Compiling quantum circuits using the palindrome transform (original) (raw)
Related papers
An Extended Approach for Generating Unitary Matrices for Quantum Circuits
Computers, Materials & Continua, 2019
In this paper, we do research on generating unitary matrices for quantum circuits automatically. We consider that quantum circuits are divided into six types, and the unitary operator expressions for each type are offered. Based on this, we propose an algorithm for computing the circuit unitary matrices in detail. Then, for quantum logic circuits composed of quantum logic gates, a faster method to compute unitary matrices of quantum circuits with truth table is introduced as a supplement. Finally, we apply the proposed algorithm to different reversible benchmark circuits based on NCT library (including NOT gate, Controlled-NOT gate, Toffoli gate) and generalized Toffoli (GT) library and provide our experimental results.
Optimal quantum circuit synthesis from controlled-unitary gates
Physical Review A, 2004
From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either optimal or close to optimal. This result can be extended to improve the efficiency of universal quantum circuit construction from any entangling gate. Specifically, for both the Controlled-NOT and Double-CNOT gates, we develop simple analytic ways to construct universal quantum circuits with three applications, which is the least possible.
The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits [10] to the attention of the Electronic Design Automation community . We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve earlier published results by at least a factor of two.
Optimal design of two-qubit quantum circuits
2004
Current quantum computing hardware is unable to sustain quantum coherent operations for more than a handful of gate operations. Consequently, if near-term experimental milestones, such as synthesizing arbitrary entangled states, or performing fault-tolerant operations, are to be met, it will be necessary to minimize the number of elementary quantum gates used.
A Hierarchical Approach to Computer-Aided Design of Quantum Circuits
2003
A new approach to synthesis of permutation class of quantum logic circuits has been proposed in this paper. This approach produces better results than the previous approaches based on classical reversible logic and can be easier tuned to any particular quantum technology such as nuclear magnetic resonance (NMR). First we synthesize a library of permutation (pseudobinary) gates using a Computer-Aided-Design approach that links evolutionary and combinatorics approaches with human experience and creativity. Next the circuit is designed using these gates and standard 1*1 and 2*2 quantum gates and finally the optimizing tautological transforms are applied to the circuit, producing a sequence of quantum operations being close to operations practically realizable. These hierarchical stages can be compared to standard gate library design, generic logic synthesis and technology mapping stages of classical CAD systems, respectively. We use an informed genetic algorithm to evolve arbitrary quantum circuit specified by a (target) unitary matrix, specific encoding that reduces the time of calculating the resultant unitary matrices of chromosomes, and an evolutionary algorithm specialized to permutation circuits specified by truth tables. We outline interactive CAD approach in which the designer is a part of feedback loop in evolutionary program and the search is not for circuits of known specifications, but for any gates with high processing power and small cost for given constraints. In contrast to previous approaches, our methodology allows synthesis of both: small quantum circuits of arbitrary type (gates), and permutation class circuits that are well realizable in particular technology.
A mathematica program for constructing quantum circuits and computing their unitary matrices
Physics of Particles and Nuclei Letters, 2009
One reason for this is the potential ability of a quantum computer to do certain computational tasks much more efficiently than they can be done by any classical computer Two the most famous examples of such calculations are Shor's algorithm for efficient factorization of large integers and Grover's algorithm of element search in an unsorted list.
Quantum circuit optimization for unitary operators over non-adjacent qudits
arXiv: Quantum Physics, 2017
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an arbitrary dimensional input state. The model is also extended to the framework of quantum computation with qudits. An application in the context of the quantum computational logic is provided.
Synthesis of quantum-logic circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006
The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits [10] to the attention of the Electronic Design Automation community . We discuss efficient quantum logic circuits which perform two tasks: (i) implementing generic quantum computations and (ii) initializing quantum registers. In contrast to conventional computing, the latter task is nontrivial because the state-space of an n-qubit register is not finite and contains exponential superpositions of classical bit strings. Our proposed circuits are asymptotically optimal for respective tasks and improve earlier published results by at least a factor of two.
Optimal quantum circuits for general two-qubit gates
Physical Review A, 2004
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence of one-qubit and two-qubit gates. We contribute to this effort by providing a method to construct an optimal quantum circuit for a general two-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit gates. Moreover, if the desired two-qubit gate corresponds to a purely real unitary transformation, we provide a construction that requires at most 2 CNOTs and 12 one-qubit gates. We then prove that these constructions are optimal with respect to the family of CNOT, y-rotation, z-rotation, and phase gates.
Quantum Circuit Optimization by Hadamard Gate Reduction
Lecture Notes in Computer Science, 2014
Due to its fault-tolerant gates, the Clifford+T library consisting of Hadamard (denoted by H), T , and CNOT gates has attracted interest in the synthesis of quantum circuits. Since the implementation of T gates is expensive, recent research is aiming at minimizing the use of such gates. It has been shown that T-depth optimizations can be implemented efficiently for circuits consisting only of T and CNOT gates and that H gates impede the optimization significantly. In this paper, we investigate the role of H gates in reducing the T-count and T-depth for quantum circuits. To reduce the number of H gates, we propose several algorithms targeting different steps in the synthesis of reversible functions as quantum circuits. Experiments show the effect of H gate reductions on the costs for Tcount and T-depth. Our approach yields a significant improvement of up to 88% in the final T-depth compared to the best known T-depth optimization technique.