Computing with a single qubit faster than the computation quantum speed limit

  title={Computing with a single qubit faster than the computation quantum speed limit},
  author={Nikolai A. Sinitsyn},
  journal={Physics Letters A},
  • N. Sinitsyn
  • Published 19 January 2017
  • Physics
  • Physics Letters A
Abstract The possibility to save and process information in fundamentally indistinguishable states is the quantum mechanical resource that is not encountered in classical computing. I demonstrate that, if energy constraints are imposed, this resource can be used to accelerate information-processing without relying on entanglement or any other type of quantum correlations. In fact, there are computational problems that can be solved much faster, in comparison to currently used classical schemes… Expand

Figures from this paper

Quantum Algorithm Implementations for Beginners
This review aims to explain the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. Expand
Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
Quantum computational complexity estimates the difficulty of constructing quantum states from elementary operations, a problem of prime importance for quantum computation. Surprisingly, this quantityExpand
Complexity is simple!
A bstractIn this note we investigate the role of Lloyd’s computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd’s proof into the bulk language. InExpand


Substituting a qubit for an arbitrarily large number of classical bits.
It is shown that a qubit can be used to substitute for a classical analog system requiring an arbitrarily large number of classical bits to represent digitally and no finite amount of one-way classical communication can perfectly simulate the effect of quantum entanglement. Expand
Accurate and Robust Unitary Transformations of a High-Dimensional Quantum System.
This work designs and implements unitary maps in a 16-dimensional Hilbert space associated with the 6S(1/2) ground state of (133)Cs, achieving fidelities >0.98 with built-in robustness to static and dynamic perturbations. Expand
Decoherence-protected quantum gates for a hybrid solid-state spin register
The integration of dynamical decoupling into quantum gates for a standard hybrid system, the electron–nuclear spin register, is presented, which directly allow decoherence-protected interface gates between different types of solid-state qubit. Expand
Quantum information processing: The case of vanishing interaction energy
The possibility of performing an operation by a quantum “oracle” whose average energy equals zero is pointed out and this counterintuitive result not only presents a generalization of the recent results of Margolus and Levitin, but might also sharpen the conceptual distinction between the “classical” and the ”quantum” information. Expand
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits.
We demonstrate laser-driven two-qubit and single-qubit logic gates with respective fidelities 99.9(1)% and 99.9934(3)%, significantly above the ≈99% minimum threshold level required forExpand
Quantum discord: a measure of the quantumness of correlations.
This work shows that absence of entanglement does not imply classicality, and considers the vanishing of discord as a criterion for the preferred effectively classical states of a system, i.e., the pointer states. Expand
Fast quantum computation at arbitrarily low energy
One version of the energy-time uncertainty principle states that the minimum time $T_{\perp}$ for a quantum system to evolve from a given state to any orthogonal state is $h/(4 \Delta E)$ whereExpand
Three-stage decoherence dynamics of an electron spin qubit in an optically active quantum dot
The mechanisms of decoherence in solid-state spin qubits subject to low magnetic fields turn out to be more complex than previously expected as an additional fast relaxation stage has now beenExpand
Quantum Finite Automata: A Modern Introduction
Five examples where quantum finite automata (QFAs) outperform their classical counterparts and a modern QFA model involving superoperators that is able to simulate all known QFA and classical finite automaton variants is described. Expand
Ultimate physical limits to computation
The physical limits of computation as determined by the speed of light c, the quantum scale ℏ and the gravitational constant G are explored. Expand