Podlipodcast player Webplayer

Stanford Online: University Courses & Lectures

Stanford Online: University Courses & Lectures

Stanford Seminar - Highly optimized quantum circuits synthesized via data-flow engines

Stanford Online: University Courses & Lectures · Nov 17, 2026 · 1:33:39

0:001:33:39

Listen in the Podli app 🎧

Follow your favourite podcasts, listen offline and in the car with CarPlay and Android Auto, and always pick up where you left off. Free to try.

Peter Rakyta, Department of Physics of Complex Systems at Eötvös Loránd UniversityNovember 9, 2022The formulation of quantum programs in terms of the fewest number of gate operations iscrucial to retrieve meaningful results from the noisy quantum processors accessible thesedays. In this talk I will describe the adaptive circuit compression algorithm [1] developed byour group and implemented in the SQUANDER package [2]. We scaled up the scope of ourquantum compiler to synthesize circuits up to 9 qubits solely from the unitary associatedwith the quantum program. Such capabilities were not demonstrated before by anyoptimization based quantum gate synthesis tool. This significant improvement was achievedby the utilization of a data-flow engine (DFE) based quantum computer simulator, developedin the collaboration of the Eötvös Loránd University and the Wigner Research Center(Hungary), Maxeler Technologies and Groq. The quantum computer simulator was designedto simulate arbitrary quantum circuit consisting of single qubit rotations and controlledtwo-qubit gates on Field Programmable Gate Array (FPGA) chips. In our benchmarkcomparison with the QISKIT package, the circuits produced by the SQUANDER package (withthe DFE accelerator support) were compressed by 97% in average, while the fidelity of thecircuits were still close to unity by an error of $10^{-4}$. In the talk I will also discusspossibilities to further improve the synthesis procedure and scale up our approach to highernumber of qubits.Uploaded 23-11-22[1] P. Rakyta, Z. Zimborás, Efficient quantum gate decomposition via adaptive circuitcompression, arXiv:2203.04426 (2022).[2]https://github.com/rakytap/sequential-quantum-gate-decomposerAbout the speaker: Peter Rakyta is a researcher fellow at the Department of Physics of Complex Systems ofEötvös Loránd University. During his work he developed deep experiences in modelling quantum mechanical systems. Simulations performed by the software package Eötvös Quantum Utilities provided the central results in most of his research work. In 2020 he turned his attention to quantuminformatics. Currently he is involved in several projects related to programming andsimulating quantum computers. His first result in the area is the currently most efficientalgorithm to decompose an arbitrary unitary into a sequence of quantum logical gates
Learn more about your ad choices. Visit megaphone.fm/adchoices

Episodes: Stanford Online: University Courses & Lectures

PodliGet the free Podli app
↓ App