Basic circuit compilation techniques for an ion-trap quantum machine

DOI10.1088/1367-2630/AA5E47zbMATH Open1512.81028arXiv1603.07678OpenAlexW2305083767MaRDI QIDQ6157880FDOQ6157880

Authors: Dmitri Maslov 

Publication date: 12 May 2023

Published in: New Journal of Physics (Search for Journal in Brave)

Abstract: We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an algorithm in the form of a quantum computer program, we compile it into a high-level logical circuit that goes through multiple stages of decomposition into progressively lower-level circuits until we reach the physical execution-level specification. We skip the fault-tolerance layer, as it is not within the scope of this work. The different stages are structured so as to best assist with the overall optimization while taking into account numerous optimization criteria, including minimizing the number of expensive two-qubit gates, minimizing the number of less expensive single-qubit gates, optimizing the runtime, minimizing the overall circuit error, and optimizing classical control sequences. Our approach allows a trade-off between circuit runtime and quantum error, as well as to accommodate future changes in the optimization criteria that may likely arise as a result of the anticipated improvements in the physical-level control of the experiment.

Full work available at URL: https://arxiv.org/abs/1603.07678

Recommendations

• Automating quantum experiment control. From circuit compilation to ion routing
• ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
• \(Qcompiler\): quantum compilation with the CSD method
• Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
• Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The physical implementation of quantum computation.
• Synthesis and optimization of reversible circuits -- a survey
• Title not available (Why is that?)

Cited In (10)

• Boolean satisfiability in quantum compilation
• Design of a universal logic block for fault-tolerant realization of any logic operation in trapped-ion quantum circuits
• ACCELERATION OF QUANTUM ALGORITHMS USING THREE-QUBIT GATES
• Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
• The HLRB cluster as quantum CISC compiler. Matrix methods and applications for advanced quantum control by gradient-flow algorithms on parallel clusters
• Deterministic algorithms for compiling quantum circuits with recurrent patterns
• Relating measurement patterns to circuits via Pauli flow
• Automating quantum experiment control. From circuit compilation to ion routing
• Use of global interactions in efficient quantum circuit constructions
• \textit{OptQC}: an optimized parallel quantum compiler

This page was built for publication: Basic circuit compilation techniques for an ion-trap quantum machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157880)