Rotational abstractions for verification of quantum Fourier transform circuits

With the race to build large‐scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of vital importance. A novel formal verification method that is...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IET quantum communication Jg. 4; H. 2; S. 84 - 92
Hauptverfasser:	Govindankutty, Arun, Srinivasan, Sudarshan K., Mathure, Nimish
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Shenzhen John Wiley & Sons, Inc 01.06.2023 Wiley
Schlagworte:	Algorithms Circuits Fourier transforms Hilbert space Problem solving qft verification Quantum computers Quantum computing quantum fourier transform quantum information Qubits (quantum computing) Semiconductors Verification
ISSN:	2632-8925, 2632-8925
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!