Related papers: Efficient quantum Gibbs sampling of stabilizer cod…
We show how the thermodynamic properties of large many-body localized systems can be studied using quantum Monte Carlo simulations. To this end we devise a heuristic way of constructing local integrals of motion of very high quality, which…
The properties of strongly-coupled lattice gauge theories at finite density as well as in real time have largely eluded first-principles studies on the lattice. This is due to the failure of importance sampling for systems with a complex…
In a recent work [10], Poulin and one of us presented a quantum algorithm for preparing thermal Gibbs states of interacting quantum systems. This algorithm is based on Grovers's technique for quantum state engineering, and its running time…
Preparing the thermal density matrix $\rho_{\beta} \propto e^{-\beta H}$ corresponding to a given Hamiltonian $H$ is a task of central interest across quantum many-body physics, and is particularly salient when attempting to study it with…
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of…
Inspired by natural cooling processes, dissipation has become a promising approach for preparing low-energy states of quantum systems. However, the potential of dissipative protocols remains unclear beyond certain commuting Hamiltonians.…
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…
We study the phase transition from two different topological phases to the ferromagnetic phase by focusing on points of the phase transition. To this end, we present a detailed mapping from such models to the Ising model in a transverse…
Quantum state preparation lies at the heart of quantum computation and quantum simulations, enabling the investigation of complex manybody systems across physics, chemistry, and data science. While existing methods such as Variational…
Hamiltonian simulation is one of the most promising candidates for the demonstration of quantum advantage within the next ten years, and several studies have proposed end-to-end resource estimates for executing such algorithms on…
Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to…
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators, acting on protected qubits, to be translated into physical operators (circuits) acting on physical quantum…
We introduce the hemicubic codes, a family of quantum codes obtained by associating qubits with the $p$-faces of the $n$-cube (for $n>p$) and stabilizer constraints with faces of dimension $(p\pm1)$. The quantum code obtained by identifying…
This paper provides a stabilizing preparation method for quantum Gaussian states by utilizing continuous measurement. The stochastic evolution of the open quantum system is described in terms of the quantum stochastic master equation. We…
We present a low-depth amplitude encoding method for arbitrary quantum state preparation. Building on the foundation of an existing divide-and-conquer algorithm, we propose a method to disentangle the ancillary qubits from the final state.…
Adaptive quantum circuits employ unitary gates assisted by mid-circuit measurement, classical computation on the measurement outcome, and the conditional application of future unitary gates based on the result of the classical computation.…
We introduce a numerical method to determine the Hamiltonian of Mean Force (HMF) Gibbs state for a quantum system strongly coupled to a reservoir. The method adapts the Time Evolving Matrix Product Operator (TEMPO) algorithm to imaginary…
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. Synthesizing the corresponding quantum circuit is typically done by breaking the evolution into small time steps, also known as…
Surface codes based on stabilizer circuits may pave the way for large scale fault-tolerant quantum computation. The surface code uses only single- and two-qubit gates and the error threshold falls close to 1% for a large range of errors.…
Quantum error correction is an important ingredient for scalable quantum computing. Stabilizer codes are one of the most promising and straightforward ways to correct quantum errors, are convenient for logical operations, and improve…