pith. sign in

arxiv: 0804.0272 · v1 · pith:H5JKHXCInew · submitted 2008-04-02 · 🪐 quant-ph

Quantum computing using shortcuts through higher dimensions

classification 🪐 quant-ph
keywords quantumcircuitsdimensionsgateshigherimplementationnumberotherwise
0
0 comments X
read the original abstract

Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have been demonstrated in several physical architectures. A serious obstacle to a full-scale implementation is the sheer number of these gates required to implement even small quantum algorithms. Here we present and demonstrate a general technique that harnesses higher dimensions of quantum systems to significantly reduce this number, allowing the construction of key quantum circuits with existing technology. We are thereby able to present the first implementation of two key quantum circuits: the three-qubit Toffoli and the two-qubit controlled-unitary. The gates are realised in a linear optical architecture, which would otherwise be absolutely infeasible with current technology.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory

    quant-ph 2023-09 unverdicted novelty 7.0

    The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.