Related papers: Classical simulators of quantum computers and no-g…
A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically…
The question of whether quantum phenomena can be explained by classical models with hidden variables is the subject of a long lasting debate. In 1964, Bell showed that certain types of classical models cannot explain the quantum mechanical…
Contrary to the widespread belief, the problem of the emergence of classical mechanics from quantum mechanics is still open. In spite of many results on the $\h \to 0$ asymptotics, it is not yet clear how to explain within standard quantum…
One of the recent no-go theorems on \Psi-epistemic interpretations of quantum proves that there are no 'maximally epistemic' interpretations of quantum theory. The proof utilises similar arrangements to Clifton's quantum contextuality proof…
Classical realism demands that system properties exist independently of whether they are measured, while noncontextuality demands that the results of measurements do not depend on what other measurements are performed in conjunction with…
We show that a class of quantum computations that was recently shown to be efficiently simulatable on a classical computer by Valiant corresponds to a physical model of noninteracting fermions in one dimension. We give an alternative proof…
Wigner's friend thought experiment is intended to reveal the inherent tension between unitary evolution and measurement collapse. On the basis of Wigner's friend experiment, Brukner derives a no-go theorem for observer-independent facts. We…
This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational…
More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be…
We examine the implications of quantum foundations for AGI, focusing on how seminal results such as Bell's theorems (non-locality), the Kochen-Specker theorem (contextuality) and no-cloning theorem problematise practical implementation of…
The possibility to test experimentally the Bell-Kochen-Specker theorem is investigated critically, following the demonstrations by Meyer, Kent and Clifton-Kent that the predictions of quantum mechanics are indistinguishable (up to arbitrary…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in classical (non-quantum) areas. In this paper we survey these results and…
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…
We present critical arguments against individual interpretation of Bohr's complementarity and Heisenberg's uncertainty principles. Statistical interpretation of these principles is discussed in the contextual framework. We support the…
The Kochen-Specker theorem is a basic and fundamental 50 year old non-existence result affecting the foundations of quantum mechanix, strongly implying the lack of any meaningful notion of "quantum realism", and typically leading to…
An integrable anharmonic oscillator is presumably simulable by a classical computer and therefore by a quantum computer. An integrable anharmonic oscillator whose Hamiltonian is of normal type and quartic in the canonical coordinates is not…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
Classical stochastic processes can be generated by quantum simulators instead of the more standard classical ones, such as hidden Markov models. One reason for using quantum simulators is that they generally require less memory than their…
There exist diverse no-go theorems, ranging from no-cloning to monogamies of quantum correlations and Bell inequality violations, which restrict the processing of information in the quantum world. In a multipartite scenario, monogamy of…