Improved synthesis of Toffoli-Hadamard circuits
From MaRDI portal
(Redirected from Publication:6148121)
Abstract: The matrices that can be exactly represented by a circuit over the Toffoli-Hadamard gate set are the orthogonal matrices of the form , where is an integer matrix and is a nonnegative integer. The exact synthesis problem for this gate set is the problem of constructing a circuit for a given such matrix. Existing methods produce circuits consisting of gates, where is the dimension of the matrix. In this paper, we provide two improved synthesis methods. First, we show that a technique introduced by Kliuchnikov in 2013 for Clifford+ circuits can be straightforwardly adapted to Toffoli-Hadamard circuits, reducing the complexity of the synthesized circuit from to . Then, we present an alternative synthesis method of similarly improved cost, but whose application is restricted to circuits on no more than three qubits. Our results also apply to orthogonal matrices over the dyadic fractions, which correspond to circuits using the 2-qubit gate , rather than the usual single-qubit Hadamard gate .
Recommendations
Cites work
- Advanced exact synthesis of Clifford+T circuits
- Both Toffoli and Controlled-NOT need little help to universal quantum computing
- Conservative logic
- Exact synthesis of single-qubit unitaries over Clifford-cyclotomic gate sets
- scientific article; zbMATH DE number 7449988 (Why is no real title available?)
- The Toffoli-Hadamard gate system: an algebraic approach
Cited in
(4)
This page was built for publication: Improved synthesis of Toffoli-Hadamard circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148121)