Related papers: Quantum eigenstate broadcasting assisted by a cohe…
Hamiltonian simulation is a domain where quantum computers have the potential to outperform their classical counterparts. One of the main challenges of such quantum algorithms is increasing the system size, which is necessary to achieve…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
In realistic metrology, entangled probes are more sensitive to noise, especially for a correlated environment. The precision of parameter estimation with entangled probes is even lower than that of the unentangled ones in a correlated…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
We introduce an efficient algorithm for the systematic design of shallow-depth quantum circuits capable of preparing many-body quantum states represented as Matrix Product States (MPS). The proposed method leverages Schmidt spectrum…
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available,…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Hamiltonian using any method of choice. The eigenstate is then…
A variety of quantum computing algorithms exist for the preparation of approximate Hamiltonian ground states. A natural and important question is how these ground-state approximations can be further improved using adiabatic state…
Quantum Mechanical ground states of many-body systems can be important resources for various investigations: for quantum sensing, as the initial state for nonequilibrium quantum dynamics following quenches, and the simulation of quantum…
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will…
Quantum state preparation (QSP) is a key component in many quantum algorithms. In particular, the problem of sparse QSP (SQSP) $\unicode{x2013}$ the task of preparing the states with only a small number of non-zero amplitudes…
Efficient quantum circuit optimization schemes are central to quantum simulation of strongly interacting quantum many body systems. Here, we present an optimization algorithm which combines machine learning techniques and tensor network…
Quantum computers based on superconducting circuits are experiencing a rapid development, aiming at outperforming classical computers in certain useful tasks in the near future. However, the currently available chip fabrication technologies…
Assemblies of strongly interacting fermions, whether in a condensed-matter or a quantum chemistry context, range amongst the most promising candidate systems for which quantum computing platforms could provide an advantage. Near-term…
We develop a phase estimation method with a distinct feature: its maximal runtime (which determines the circuit depth) is $\delta/\epsilon$, where $\epsilon$ is the target precision, and the preconstant $\delta$ can be arbitrarily close to…
Ground-state estimation lies at the heart of a broad range of quantum simulations. Most near-term approaches are cast as variational energy minimization and thus inherit the challenges of problem-specific energy landscapes. We develop the…
Quantum simulations are bound to be one of the main applications of near-term quantum computers. Quantum chemistry and condensed matter physics are expected to benefit from these technological developments. Several quantum simulation…
Accurate ground-state calculations on noisy quantum computers are fundamentally limited by restricted ansatz expressivity and unavoidable hardware errors. We introduce a hybrid-quantum classical framework that simultaneously addresses these…
Variational quantum algorithms constitute one of the most widespread methods for using current noisy quantum computers. However, it is unknown if these heuristic algorithms provide any quantum-computational speedup, although we cannot…