As a wide variety of quantum computing platforms become available, methods for assessing and comparing the performance of these devices are of increasing interest and importance. Inspired by the success of single-qubit error rate computations for tracking the progress of gate-based quantum computers, this work proposes a Quantum Annealing Single-qubit Assessment (QASA) protocol for quantifying the performance of individual qubits in quantum annealing computers. The proposed protocol scales to large quantum annealers with thousands of qubits and provides unique insights into the distribution of qubit properties within a particular hardware device. The efficacy of the QASA protocol is demonstrated by analyzing the properties of a D-Wave 2000Q system, revealing unanticipated correlations in the qubit performance of that device. A study repeating the QASA protocol at different annealing times highlights how the method can be utilized to understand the impact of annealing parameters on qubit performance. Overall, the proposed QASA protocol provides a useful tool for assessing the performance of current and emerging quantum annealing devices.
Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k$-SAT problems. This paper compares simulated annealing, simulated quantum annealing and walkSAT, an open-source SAT solver, in terms of their ability to find such solutions. The results indicate that solutions found by simulated quantum annealing are generally less disparate than solutions found by the other solvers and therefore less useful for th…
The computational complexity conjecture of NP $\nsubseteq$ BQP implies that there should be an exponentially small energy gap for Quantum Annealing (QA) of NP-hard problems. We aim to verify how this computation originated gapless point could be understood based on physics, using the quantum Monte Carlo method. As a result, we found a phase transition detectable only by the divergence of fidelity susceptibility. The exponentially small gapless points of each instance are all located in the phase found in this study, which suggests that this phase transition is the physical cause of the failure…
Scaling the number of qubits while maintaining high-fidelity quantum gates remains a key challenge for quantum computing. Presently, superconducting quantum processors with >50-qubits are actively available. For such systems, fixed-frequency transmons are attractive due to their long coherence and noise immunity. However, scaling fixed-frequency architectures proves challenging due to precise relative frequency requirements. Here we employ laser annealing to selectively tune transmon qubits into desired frequency patterns. Statistics over hundreds of annealed qubits demonstrate an empirical tu…
The study of optimal control of quantum annealing by modulating the pace of evolution and by introducing a counterdiabatic potential has gained significant attention in recent times. In this work, we present a numerical approach based on genetic algorithms to improve the performance of quantum annealing, which evades the Landau-Zener transitions to navigate to the ground state of the final Hamiltonian with high probability. We optimize the annealing schedules starting from polynomial ansatz by treating their coefficients as chromosomes of the genetic algorithm. We also explore shortcuts to adi…
We present Counterdiabatic Reverse Annealing, a novel quantum annealing protocol that extends the range of application of reverse annealing to the previously inaccessible short-time domain. This is achieved by exploiting approximate counterdiabatic driving expanded in low-order nested commutators. In this work, we offer a comparative study of the performance of this new technique to that of unassisted reverse annealing in terms of metrics such as the ground-state fidelity and the time to solution. We provide a quantitative measure of the energetic cost of counterdiabatic reverse annealing and …
Graduate School of Information Sciences, Tohoku University（东北大学信息科学研究科）；Institute for Innovative Research, Tokyo Institute of Technology（东京工业大学创新研究所）；Sigma-i Co., Ltd.（Sigma-i 有限公司）
Quantum annealing was originally proposed as an approach for solving combinatorial optimisation problems using quantum effects. D-Wave Systems has released a production model of quantum annealing hardware. However, the inherent noise and various environmental factors in the hardware hamper the determination of optimal solutions. In addition, the freezing effect in regions with weak quantum fluctuations generates outputs approximately following a Gibbs--Boltzmann distribution at an extremely low temperature. Thus, a quantum annealer may also serve as a fast sampler for the Ising spin-glass prob…
We have done simulating of factorization the number 15 on three qutrits, represented by the spins S = 1, by quantum annealing. We assume that strong one-spin interaction allow selectively operate on different transitions between levels of the each qutrit. We present a sequence of selective rotation operators to engineer from dipole-dipole interaction a time-dependent effective Hamiltonian necessary for solving the problem. Also we find dependence of fidelity versus different parameters: magnetic field, total annealing time, and duration of time step, when the continuous variation of the Hamilt…
The accurate implementation of quantum gates is essential for the realisation of quantum algorithms and digital quantum simulations. This accuracy may be increased on noisy hardware through the variational optimisation of gates, however the experimental realisation of such a protocol is impeded by the large effort required to estimate the fidelity of an implemented gate. With a hierarchy of approximations we find a faithful approximation to the quantum process fidelity that can be estimated experimentally with reduced effort. Its practical use is demonstrated with the optimisation of a three-q…
The annealing schedule is optimized for a parameter in the Lechner-Hauke-Zoller (LHZ) scheme for quantum annealing designed for the all-to-all-interacting Ising model representing generic combinatorial optimization problems. We adapt the variational approach proposed by Matsuura et al. (arXiv:2003.09913) to the annealing schedule of a term representing a constraint for variables intrinsic to the LHZ scheme with the annealing schedule of other terms kept intact. Numerical results for a simple ferromagnetic model and the spin-glass problem show that nonmonotonic annealing schedules optimize the …
We performed a banged-digital-analog simulation of a quantum annealing protocol in a two-qubit Nuclear Magnetic Resonance (NMR) quantum computer. Our experimental simulation employed up to 235 Trotter steps, with more than 2000 gates (pulses), and we obtained a protocol success above 80%. Given the exquisite control of the NMR quantum computer, we performed the simulation with different noise levels. We thus analyzed the reliability of the quantum annealing process, and related it to the level of entanglement produced during the protocol. Although the presence of entanglement is not a sufficie…
Preparing ground states of Hamiltonians is important in the condensed matter physics and the quantum chemistry. The interaction Hamiltonians typically contain not only diagonal but also off-diagonal elements. Although quantum annealing provides a way to prepare a ground state of a Hamiltonian, we can only use the Hamiltonian with Ising interaction by using currently available commercial quantum annealing devices. In this work, we propose a quantum annealing for the XXZ model, which contains both Ising interaction and energy-exchange interaction, by using inductively coupled superconducting flu…
Finding the exact counterdiabatic potential is, in principle, particularly demanding. Following recent progresses about variational strategies to approximate the counterdiabatic operator, in this paper we apply this technique to the quantum annealing of the $p$-spin model. In particular, for $ p = 3 $ we find a new form of the counterdiabatic potential originating from a cyclic ansatz, that allows us to have optimal fidelity even for extremely short dynamics, independently of the size of the system. We compare our results with a nested commutator ansatz, recently proposed in P. W. Claeys, M. P…
We investigate the quantum computing paradigm consisted of obtaining a target state that encodes the solution of a certain computational task by evolving the system with a combination of the problem-Hamiltonian and the driving-Hamiltonian. We analyze this paradigm in the light of Optimal Control Theory considering each Hamiltonian modulated by an independent control function. In the case of short evolution times and bounded controls, we analytically demonstrate that an optimal solution consists of both controls tuned at their upper bound for the whole evolution time. This optimal solution is a…
The observation of an unequivocal quantum speedup remains an elusive objective for quantum computing. The D-Wave quantum annealing processors have been at the forefront of experimental attempts to address this goal, given their relatively large numbers of qubits and programmability. A complete determination of the optimal time-to-solution (TTS) using these processors has not been possible to date, preventing definitive conclusions about the presence of a scaling advantage. The main technical obstacle has been the inability to verify an optimal annealing time within the available range. Here we…
Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems' most recent Advantage Performance Update computer, which can n…
We introduce a two-parameter approximate counter-diabatic term into the Hamiltonian of the transverse-field Ising model for quantum annealing to accelerate convergence to the solution, generalizing an existing single-parameter approach. The protocol is equivalent to unconventional diabatic control of the longitudinal and transverse fields in the transverse-field Ising model and thus makes it more feasible for experimental realization than an introduction of new terms such as non-stoquastic catalysts toward the same goal of performance enhancement. We test the idea for the $p$-spin model with $…
Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a key challenge in QA. The choice of the drive Hamiltonian is known to affect the performance of QA because of the possible suppression of non-adiabatic transitions. Here, we propose the use of a drive Hamiltonian that preserves the symmetry of the problem Hamiltonian for more efficient QA. Owing to our choice of the drive Hamiltonian, the solution is searche…
We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with…
Quality assessment of quantum teleportation through the distribution of fidelity
Universidad de Valladolid（巴利亚多利德大学）；CONICET-Universidad de Buenos Aires, Instituto de Ciencias de la Computación (ICC)（阿根廷国家科学研究委员会-布宜诺斯艾利斯大学，计算科学研究所）；Jagiellonian University（雅盖隆大学）；Center for Theoretical Physics, Polish Academy of Sciences（波兰科学院理论物理中心）
With progress in quantum technology more sophisticated quantum annealing devices are becoming available. While they offer new possibilities for solving optimization problems, their true potential is still an open question. As the optimal design of adiabatic algorithms plays an important role in their assessment, we illustrate the aspects and challenges to consider when implementing optimization problems on quantum annealing hardware based on the example of the traveling salesman problem (TSP). We demonstrate that tunneling between local minima can be exponentially suppressed if the quantum dyn…
Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems
Graduate School of Science and Technology, Keio University（庆应义塾大学理工学研究科）；Dept. of Appl. Phys. and Physico-Informatics, Graduate School of Science and Technology, KSQAIC, WPI-Bio2Q, Keio University（庆应义塾大学理工学研究科应用物理与物理信息系）
As the number of qubits available on noisy quantum computers grows, it will become necessary to efficiently select a subset of physical qubits to use in a quantum computation. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while r…
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitable quantum many body Hamiltonian encoding the solution in its ground state. To find the solution one typically evolves the ground state of a soluble initial Hamiltonian adiabatically to the ground state of the designated final Hamiltonian. Here we explore whether and when a full quantum representation of the dynamics leads to higher probability to end up in the desired ground when compared to a classical mean field approximation. As simple, nontrivial example we target the ground state of interac…
An Annealing-based Quantum Neural Network with Discrete Wavelet Transforms for Enhanced Air Pollution Nowcasting
SENAI CIMATEC University（SENAI CIMATEC大学）；QuIIN - Quantum Industrial Innovation, SENAI CIMATEC University（量子工业创新中心（QuIIN），SENAI CIMATEC大学）；Latin-American Quantum Computing Center, SENAI CIMATEC University（拉丁美洲量子计算中心，SENAI CIMATEC大学）；Dynex, QEnterprises AG（Dynex公司，QEnterprises股份公司）；Surrey Institute for People-Centered Artificial Intelligence, Faculty of Engineering and Physical Sciences, University of Surrey（萨里大学工程与物理科学学院人类中心人工智能研究所）；Global Centre for Clean Research (GCARE), School of Sustainability, Civil and Environmental Engineering and Physical Sciences, University of Surrey（萨里大学可持续发展、土木与环境工程及物理科学学院全球清洁研究中心（GCARE））；Institute for Sustainability, University of Surrey（萨里大学可持续发展研究所）
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time-scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which c…
Properly designed control has been shown to be particularly advantageous for improving AQC accuracy and time complexity scaling. Here, an \emph{in situ} quantum control optimization protocol is developed to indirectly optimize state fidelity without knowledge of the instantaneous spectral gap or the computational solution. The protocol is shown to converge to analytically-derived time-optimal controls for Grover's search algorithm. Furthermore, the protocol is utilized to explore optimized control trajectories for the Maximum 2-bit Satisifiability (MAX 2-SAT) problem, where appreciable improve…
The creation of specified quantum states is important for most, if not all, applications in quantum computation and communication. The quality of the state preparation is therefore an essential ingredient in any assessment of a quantum-state gun. We show that the fidelity, under the standard definitions is not sufficient to assess quantum sources, and we propose a new measure of suitability that necessarily depends on the application for the source. We consider the performance of single-photon guns in the context of quantum key distribution (QKD) and linear optical quantum computation. Single-…
Adiabatic evolution is a common strategy for manipulating quantum states and has been employed in diverse fields such as quantum simulation, computation and annealing. However, adiabatic evolution is inherently slow and therefore susceptible to decoherence. Existing methods for speeding up adiabatic evolution require complex many-body operators or are difficult to construct for multi-level systems. Using the tools of Floquet engineering, we design a scheme for high-fidelity quantum state manipulation, utilizing only the interactions available in the original Hamiltonian. We apply this approach…
Counter-diabatic driving protocols were proposed as a means to do fast changes in the Hamiltonian without exciting transitions. Such driving in principle allows one to realize arbitrarily fast annealing protocols or implement fast dissipationless driving, circumventing standard adiabatic limitations requiring infinitesimally slow rates. These ideas were tested and used both experimentally and theoretically in small systems, but in larger chaotic systems it is known that exact counter-diabatic protocols do not exist. In this work we develop a simple variational approach allowing one to find bes…
This paper has been wthdrawn by the authors due to a critical error in the assessment of the entanglement and, consequently, of the protocol fidelity, when no postselection is performed.
We develop a protocol for continuous operation of a quantum error correcting code for protection of coherent evolution due to an encoded Hamiltonian against environmental errors, using the three qubit bit flip code and bit flip errors as a canonical example. To detect errors in real time, we filter the output signals from continuous measurement of the error syndrome operators and use a double thresholding protocol for error diagnosis, while correction of errors is done as in the conventional operation. We optimize our continuous operation protocol for evolution under quantum memory and under q…
Quantum computing is an important developing technology with the potential to revolutionise the landscape of scientific and business problems that can be practically addressed. The widespread excitement derives from the potential for a fault tolerant quantum computer to solve previously intractable problems. Such a machine is not expected to be available until 2030 at least. Thus we are currently in the so-called NISQ era where more heuristic quantum approaches are being applied to early versions of quantum hardware. In this paper we seek to provide a more accessible explanation of many of the…
We analyze in detail the proposal for a two-qubit gate for travelling single-photon qubits recently presented by C. Ottaviani \emph{et al}. [Phys. Rev. A \textbf{73}, 010301(R) (2006)]. The scheme is based on an ensemble of five-level atoms coupled to two quantum and two classical light fields. The two quantum fields undergo cross-phase modulation induced by electromagnetically induced transparency. The performance of this two-qubit quantum phase gate for travelling single-photon qubits is thoroughly examined in the steady-state and transient regimes, by means of a full quantum treatment of th…
