Low Depth Quantum Circuits for Ising Models
arXiv:1208.3918 · doi:10.1016/j.aop.2013.11.001
Abstract
A scheme for measuring complex temperature partition functions of Ising models is introduced. In the context of ordered qubit registers this scheme finds a natural translation in terms of global operations, and single particle measurements on the edge of the array. Two applications of this scheme are presented. First, through appropriate Wick rotations, those amplitudes can be analytically continued to yield estimates for partition functions of Ising models. Bounds on the estimation error, valid with high confidence, are provided through a central-limit theorem, which validity extends beyond the present context. It holds for example for estimations of the Jones polynomial. Interestingly, the kind of state preparations and measurements involved in this application can in principle be made "instantaneous", i.e. independent of the system size or the parameters being simulated. Second, the scheme allows to accurately estimate some non-trivial invariants of links. A third result concerns the computational power of estimations of partition functions for real temperature classical ferromagnetic Ising models on a square lattice. We provide conditions under which estimating such partition functions allows one to reconstruct scattering amplitudes of quantum circuits making the problem BQP-hard. Using this mapping, we show that fidelity overlaps for ground states of quantum Hamiltonians, which serve as a witness to quantum phase transitions, can be estimated from classical Ising model partition functions. Finally, we show that the ability to accurately measure corner magnetizations on thermal states of two-dimensional Ising models with magnetic field leads to fully polynomial random approximation schemes (FPRAS) for the partition function. Each of these results corresponds to a section of the text that can be essentially read independently.
arXiv comment28 pages, 9 figures. Changes to v2: reformatted to two column, new citations added, expanded Appendices B and E. typos fixed. v3: Figure added
References in corpus (23)
- Quantum Simulation of Antiferromagnetic Spin Chains in an Optical Lattice
- Ground state overlap and quantum phase transitions
- Natural and artificial atoms for quantum computation
- Fidelity approach to quantum phase transitions
- Can One Trust Quantum Simulators?
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- How Powerful is Adiabatic Quantum Computation?
- Globally controlled quantum wires for perfect qubit transport, mirroring and computing
- Simulating Ising Spin Glasses on a Quantum Computer
- Anyonic interferometry and protected memories in atomic spin lattices
- Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance
- Schemes for Parallel Quantum Computation Without Local Control of Qubits
- Quantum Speed-up for Approximating Partition Functions
- Quantum computation via translation-invariant operations on a chain of qubits
- Quantum algorithms for spin models and simulable gate sets for quantum computation
- On the Exact Evaluation of Certain Instances of the Potts Partition Function by Quantum Computers
- Quantum algorithms for classical lattice models
- Simulation of Classical Thermal States on a Quantum Computer: A Transfer Matrix Approach
- On the Quantum Computational Complexity of the Ising Spin Glass Partition Function and of Knot Invariants
- Classical Ising model test for quantum circuits
- Efficiency of free energy calculations of spin lattices by spectral quantum algorithms
- Quantum simulation of classical thermal states
- Globally controlled universal quantum computation with arbitrary subsystem dimension
Cited by in corpus (8)
- Quantum Commuting Circuits and Complexity of Ising Partition Functions
- A quantum algorithm for additive approximation of Ising partition functions
- Fixing detailed balance in ancilla-based dissipative state engineering
- Modeling the unphysical pseudomode model with physical ensembles: simulation, mitigation, and restructuring of non-Markovian quantum noise
- MERA as a holographic strange correlator
- Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
- Simulating Quantum Computations with Tutte Polynomials
- Evaluating the Jones polynomial with tensor networks