Related papers: Simulating 2D topological quantum phase transition…
Developing methods to solve nuclear many-body problems with quantum computers is an imperative pursuit within the nuclear physics community. Here, we introduce a quantum algorithm to accurately and precisely compute the ground state of…
A scheme is presented for realizing a quantum phase gate with three-level atoms, solid-state qubits--often called artificial atoms, or ions that share a quantum data bus such as a single mode field in cavity QED system or a collective…
Preparing the ground state of a system is an important task in physics. We propose a quantum algorithm for preparing the ground state of a physical system that can be simulated on a quantum computer. The system is coupled to an ancillary…
Spin network states are a powerful tool for constructing the $SU(2)$ gauge theories on a graph. In loop quantum gravity (LQG), they have yielded many promising predictions, although progress has been limited by the computational challenge…
We characterize the variational power of quantum circuit tensor networks in the representation of physical many-body ground-states. Such tensor networks are formed by replacing the dense block unitaries and isometries in standard tensor…
Quantum computing crucially relies on the ability to efficiently characterize the quantum states output by quantum hardware. Conventional methods which probe these states through direct measurements and classically computed correlations…
Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…
Learning faithful representations of quantum states is crucial to fully characterizing the variety of many-body states created on quantum processors. While various tomographic methods such as classical shadow and MPS tomography have shown…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…
Identifying quantum phase transitions poses a significant challenge in condensed matter physics, as this requires methods that both provide accurate results and scale well with system size. In this work, we demonstrate how relaxation…
Reconstructing the state of a complex quantum system represents a pivotal task for all quantum information applications, both for characterization purposes and for verification of quantum protocols. Recent technological developments have…
The concept of quantum phase transitions (QPT) plays a central role in the description of condensed matter systems. In this contribution, we perform high-quality wavefunction-based simulations to demonstrate the existence of a quantum phase…
We develop and analyze a method for simulating quantum circuits on classical computers by representing quantum states as rooted tree tensor networks. Our algorithm first determines a suitable, fixed tree structure adapted to the expected…
The quantum state preparation of probability distributions is an important subroutine for many quantum algorithms. When embedding $D$-dimensional multivariate probability distributions by discretizing each dimension into $2^n$ points, we…
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
We construct parametrized isometric tensor network states -- referred to as skeletons -- that allow us to explore phases of abelian topological order and can be efficiently implemented on quantum processors. We obtain stable finite…
Motivated by the possibility of universal quantum computation under noise perturbations, we compute the phase diagram of the 2d cluster state Hamiltonian in the presence of Ising terms and magnetic fields. Unlike in previous analysis of…
A major bottleneck in the quest for scalable many-body quantum technologies is the difficulty in benchmarking their preparations, which suffer from an exponential `curse of dimensionality' inherent to their quantum states. We present an…
We present a holographic quantum simulation algorithm to variationally prepare thermal states of $d$-dimensional interacting quantum many-body systems, using only enough hardware qubits to represent a ($d$-1)-dimensional cross-section. This…