Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Smaller Two-Qubit Circuits for Quantum Communication and Computation

Published

Author(s)

V V. Shende, I L. Markov, Stephen Bullock

Abstract

We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts.Using quantum circuit identities, we improve an earlier lower bound of 17 elementary gates by Bullock and Markov to 18, and their upper bound of 23 elementary gates to 18. We also improve upon the generic circuit with six CNOT gates by Zhang et al. (our circuit uses three), and that by Vidal and Dawson with 11 basic gates (we use 10).We study the performance of our synthesis procedures on two-qubit operators that are useful in quantum algorithms and communication protocols. With additional work, we find small circuits and improve upon previously known circuits in some cases.
Proceedings Title
DATE (Design, Automation, and Test in Europe) Conference paper
Volume
Paris, France
Conference Dates
February 16, 2004
Conference Location
Paris, 1, FR
Conference Title
Design Automation Conference

Keywords

circuit synthesis, quantum circuit

Citation

Shende, V. , Markov, I. and Bullock, S. (2003), Smaller Two-Qubit Circuits for Quantum Communication and Computation, DATE (Design, Automation, and Test in Europe) Conference paper, Paris, 1, FR, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=50704 (Accessed March 1, 2024)
Created March 19, 2003, Updated October 12, 2021