Optimal two-qubit circuits for universal fault-tolerant quantum computation

  title={Optimal two-qubit circuits for universal fault-tolerant quantum computation},
  author={Andrew N. Glaudell and Neil J. Ross and Jacob M. Taylor},
  journal={npj Quantum Information},
We study two-qubit circuits over the Clifford+CS gate set, which consists of the Clifford gates together with the controlled-phase gate CS = diag(1, 1, 1,  i ). The Clifford+CS gate set is universal for quantum computation and its elements can be implemented fault-tolerantly in most error-correcting schemes through magic state distillation. Since non-Clifford gates are typically more expensive to perform in a fault-tolerant manner, it is often desirable to construct circuits that use few CS… 
Fixed-Depth Two-Qubit Circuits and the Monodromy Polytope
For a native gate set which includes all single-qubit gates, we apply results from symplectic geometry to analyze the spaces of two-qubit programs accessible within a fixed number of gates. These
Two-Qubit Circuit Depth and the Monodromy Polytope
Results from symplectic geometry are applied to analyze the spaces of two-qubit programs accessible within a fixed number of gates to yield an explicit description of this subspace as a convex polytope, presented by a family of linear inequalities themselves accessible via a finite calculation.
On the Structure of the CNOT-Dihedral Group
In this note we present explicit canonical forms for all the elements in the $2$-qubit CNOT-Dihedral group, with minimal numbers of controlled-$S$ ($CS$) and controlled-$X$ ($CX$) gates, using the
Quantum Theory from Principles, Quantum Software from Diagrams
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning,
T-count and T-depth of any multi-qubit unitary
While implementing a quantum algorithm it is crucial to reduce the quantum resources, in order to obtain the desired computational advantage. For most fault-tolerant quantum errorcorrecting codes the
J un 2 02 1 Generators and Relations for the Group O n ( Z [ 1 2 ] )
We give a finite presentation by generators and relations for the group On(Z[1/2]) of ndimensional orthogonal matrices with entries in Z[1/2]. We then obtain a similar presentation for the group of
A polynomial time and space heuristic algorithm for T-count
This work focuses on reducing the physical cost of implementing quantum algorithms when using the state-of-the-art fault-tolerant quantum error correcting codes, in particular, those for which implementing the T gate consumes vastly more resources than the other gates in the gate set.
Generators and Relations for the Group On(Z[1/2])
A finite presentation by generators and relations is given for the group On(Z[ 1/2]) of ndimensional orthogonal matrices with entries in Z[1/2] and for thegroup of n-dimensional orthosomatic matrices of the form M/ √ 2, where k is a nonnegative integer and M is an integer matrix.
Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA
Akel Hashim, 2, 3, ∗ Rich Rines, ∗ Victory Omole, Ravi K. Naik, 3 John Mark Kreikebaum, 5, † David I. Santiago, Frederic T. Chong, 6 Irfan Siddiqi, 3, 5 and Pranav Gokhale ‡ Quantum Nanoelectronics
Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled- S gate
Calibration of a low error non-Clifford Controlled-\frac{\pi}{2}$ phase (CS) gate on a cloud based IBM Quantum computing using the Qiskit Pulse framework is demonstrated.


Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
We generalize an efficient exact synthesis algorithm for single-qubit unitaries over the Clifford+T gate set which was presented by Kliuchnikov, Maslov, and Mosca [Quantum Inf. Comput. 13(7,8),
An algorithm for the T-count
This work implemented their algorithm and used it to show that any Clifford+T circuit for the Toffoli or the Fredkin gate requires at least 7 T gates, which implies that the known 7 T gate circuits for these gates are T-optimal.
Parallelizing quantum circuit synthesis
This work presents a method for quantum circuit synthesis using deterministic walks, and applies this method to construct a parallel framework for circuit synthesis, and implements one such version performing optimal $T$-count synthesis over the Clifford+$T$ gate set.
SAT-based {CNOT, T} Quantum Circuit Synthesis
This work has developed an exact SAT-based algorithm for quantum circuit rewriting that aims at reducing CNOT gates without increasing the number of T gates and finds the minimum {CNOT, T} circuit for a given phase polynomial description of a unitary transformation.
Minimal universal two-qubit controlled-NOT-based circuits (8 pages)
For several quantum gate libraries, this work gives quantum circuits that simulate an arbitrary two-qubit unitary operator up to a global phase and proves that gate counts are optimal in the worst and average cases.
Unified framework for magic state distillation and multiqubit gate synthesis with reduced resource cost
An in-depth analysis of a unified framework that realizes one round of distillation and multiqubit gate synthesis in a single step, and provides an efficient algorithm for synthesizing controlled unitaries with the same worst-case resource scaling as optimal solutions.
A framework for exact synthesis
This paper presents a common mathematical structure underlying all results related to the exact synthesis of qubit unitaries known to date, including Clifford+T, Clifford-cyclotomic and V-basis gate sets, as well as gates sets induced by the braiding of Fibonacci anyons in topological quantum computing.
Exact synthesis of multi-qubit Clifford+T circuits
We prove that a unitary matrix has an exact representation over the Clifford+$T$ gate set with local ancillas if and only if its entries are in the ring $\mathbb{Z}[\frac{1}{\sqrt{2}},i]$. Moreover,
Representation of Quantum Circuits with Clifford and $\pi/8$ Gates
In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis $\{H, P, T\}$, where $H$, $P$ and $T$ denote the Hadamard, Phase and $\pi/8$ gates, respectively.
Efficient Clifford+T approximation of single-qubit operators
  • P. Selinger
  • Computer Science, Mathematics
    Quantum Inf. Comput.
  • 2015
An efficient randomized algorithm for approximating an arbitrary element of SU(2) by a product of Clifford+T operators, up to any given error threshold e > 0.05, which is within an additive constant of optimal for certain z-rotations.