Related papers: Quantum Supremacy for Simulating A Translation-Inv…
Quantum simulation using synthetic quantum systems offers unique opportunities to explore open questions in many-body physics and a path for the generation of useful entangled states. Nevertheless, so far many quantum simulators have been…
We show how quantum metrology protocols that seek to estimate the parameters of a Hamiltonian that exhibits a quantum phase transition can be efficiently simulated on an exponentially smaller quantum computer. Specifically, by exploiting…
Light-matter interfaces are pivotal for quantum computation and communication. While typically analyzed using single-mode or open-quantum-system approximations, these models often neglect multi-mode field states and light-matter…
Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems…
An analysis is presented of the phase transition of the quantum Ising model with transverse field on the d-dimensional hypercubic lattice. It is shown that there is a unique sharp transition. The value of the critical point is calculated…
We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in…
Implementing a scalable quantum information processor using polar molecules in optical lattices requires precise control over the long-range dipole-dipole interaction between molecules in selected lattice sites. We present here a scheme…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
Quantum annealing (QA) is a generic method for solving optimization problems using fictitious quantum fluctuation. The current device performing QA involves controlling the transverse field; it is classically simulatable by using the…
We employ quantum circuit learning to simulate quantum field theories (QFTs). Typically, when simulating QFTs with quantum computers, we encounter significant challenges due to the technical limitations of quantum devices when implementing…
Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…
A universal family of Hamiltonians can be used to simulate any local Hamiltonian by encoding its full spectrum as the low-energy subspace of a Hamiltonian from the family. Many spin-lattice model Hamiltonians -- such as Heisenberg or XY…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
An Ising-inspired numerical model is developed to study spontaneous quantum teleportation in a quenched spin lattice. Quantum teleportation is an operation that can, using entangled pairs of particles, transport a quantum state across…
We propose a method to perform precision measurements of the interaction parameters in systems of N ultra-cold spin 1/2 atoms. The spectroscopy is realized by first creating a coherent spin superposition of the two relevant internal states…
A quantum simulator is a restricted class of quantum computer that controls the interactions between quantum bits in a way that can be mapped to certain difficult quantum many-body problems. As more control is exerted over larger numbers of…
Non-invertible Kramers-Wannier (KW) duality symmetries are constructed for the transverse-field Ising model (TFIM) at the self-dual point under various boundary conditions (BCs), as long as the resultant Hamiltonian commutes with the ${\rm…
We develop a novel approach to phase transitions in quantum spin models based on a relation to their classical counterparts. Explicitly, we show that whenever chessboard estimates can be used to prove a phase transition in the classical…
All elementary Hamiltonians in nature are expected to be invariant under rotation. Despite this restriction, we usually assume that any arbitrary measurement or unitary time evolution can be implemented on a physical system, an assumption…
Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…