The elusive source of quantum effectiveness
arXiv:0906.3656 · doi:10.1007/s10701-010-9452-0
Abstract
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum correlations, or entanglement, are clearly of paramount importance for efficient pure state manipulations, mixed states present a much richer arena and reveal a more subtle interplay between correlations and distinguishability. The current work explores a number of issues related with identifying the important ingredients needed for quantum information processing. We discuss the Deutsch-Jozsa algorithm, the Shor algorithm, the Grover algorithm and the power of a single qubit class of algorithms. One section is dedicated to cluster states where entanglement is crucial, but its precise role is highly counter-intuitive. Here we see that distinguishability becomes a more useful concept.
arXiv comment8 pages, no figures
References in corpus (27)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Introducing Quantum Discord
- Classical, quantum and total correlations
- Quantifying Entanglement
- Entanglement Measures and Purification Procedures
- Quantum discord and the power of one qubit
- The Role of Relative Entropy in Quantum Information Theory
- On the Power of One Bit of Quantum Information
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- On the role of entanglement in quantum computational speed-up
- Separability of very noisy mixed states and implications for NMR quantum computing
- Classical Correlations and Entanglement in Quantum Measurements
- Most quantum states are too entangled to be useful as computational resources
- Statistical Inference, Distinguishability of Quantum States, And Quantum Entanglement
- On the role of entanglement and correlations in mixed-state quantum computation
- Implementation of quantum search algorithm using classical Fourier optics
- Are random pure states useful for quantum computation?
- Good dynamics versus bad kinematics. Is entanglement needed for quantum computation?
- Quantum Computing Without Entanglement
- Nonlocality of a single particle
- Communication Capacity of Quantum Computation
- Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
- Explicit product ensembles for separable quantum states
- Entanglement and nonlocality of a single relativistic particle
- Entanglement Simulations of Shor's Algorithm
- How much of one-way computation is just thermodynamics?
- Entangling capacity of global phases and implications for Deutsch-Jozsa algorithm
Cited by in corpus (42)
- The classical-quantum boundary for correlations: discord and related measures
- Contextuality supplies the magic for quantum computation
- Experimental investigation of classical and quantum correlations under decoherence
- Measures and applications of quantum correlations
- Operational Significance of Discord Consumption: Theory and Experiment
- Quasi-probability representations of quantum theory with applications to quantum information science
- Theoretical and experimental aspects of quantum discord and related measures
- Maximally discordant mixed states of two qubits
- Orthogonal measurements are {\it almost} sufficient for quantum discord of two qubits
- Discord and quantum computational resources
- The computational landscape of general physical theories
- Geometric Algebra and Information Geometry for Quantum Computational Software
- Entanglement and deterministic quantum computing with one qubit
- On the quantumness of correlations in nuclear magnetic resonance
- Quantum discord in nuclear magnetic resonance systems at room temperature
- Enhancement of quantum correlations for the system of cavity QED by applying bang-bang pulses
- Benchmarks of Nonclassicality for Qubit Arrays
- Epistemically restricted phase space representation, weak momentum value, and reconstruction of quantum wave function
- Quantifying Computational Advantage of Grover's Algorithm with the Trace Speed
- Many Worlds, the Cluster-state Quantum Computer, and the Problem of the Preferred Basis
- Quantum Collapse and the Second Law of Thermodynamics
- Experimental Realization of Schumacher's Information Geometric Bell Inequality
- Witnessing nonclassical correlations via a single-shot experiment on an ensemble of spins using NMR
- Generalizations of Quantum Discord
- Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation
- Completing the physical representation of quantum algorithms provides a quantitative explanation of their computational speedup
- Quantum Path Computing: Computing Architecture with Propagation Paths in Multiple Plane Diffraction of Classical Sources of Fermion and Boson Particles
- Two-qubit correlations revisited: average mutual information, relevant (and useful) observables and an application to remote state preparation
- A relational time-symmetric framework for analyzing the quantum computational speedup
- Nonclassical correlations in subsystems of globally entangled quantum states
- Entanglement-breaking channels are a quantum memory resource
- On the Physical Explanation for Quantum Computational Speedup
- Quantum Reactivity: A Measure of Quantum Correlation
- Distillation of quantum non-Markovianity
- On the Necessity of Entanglement for the Explanation of Quantum Speedup
- Contextuality, Witness of Quantum Weirdness
- On The Stabilizer Formalism And Its Generalization
- Generation and Detection of Quantum Correlations and Entanglement on a Spin-Based Quantum Information Processor
- A Multilayer Network Approach to Quantum Computing
- Oracle problems as communication tasks and optimization of quantum algorithms
- Free Quantum Computing
- Exploiting quantum discord for analyzing complex systems: two-state Markov-binary