Compiling Conditional Quantum Gates without Using Helper Qubits
Authors: 
Keli Huang, Jens PalsbergAuthors Info & Claims
Keli Huang, Jens PalsbergAuthors Info & ClaimsArticle No.: 206, Pages 1463 - 1484
Abstract
We present a compilation scheme for conditional quantum gates. Our scheme compiles a multi-qubit conditional to a linear number of two-qubit conditionals. This can be done straightforwardly with helper qubits, but we show how to do it without using helper qubits and with much fewer gates than in previous work. Specifically, our scheme requires 1/3 as many gates as the previous best scheme without using helper qubits, which is essential for practical use. Our experiments show that several quantum-circuit optimizers have little impact on the compiled code from the previous best scheme, confirming the need for our new scheme. Our experiments with Grover's algorithm and quantum walk also show that our scheme has a major impact on the reliability of the compiled code.
Supplementary Material
The material is a pdf file with an appendix to the main paper.
- Download
- 1.44 MB
References
[1]
Matthew Amy, Parsiad Azimzadeh, and Michele Mosca. 2018. On the controlled-NOT complexity of controlled-NOT–phase circuits. Quantum Science and Technology, 4, 1 (2018), 015002. https://doi.org/10.1088/2058-9565/aad8ca
[2]
Adriano Barenco, Charles H Bennett, Richard Cleve, David P DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A Smolin, and Harald Weinfurter. 1995. Elementary gates for quantum computation. Physical review A, 52, 5 (1995), 3457. https://doi.org/10.1103/PhysRevA.52.3457
[3]
Sebastian Brandhofer, Ilia Polian, and Kevin Krsulich. 2023. Optimal Qubit Reuse for Near-Term Quantum Computers. In 2023 IEEE International Conference on Quantum Computing and Engineering (QCE). 1, 859–869. https://doi.org/10.1109/QCE57702.2023.00100
[4]
Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp. 2002. Quantum Amplitude Amplification and Estimation. Quantum Computation and Quantum Information, 305 (2002), 53–74. arxiv:quant-ph/0005055
[5]
Matthew DeCross, Eli Chertkov, Megan Kohagen, and Michael Foss-Feig. 2023. Qubit-reuse compilation with mid-circuit measurement and reset. Physical Review X, 13, 4 (2023), 041057. https://doi.org/10.1103/PhysRevX.13.041057
[6]
Yongshan Ding, Xin-Chuan Wu, Adam Holmes, Ash Wiseth, Diana Franklin, Margaret Martonosi, and Frederic T Chong. 2020. Square: Strategic quantum ancilla reuse for modular quantum programs via cost-effective uncomputation. In 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA). 570–583. https://doi.org/10.1109/ISCA45697.2020.00054
[7]
Austin G. Fowler, Matteo Mariantoni, John M. Martinis, and Andrew N. Cleland. 2012. Surface codes: Towards practical large-scale quantum computation. Physical Review A, 86, 3 (2012), https://doi.org/10.1103/PhysRevA.86.032324
[8]
Craig Gidney. 2015. Using Quantum Gates instead of Ancilla Bits. https://algassert.com/circuits/2015/06/22/Using-Quantum-Gates-instead-of-Ancilla-Bits.html
[9]
Pranav Gokhale, Samantha Koretsky, Shilin Huang, Swarnadeep Majumder, Andrew Drucker, Kenneth R Brown, and Frederic T Chong. 2021. Quantum fan-out: Circuit optimizations and technology modeling. In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE). 276–290. https://doi.org/10.1109/QCE52317.2021.00045
[10]
Lov K Grover. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. 212–219. https://doi.org/10.1145/237814.237866
[11]
Kesha Hietala, Robert Rand, Shih-Han Hung, Xiaodi Wu, and Michael Hicks. 2021. A verified optimizer for quantum circuits. Proceedings of the ACM on Programming Languages, 5, POPL (2021), 1–29. https://doi.org/10.1145/3434318
[12]
Fei Hua, Yuwei Jin, Yanhao Chen, Suhas Vittal, Kevin Krsulich, Lev S Bishop, John Lapeyre, Ali Javadi-Abhari, and Eddy Z Zhang. 2023. Caqr: A compiler-assisted approach for qubit reuse through dynamic circuit. In Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3. 59–71. https://doi.org/10.1145/3582016.3582030
[13]
IBM Quantum Platform. 2023. IBM Mumbai. https://quantum-computing.ibm.com/services/resources?system=ibmq_mumbai
[14]
Raban Iten, Roger Colbeck, Ivan Kukuljan, Jonathan Home, and Matthias Christandl. 2016. Quantum circuits for isometries. Physical Review A, 93, 3 (2016), 032318. https://doi.org/10.1103/PhysRevA.93.032318
[15]
Aleks Kissinger and John van de Wetering. 2019. Pyzx: Large scale automated diagrammatic reasoning. arXiv preprint arXiv:1904.04735, https://doi.org/10.48550/arXiv.1904.04735
[16]
Zikun Li, Jinjun Peng, Yixuan Mei, Sina Lin, Yi Wu, Oded Padon, and Zhihao Jia. 2023. Quarl: A learning-based quantum circuit optimizer. arXiv preprint arXiv:2307.10120, https://doi.org/10.48550/arXiv.2307.10120
[17]
Michael A. Nielsen and Isaac L. Chuang. 2000. Quantum Computation and Quantum Information. Cambridge University Press. isbn:9781107002173
[18]
Anouk Paradis, Benjamin Bichsel, Samuel Steffen, and Martin Vechev. 2021. Unqomp: synthesizing uncomputation in Quantum circuits. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. 222–236. https://doi.org/10.1145/3453483.3454040
[19]
IBM Qiskit. 2023. Summary of Quantum Operations. https://qiskit.org/documentation/tutorials/circuits/3_summary_of_quantum_operations.html
[20]
Qiskit contributors. 2023. Grover’s algorithm tutorials. https://qiskit.org/ecosystem/algorithms/tutorials/06_grover.html
[21]
Qiskit contributors. 2023. Qiskit: An Open-source Framework for Quantum Computing. https://doi.org/10.5281/zenodo.2573505
[22]
Qiskit contributors. 2023. Statevector method in Qiskit. https://docs.quantum.ibm.com/api/qiskit/qiskit.quantum_info.Statevector
[23]
Mehdi Saeedi and Massoud Pedram. 2013. Linear-depth quantum circuits for n-qubit Toffoli gates with no ancilla. Physical Review A, 87, 6 (2013), 062318. https://doi.org/10.1103/PhysRevA.87.062318
[24]
Vivek V. Shende and Igor L. Markov. 2009. On the CNOT-cost of TOFFOLI gates. Quantum Information and Computation, 9, 5–6 (2009), 461–486. https://doi.org/10.48550/arXiv.0803.2316
[25]
Seyon Sivarajah, Silas Dilkes, Alexander Cowtan, Will Simmons, Alec Edgington, and Ross Duncan. 2020. t| ket>: a retargetable compiler for NISQ devices. Quantum Science and Technology, 6, 1 (2020), 014003. https://doi.org/10.1088/2058-9565/ab8e92
[26]
Bochen Tan and Jason Cong. 2020. Optimal layout synthesis for quantum computing. In Proceedings of the 39th International Conference on Computer-Aided Design. 1–9. https://doi.org/10.1145/3400302.3415620
[27]
Siwei Tan, Congliang Lang, Liang Xiang, Shudi Wang, Xinghui Jia, Ziqi Tan, Tingting Li, Jieming Yin, Yongheng Shang, and Andre Python. 2023. QuCT: A Framework for Analyzing Quantum Circuit by Extracting Contextual and Topological Features. In Proceedings of the 56th Annual IEEE/ACM International Symposium on Microarchitecture. 494–508. https://doi.org/10.1145/3613424.3614274
[28]
Rafaella Vale, Thiago Melo D Azevedo, Ismael Araújo, Israel F Araujo, and Adenilton J da Silva. 2023. Decomposition of multi-controlled special unitary single-qubit gates. arXiv preprint arXiv:2302.06377, https://doi.org/10.48550/arXiv.2302.06377
[29]
Amanda Xu, Abtin Molavi, Lauren Pick, Swamit Tannu, and Aws Albarghouthi. 2023. Synthesizing Quantum-Circuit Optimizers. Proceedings of the ACM on Programming Languages, 7, PLDI (2023), 835–859. https://doi.org/10.1145/3591254
[30]
Mingkuan Xu, Zikun Li, Oded Padon, Sina Lin, Jessica Pointing, Auguste Hirth, Henry Ma, Jens Palsberg, Alex Aiken, and Umut A Acar. 2022. Quartz: superoptimization of quantum circuits. In Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation. 625–640. https://doi.org/10.1145/3519939.3523433
Index Terms
- Compiling Conditional Quantum Gates without Using Helper Qubits
Recommendations
Turbo‐coded secure and reliable quantum teleportation
Quantum teleportation allows an unknown arbitrary quantum state to be transmitted between two separate locations. To achieve this, the system requires both classical and quantum channels, for communicating two classical bits and an entangled quantum bit ...
Optically controlled quantum gates for three spin qubits in quantum dot–microcavity coupled systems
AbstractWe investigate theoretically the possibility of achieving feasible solid-state quantum computing by compactly constructing a set of two or three quantum gates on stationary electron spin qubits, including the controlled NOT gate, Toffoli gate and ...
Comments
Information & Contributors
Information
Published In
Copyright © 2024 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 20 June 2024
Published in PACMPL Volume 8, Issue PLDI
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- National Science Foundation
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 946Total Downloads
- Downloads (Last 12 months)946
- Downloads (Last 6 weeks)69
Reflects downloads up to 16 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in