A repeat-until-success quantum computing scheme

The quantum computing scheme described by Raussendorf et. al (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through the correction of Z errors only, a threshold error rate approaching 1% and low overhead arbitrarily long-range logical gates. In this work, we review the scheme in detail framing the discussion solely in terms of the required 3-D cluster state and its stabilizers.

Download Full-text

Controlling the dynamics of ultracold polar molecules in optical tweezers

New Journal of Physics ◽

10.1088/1367-2630/ac434b ◽

2021 ◽

Author(s):

Marta Sroczyńska ◽

Anna Dawid ◽

Michał Tomza ◽

Zbigniew Idziaszek ◽

Tommaso Calarco ◽

...

Keyword(s):

Quantum Computing ◽

Optical Tweezers ◽

Precision Measurements ◽

Great Promise ◽

Polar Molecules ◽

Ultracold Molecules ◽

Ultracold Polar Molecules ◽

Qubit States ◽

Computing Scheme

Abstract Ultracold molecules trapped in optical tweezers show great promise for the implementation of quantum technologies and precision measurements. We study a prototypical scenario where two interacting polar molecules placed in separate traps are controlled using an external electric field. This, for instance, enables a quantum computing scheme in which the rotational structure is used to encode the qubit states. We estimate the typical operation timescales needed for state engineering to be in the range of few microseconds. We further underline the important role of the spatial structure of the two-body states, with the potential for significant gate speedup employing trap-induced resonances.

Download Full-text

Discrete variable gate-model quantum computing

10.32388/262483 ◽

2019 ◽

Author(s):

Mark Fingerhuth ◽

Tomáš Babej ◽

Peter Wittek

Keyword(s):

Quantum Computing ◽

Discrete Variable

Download Full-text

Surface code quantum computing

Physics Subject Headings (PhySH) ◽

10.29172/7afc8a46-4a16-4509-8db6-2bfa23521cc4 ◽

2018 ◽

Keyword(s):

Quantum Computing ◽

Surface Code

Download Full-text

The Essence of Quantum Computing

10.34048/2018.1.f1 ◽

2018 ◽

Author(s):

Rajendra K. Bera

Keyword(s):

Hilbert Space ◽

Quantum Computing ◽

Quantum Physics ◽

Quantum Algorithms ◽

Quantum Computers ◽

Turing Machines ◽

Classical Physics ◽

Core Set ◽

The World ◽

Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

Download Full-text