# Quantum computing and hidden variables

@article{Aaronson2005QuantumCA, title={Quantum computing and hidden variables}, author={Scott Aaronson}, journal={Physical Review A}, year={2005}, volume={71}, pages={032325} }

This paper initiates the study of hidden variables from a quantum computing perspective. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another into a stochastic matrix that maps the initial probability distribution to the final one in some fixed basis. We list five axioms that we might want such a theory to satisfy and then investigate which of the axioms can be satisfied simultaneously. Toward this end, we propose a new hidden…

## Figures from this paper

## 56 Citations

Quantum Computing and Hidden Variables II: The Complexity of Sampling Histories

- Computer Science
- 2004

If the authors could examine the entire history of a hidden variable, then they could efficiently solve problems that are believed to be intractable even for quantum computers, and obtain the first good example of a model of computation that appears slightly more powerful than the quantum computing model.

Limits on Efficient Computation in the Physical World

- Computer ScienceArXiv
- 2004

This thesis attacks the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known, and studies the relationship of the quantum computing model to physical reality.

The complexity class PDQP SPUR Final Paper: Summer 2013

- Computer Science
- 2013

This paper denes a model of computation slightly more powerful than quantum computation, but only slightly so, and shows that by allowing non-collapsing measurements, it can solve eciently problems such as Graph Isomorphism and Approximate Shortest Vector which are believed to be intractable for quantum computers.

Quantum Computer Search Algorithms: Can We Outperform the Classical Search Algorithms?

- Computer ScienceAdvances in Intelligent Systems and Computing
- 2019

Qubits, the basic unit of quantum computing have the power to exist in more than one state at a time, which could be exploited in the future to come up with solutions for NP-complete problems in thefuture.

Simulation of Quantum Correlation Functions is not Sufficient Resource to Describe Quantum Entanglement

- Physics
- 2020

The Bell theorem expresses that quantum mechanics is not a local-realistic theory, which is often interpreted as nonlocality of the nature. This result has led to this belief that nonlocality and…

Testing Quantum Mechanics using Noisy Quantum Computers

- Physics
- 2021

We consider the hypothesis that quantum mechanics is not fundamental, but instead emerges from a theory with less computational power, such as classical mechanics. This hypothesis makes the…

Bounds on computation from physical principles

- Computer Science
- 2017

This thesis defines a circuit-based model of computation in the operationally-defined framework of generalised probabilistic theories and investigates the relationship between interference behaviour and computational power, demonstrating that non-trivial interference behaviour is a general resource for post-classical computation.

Se p 20 08 Instantaneous Quantum Computation

- Physics
- 2008

We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal…

Architectures for quantum simulation showing a quantum speedup

- Computer Science, Physics
- 2017

This work shows that benchmark settings exhibiting a quantum speedup may require little control in contrast to universal quantum computing, and proposes versatile and feasible schemes of two-dimensional dynamical quantum simulators showing such a quantumSpeedup.

Quantum Computation, Markov Chains and Combinatorial Optimisation

- Mathematics
- 2020

This thesis addresses two questions related to the title, Quantum Computation, Markov Chains and Combinatorial Optimisation. The first question involves an algorithmic primitive of quantum…

## References

SHOWING 1-10 OF 95 REFERENCES

Quantum Computing and Hidden Variables II: The Complexity of Sampling Histories

- Computer Science
- 2004

If the authors could examine the entire history of a hidden variable, then they could efficiently solve problems that are believed to be intractable even for quantum computers, and obtain the first good example of a model of computation that appears slightly more powerful than the quantum computing model.

A SUGGESTED INTERPRETATION OF THE QUANTUM THEORY IN TERMS OF "HIDDEN" VARIABLES. II

- Physics
- 1952

In this paper, we shall show how the theory of measurements is to be understood from the point of view of a physical interpretation of the quantum theory in terms of hidden variables developed in a…

Choice of Consistent Family, and Quantum Incompatibility

- Physics
- 1998

In consistent-history quantum theory, a description of the time development of a quantum system requires choosing a framework or consistent family, and then calculating probabilities for the…

Quantum Mechanics in the Light of Quantum Cosmology

- Physics
- 1989

We sketch a quantum mechanical framework for the universe as a whole. Within that framework we propose a program for describing the ultimate origin in quantum cosmology of the quasiclassical domain…

Quantum computation and quantum information

- PhysicsMathematical Structures in Computer Science
- 2007

This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal…

Modal interpretation of quantum mechanics, measurements, and macroscopic behavior.

- PhysicsPhysical review. A, Atomic, molecular, and optical physics
- 1994

The modal interpretation explained here construes the mathematical formalism of quantum mechanics in terms of physical properties (``be-ables,'' ``existents'') in such a way that the property…

Book-Review - the Undivided Universe - an Ontological Interpretation of Quantum Theory

- Physics
- 1993

In the The Undivided Universe, David Bohn and Basil Hiley present a radically different approach to quantum theory. They develop an interpretation of quantum mechanics which gives a clear, intuitive…

Quantum theory: Reconsideration of foundations

- Philosophy
- 2003

The purpose of the conference (the fourth in the series of Vaxjo conferences) was to bring together scientists (physicists, mathematicians and philosophers) who are interested in foundations of…

The Undivided Universe: An ontological interpretation of Quantum Theory

- Philosophy
- 1994

Systematic Theology by Louis BerkhofSaint Bonaventure (Stanford Encyclopedia of Philosophy)Bohmian Mechanics (Stanford Encyclopedia of Philosophy)Dogmatic Constitution on the Church (Lumen…

Complexity, Entropy and the Physics of Information

- Education
- 1990

That's it, a book to wait for in this month. Even you have wanted for long time for releasing this book complexity entropy and the physics of information; you may not be able to get in some stress.…