相关论文: Improving the Accuracy of an Adiabatic Quantum Com…
The promise of quantum computing to open new unexplored possibilities in several scientific fields has been long discussed, but until recently the lack of a functional quantum computer has confined this discussion mostly to theoretical…
Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-called Chimera graphs. Ising models are equivalent to quadratic…
In order to model and evaluate large-scale quantum systems, e.g. quantum computer and quantum annealer, it is necessary to quantify the ``quantumness" of such systems. In this paper, we discuss the dimensionless combinations of basic…
Noise poses a fundamental challenge to quantum information processing, with amplitude-damping (AD) noise being particularly detrimental. Preserving high-fidelity quantum systems therefore relies critically on effective error correction and…
To improve the efficiency of the state tomography strategy via weak value, we have searched the optimal coupling strength between the system and measuring device. For an arbitrary d-dimensional quantum system, the optimal strengths being…
Most investigations devoted to the conditions for adiabatic quantum computing are based on the first-order correction ${\bra{\Psi_{\rm ground}(t)}\dot H(t)\ket{\Psi_{\rm excited}(t)} /\Delta E^2(t)\ll1}$. However, it is demonstrated that…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
Two-stage stochastic programming is a problem formulation for decision-making under uncertainty. In the first stage, the actor makes a best "here and now" decision in the presence of uncertain quantities that will be resolved in the future,…
We report the Atos Q-score for D-Wave's quantum devices, classical algorithms and hybrid quantum-classical solver. Computing the Q-score entails solving the Max-Cut problem for increasingly large graphs. This work presents the first…
To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer,…
Near term quantum hardware promises unprecedented computational advantage. Crucial in its development is the characterization and minimization of computational errors. We propose the use of the quantum fluctuation theorem to benchmark the…
This study addresses the minor-embedding problem, which involves mapping the variables of an Ising model onto a quantum annealing processor. The primary motivation stems from the observed performance disparity of quantum annealers when…
We explore the usefulness of mid-circuit measurements to enhance quantum algorithmics. Specifically, we assess how quantum phase estimation (QPE) and mid-circuit measurements can improve the performance of variational quantum algorithms.…
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a…
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…
Quantum amplitude amplification algorithm is an important and basic technique in quantum computing. In this paper, our goal is to study distributed quantum amplitude amplification algorithms, and the main contributions are: (1) A…
Quantum error correction plays an important role in fault-tolerant quantum information processing. It is usually difficult to experimentally realize quantum error correction, as it requires multiple qubits and quantum gates with high…