Efficient classical simulation of slightly entangled quantum computations.

@article{Vidal2003EfficientCS,
  title={Efficient classical simulation of slightly entangled quantum computations.},
  author={Guifr{\'e} Vidal},
  journal={Physical review letters},
  year={2003},
  volume={91 14},
  pages={
          147902
        }
}
  • G. Vidal
  • Published 15 January 2003
  • Computer Science, Physics
  • Physical review letters
We present a classical protocol to efficiently simulate any pure-state quantum computation that involves only a restricted amount of entanglement. More generally, we show how to classically simulate pure-state quantum computations on n qubits by using computational resources that grow linearly in n and exponentially in the amount of entanglement in the quantum computer. Our results imply that a necessary condition for an exponential computational speedup (with respect to classical computations… 
Quantum computing without entanglement
Quantum advantage without entanglement
TLDR
The Deutsch-Jozsa algorithm is presented, and it is shown that the maximal subproblem is of greater significance, by proving that it contains all the Boolean functions whose quantum phase-oracle is non-entangling.
Review on the study of entanglement in quantum computation speedup
TLDR
It is concluded that the presence of entanglement is a necessary but not sufficient condition in the pure state or pseudo-pure state quantum computation speedup and the case with the mixed state remains open.
Most quantum States are too entangled to be useful as computational resources.
TLDR
It is shown that quantum states can be too entangled to be useful for the purpose of computation, in that high values of the geometric measure of entanglement preclude states from offering a universal quantum computational speedup.
groverian entanglement measure of pure quantum states with arbitrary partitions
The Groverian entanglement measure of pure quantum states of n qubits is generalized to the case in which the qubits are divided into any p{<=}n parties. The entanglement between these parties is
Sequential implementation of global quantum operations.
TLDR
It is proved that sequential unitary decompositions are in general impossible for genuine entangling operations, even with an infinite-dimensional ancilla, being the controlled-NOT gate a paradigmatic example.
Efficient generation of graph states for quantum computation
We present an entanglement generation scheme which allows arbitrary graph states to be efficiently created in a linear quantum register via an auxiliary entangling bus (EB). The dynamical evolution
Quantum Computation by Local Measurement
TLDR
An introduction to the one-way quantum computer, a scheme of measurement-based quantum computation (MBQC), in this model, the computation is driven by local measurements on a carefully chosen, highly entangled state.
Quantum computingwithout entang lement
TLDR
It is concluded that: (a) entanglement is not essential for quantum computing; and (b) some advantage of quantum algorithms over classical algorithms persists even when the quantum state contains an arbitrarily small amount of information—even when the state is arbitrarily close to being totally mixed.
Entanglement in a Quantum Annealing Processor
Abstract : Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Entanglement in quantum critical phenomena.
TLDR
The results establish a precise connection between concepts of quantum information, condensed matter physics, and quantum field theory, by showing that the behavior of critical entanglement in spin systems is analogous to that of entropy in conformal field theories.
MATH
TLDR
It is still unknown whether there are families of tight knots whose lengths grow faster than linearly with crossing numbers, but the largest power has been reduced to 3/z, and some other physical models of knots as flattened ropes or strips which exhibit similar length versus complexity power laws are surveyed.
On the role of entanglement in quantum-computational speed-up
  • R. JozsaN. Linden
  • Physics, Computer Science
    Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 2003
TLDR
It is argued that it is nevertheless misleading to view entanglement as a key resource for quantum‐computational power, as it is necessary for any quantum algorithm to offer an exponential speed‐up over classical computation.
in Proceedings of the 35th Annual Symposium on Foundations of Computer Science
  • Santa Fe, NM, 20 to 22 November 1994, S. Goldwasser, Ed.
  • 1994
Caltech, Pasadena)
  • D. Thesis,
  • 1997
Phys
  • Rev. Lett. 87, 047901
  • 2001
Phys
  • Rev. Lett. 81, 5672
  • 1998
Proceedings of the 35th Annual Symposium on Foundations of Computer Science
  • Proceedings of the 35th Annual Symposium on Foundations of Computer Science
  • 1994
Found. Phys. Int. J. Theor. Phys
  • Found. Phys. Int. J. Theor. Phys
  • 1982
in Proceedings of the 33rd ACM Symposium on the Theory of Computation (ACM Press
  • New York, 2001), pp. 114–123; B. M. Terhal and D. P. DiVincenzo, Phys. Rev. A 65, 032325
  • 2002
...
...