Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates-Reference-Cited by-同舟云学术

Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates

Published:2020-12-07 Issue: Volume:4 Page:369
ISSN:2521-327X
Container-title:Quantum
language:en
Short-container-title:Quantum

Author:

Garion Shelly¹,Cross Andrew W.²

Affiliation:

1. IBM Quantum, IBM Research Haifa, Haifa University Campus, Mount Carmel, Haifa, 3498825, Israel

2. IBM Quantum, IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, USA

Abstract

In this note we present explicit canonical forms for all the elements in the two-qubit CNOT-Dihedral group, with minimal numbers of controlled-S(CS) and controlled-X(CX) gates, using the generating set of quantum gates[X,T,CX,CS]. We provide an algorithm to successively construct then-qubit CNOT-Dihedral group, asserting an optimal number of controlled-X(CX) gates. These results are needed to estimate gate errors via non-Clifford randomized benchmarking and may have further applications to circuit optimization over fault-tolerant gate sets.

Publisher

Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften

Subject

Physics and Astronomy (miscellaneous),Atomic and Molecular Physics, and Optics

Link

https://quantum-journal.org/papers/q-2020-12-07-369/pdf/

Reference34 articles.

1. Scott Aaronson and Daniel Gottesman. Improved simulation of stabilizer circuits. Phys. Rev. A, 70: 052328, Nov 2004. 10.1103/PhysRevA.70.052328. URL https://link.aps.org/doi/10.1103/PhysRevA.70.052328.

2. M. Amy, D. Maslov, M. Mosca, and M. Roetteler. A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 32 (6): 818–830, 2013. 10.1109/TCAD.2013.2244643.

3. Matthew Amy, Parsiad Azimzadeh, and Michele Mosca. On the controlled-NOT complexity of controlled-NOT–phase circuits. Quantum Science and Technology, 4 (1): 015002, sep 2018a. 10.1088/2058-9565/aad8ca. URL https://doi.org/10.1088.

4. Matthew Amy, Jianxin Chen, and Neil J. Ross. A finite presentation of cnot-dihedral operators. Electronic Proceedings in Theoretical Computer Science, 266: 84–97, 2018b. 10.4204/eptcs.266.5. URL https://app.dimensions.ai/details/publication/pub.1101260386 and https://arxiv.org/pdf/1701.00140.

5. Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter. Elementary gates for quantum computation. Phys. Rev. A, 52: 3457–3467, Nov 1995. 10.1103/PhysRevA.52.3457. URL https://link.aps.org/doi/10.1103/PhysRevA.52.3457.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Randomised benchmarking for universal qudit gates;New Journal of Physics;2024-07-01

2. CS-count-optimal quantum circuits for arbitrary multi-qubit unitaries;Scientific Reports;2024-06-17

3. Crosstalk-Based Parameterized Quantum Circuit Approximation;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17

4. Generators and Relations for 3-Qubit Clifford+CS Operators;Electronic Proceedings in Theoretical Computer Science;2023-08-30

5. Estimating the Bias of CX Gates via Character Randomized Benchmarking;PRX Quantum;2023-01-18