Testing measurement-based computational phases of quantum matter on a quantum processor
University of Chicago（芝加哥大学）；Pritzker School of Molecular Engineering, University of Chicago（普林茨克分子工程学院，芝加哥大学）；University of British Columbia（不列颠哥伦比亚大学）；Stewart Blusson Quantum Matter Institute, University of British Columbia（斯图尔特·布拉斯量子物质研究所，不列颠哥伦比亚大学）
Ryohei Weil, Dmytro Bondarenko, Arnab Adhikary, Robert Raussendorf
Many symmetry protected or symmetry enriched phases of quantum matter have the property that every ground state in a given such phase endows measurement based quantum computation with the same computational power. Such phases are called computational phases of quantum matter. Here, we experimentally verify four theoretical predictions for them on an IBM superconducting quantum device. We comprehensively investigate how symmetric imperfections of the resource states translate into logical decoherence, and how this decoherence is mitigated. In particular, the central experiment probes the scaling law from which the uniformity of computational power follows. We also analyze the correlated regime, where local measurements give rise to logical operations collectively. We test the prediction that densest packing of a measurement-based algorithms remains the most efficient, in spite of the correlations. Our experiments corroborate the operational stability of measurement based quantum computation in quantum phases of matter with symmetry.
IBM Quantum offers free remote access to real quantum processors. One of the many experiments now accessible to all students is a test of Bell inequalities. This experiment introduces the rigorous mysteries that physicists have grappled with for a century. Using IBM Quantum to test Bell inequalities is not new. However, we are unaware of any single reference, appropriate for introductory students, that contains (1) the derivation of a Bell inequality, (2) the derivation of the corresponding quantum prediction, and (3) instructions for carrying out the experiment with IBM Quantum.
We propose quantum circuits to test interferometric complementarity using symmetric two-way interferometers coupled to a which-path detector. First, we consider the two-qubit setup in which the controlled transfer of path information to the detector subsystem depletes interference on the probed subspace, testing the visibility-distinguishability trade-off via minimum-error state discrimination measurements. Next, we consider the quantum eraser setup, in which reading out path information in the right basis recovers an interference pattern. These experiments are then carried out in an IBM super…
Quantum computation, a completely different paradigm of computing, benefits from theoretically proven speed-ups for certain problems and opens up the possibility of exactly studying the properties of quantum systems. Yet, because of the inherent fragile nature of the physical computing elements, qubits, achieving quantum advantages over classical computation requires extremely low error rates for qubit operations as well as a significant overhead of physical qubits, in order to realize fault-tolerance via quantum error correction. However, recent theoretical work has shown that the accuracy of…
Scaling up to a large number of qubits with high-precision control is essential in the demonstrations of quantum computational advantage to exponentially outpace the classical hardware and algorithmic improvements. Here, we develop a two-dimensional programmable superconducting quantum processor, \textit{Zuchongzhi}, which is composed of 66 functional qubits in a tunable coupling architecture. To characterize the performance of the whole system, we perform random quantum circuits sampling for benchmarking, up to a system size of 56 qubits and 20 cycles. The computational cost of the classical …
Even if Google AI's Sycamore processor is efficient for the particular task it has been designed for it fails to deliver universal computational capacity. Furthermore, even classical devices implementing transverse homoclinic orbits realize exponential speedups with respect to universal classical as well as quantum computations. Moreover, relative to the validity of quantum mechanics, there already exist quantum oracles which violate the Church-Turing thesis.
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in non-classical correlations such as entanglement or quantum discord. However, it has been recently shown that even a single pure qudit is sufficient to design an oracle-based algorithm which solves a black-box problem faster than any classical approach to the same problem. In particular, the algorithm that we consider determines whether eight permutation functions d…
In this paper is presented an abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such approach formally differs from consideration of quantum control as some external influence on a system using some set of Hamiltonians or quantum gates. The model of programmed quantum controllers discussed in present paper is based on theory of universal deterministic quantum processors (programmable gate arrays). Such quantum devices may simulate arbitrary evoluti…
Motivated by recent experiments in which specific thermal properties of complex many-body systems were successfully reproduced on a commercially available quantum annealer, we examine the extent to which quantum annealing hardware can reliably sample from the thermal state in a specific basis associated with a target quantum Hamiltonian. We address this question by studying the diagonal thermal properties of the canonical one-dimensional transverse-field Ising model on a D-Wave 2000Q quantum annealing processor. We find that the quantum processor fails to produce the correct expectation values…
We introduce the sudden variant (SNZ) of the Net Zero scheme realizing controlled-$Z$ (CZ) gates by baseband flux control of transmon frequency. SNZ CZ gates operate at the speed limit of transverse coupling between computational and non-computational states by maximizing intermediate leakage. The key advantage of SNZ is tuneup simplicity, owing to the regular structure of conditional phase and leakage as a function of two control parameters. We realize SNZ CZ gates in a multi-transmon processor, achieving $99.93\pm0.24\%$ fidelity and $0.10\pm0.02\%$ leakage. SNZ is compatible with scalable s…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits…
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Berns…
Learning Lindblad Dynamics of a Superconducting Quantum Processor
University of Copenhagen（哥本哈根大学）；Niels Bohr Institute, University of Copenhagen（尼尔斯·玻尔研究所，哥本哈根大学）；Center for the Mathematics of Quantum Theory, MATH Department, University of Copenhagen（哥本哈根大学数学系量子理论数学中心）；Chalmers University of Technology（查尔姆斯理工大学）
Improved error correction with leakage reduction units built into qubit measurement in a superconducting quantum processor
QuTech（夸特克）；Delft University of Technology（代尔夫特理工大学）；Kavli Institute of Nanoscience, Delft University of Technology（代尔夫特理工大学卡弗里纳米科学研究所）；SRON Netherlands Institute for Space Research（荷兰空间研究协会）
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains for some important computational tasks. In the context of quantum information, "universal" refers to the ability to perform arbitrary unitary transformations in the system's computational space. The combination of arbitrary single-quantum-bit (qubit) gates with an entangling two-qubit gate is a gate set capable of achieving universal control of any number of q…
We extensively test a recent protocol to demonstrate quantum fault tolerance on three systems: (1) a real-time simulation of five spin qubits coupled to an environment with two-level defects, (2) a real-time simulation of transmon quantum computers, and (3) the 16-qubit processor of the IBM Q Experience. In the simulations, the dynamics of the full system is obtained by numerically solving the time-dependent Schrödinger equation. We find that the fault-tolerant scheme provides a systematic way to improve the results when the errors are dominated by the inherent control and measurement errors p…
Quantum computers can potentially provide an unprecedented speed-up with respect to traditional computers. However, a significant increase in the number of quantum bits (qubits) and their performance is required to demonstrate such quantum supremacy. While scaling up the underlying quantum processor is extremely challenging, building the electronics required to interface such large-scale processor is just as relevant and arduous. This paper discusses the challenges in designing a scalable electronic interface for quantum processors. To that end, we discuss the requirements dictated by differen…
We propose and demonstrate scheme for direct experimental testing of quantum commutation relations for Pauli operators. The implemented device is an advanced quantum processor that involves two programmable quantum gates. Depending on a state of two-qubit program register, we can test either commutation or anti-commutation relations. Very good agreement between theory and experiment is observed, indicating high-quality performance of the implemented quantum processor and reliable verification of commutation relations for Pauli operators.
In the evaluation of quantum annealers, metrics based on ground state success rates have two major drawbacks. First, evaluation requires computation time for both quantum and classical processors that grows exponentially with problem size. This makes evaluation itself computationally prohibitive. Second, results are heavily dependent on the effects of analog noise on the quantum processors, which is an engineering issue that complicates the study of the underlying quantum annealing algorithm. We introduce a novel "time-to-target" metric which avoids these two issues by challenging software sol…
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…
Wave--particle transition and quantum Zeno effect in which-way experiments with a superconducting quantum processor
RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）；Department of Physics, University of Michigan（密歇根大学物理系）；Department of Applied Physics, Graduate School of Engineering, The University of Tokyo（东京大学工学研究科应用物理系）
Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the relationships between the noise model, encoding scheme, and threshold value. For general circuits and noise models, these simulations quickly become intractable in the size of the encoded circuit. We introduce methods for approximating a noise process by one which allows for efficient Monte Carlo simulation of properties of encoded circuits. The approximations are a…
Random quantum sampling, a task to sample bit-strings from a random quantum circuit, is considered one of suitable benchmark tasks to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum sampling was performed on the Sycamore quantum processor with 53 qubits [Nature 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare statistical properties of the outputs of random quantum sampling by Sycamore and Zuchongzhi. Using the Marchenko-Pastur law and the Wasssertein d…
Computational chemistry is the leading application to demonstrate the advantage of quantum computing in the near term. However, large-scale simulation of chemical systems on quantum computers is currently hindered due to a mismatch between the computational resource needs of the program and those available in today's technology. In this paper we argue that significant new optimizations can be discovered by co-designing the application, compiler, and hardware. We show that multiple optimization objectives can be coordinated through the key abstraction layer of Pauli strings, which are the basic…
Nonlocal Games as Cross-Platform Quantum Benchmarks: Exceeding unconditional classical bounds on trapped-ion processors
Joint Quantum Institute and Department of Physics, University of Maryland（马里兰大学联合量子研究所与物理系）；National Quantum Laboratory (QLab), University of Maryland（马里兰大学国家量子实验室（QLab））；Physical Detection Systems and Deployment Division, Pacific Northwest National Laboratory（太平洋西北国家实验室物理探测系统与部署部）；Duke Quantum Center, Department of Physics, and Department of Electrical and Computer Engineering, Duke University（杜克大学杜克量子中心、物理系及电气与计算机工程系）；Quantum Information Science Section, Oak Ridge National Laboratory（橡树岭国家实验室量子信息科学科）；Quantum Center, University of Tennessee at Chattanooga（田纳西大学查塔努加分校量子中心）
Quantum computers have the potential to outperform classical computers in a range of computational tasks, such as prime factorisation and unstructured searching. However, real-world quantum computers are subject to noise. Quantifying noise is of vital importance, since it is often the dominant factor preventing the successful realisation of advanced quantum computations. Here we propose and demonstrate an interleaved randomised benchmarking protocol for measurement-based quantum computers that can be used to estimate the fidelity of any single-qubit measurement-based gate. We tested the protoc…
It is hard to achieve a theoretical quantum advantage on NISQ devices. Besides the attempts to reduce error using error mitigation and dynamical decoupling, small quantum error correction and fault-tolerant schemes that reduce the high overhead of traditional schemes have also been proposed. According to the recent advancements in fault tolerance, it is possible to minimize the number of ancillary qubits using flags. While implementing those schemes is still impossible, it is worthwhile to bridge the gap between the NISQ era and the FTQC era. Here, we introduce a benchmarking method to test fa…
Artificial neural networks are the heart of machine learning algorithms and artificial intelligence protocols. Historically, the simplest implementation of an artificial neuron traces back to the classical Rosenblatt's `perceptron', but its long term practical applications may be hindered by the fast scaling up of computational complexity, especially relevant for the training of multilayered perceptron networks. Here we introduce a quantum information-based algorithm implementing the quantum computer version of a perceptron, which shows exponential advantage in encoding resources over alternat…
Realizing the Petz Recovery Map on an NMR Quantum Processor
Indian Institute of Science Education & Research Mohali（印度科学教育与研究所莫哈利分校）；Amrita Vishwa Vidyapeetham, Amritapuri（阿姆里塔大学阿姆里塔普里校区）；National Institute for Theoretical and Computational Sciences (NITheCS)（国家理论与计算科学研究所）；Chennai Institute of Technology（金奈理工学院）；Universität Ulm（乌尔姆大学）；Universidade Federal de Pernambuco（伯南布哥联邦大学）
Experimental construction of a symmetric three-qubit entangled state and its utility in testing the violation of a Bell inequality on an NMR quantum simulator
Quantum computers are an increasingly hopeful means for understanding large quantum many-body systems bearing high computational complexity. Such systems exhibit complex evolutions of quantum states, and are prevailing in fundamental physics, e.g., quantum gravity. Computing the transition amplitudes between different quantum states by quantum computers is one of the promising ways to solve such computational complexity problems. In this work, we apply a 10-qubit superconducting quantum processor, where the all-to-all circuit connectivity enables a many-body entangling gate that is highly effi…
JD Explore Academy（京东探索研究院）；The University of Sydney（悉尼大学）
Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages over classical methods. Nevertheless, modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large-volume data. As such, to better exert the superiority of VQAs, it is of great significance to improve their runtime efficiency. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue. Specifically, in QUDIO, a classical central server part…
Quantum Computers, one fully realized, can represent an exponential boost in computing power. However, the computational power of the current quantum computers, referred to as Noisy Internediate Scale Quantum, or NISQ, is severely limited because of environmental and intrinsic noise, as well as the very low connectivity between qubits compared to their total amount. We propose a virtual quantum processor that emulates a generic hybrid quantum machine which can serve as a logical version of quantum computing hardware. This hybrid classical quantum machine powers quantum-logical computations whi…
Future quantum computers capable of solving relevant problems will require a large number of qubits that can be operated reliably. However, the requirements of having a large qubit count and operating with high-fidelity are typically conflicting. Spins in semiconductor quantum dots show long-term promise but demonstrations so far use between one and four qubits and typically optimize the fidelity of either single- or two-qubit operations, or initialization and readout. Here we increase the number of qubits and simultaneously achieve respectable fidelities for universal operation, state prepara…
Quantifying Quantum Computational Advantage on a Processor of Ultracold Atoms
Hefei National Research Center for Physical Sciences at the Microscale and School of Physical Sciences, University of Science and Technology of China（合肥微尺度物质科学国家研究中心和中国科学技术大学物理科学学院）
More computational resources (i.e., more physical qubits and qubit connections) on a superconducting quantum processor not only improve the performance but also result in more complex chip architecture with lower yield rate. Optimizing both of them simultaneously is a difficult problem due to their intrinsic trade-off. Inspired by the application-specific design principle, this paper proposes an automatic design flow to generate simplified superconducting quantum processor architecture with negligible performance loss for different quantum programs. Our architecture-design-oriented profiling m…
Henan Key Laboratory of Quantum Information and Cryptography（河南省量子信息与密码重点实验室）；University of Science and Technology of China（中国科学技术大学）；Hefei National Research Center for Physical Sciences at the Microscale（合肥微尺度物质科学国家研究中心）；Shanghai Research Center for Quantum Science（上海量子科学研究中心）；CAS Center for Excellence in Quantum Information and Quantum Physics（中国科学院量子信息与量子科技创新研究院）；Hefei National Laboratory（合肥国家实验室）
Training a quantum machine learning model generally requires a large labeled dataset, which incurs high labeling and computational costs. To reduce such costs, a selective training strategy, called active learning (AL), chooses only a subset of the original dataset to learn while maintaining the trained model's performance. Here, we design and implement two AL-enpowered variational quantum classifiers, to investigate the potential applications and effectiveness of AL in quantum machine learning. Firstly, we build a programmable free-space photonic quantum processor, which enables the programme…
Simulating response properties of molecules is crucial for interpreting experimental spectroscopies and accelerating materials design. However, it remains a long-standing computational challenge for electronic structure methods on classical computers. While quantum computers hold the promise to solve this problem more efficiently in the long run, existing quantum algorithms requiring deep quantum circuits are infeasible for near-term noisy quantum processors. Here, we introduce a pragmatic variational quantum response (VQR) algorithm for response properties, which circumvents the need for deep…
