• Corpus ID: 54816981

Quantum Circuit Identities

@article{Lomont2003QuantumCI,
  title={Quantum Circuit Identities},
  author={Chris Lomont},
  journal={arXiv: Quantum Physics},
  year={2003}
}
  • C. Lomont
  • Published 16 July 2003
  • Physics
  • arXiv: Quantum Physics
There are quantum circuit identities that simplify quantum circuits, reducing the effort needed physically to implement them. This paper constructs all identities made from 3 or fewer operations taken from a common set of one qubit operations, and explains how they may be used to simplify the cost of constructing quantum circuit identities. 

Tables from this paper

Quantum circuit simplification using templates

TLDR
This work considers the use of templates to simplify a quantum circuit initially found by other means, and presents and analyzes templates in the general case, and provides particular details for circuits composed of NOT, CNOT and controlled-sqrt-of-NOT gates.

Optimized Quantum Gate Library for Various Physical Machine Descriptions

TLDR
This paper targets quantum logic design with respect to the set of primitive quantum operations that are supported by six different PMDs: quantum dot, superconducting, ion trap, neutral atom, and two photonics systems, and shows that, using one- and two-qubit quantum identity rules, each gate in the library can be efficiently mapped to just theset of primitive operations supported by each of the six PMDs.

Quantum Circuit Simplification and Level Compaction

TLDR
This paper considers a local optimization technique based on templates to simplify and reduce the depth of nonoptimal quantum circuits and shows how templates can be used to compact the number of levels of a quantum circuit.

Hybrid simplification rules for boundaries of quantum circuits

We describe rules to simplify quantum circuits at their boundaries, i.e. at state preparation and measurement. There, any strictly incoherent operation may be pushed into a preor post-processing of

Block-based quantum-logic synthesis

TLDR
A basic block based on the cosine-sine decomposition method is suggested which contains l qubits and it is shown that the exact value of $l$ affects the number of one-qubit and CNOT gates in the proposed method.

Reversible and Quantum Circuit Synthesis

TLDR
This thesis presents five major tools for the synthesis of reversible and quantum circuits, and proposes FTQLS, a tool that synthesizes and optimizes fault-tolerant quantum circuits by using logic identity rules for various physical machine descriptions.

Level Compaction in Quantum Circuits

  • D. MaslovG. Dueck
  • Computer Science
    2006 IEEE International Conference on Evolutionary Computation
  • 2006
TLDR
An automated level compactor for quantum circuits is presented and it is shown how the templates can be applied to compact logic levels in quantum circuits, which extends the boundaries of their usefulness.

An Algorithm For Quantum Circuit Optimization

TLDR
This project looks at a possible approach to solving the issue of circuit optimization by incorporating classical algorithms as well as touching on another possible application of machine learning.

Quanto: Optimizing Quantum Circuits with Automatic Generation of Circuit Identities

TLDR
This research presents a parallel version of the Celada–Seiden cellular automaton that combines the efforts of four generations of scientists to solve the challenge of integrating NoSQL data stores to manage smart phones.

References

SHOWING 1-10 OF 17 REFERENCES

Gate-level simulation of quantum circuits

TLDR
This work implemented a general-purpose quantum computing simulator in C++ called QuIDDPro and tested it on Grover's algorithm and found that it asymptotically outperforms other known simulation techniques.

Quantum measurements and the Abelian Stabilizer Problem

We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor’s results [7]. Our method is based on

Quantum measurements and the Abelian Stabilizer Problem

  • A. Kitaev
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 1996
TLDR
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.

A silicon-based nuclear spin quantum computer

Quantum computers promise to exceed the computational efficiency of ordinary classical machines because quantum algorithms allow the execution of certain tasks in fewer steps. But practical

Quantum algorithms for some hidden shift problems

TLDR
The hidden coset problem is defined, which generalizes the hidden shift problem and the hidden subgroup problem and provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure.

Elementary gates for quantum computation.

TLDR
U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.

Quantum Computations with Cold Trapped Ions.

TLDR
A quantum computer can be implemented with cold ions confined in a linear trap and interacting with laser beams, where decoherence is negligible, and the measurement can be carried out with a high efficiency.

Toward an architecture for quantum programming

TLDR
A template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives, and easily lends itself to automatic, hardware independent, circuit simplification.

Quantum information processing using quantum dot spins and cavity QED

The electronic spin degrees of freedom in semiconductors typically have decoherence times that are several orders of magnitude longer than other relevant time scales. A solid-state quantum computer

A scheme for efficient quantum computation with linear optics

TLDR
It is shown that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors and are robust against errors from photon loss and detector inefficiency.