Related papers: Efficient Adiabatic Preparation of Tensor Network …
Preparing highly entangled quantum states is a key challenge in quantum metrology and quantum information science. Measurements, especially those of global observables, offer a simple and efficient way to generate entanglement between…
Adiabatic passage employs a slowly varying time-dependent Hamiltonian to control the evolution of a quantum system along the Hamiltonian eigenstates. For processes of finite duration, the exact time evolving state may deviate from the…
Preparing quantum states is a fundamental task in various quantum algorithms. In particular, state preparation in quantum harmonic oscillators (HOs) is crucial for the creation of qudits and the implementation of high-dimensional…
We introduce a method to speed up adiabatic protocols for creating entanglement between two qubits dispersively coupled to a transmission line, while keeping fidelities high and maintaining robustness to control errors. The method takes…
The cost and the error of the adiabatic theorem for preparing the final eigenstate are discussed in terms of path length. Previous studies in terms of the norm of the Hamiltonian and its derivatives with the spectral gap are limited in…
Discrete combinatorial optimization consists in finding the optimal configuration that minimizes a given discrete objective function. An interpretation of such a function as the energy of a classical system allows us to reduce the…
We discuss how adiabatic potentials can be used to create addressable lattices on a subwavelength scale, which can be used as a tool for local operations and readout within a lattice substructure, while taking advantage of the faster…
We consider the possibility of creating an adiabatic transition through a narrow neck, or point contact, between two different quantized Hall states that have the same number of edge modes, such as \nu=1 and \nu=1/3. We apply both the…
Tensor network states provide an efficient class of states that faithfully capture strongly correlated quantum models and systems in classical statistical mechanics. While tensor networks can now be seen as becoming standard tools in the…
The preparation of $n$-qubit quantum states is a cross-cutting subroutine for many quantum algorithms, and the effort to reduce its circuit complexity is a significant challenge. In the literature, the quantum state preparation algorithm by…
We propose a novel tensor network method to achieve accurate and efficient simulations of Abelian lattice gauge theories (LGTs) in (2+1)D for both ground state and real-time dynamics. The first key is to identify a gauge canonical form…
Macroscopic cat states have been widely studied to illustrate fundamental principles of quantum physics as well as their application in quantum information processing. In this paper, we propose a quantum speedup method for adiabatic…
A shortcut to an adiabatic scheme is proposed for preparing a massive object in a macroscopic spatial superposition state. In this scheme we propose to employ counterdiabatic driving to maintain the system in the ground state of its…
We develop a resource efficient method by which the ground-state of an arbitrary k-local, optimization Hamiltonian can be encoded as the ground-state of a (k-1)-local optimization Hamiltonian. This result is important because adiabatic…
Using exact diagonalization and tensor network techniques we compute the gap for the AKLT Hamiltonian in 1D and 2D spatial dimensions. Tensor Network methods are used to extract physical properties directly in the thermodynamic limit, and…
Motivated by transitionless quantum driving, we construct shortcuts to adiabatic passage in a three-atom system to create a singlet state with the help of quantum zeno dynamics and non-resonant lasers. The influence of various decoherence…
We present a quantum algorithm for implementing $\phi^4$ lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the…
We design a quantum algorithm for ground state preparation in the early fault tolerant regime. As a Monte Carlo-style quantum algorithm, our method features a Lindbladian where the target state is stationary. The construction of this…
We propose here a counterdiabatic (CD) strategy for fast preparation of a state with long-range topological order by magnetic field tuning of an initial separable state. For concreteness, we consider the ground state of the honeycomb Kitaev…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…