Low depth quantum circuits for Ising models
From MaRDI portal
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.
Recommendations
- Suppressing weak Ising couplings: tailored gates for quantum computation
- Commuting quantum circuits and complexity of Ising partition functions
- On complexity of the quantum Ising model
- Classical Ising model test for quantum circuits
- Universal quantum logic gates in a scalable Ising spin quantum computer
- On the approximability of the `ground-state' problem for Ising spin glasses by quantum devices
- Holonomic quantum gates using isospectral deformation of Ising model
- An algorithm for simulating the Ising model on a type-II quantum computer
- MINIMIZATION OF NONRESONANT EFFECTS IN A SCALABLE ISING SPIN QUANTUM COMPUTER
- Treating the independent set problem by 2D Ising interactions with adiabatic quantum computing
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 437298 (Why is no real title available?)
- scientific article; zbMATH DE number 921439 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- A polynomial quantum algorithm for approximating the Jones polynomial
- An observable measure of entanglement for pure states of multi-qubit systems
- An upper bound on the threshold quantum decoherence rate
- Classical Ising model test for quantum circuits
- Exactly solved models: A journey in statistical mechanics. Selected papers with commentaries (1963-2008).
- On Lattices Admitting Unique Lagrange Interpolations
- On the computational complexity of the Jones and Tutte polynomials
- On the exact evaluation of certain instances of the Potts partition function by quantum computers
- Polynomial-Time Approximation Algorithms for the Ising Model
- Quantum algorithms for classical lattice models
- Quantum computation and the evaluation of tensor networks
- The Complexity of Ferromagnetic Ising with Local Fields
Cited in
(8)- Commuting quantum circuits and complexity of Ising partition functions
- Suppressing weak Ising couplings: tailored gates for quantum computation
- A new connection between quantum circuits, graphs and the Ising partition function
- MODELING FULL ADDER IN ISING SPIN QUANTUM COMPUTER WITH 1000 QUBITS USING QUANTUM MAPS
- The complexity of approximating complex-valued Ising and Tutte partition functions
- Calculation of partition function of Ising model on quantum computer
- Classical Ising model test for quantum circuits
- Quantum algorithms for classical lattice models
This page was built for publication: Low depth quantum circuits for Ising models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339445)
