Entanglement and Quantum Computation
read the original abstract
We argue that entanglement is the essential non-classical ingredient which provides the computational speed-up in quantum algorithms as compared to algorithms based on the processes of classical physics.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Testing Single Photon Entanglement using Self-Referential Measurements
Single-photon Bell inequality violation achieved with self-referential joint measurements on two identical states, producing CHSH values of 2.71±0.09 and 2.23±0.07.
-
Existing experiments suffice to indirectly verify the quantum essence of gravity
Verifying the Schrödinger equation for a single delocalized system in gravitational interaction implies gravity-mediated entanglement for two systems under two reasonable assumptions.
-
Geometric and Resource-Theoretic Characterisation of Non-Stabiliserness in Quantum Algorithms
Introduces permutation-agnostic distance measures to quantify non-stabiliserness consumption and shows structured variational methods use it more efficiently than unstructured ones with greater classical optimisation freedom.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.