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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IET quantum communication Ročník 4; číslo 2; s. 84 - 92
Hlavní autoři: Govindankutty, Arun, Srinivasan, Sudarshan K., Mathure, Nimish
Médium: Journal Article
Jazyk:angličtina
Vydáno: Shenzhen John Wiley & Sons, Inc 01.06.2023
Wiley
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 targeted at Quantum Fourier Transform (QFT) circuits is proposed. Quantum Fourier Transform is a fundamental quantum algorithm that forms the basis of many quantum computing applications. The verification method employs ions of quantum gates used in QFT that leads to a reduction of the verification problem from Hilbert space to the quantifier free logic of bit‐vectors. Very efficient decision procedures are available to reason about bit‐vectors. Therefore, this method is able to scale up to the verification of QFT circuits with 10,000 qubits and 50 million quantum gates, providing a meteoric advance in the size of QFT circuits thus far verified using formal verification methods. A scalable and efficient formal verification method for quantum Fourier transform circuits, capable of verifying unto 10,000 qubits QFT circuit in less than an hour time is proposed. The work uses rotational ions to achieve the verification and provides a feasible solution to the verification bottleneck in quantum computing domain.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2632-8925
2632-8925
DOI:10.1049/qtc2.12055