Related papers: A simple method for seniority-zero quantum state p…
For quantum state preparation, a non-unitary operator is typically designed to decay undesirable states contained in an initial state using ancilla qubits and a probabilistic action. Probabilistic algorithms do not accelerate the…
The efficient initialization of a quantum system is a prerequisite for quantum technological applications. Here we show that several classes of quantum states of a harmonic oscillator can be efficiently prepared by means of a…
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…
There has been an extensive development in the use of multi-partite entanglement as a resource for various quantum information processing tasks. In this paper we focus on preparing arbitrary spin eigenstates whose subset contain important…
Quantum Kernel Estimation (QKE) is a technique based on leveraging a quantum computer to estimate a kernel function that is classically difficult to calculate, which is then used by a classical computer for training a Support Vector Machine…
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…
Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the required qubits for storing the corresponding eigenvector, suppose…
An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the systematic errors in gates and…
We simulate the excited states of the Lipkin model using the recently proposed Quantum Equation of Motion (qEOM) method. The qEOM generalizes the EOM on classical computers and gives access to collective excitations based on quasi-boson…
We introduce the multistate iterative qubit coupled cluster (MS-iQCC) method, a quantum-inspired algorithm that runs efficiently on classical hardware and is designed to predict both ground and excited electronic states of molecules.…
We present a quantum-classical hybrid algorithm that simulates electronic structures of periodic systems such as ground states and quasiparticle band structures. By extending the unitary coupled cluster (UCC) theory to describe crystals in…
Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a quantum process. QPT is a major quantum information processing tool, since it especially allows one to experimentally characterize the actual behavior of…
Dynamical response functions are fundamental quantities to describe the excited-state properties in quantum many-body systems. Quantum algorithms have been proposed to evaluate these quantities by means of quantum phase estimation (QPE),…
Quantum state preparation plays an equally important role with quantum operations and measurements in quantum information processing. The previous methods of preparing initial state for bulk quantum computation all have inevitable…
Inspired by recent advances in the manipulation of superconducting circuits coupled to mechanical modes in the quantum regime, we propose a protocol for generating superpositions of orthogonally squeezed states in a quantum harmonic…
The variational quantum eigensolver (VQE) is a hybrid quantum-classical algorithm designed for current and near-term quantum devices. Despite its initial success, there is a lack of understanding involving several of its key aspects. There…
Eigenvalue estimation is a central problem for demonstrating quantum advantage, yet its implementation on digital quantum computers remains limited by circuit depth and operational overhead. We present an analog quantum phase estimation…
State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorithm. In this paper, we analyse the performance of this…
The study and prediction of chemical reactivity is one of the most important application areas of molecular quantum chemistry. Large-scale, fully error-tolerant quantum computers could provide exact or near-exact solutions to the underlying…
We propose a state-averaged orbital optimization scheme for improving the accuracy of excited states of the electronic structure Hamiltonian for use on near-term quantum computers. Instead of parameterizing the orbital rotation operator in…