• Corpus ID: 117052527

Entanglement Theory and the Quantum Simulation of Many-Body Physics

@article{Brando2008EntanglementTA,
  title={Entanglement Theory and the Quantum Simulation of Many-Body Physics},
  author={Fernando G. S. L. Brand{\~a}o},
  journal={arXiv: Quantum Physics},
  year={2008}
}
  • F. Brandão
  • Published 1 October 2008
  • Physics
  • arXiv: Quantum 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… 
On the complexity of quantum partition functions
TLDR
The results suggest that simulation of quantum many-body systems in thermal equilibrium may precisely capture the complexity of a broad family of computational problems that has yet to be defined or characterized in terms of known complexity classes.
Quantum proof systems and entanglement theory
TLDR
This thesis presents a new complete problem for the complexity class QMA, and proves that QMAlog(2), which is defined the same as QMA(2) except that the size of witnesses is logarithmic, with the gap n( +E) contains NP.
Approximation, Proof Systems, and Correlations in a Quantum World
TLDR
A polynomial-time (classical) approximation algorithm for dense instances of the canonical QMA-complete quantum constraint satisfaction problem, the local Hamiltonian problem, and two novel schemes for quantifying non-classicality are proposed.
The importance of the spectral gap in estimating ground-state energies
TLDR
It is shown that the full complexity of the high precision case only comes about when the spectral gap is exponentially small, which is a surprising result that the complexity of LocalHamiltonian is magnified from QMA to PSPACE, the class of problems solvable in polynomial space.
Extendibility limits the performance of quantum processors
TLDR
The resource theory of unextendibility is introduced, which is associated with the inability of extending quantum entanglement in a given quantum state to multiple parties, and the bounds obtained are significantly tighter than previously known bounds for quantum communication over both the depolarizing and erasure channels.
Exponential clustering of bipartite quantum entanglement at arbitrary temperatures
Many inexplicable phenomena in low-temperature many-body physics are a result of macroscopic quantum effects. Such macroscopic quantumness is often evaluated via long-range entanglement, that is,
Quantum proofs, the local Hamiltonian problem and applications. (Preuves quantiques, le problème des Hamiltoniens locaux et applications)
TLDR
This thesis proposes the first relativistic verifiable delegation scheme for quantum computation and proposes a weaker version of QPCP conjecture, and shows that this new conjecture can be formulated as a Local Hamiltonian problem and also as a problem involving the maximum acceptance probability of multi-prover games.
Quantum de finetti theorems under local measurements with applications
TLDR
Two new quantum de Finetti theorems are proved, both showing that under tests formed by local measurements in each of the subsystems one can get an exponential improvement in the error dependence on the dimension ofThe subsystems.
Faithful Squashed Entanglement
TLDR
This paper presents a lower bound for squashed entanglement in terms of a distance to the set of separable states, and shows that multiple provers are not more powerful than a single prover when the verifier is restricted to LOCC operations thereby providing a new characterisation of the complexity class QMA.
Towards quantum advantage for topological data analysis
TLDR
Evidence is provided that certain crucial steps in this quantum algorithm for topological data analysis solve problems that are classically intractable by closely relating them to the one clean qubit model, a restricted model of quantum computation whose power is strongly believed to lie beyond that of classical computation.
...
...

References

SHOWING 1-10 OF 345 REFERENCES
Simulating the Quantum Magnet
To gain deeper insight into the dynamics of complex quantum systems we need a quantum leap in computer simulations. We can not translate quantum behaviour arising with superposition states or
The Power of Quantum Systems on a Line
TLDR
The proof of the QMA-completeness result requires an additional idea beyond the usual techniques in the area: Some illegal configurations cannot be ruled out by local checks, and are instead ruled out because they would, in the future, evolve into a state which can be seen locally to be illegal.
Uncertainty, monogamy, and locking of quantum correlations
TLDR
The results lead to the conclusion that both measures can drop by an arbitrary amount when only a single qubit of a local system is lost.
A Reversible Theory of Entanglement and its Relation to the Second Law
We consider the manipulation of multipartite entangled states in the limit of many copies under quantum operations that asymptotically cannot generate entanglement. In stark contrast to the
Aspects of Generic Entanglement
We study entanglement and other correlation properties of random states in high-dimensional bipartite systems. These correlations are quantified by parameters that are subject to the ``concentration
Simulation of Topological Field Theories¶by Quantum Computers
Abstract: Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a
Dynamics and manipulation of entanglement in coupled harmonic systems with many degrees of freedom
We study the entanglement dynamics of a system consisting of a large number of coupled harmonic oscillators in various configurations and for different types of nearest-neighbour interactions. For a
Adiabatic quantum state generation and statistical zero knowledge
TLDR
The ASG approach to quantum algorithms provides intriguing links between quantum computation and many different areas: the analysis of spectral gaps and groundstates of Hamiltonians in physics, rapidly mixing Markov chains, statistical zero knowledge, and quantum random walks.
Entanglement and thermodynamical analogies
TLDR
A scheme of the search of representative state for given entanglement which can be viewed as an analogue of the Jaynes maximum entropy principle is proposed and proposes a concept of local orthogonality of ensembles which leads to the mixed states with distillableEntanglement equal to entanglements of formation.
A tight lower bound on the classical communication cost of entanglement dilution
  • A. Harrow, H. Lo
  • Physics, Computer Science
    IEEE Transactions on Information Theory
  • 2004
TLDR
The main result is to prove that this prior art result for diluting to N copies of a partially entangled state is optimal up to a constant factor; any procedure for approximately creating N partially entangled states from singlets requires /spl Omega/(/spl radic/N) bits of classical communication.
...
...