• Corpus ID: 248887548

Applications of Universal Parity Quantum Computation

@inproceedings{Fellner2022ApplicationsOU,
  title={Applications of Universal Parity Quantum Computation},
  author={Michaela Fellner and Anna Laetitia Messinger and Kilian Ender and Wolfgang Lechner},
  year={2022}
}
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the Quantum Fourier Transform and Quantum Addition. Embedding these algorithms in the parity encoding reduces the circuit depth as compared to conventional gate-based implementations while keeping the multi-qubit gate counts comparable. We further propose simple implementations of multi-qubit gates in tailored encodings… 
1 Citations

Figures and Tables from this paper

Universal Parity Quantum Computing

TLDR
A universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on the parity encoding is proposed and a method to switch between different encoding variants via partial on-the- fly encoding and decoding is presented.

References

SHOWING 1-10 OF 47 REFERENCES

Universal Parity Quantum Computing

TLDR
A universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on the parity encoding is proposed and a method to switch between different encoding variants via partial on-the- fly encoding and decoding is presented.

Measurement-based quantum computation on cluster states

We give a detailed account of the one-way quantum computer, a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster

Quantum arithmetic with the quantum Fourier transform

TLDR
A quantum method to compute the weighted average of a series of inputs in the transform domain is discussed, and one of the circuits, the controlled weighted sum, can be interpreted as a circuit to computed the inner product of two data vectors.

Quantum networks for elementary arithmetic operations.

  • VedralBarencoEkert
  • Computer Science
    Physical review. A, Atomic, molecular, and optical physics
  • 1996
TLDR
This work provides an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation, and shows that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized.

A one-way quantum computer.

TLDR
A scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states, which are thus one-way quantum computers and the measurements form the program.

Addition on a Quantum Computer

A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for

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.

Fast quantum gates for neutral atoms

We propose several schemes for implementing a fast two-qubit quantum gate for neutral atoms with the gate operation time much faster than the time scales associated with the external motion of the

Quantum Approximate Optimization With Parallelizable Gates

  • W. Lechner
  • Computer Science, Physics
    IEEE Transactions on Quantum Engineering
  • 2020
TLDR
A scheme to parallelize the quantum approximate optimization algorithm for arbitrary all-to-all connected problem graphs in a layout of quantum bits (qubits) with nearest-neighbor interactions in a lattice gauge model.

Toward fault-tolerant quantum computation without concatenation

TLDR
By iteratively distilling a certain two-qubit entangled state it is shown how to perform an encoded Toffoli gate, important for universal computation, on CSS codes that are either unconcatenated or, for a range of very large block sizes, singly concatenated.