相关论文: Encoded probabilistic imaginary-time evolution on …
We present calculations of the ground and excited state energies of spin defects in solids carried out on a quantum computer, using a hybrid classical/quantum protocol. We focus on the negatively charged nitrogen vacancy center in diamond…
Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. As a kind of it, the probabilistic ITE (PITE) takes advantage of measurements to implement the nonunitary…
A probabilistic imaginary-time evolution (PITE) method was proposed as a nonvariational method to obtain a ground state on a quantum computer. In this formalism, the success probability of obtaining all imaginary-time evolution operators…
Imaginary-time evolution, an important technique in tensor network and quantum Monte Carlo algorithms on classical computers, has recently been adapted to quantum computing. In this study, we focus on probabilistic imaginary-time evolution…
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum…
Ground-state preparation is an important task in quantum computation. The probabilistic imaginary-time evolution (PITE) method is a promising candidate for preparing the ground state of the Hamiltonian, which comprises a single ancilla…
Many computationally hard problems can be encoded in quantum Hamiltonians. The solution to these problems is given by the ground states of these Hamiltonians. A state-of-the-art algorithm for finding the ground state of a Hamiltonian is the…
We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution, using mid-circuit measurements on a single ancilla qubit. Imaginary time evolution (ITE) is widely used for…
We develop a resource efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along…
Topology and symmetry play critical roles in characterizing quantum phases of matter. Recent advancements have unveiled symmetry-protected topological (SPT) phases in many-body systems as a unique class of short-range entangled states,…
Quantum imaginary time evolution (QITE) is one of the promising candidates for finding eigenvalues and eigenstates of a Hamiltonian. However, the original QITE proposal [Nat. Phys. 16, 205-210 (2020)], which approximates the imaginary time…
Quantum Imaginary-Time Evolution (QITE) is a powerful method for preparing ground states on quantum hardware. However, executing QITE has costly measurement budgets for general Hamiltonians. Both fidelity and computational cost are strongly…
As a valid tool for solving ground state problems, imaginary time evolution (ITE) is widely used in physical and chemical simulations. Different ITE-based algorithms in their quantum counterpart have recently been proposed and applied to…
Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. One approach for preparing such a…
Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of system. In this study, we present several improvements on QITE, mainly focusing on molecular…
The realization of effective quantum error correction protocols remains a central challenge in the development of scalable quantum computers. Employing high-dimensional quantum systems (qudits) can offer more hardware-efficient protocols…
The construction of a quantum computer remains a fundamental scientific and technological challenge, in particular due to unavoidable noise. Quantum states and operations can be protected from errors using protocols for fault-tolerant…
The stable operation of quantum computers will rely on error-correction, in which single quantum bits of information are stored redundantly in the Hilbert space of a larger system. Such encoded qubits are commonly based on arrays of many…
There is increasing interest in quantum algorithms that are based on the imaginary-time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy post-processing…
A successful quantum error correction protocol would allow quantum computers to run algorithms without suffering from the effects of noise. However, fully fault-tolerant quantum error correction is too resource intensive for existing…