A scalable control system for a superconducting adiabatic quantum optimization processor
M. W. Johnson, P. Bunyk, F. Maibaum, E. Tolkacheva, A. J. Berkley, E. M. Chapple, R. Harris, J. Johansson, T. Lanting, I. Perminov, E. Ladizinsky, T. Oh, G. Rose
We have designed, fabricated and operated a scalable system for applying independently programmable time-independent, and limited time-dependent flux biases to control superconducting devices in an integrated circuit. Here we report on the operation of a system designed to supply 64 flux biases to devices in a circuit designed to be a unit cell for a superconducting adiabatic quantum optimization system. The system requires six digital address lines, two power lines, and a handful of global analog lines.
Realizing leakage elimination operator-based adiabatic speedup on a superconducting quantum processor
College of Physics and Optoelectronic Engineering, Ocean University of China（中国海洋大学物理与光电工程学院）；China Mobile (Suzhou) Software Technology Co., Ltd（中国移动（苏州）软件技术有限公司）；School of Sciences, Qingdao University of Technology（青岛理工大学理学院）
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the factors of a given composite number. The main challenge in scaling it to larger numbers is the unavailability of large number of qubits. Here we propose a hybrid scheme that involves both classical and quantum computation, which reduces the number of qubits required for factorization. The classical part involves setting up and partially simplifying a set of bit-wi…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required output state. In some cases, such as the adiabatic versions of Grover's search algorithm and Deutsch-Jozsa algorithm, applying the global adiabatic evolution yields a complexity similar to their classical algorithms. However, using the local adiabatic evolution, the algorithms given by J. Roland and N. J. Cerf for Grover's search [ Phys. Rev. A. {\bf 65} 0423…
Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard Ising spin glass instance class with up to 128 binary variables. Using parameters obtained from a realistic superconducting adiabatic quantum processor, we extract the minimum gap and matrix elements using high performance Quantum Monte Carlo simulations on a large-scale Internet-based computing platform. We compare the median adiabatic times with the media…
We propose a realization of a scalable, high-performance quantum processor whose qubits are represented by the ground and subradiant states of effective dimers formed by pairs of two-level systems coupled by resonant dipole-dipole interaction. The dimers are implanted in low-temperature solid host material at controllable nanoscale separations. The two-qubit entanglement either relies on the coherent excitation exchange between the dimers or is mediated by external laser fields.
Existing protocols for benchmarking current quantum co-processors fail to meet the usual standards for assessing the performance of High-Performance-Computing platforms. After a synthetic review of these protocols -- whether at the gate, circuit or application level -- we introduce a new benchmark, dubbed Atos Q-score (TM), that is application-centric, hardware-agnostic and scalable to quantum advantage processor sizes and beyond. The Q-score measures the maximum number of qubits that can be used effectively to solve the MaxCut combinatorial optimization problem with the Quantum Approximate Op…
We present experimental results on the measurement of fidelity decay under contrasting system dynamics using a nuclear magnetic resonance quantum information processor. The measurements were performed by implementing a scalable circuit in the model of deterministic quantum computation with only one quantum bit. The results show measurable differences between regular and complex behaviour and for complex dynamics are faithful to the expected theoretical decay rate. Moreover, we illustrate how the experimental method can be seen as an efficient way for either extracting coarse-grained informatio…
The realization of a scalable quantum information processor has emerged over the past decade as one of the central challenges at the interface of fundamental science and engineering. Much progress has been made towards this goal. Indeed, quantum operations have been demonstrated on several trapped ion qubits, and other solid-state systems are approaching similar levels of control. Extending these techniques to achieve fault-tolerant operations in larger systems with more qubits remains an extremely challenging goal, in part, due to the substantial technical complexity of current implementation…
A simple scheme is presented for realizing robust optically controlled quantum gates for scalable atomic quantum processors by driving the qubits with optical standing waves. Atoms localized close to the antinodes of the standing wave can realize phase-controlled quantum operations that are potentially more than an order of magnitude less sensitive to the local optical phase and atomic motion than corresponding travelling wave configurations. The scheme is compatible with robust optimal control techniques and spatial qubit addressing in atomic arrays to realize phase controlled operations with…
The article is addressing a possibility of implementation of spin network states on adiabatic quantum computer. The discussion is focused on application of currently available technologies and analyzes a concrete example of D-Wave machine. A class of simple spin network states which can be implemented on the Chimera graph architecture of the D-Wave quantum processor is introduced. However, extension beyond the currently available quantum processor topologies is required to simulate more sophisticated spin network states, which may inspire development of new generations of adiabatic quantum com…
We present a control and measurement setup for superconducting qubits based on Xilinx 16-channel radio-frequency system-on-chip (RFSoC) device. The proposed setup consists of four parts: multiple RFSoC boards, a setup to synchronise every digital to analog converter (DAC), and analog to digital converter (ADC) channel across multiple boards, a low-noise direct current (DC) supply for tuning the qubit frequency and cloud access for remotely performing experiments. We also design the setup to be free of physical mixers. The RFSoC boards directly generate microwave pulses using sixteen DAC channe…
Measurement fidelity matrices (MFMs) (also called error kernels) are a natural way to characterize state preparation and measurement errors in near-term quantum hardware. They can be employed in post processing to mitigate errors and substantially increase the effective accuracy of quantum hardware. However, the feasibility of using MFMs is currently limited as the experimental cost of determining the MFM for a device grows exponentially with the number of qubits. In this work we present a scalable way to construct approximate MFMs for many-qubit devices based on cumulant expansion. Our method…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. By far, there is no experimental realization of adiabatic quantum computation on a single solid spin system under ambient conditions, which has been proved to be a compatible candidate for scalable quantum computation. In this letter, we report on the first experimental realization of an adiab…
A quantum processor to import, process, and export optical quantum states is a common core technology enabling various photonic quantum information processing. However, there has been no photonic processor which is simultaneously universal, scalable, and programmable. Here, we report on an original loop-based single-mode versatile photonic quantum processor which is designed to be universal, scalable, and programmable. Our processor can perform arbitrarily many steps of programmable quantum operations on a given single-mode optical quantum state by time-domain processing in a dynamically contr…
We present a comprehensive review of past research into adiabatic quantum computation and then propose a scalable architecture for an adiabatic quantum computer that can treat NP-hard problems without requiring local coherent operations. Instead, computation can be performed entirely by adiabatically varying a magnetic field applied to all the qubits simultaneously. Local (incoherent) operations are needed only for: (1) switching on or off certain pairwise, nearest-neighbor inductive couplings in order to set the problem to be solved and (2) measuring some subset of the qubits in order to obta…
A scalable superconducting architecture for adiabatic quantum computers is proposed. The architecture is based on time-independent, nearest-neighbor interqubit couplings: it can handle any problem in the class NP even in the presence of measurement errors, noise, and decoherence. The implementation of this architecture with superconducting persistent-current qubits and the natural robustness of such an implementation to manufacturing imprecision and decoherence are discussed.
The technological development of hardware heading toward universal fault-tolerant quantum computation requires a large-scale processing unit with high performance. While fluxonium qubits are promising with high coherence and large anharmonicity, their scalability has not been systematically explored. In this work, we propose a superconducting quantum information processor based on compact high-coherence fluxoniums with suppressed crosstalk, reduced design complexity, improved operational efficiency, high-fidelity gates, and resistance to parameter fluctuations. In this architecture, the qubits…
Adiabatic quantum computing is a promising route to the computational power afforded by quantum information processing. The recent availability of adiabatic hardware has raised challenging questions about how to evaluate adiabatic quantum optimization programs. Processor behavior depends on multiple steps to synthesize an adiabatic quantum program, which are each highly tunable. We present an integrated programming and development environment for adiabatic quantum optimization called JADE that provides control over all the steps taken during program synthesis. JADE captures the workflow needed…
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in an NMR quantum information processor and experimentally factorize the number 21. Numerical simulations indicate that the running time grows only quadratically with the number of qubits.
In this paper we examine the use of an adiabatic quantum data transfer protocol to build a universal quantum computer. Single qubit gates are realized by using a bus protocol to transfer qubits of information down a spin chain with a unitary twist. This twist arises from altered couplings on the chain corresponding to unitary rotations performed on one region of the chain. We show how a controlled NOT gate can be realized by using a control qubit with Ising type coupling. The method discussed here can be extended to non-adiabatic quantum bus protocols. We also examine the potential of realizin…
In this work, we introduce a new family of [[6k, 2k, 2]] codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight-two logical operators and are particularly well-suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increase the graph degree by only two. These codes are the first known to possess these features.
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy intermediate-scale quantum (NISQ) computing, systematic miscalibrations, drift, and crosstalk in the control of qubits can lead to a coherent form of error which has no classical analog. Coherent errors severely limit the performance of quantum algorithms in an unpredictable manner, and mitigating their impact is necessary for realizing reliable quantum computations. Moreover, the average error rates measured by randomi…
We consider the effects of decoherence on Landau-Zener crossings encountered in a large-scale adiabatic-quantum-computing setup. We analyze the dependence of the success probability, i.e. the probability for the system to end up in its new ground state, on the noise amplitude and correlation time. We determine the optimal sweep rate that is required to maximize the success probability. We then discuss the scaling of decoherence effects with increasing system size. We find that those effects can be important for large systems, even if they are small for each of the small building blocks.
Quantum processing unit (QPU) has to satisfy highly demanding quantity and quality requirements on its qubits to produce accurate results for problems at useful scales. Furthermore, classical simulations of quantum circuits generally do not scale. Instead, quantum circuit cutting techniques cut and distribute a large quantum circuit into multiple smaller subcircuits feasible for less powerful QPUs. However, the classical post-processing incurred from the cutting introduces runtime and memory bottlenecks. Our tool, called ScaleQC, addresses the bottlenecks by developing novel algorithmic techni…
Experimental demonstration of scalable cross-entropy benchmarking to detect measurement-induced phase transitions on a superconducting quantum processor
Cryogenic Time-Division-Multiplexed Voltage Control for Scalable Trapped-Ion Quantum Processors
QuEL, Inc.（QuEL公司）；Center for Quantum Information and Quantum Biology, The University of Osaka（大阪大学量子信息与量子生物学中心）；International Center for Elementary Particle Physics (ICEPP), The University of Tokyo（东京大学 elementary 粒子物理国际中心）；Komaba Institute for Science (KIS), The University of Tokyo（东京大学驹场理学研究所）；e-trees. Japan, Inc.（e-trees日本公司）；RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）；Inamori Research Institute for Science (InaRIS)（稻盛科学研究所）
We report a quantum-classical hybrid scheme for factorization of bi-prime numbers (which are odd and square-free) using IBM's quantum processors. The hybrid scheme proposed here involves both classical optimization techniques and adiabatic quantum optimization techniques, and is build by extending a previous scheme of hybrid factorization [Pal et al., Pramana 92, 26 (2019) and Xu et al., Phys. Rev. Lett. 108, 130501 (2012)]. The quantum part of the scheme is very general in the sense that it can be implemented using any quantum computing architecture. Here, as an example, we experimentally imp…
Scalable suppression of heating errors in large trapped-ion quantum processors
Center on Frontiers of Computing Studies, School of Computer Science, Peking University（北京大学计算机学院前沿计算研究中心）；Key Laboratory of Atomic and Subatomic Structure and Quantum Control (Ministry of Education), Guangdong Basic Research Center of Excellence for Structure and Fundamental Interactions of Matter, School of Physics, South China Normal University（华南师范大学物理学院原子与亚原子结构及量子控制教育部重点实验室、广东省物质结构与基本相互作用卓越基础研究基地）；Guangdong Provincial Key Laboratory of Quantum Engineering and Quantum Materials, Guangdong-Hong Kong Joint Laboratory of Quantum Matter, Frontier Research Institute for Physics, South China Normal University（华南师范大学前沿物理研究院广东量子工程与量子材料重点实验室、粤港澳量子物质联合实验室）
Remote Adiabatic Controlled-Z Gate between Distant Superconducting Qubits
Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）；Institute of Physics, Chinese Academy of Sciences（中国科学院物理研究所）；University of Chinese Academy of Sciences（中国科学院大学）；Hefei National Laboratory（合肥国家实验室）
Quantum algorithms could be much faster than classical ones in solving the factoring problem. Adiabatic quantum computation for this is an alternative approach other than Shor's algorithm. Here we report an improved adiabatic factoring algorithm and its experimental realization to factor the number 143 on a liquid crystal NMR quantum processor with dipole-dipole couplings. We believe this to be the largest number factored in quantum-computation realizations, which shows the practical importance of adiabatic quantum algorithms.
We consider a quantum processor based on five qutrits represented by spins S=1, which is driven by radio fre-quency (RF) pulses selective in transitions between adjacent levels. Numerical simulation of the implementation of the quantum-adiabatic clustering algorithm was performed on the example of partitioning a set of six points into three groups. We find the amplitudes and durations of rectangular RF pulses, as well as the durations of free evolu-tion intervals in the control pulse sequence, which made it possible to engineer a time-dependent effective Hamilto-nian in the discrete-time appro…
