相关论文: Efficient characterization of general Gottesman-Ki…
We consider hybrid qubit-oscillator systems together with Gaussian, multi-qubit as well as qubit-controlled Gaussian unitaries. We propose implementations of logical gates for approximate Gottesman-Kitaev-Preskill codes in this model using…
The development of a continuous-variable photonic quantum computer depends on the reliable preparation of high-quality Gottesman-Kitaev-Preskill states. The most promising GKP preparation scheme is the cat breeding protocol, which can…
The deterministic preparation of quantum many-body ground states is essential for advanced quantum simulation, yet optimal algorithms often require prohibitive hardware resources. Here, we propose a highly efficient, non-variational…
Long distance quantum communication will require the use of quantum repeaters to overcome the exponential attenuation of signal with distance. One class of such repeaters utilizes quantum error correction to overcome losses in the…
Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm…
Quantum Computing allows, in principle, the encoding of the exponentially scaling many-electron wave function onto a linearly scaling qubit register, offering a promising solution to overcome the limitations of traditional quantum chemistry…
While numerical simulations are presented in most papers introducing new methods to enhance the VQE performance, comprehensive, comparative, and applied studies remain relatively rare. We present a comprehensive, yet concise guide for the…
A class of pseudo-hermitian quantum system with an explicit form of the positive-definite metric in the Hilbert space is presented. The general method involves a realization of the basic canonical commutation relations defining the quantum…
We propose a quantum optical device to experimentally realize quantum processes, which perform the regularization of the---in general highly singular---Glauber-Sudarshan $P$~functions of arbitrary quantum states before their application…
Accurately determining ground-state properties of quantum many-body systems remains one of the major challenges of quantum simulation. In this work, we present a protocol for estimating the ground-state energy using only global time…
Preparing thermal and ground states is an essential quantum algorithmic task for quantum simulation. In this work, we construct the first efficiently implementable and exactly detailed-balanced Lindbladian for Gibbs states of arbitrary…
We describe a protocol for preparing the ground state of a Hamiltonian $H$ on a quantum computer. This is done by designing a quantum algorithm that implements the imaginary time evolution operator: $e^{-\tau H}$. The method relies on the…
As a measure of the 'closeness' of two quantum states, fidelity plays a fundamental role in quantum information theory. Fidelity estimation protocols try to strike a balance between information gleaned from an experiment, and the efficiency…
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…
Quantum computation with light, compared with other platforms, offers the unique benefit of natural high-speed operations at room temperature and large clock rate, but a big obstacle of photonics is the lack of strong nonlinearities which…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited…
Continuous-variable measurement-based quantum computation, which requires deterministically generated large-scale cluster state, is a promising candidate for practical, scalable, universal, and fault-tolerant quantum computation. In this…
The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it…
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…