A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

@article{Amy2013AMA,
  title={A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits},
  author={Matthew Amy and Dmitrii L. Maslov and Michele Mosca and Martin Roetteler},
  journal={IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems},
  year={2013},
  volume={32},
  pages={818-830}
}
  • M. Amy, D. Maslov, +1 author M. Roetteler
  • Published 4 June 2012
  • Mathematics, Computer Science, Physics
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
We present an algorithm for computing depth-optimal decompositions of logical operations, leveraging a meet-in-the-middle technique to provide a significant speedup over simple brute force algorithms. As an illustration of our method, we implemented this algorithm and found factorizations of commonly used quantum logical operations into elementary gates in the Clifford+T set. In particular, we report a decomposition of the Toffoli gate over the set of Clifford and T gates. Our decomposition… 
Algorithms for the Optimization of Quantum Circuits
TLDR
An exponential time algorithm for synthesizing minimal depth quantum circuits is developed with effective heuristics for reducing the search space, and it is shown how it can be extended to different optimization problems.
A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
We investigate the problem of synthesizing T-depth optimal quantum circuits over the Clifford+T gate set. The latter is a universal fault-tolerant gate set where the cost of fault-tolerantly
A best-fit mapping algorithm to facilitate ESOP-decomposition in Clifford+T quantum network synthesis
TLDR
This work introduces an efficient method to map reversible single-target gates into a universal set of quantum gates (Clifford+T) and proposes a post-synthesis optimization method to reduce the cost of the final quantum network, based on two cost-minimization properties.
A best-fit mapping algorithm to facilitate ESOP-decomposition in clifford+T quantum network synthesis
TLDR
This work introduces an efficient method to map reversible single-target gates into a universal set of quantum gates (Clifford+T) and proposes a post-synthesis optimization method to reduce the cost of the final quantum network, based on two cost-minimization properties.
Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks
TLDR
A dynamic programming based logic synthesis algorithm to reduce the multiplicative depth in logic networks that makes use of cut enumeration, tree balancing, and exclusive sum-of-products (ESOP) representations.
Halving the cost of quantum addition
We improve the number of T gates needed to perform an n-bit adder from 8n+O(1) to 4n+O(1). We do so via a "temporary logical-AND" construction which uses four T gates to store the logical-AND of two
An algorithm for the T-count
TLDR
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.
Improved reversible and quantum circuits for Karatsuba-based integer multiplication
TLDR
A reversible circuit for integer multiplication that is inspired by Karatsuba's recursive method is presented, with the main improvement over circuits that have been previously reported in the literature is an asymptotic reduction of the amount of space required.
Nearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation
TLDR
This work proposes a novel mapping of Multiple-Control Toffoli (MCT) gates to Clifford+T group gates, which achieves lower gate count compared to earlier work and shows a generic way to convert any Clifford-T circuit into a nearest neighbor one.
Resource optimization for fault-tolerant quantum computing
TLDR
This thesis shows how to simplify universal encoded computation by using only transversal gates and standard error correction procedures, circumventing existing no-go theorems and finds that by using a special class of non-deterministic circuits, the cost of decomposition can be reduced by as much as a factor of four over state-of-the-art techniques, which typically use deterministic circuits.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a
Resource-optimal single-qubit quantum circuits.
TLDR
This work constructs an optimal gate sequence consisting of fault-tolerant Hadamard (H) and π/8 rotations (T) and demonstrates that a precomputed epsilon net of canonical circuits in combination with the scheme lowers the depth of approximation circuits by up to 3 orders of magnitude compared to previously reported results.
Fast and efficient exact synthesis of single-qubit unitaries generated by clifford and T gates
TLDR
An efficient synthesis algorithm, with an exact optimality guarantee on the number of Hadamard and T gates used, and conjecture that the equivalence of the sets of unitaries implementable by circuits over the Clifford and T library and unitaries over the ring Z[1/√2, i] holds in the n-qubit case.
Optimal synthesis of linear reversible circuits
TLDR
Simulation results show that even for relatively small n the authors' algorithm is faster and yields smaller circuits than the standard method, and can be interpreted as a matrix decomposition algorithm, yielding an asymptotically efficient decomposition of a binary matrix into a product of elementary matrices.
Efficient Synthesis of Linear Reversible Circuits
In this paper we consider circuit synthesis for n-wire linear reversible circuits using the C-NOT gate library. These circuits are an important class of reversible circuits with applications to
Synthesis of reversible logic circuits
TLDR
In an application important to quantum computing, the synthesis of oracle circuits for Grover's search algorithm are synthesized, and a significant improvement over a previously proposed synthesis algorithm is shown.
The Solovay-Kitaev algorithm
TLDR
The algorithm can be used to compile Shor's algorithm into an efficient fault-tolerant form using only Hadamard, controlled-not, and π/8 gates, and is generalized to apply to multi-qubit gates and togates from SU(d).
A Study of Optimal 4-Bit Reversible Toffoli Circuits and Their Synthesis
TLDR
This paper presents two algorithms: one, that synthesizes an optimal circuit for any 4-bit reversible specification, and another that synthesized all optimal implementations, and illustrates that the proposed approach may be extended to accommodate physical constraints via reporting LNN-optimal reversible circuits.
Improved Simulation of Stabilizer Circuits
TLDR
The Gottesman-Knill theorem, which says that a stabilizer circuit, a quantum circuit consisting solely of controlled-NOT, Hadamard, and phase gates can be simulated efficiently on a classical computer, is improved in several directions.
Comparison of the Cost Metrics for Reversible and Quantum Logic Synthesis
A breadth-first search method for determining optimal 3-line circuits composed of quantum NOT, CNOT, controlled-V and controlled-V+ (NCV) gates is introduced. Results are presented for simple gate
...
1
2
3
4
...