Related papers: Quantum eigenstate broadcasting assisted by a cohe…
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $\delta$. Given a local…
The preparation of the ground state of a Hamiltonian $H$ with a large spectral radius has applications in many areas such as electronic structure theory and quantum field theory. Given an initial state with a constant overlap with the…
In this paper we discuss a quantum multi-tasking protocol for preparation of known one-qubit and two-qubit states respectively in two different locations. The ideal remote state preparation protocol is discussed in the first place in which…
Quantum variational algorithms are one of the most promising applications of near-term quantum computers; however, recent studies have demonstrated that unless the variational quantum circuits are configured in a problem-specific manner,…
The determination of ground state properties of quantum systems is a fundamental problem in physics and chemistry, and is considered a key application of quantum computers. A common approach is to prepare a trial ground state on the quantum…
The use of near-term quantum devices that lack quantum error correction, for addressing quantum chemistry and physics problems, requires hybrid quantum-classical algorithms and techniques. Here we present a process for obtaining the…
The variational quantum eigensolver (VQE) is an attracting possible application of near-term quantum computers. Originally, the aim of the VQE is to find a ground state for a given specific Hamiltonian. It is achieved by minimizing the…
We propose a new method to extend the size of a quantum computation beyond the number of physical qubits available on a single device. This is accomplished by randomly inserting measure-and-prepare channels to express the output state of a…
Compared to general quantum states, the sparse states arise more frequently in the field of quantum computation. In this work, we consider the preparation for $n$-qubit sparse quantum states with $s$ non-zero amplitudes and propose two…
This study introduces a superconducting quantum chip architecture designed to simultaneously preserve entanglement and readout fidelity, addressing one of the key trade-offs in the development of scalable quantum hardware. In conventional…
Near-term quantum computers will be limited in the number of qubits on which they can process information as well as the depth of the circuits that they can coherently carry out. To-date, experimental demonstrations of algorithms such as…
Recent progress in nanoscale quantum optics and superconducting qubits has made the creation of strongly correlated, and even topologically ordered, states of photons a real possibility. Many of these states are gapped and exhibit anyon…
Quantum computing promises to revolutionize various fields, yet the execution of quantum programs necessitates an effective compilation process. This involves strategically mapping quantum circuits onto the physical qubits of a quantum…
Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel…
The Quantum State Preparation problem aims to prepare an $n$-qubit quantum state $|\psi_v\rangle =\sum_{k=0}^{2^n-1}v_k|k\rangle$ from the initial state $|0\rangle^{\otimes n}$, for a given unit vector $v=(v_0,v_1,v_2,\ldots,v_{2^n-1})^T\in…
Estimating the ground state energy of a multiparticle system with relative error $\e$ using deterministic classical algorithms has cost that grows exponentially with the number of particles. The problem depends on a number of state…
Determining the energy gap in a quantum many-body system is critical to understanding its behavior and is important in quantum chemistry and condensed matter physics. The challenge of determining the energy gap requires identifying both the…
We present a cooling algorithm for ground state preparation of fermionic Hamiltonians. Our algorithm makes use of the Hamiltonian simulation of the considered system coupled to an ancillary fridge, which is regularly reset to its known…
We consider a computational problem where the goal is to approximate the maximum eigenvalue of a two-local Hamiltonian that describes Heisenberg interactions between qubits located at the vertices of a graph. Previous work has shed light on…
We propose an efficient method for simultaneously optimizing both the structure and parameter values of quantum circuits with only a small computational overhead. Shallow circuits that use structure optimization perform significantly better…