Equivalence Checking of Dynamic Quantum Circuits | | JuliaCon 2024

The Julia Programming Language
The Julia Programming Language
93 بار بازدید - 21 ساعت پیش - Equivalence Checking of Dynamic Quantum
Equivalence Checking of Dynamic Quantum Circuits by Liam PreTalx: pretalx.com/juliacon2024/talk/EML8NG/ ZXCalculus.jl Pluto Notebooks: github.com/contra-bit/ZXCalculus.jl/tree/feature/p… DynamicQuantumCircuits.jl Pluto Notebooks: github.com/JuliaEDA/DynamicQuantumCircuits.jl Slides: pretalx.com/media/juliacon2024/submissions/EML8NG/… In order to overcome platform limitations of NISQ, namely the limit amount of qubits and high noise ration, IBM introduced a new type of quantum circuits named Dynamic Quantum Circuits (DQCs). They contain non-unitary operations such as mid-circuit measurements, active-reset and classically controlled logic. Yet most state-of-the-art equivalence checkers are not efficient and effective for verification of DQCs. Previously ZXCalculus.jl did not support importing circuits from OpenQASM or checking the equivalence of two quantum circuits. This talk presents how dynamic quantum circuits can be converted into quantum circuits, that only contain unitary operations, which can be proven equivalent using ZXCalculus.jl. Furthermore this approach is scalable in regard to the number qubits, allowing us to verify the equivalence of quantum circuits with more than 1000 Qubits.
21 ساعت پیش در تاریخ 1403/07/04 منتشر شده است.
93 بـار بازدید شده
... بیشتر