132 research outputs found
Why Philosophers Should Care About Computational Complexity
One might think that, once we know something is computable, how efficiently
it can be computed is a practical question with little further philosophical
importance. In this essay, I offer a detailed case that one would be wrong. In
particular, I argue that computational complexity theory---the field that
studies the resources (such as time, space, and randomness) needed to solve
computational problems---leads to new perspectives on the nature of
mathematical knowledge, the strong AI debate, computationalism, the problem of
logical omniscience, Hume's problem of induction, Goodman's grue riddle, the
foundations of quantum mechanics, economic rationality, closed timelike curves,
and several other topics of philosophical interest. I end by discussing aspects
of complexity theory itself that could benefit from philosophical analysis.Comment: 58 pages, to appear in "Computability: G\"odel, Turing, Church, and
beyond," MIT Press, 2012. Some minor clarifications and corrections; new
references adde
A study of one-turn quantum refereed games
This thesis studies one-turn quantum refereed games, which are abstract zero-sum games with two competing computationally unbounded quantum provers and a computationally bounded quantum referee. The provers send quantum states to the referee, who plugs the two states into his quantum circuit, measures the output of the circuit in the standard basis, and declares one of the two players as the winner depending on the outcome of the measurement. The complexity class QRG(1) comprises of those promise problems for which there exists a one-turn quantum refereed game such that one of the players wins with high probability for the yes-instances, and the other player wins with high probability for the no-instances, irrespective of the opponentās strategy. QRG(1) is a generalization of QMA (or co-QMA), and can informally be viewed as QMA with a no-prover (or co-QMA with a yes-prover).
We have given a full characterization of QRG(1), starting with appropriate definitions and known results, and building on to two new results about this class. Previously, the best known upper bound on QRG(1) was PSPACE. We have proved that if one of the provers is completely classical, sending a classical probability distribution instead of a quantum state, the new class, which we name CQRG(1), is contained in Ę Ā· PP (non- deterministic polynomial-time operator applied to the class PP). We have also defined another restricted version of QRG(1) where both provers send quantum states, but the referee measures one of the quantum states first, and plugs the classical outcome into the measurement, along with the other proverās quantum state, into a quantum circuit, before measuring the output of the quantum circuit in the standard basis. The new class, which we name MQRG(1), is contained in P Ā· PP (the probabilistic polynomial time operator applied to PP). Ę Ā· PP is contained in P Ā· PP, which is, in turn, contained in PSPACE. Hence, our results give better containments than PSPACE for restricted versions of QRG(1)
The complexity of simulating quantum physics: dynamics and equilibrium
Quantum computing is the offspring of quantum mechanics and computer science, two great scientific fields founded in the 20th century. Quantum computing is a relatively young field and is recognized as having the potential to revolutionize science and technology in the coming century. The primary question in this field is essentially to ask which problems are feasible with potential quantum computers and which are not. In this dissertation, we study this question with a physical bent of mind. We apply tools from computer science and mathematical physics to study the complexity of simulating quantum systems. In general, our goal is to identify parameter regimes under which simulating quantum systems is easy (efficiently solvable) or hard (not efficiently solvable). This study leads to an understanding of the features that make certain problems easy or hard to solve. We also get physical insight into the behavior of the system being simulated.
In the first part of this dissertation, we study the classical complexity of simulating quantum dynamics. In general, the systems we study transition from being easy to simulate at short times to being harder to simulate at later times. We argue that the transition timescale is a useful measure for various Hamiltonians and is indicative of the physics behind the change in complexity. We illustrate this idea for a specific bosonic system, obtaining a complexity phase diagram that delineates the system into easy or hard for simulation. We also prove that the phase diagram is robust, supporting our statement that the phase diagram is indicative of the underlying physics.
In the next part, we study open quantum systems from the point of view of their potential to encode hard computational problems. We study a class of fermionic Hamiltonians subject to Markovian noise described by Lindblad jump operators and illustrate how, sometimes, certain Lindblad operators can induce computational complexity into the problem. Specifically, we show that these operators can implement entangling gates, which can be used for universal quantum computation. We also study a system of bosons with Gaussian initial states subject to photon loss and detected using photon-number-resolving measurements. We show that such systems can remain hard to simulate exactly and retain a relic of the "quantumness" present in the lossless system.
Finally, in the last part of this dissertation, we study the complexity of simulating a class of equilibrium states, namely ground states. We give complexity-theoretic evidence to identify two structural properties that can make ground states easier to simulate. These are the existence of a spectral gap and the existence of a classical description of the ground state. Our findings complement and guide efforts in the search for efficient algorithms
Entanglement Theory and the Quantum Simulation of Many-Body Physics
In this thesis we present new results relevant to two important problems in
quantum information science: the development of a theory of entanglement and
the exploration of the use of controlled quantum systems to the simulation of
quantum many-body phenomena.
In the first part we introduce a new approach to the study of entanglement by
considering its manipulation under operations not capable of generating
entanglement and show there is a total order for multipartite quantum states in
this framework. We also present new results on hypothesis testing of correlated
sources and give further evidence on the existence of NPPT bound entanglement.
In the second part, we study the potential as well as the limitations of a
quantum computer for calculating properties of many-body systems. First we
analyse the usefulness of quantum computation to calculate additive
approximations to partition functions and spectral densities of local
Hamiltonians. We then show that the determination of ground state energies of
local Hamiltonians with an inverse polynomial spectral gap is QCMA-hard.
In the third and last part, we approach the problem of quantum simulating
many-body systems from a more pragmatic point of view. We analyze the
realization of paradigmatic condensed matter Hamiltonians in arrays of coupled
microcavities, such as the Bose-Hubbard and the anisotropic Heisenberg models,
and discuss the feasibility of an experimental realization with
state-of-the-art current technology.Comment: 230 pages. PhD thesis, Imperial College London. Chapters 6, 7 and 8
contain unpublished materia
Recommended from our members
Quantum Stochastic Processes and Quantum Many-Body Physics
This dissertation investigates the theory of quantum stochastic processes and its applications in quantum many-body physics.
The main goal is to analyse complexity-theoretic aspects of both static and dynamic properties of physical systems modelled by quantum stochastic processes.
The thesis consists of two parts: the first one addresses the computational complexity of certain quantum and classical divisibility questions, whereas the second one addresses the topic of Hamiltonian complexity theory.
In the divisibility part, we discuss the question whether one can efficiently sub-divide a map describing the evolution of a system in a noisy environment, i.e. a CPTP- or stochastic map for quantum and classical processes, respectively, and we prove that taking the nth root of a CPTP or stochastic map is an NP-complete problem.
Furthermore, we show that answering the question whether one can divide up a random variable into a sum of iid random variables , i.e. , is poly-time computable; relaxing the iid condition renders the problem NP-hard.
In the local Hamiltonian part, we study computation embedded into the ground state of a many-body quantum system, going beyond "history state" constructions with a linear clock.
We first develop a series of mathematical techniques which allow us to study the energy spectrum of the resulting Hamiltonian, and extend classical string rewriting to the quantum setting.
This allows us to construct the most physically-realistic QMAEXP-complete instances for the LOCAL HAMILTONIAN problem (i.e. the question of estimating the ground state energy of a quantum many-body system) known to date, both in one- and three dimensions.
Furthermore, we study weighted versions of linear history state constructions, allowing us to obtain tight lower and upper bounds on the promise gap of the LOCAL HAMILTONIAN problem in various cases.
We finally study a classical embedding of a Busy Beaver Turing Machine into a low-dimensional lattice spin model, which allows us to dictate a transition from a purely classical phase to a Toric Code phase at arbitrarily large and potentially even uncomputable system sizes
- ā¦