Showing papers on "Qubit published in 2020"
TL;DR: An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.
Abstract: Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will likely not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational Quantum Algorithms (VQAs), which use a classical optimizer to train a parametrized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisioned for quantum computers, and they appear to the best hope for obtaining quantum advantage. Nevertheless, challenges remain including the trainability, accuracy, and efficiency of VQAs. Here we overview the field of VQAs, discuss strategies to overcome their challenges, and highlight the exciting prospects for using them to obtain quantum advantage.
842 citations
TL;DR: The superconducting qubits are leading candidates in the race to build a quantum computer capable of realizing computations beyond the reach of modern supercomputers as discussed by the authors, but their performance has not yet been evaluated.
Abstract: Superconducting qubits are leading candidates in the race to build a quantum computer capable of realizing computations beyond the reach of modern supercomputers. The superconducting qubit modality...
701 citations
TL;DR: Several quantum simulations of chemistry with up to one dozen qubits are performed, including modeling the isomerization mechanism of diazene, and error-mitigation strategies based on N-representability that dramatically improve the effective fidelity of the experiments are demonstrated.
Abstract: The simulation of fermionic systems is among the most anticipated applications of quantum computing. We performed several quantum simulations of chemistry with up to one dozen qubits, including mod...
614 citations
Posted Content•
TL;DR: This work rigorously proves a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau, and proves that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n.
Abstract: Variational Quantum Algorithms (VQAs) may be a path to quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) computers. A natural question is whether the noise on NISQ devices places any fundamental limitations on the performance of VQAs. In this work, we rigorously prove a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau (i.e., vanishing gradient). Specifically, for the local Pauli noise considered, we prove that the gradient vanishes exponentially in the number of layers $L$. This implies exponential decay in the number of qubits $n$ when $L$ scales as $\operatorname{poly}(n)$, for sufficiently large coefficients in the polynomial. These noise-induced barren plateaus (NIBPs) are conceptually different from noise-free barren plateaus, which are linked to random parameter initialization. Our result is formulated for an abstract ansatz that includes as special cases the Quantum Alternating Operator Ansatz (QAOA) and the Unitary Coupled Cluster Ansatz, among others. In the case of the QAOA, we implement numerical heuristics that confirm the NIBP phenomenon for a realistic hardware noise model.
312 citations
TL;DR: In this article, the authors review circuit QED in the context of quantum information processing and quantum optics, and discuss some of the challenges on the road towards scalable quantum computation, as well as the challenges of quantum computation.
Abstract: Since the first observation of coherent quantum behaviour in a superconducting qubit, now more than 20 years ago, there have been substantial developments in the field of superconducting quantum circuits. One such advance is the introduction of the concepts of cavity quantum electrodynamics (QED) to superconducting circuits, to yield what is now known as circuit QED. This approach realizes in a single architecture the essential requirements for quantum computation, and has already been used to run simple quantum algorithms and to operate tens of superconducting qubits simultaneously. For these reasons, circuit QED is one of the leading architectures for quantum computation. In parallel to these advances towards quantum information processing, circuit QED offers new opportunities for the exploration of the rich physics of quantum optics in novel parameter regimes in which strongly nonlinear effects are readily visible at the level of individual microwave photons. We review circuit QED in the context of quantum information processing and quantum optics, and discuss some of the challenges on the road towards scalable quantum computation. The introduction of concepts from cavity quantum electrodynamics to superconducting circuits yielded circuit quantum electrodynamics, a platform eminently suitable to quantum information processing and for the exploration of novel regimes in quantum optics.
268 citations
29 Apr 2020
TL;DR: The heart of t, a quantum software development platform produced by Cambridge Quantum Computing Ltd, is a language-agnostic optimising compiler designed to generate code for a variety of NISQ devices, which has several features designed to minimise the influence of device error.
Abstract: We present t|ket>, a quantum software development platform produced by Cambridge Quantum Computing Ltd. The heart of t|ket> is a language-agnostic optimising compiler designed to generate code for a variety of NISQ devices, which has several features designed to minimise the influence of device error. The compiler has been extensively benchmarked and outperforms most competitors in terms of circuit optimisation and qubit routing.
265 citations
TL;DR: The goal of this work is to shed light on the challenges and open problems of Quantum Internet design and introduce quantum teleportation as the key strategy for transmitting quantum information without physically transferring the particle that stores the quantum information or violating the principles of quantum mechanics.
Abstract: The Quantum Internet, a network interconnecting remote quantum devices through quantum links in synergy with classical ones, is envisioned as the final stage of the quantum revolution, opening fundamentally new communications and computing capabilities. But the Quantum Internet is governed by the laws of quantum mechanics. Phenomena with no counterpart in classical networks, such as no-cloning, quantum measurement, entanglement and quantum teleportation, impose new challenging constraints for network design. Specifically, classical network functionalities are based on the assumption that classical information can be safely read and copied. However, this assumption does not hold in the Quantum Internet. As a consequence, its design requires a major network-paradigm shift to harness the quantum mechanics specificities. The goal of this work is to shed light on the challenges and open problems of Quantum Internet design. We first introduce some basic knowledge of quantum mechanics, needed to understand the differences between a classical and a quantum network. Then, we introduce quantum teleportation as the key strategy for transmitting quantum information without physically transferring the particle that stores the quantum information or violating the principles of quantum mechanics. Finally, the key research challenges to design quantum communication networks are discussed.
260 citations
TL;DR: In this article, a fabrication process for thin films of 4H-SiC, which are compatible with industry-standard, CMOS nanofabrication, is presented, which provides a viable route towards industry-compatible, scalable colour-centre-based quantum technologies, including the monolithic generation and frequency conversion of quantum light on-chip.
Abstract: Optical quantum information processing will require highly efficient photonic circuits to connect quantum nodes on-chip and across long distances. This entails the efficient integration of optically addressable qubits into photonic circuits, as well as quantum frequency conversion to the telecommunications band. 4H-silicon carbide (4H-SiC) offers unique potential for on-chip quantum photonics, as it hosts a variety of promising colour centres and has a strong second-order optical nonlinearity. Here, we demonstrate within a single, monolithic platform the strong enhancement of emission from a colour centre and efficient optical frequency conversion. We develop a fabrication process for thin films of 4H-SiC, which are compatible with industry-standard, CMOS nanofabrication. This work provides a viable route towards industry-compatible, scalable colour-centre-based quantum technologies, including the monolithic generation and frequency conversion of quantum light on-chip. Monolithic photonics devices based on SiC are fabricated by a wafer bonding and thinning technique. The strong enhancement of single-photon emission from a colour centre and optical frequency conversion with an efficiency of 360% W−1 are demonstrated.
257 citations
TL;DR: This work indicates that a spin-based quantum computer could be operated at increased temperatures in a simple pumped 4 He system (which provides cooling power orders of magnitude higher than that of dilution refrigerators), thus potentially enabling the integration of classical control electronics with the qubit array.
Abstract: Quantum computers are expected to outperform conventional computers in several important applications, from molecular simulation to search algorithms, once they can be scaled up to large numbers—typically millions—of quantum bits (qubits)1–3. For most solid-state qubit technologies—for example, those using superconducting circuits or semiconductor spins—scaling poses a considerable challenge because every additional qubit increases the heat generated, whereas the cooling power of dilution refrigerators is severely limited at their operating temperature (less than 100 millikelvin)4–6. Here we demonstrate the operation of a scalable silicon quantum processor unit cell comprising two qubits confined to quantum dots at about 1.5 kelvin. We achieve this by isolating the quantum dots from the electron reservoir, and then initializing and reading the qubits solely via tunnelling of electrons between the two quantum dots7–9. We coherently control the qubits using electrically driven spin resonance10,11 in isotopically enriched silicon12 28Si, attaining single-qubit gate fidelities of 98.6 per cent and a coherence time of 2 microseconds during ‘hot’ operation, comparable to those of spin qubits in natural silicon at millikelvin temperatures13–16. Furthermore, we show that the unit cell can be operated at magnetic fields as low as 0.1 tesla, corresponding to a qubit control frequency of 3.5 gigahertz, where the qubit energy is well below the thermal energy. The unit cell constitutes the core building block of a full-scale silicon quantum computer and satisfies layout constraints required by error-correction architectures8,17. Our work indicates that a spin-based quantum computer could be operated at increased temperatures in a simple pumped 4He system (which provides cooling power orders of magnitude higher than that of dilution refrigerators), thus potentially enabling the integration of classical control electronics with the qubit array18,19. A scalable silicon quantum processor unit cell made of two qubits confined to quantum dots operates at about 1.5 K, achieving 98.6% single-qubit gate fidelities and a 2 μs coherence time.
241 citations
TL;DR: A cryogenic surface trap is used to integrate all necessary elements of the QCCD architecture-a scalable trap design, parallel interaction zones and fast ion transport-into a programmable trapped-ion quantum computer that has a system performance consistent with the low error rates achieved in the individual ion crystals.
Abstract: The trapped-ion QCCD (quantum charge-coupled device) architecture proposal lays out a blueprint for a universal quantum computer. The design begins with electrodes patterned on a two-dimensional surface configured to trap multiple arrays of ions (or ion crystals). Communication within the ion crystal network allows for the machine to be scaled while keeping the number of ions in each crystal to a small number, thereby preserving the low error rates demonstrated in trapped-ion experiments. By proposing to communicate quantum information by moving the ions through space to interact with other distant ions, the architecture creates a quantum computer endowed with full-connectivity. However, engineering this fully-connected computer introduces a host of difficulties that have precluded the architecture from being fully realized in the twenty years since its proposal. Using a Honeywell cryogenic surface trap, we report on the integration of all necessary ingredients of the QCCD architecture into a programmable trapped-ion quantum computer. Using four and six qubit circuits, the system level performance of the processor is quantified by the fidelity of a teleported CNOT gate utilizing mid-circuit measurement and a quantum volume measurement of $2^6=64$. By demonstrating that the low error rates achievable in small ion crystals can be successfully integrated with a scalable trap design, parallel optical delivery, and fast ion transport, the QCCD architecture is shown to be a viable path toward large quantum computers. Atomic ions provide perfectly identical, high-fidelity qubits. Our work shows that the QCCD architecture built around these qubits will provide high performance quantum computers, likely enabling important near-term demonstrations such as quantum error correction and quantum advantage.
229 citations
TL;DR: In this article, the authors proposed a hardware-efficient instance of such a non-local qubit: a superposition of position eigenstates that forms grid states of a single oscillator.
Abstract: The accuracy of logical operations on quantum bits (qubits) must be improved for quantum computers to outperform classical ones in useful tasks. One method to achieve this is quantum error correction (QEC), which prevents noise in the underlying system from causing logical errors. This approach derives from the reasonable assumption that noise is local, that is, it does not act in a coordinated way on different parts of the physical system. Therefore, if a logical qubit is encoded non-locally, we can—for a limited time—detect and correct noise-induced evolution before it corrupts the encoded information1. In 2001, Gottesman, Kitaev and Preskill (GKP) proposed a hardware-efficient instance of such a non-local qubit: a superposition of position eigenstates that forms grid states of a single oscillator2. However, the implementation of measurements that reveal this noise-induced evolution of the oscillator while preserving the encoded information3–7 has proved to be experimentally challenging, and the only realization reported so far relied on post-selection8,9, which is incompatible with QEC. Here we experimentally prepare square and hexagonal GKP code states through a feedback protocol that incorporates non-destructive measurements that are implemented with a superconducting microwave cavity having the role of the oscillator. We demonstrate QEC of an encoded qubit with suppression of all logical errors, in quantitative agreement with a theoretical estimate based on the measured imperfections of the experiment. Our protocol is applicable to other continuous-variable systems and, in contrast to previous implementations of QEC10–14, can mitigate all logical errors generated by a wide variety of noise processes and facilitate fault-tolerant quantum computation. Quantum error correction of Gottesman–Kitaev–Preskill code states is realized experimentally in a superconducting quantum device.
TL;DR: In this article, a high-yield heterogeneous integration of diamond waveguide arrays containing highly coherent colour centres on a photonic integrated circuit (PIC) is presented. But the authors are restricted to the use of a single waveguide array.
Abstract: A central challenge in developing quantum computers and long-range quantum networks is the distribution of entanglement across many individually controllable qubits1. Colour centres in diamond have emerged as leading solid-state ‘artificial atom’ qubits2,3 because they enable on-demand remote entanglement4, coherent control of over ten ancillae qubits with minute-long coherence times5 and memory-enhanced quantum communication6. A critical next step is to integrate large numbers of artificial atoms with photonic architectures to enable large-scale quantum information processing systems. So far, these efforts have been stymied by qubit inhomogeneities, low device yield and complex device requirements. Here we introduce a process for the high-yield heterogeneous integration of ‘quantum microchiplets’—diamond waveguide arrays containing highly coherent colour centres—on a photonic integrated circuit (PIC). We use this process to realize a 128-channel, defect-free array of germanium-vacancy and silicon-vacancy colour centres in an aluminium nitride PIC. Photoluminescence spectroscopy reveals long-term, stable and narrow average optical linewidths of 54 megahertz (146 megahertz) for germanium-vacancy (silicon-vacancy) emitters, close to the lifetime-limited linewidth of 32 megahertz (93 megahertz). We show that inhomogeneities of individual colour centre optical transitions can be compensated in situ by integrated tuning over 50 gigahertz without linewidth degradation. The ability to assemble large numbers of nearly indistinguishable and tunable artificial atoms into phase-stable PICs marks a key step towards multiplexed quantum repeaters7,8 and general-purpose quantum processors9–12. An approach for integrating a large number of solid-state qubits on a photonic integrated circuit is used to construct a 128-channel artificial atom chip containing diamond quantum emitters.
TL;DR: Two-dimensional transmon qubits are fabricated that have both lifetimes and coherence times with dynamical decoupling exceeding 0.3 milliseconds by replacing niobium with tantalum in the device, indicating that these material improvements are robust, paving the way for higher gate fidelities in multi-qubit processors.
Abstract: The superconducting transmon qubit is a leading platform for quantum computing and quantum science. Building large, useful quantum systems based on transmon qubits will require significant improvements in qubit relaxation and coherence times, which are orders of magnitude shorter than limits imposed by bulk properties of the constituent materials. This indicates that relaxation likely originates from uncontrolled surfaces, interfaces, and contaminants. Previous efforts to improve qubit lifetimes have focused primarily on designs that minimize contributions from surfaces. However, significant improvements in the lifetime of two-dimensional transmon qubits have remained elusive for several years. Here, we fabricate two-dimensional transmon qubits that have both lifetimes and coherence times with dynamical decoupling exceeding 0.3 milliseconds by replacing niobium with tantalum in the device. We have observed increased lifetimes for seventeen devices, indicating that these material improvements are robust, paving the way for higher gate fidelities in multi-qubit processors.
TL;DR: This work shows that some problems that are classically hard to compute can be easily predicted by classical machines learning from data and proposes a projected quantum model that provides a simple and rigorous quantum speed-up for a learning problem in the fault-tolerant regime.
Abstract: The use of quantum computing for machine learning is among the most exciting prospective applications of quantum technologies. However, machine learning tasks where data is provided can be considerably different than commonly studied computational tasks. In this work, we show that some problems that are classically hard to compute can be easily predicted by classical machines learning from data. Using rigorous prediction error bounds as a foundation, we develop a methodology for assessing potential quantum advantage in learning tasks. The bounds are tight asymptotically and empirically predictive for a wide range of learning models. These constructions explain numerical results showing that with the help of data, classical machine learning models can be competitive with quantum models even if they are tailored to quantum problems. We then propose a projected quantum model that provides a simple and rigorous quantum speed-up for a learning problem in the fault-tolerant regime. For near-term implementations, we demonstrate a significant prediction advantage over some classical models on engineered data sets designed to demonstrate a maximal quantum advantage in one of the largest numerical tests for gate-based quantum machine learning to date, up to 30 qubits.
TL;DR: The demonstration of ‘hot’ and universal quantum logic in a semiconductor platform paves the way for quantum integrated circuits that host both the quantum hardware and its control circuitry on the same chip, providing a scalable approach towards practical quantum information processing.
Abstract: Quantum computation requires many qubits that can be coherently controlled and coupled to each other1. Qubits that are defined using lithographic techniques have been suggested to enable the development of scalable quantum systems because they can be implemented using semiconductor fabrication technology2-5. However, leading solid-state approaches function only at temperatures below 100 millikelvin, where cooling power is extremely limited, and this severely affects the prospects of practical quantum computation. Recent studies of electron spins in silicon have made progress towards a platform that can be operated at higher temperatures by demonstrating long spin lifetimes6, gate-based spin readout7 and coherent single-spin control8. However, a high-temperature two-qubit logic gate has not yet been demonstrated. Here we show that silicon quantum dots can have sufficient thermal robustness to enable the execution of a universal gate set at temperatures greater than one kelvin. We obtain single-qubit control via electron spin resonance and readout using Pauli spin blockade. In addition, we show individual coherent control of two qubits and measure single-qubit fidelities of up to 99.3 per cent. We demonstrate the tunability of the exchange interaction between the two spins from 0.5 to 18 megahertz and use it to execute coherent two-qubit controlled rotations. The demonstration of 'hot' and universal quantum logic in a semiconductor platform paves the way for quantum integrated circuits that host both the quantum hardware and its control circuitry on the same chip, providing a scalable approach towards practical quantum information processing.
TL;DR: The results showcase the combination of fast quantum control and robustness against errors, which is intrinsic to stabilized macroscopic states, as well as the potential of of these states as resources in quantum information processing.
Abstract: Quantum superpositions of macroscopically distinct classical states-so-called Schrodinger cat states-are a resource for quantum metrology, quantum communication and quantum computation. In particular, the superpositions of two opposite-phase coherent states in an oscillator encode a qubit protected against phase-flip errors1,2. However, several challenges have to be overcome for this concept to become a practical way to encode and manipulate error-protected quantum information. The protection must be maintained by stabilizing these highly excited states and, at the same time, the system has to be compatible with fast gates on the encoded qubit and a quantum non-demolition readout of the encoded information. Here we experimentally demonstrate a method for the generation and stabilization of Schrodinger cat states based on the interplay between Kerr nonlinearity and single-mode squeezing1,3 in a superconducting microwave resonator4. We show an increase in the transverse relaxation time of the stabilized, error-protected qubit of more than one order of magnitude compared with the single-photon Fock-state encoding. We perform all single-qubit gate operations on timescales more than sixty times faster than the shortest coherence time and demonstrate single-shot readout of the protected qubit under stabilization. Our results showcase the combination of fast quantum control and robustness against errors, which is intrinsic to stabilized macroscopic states, as well as the potential of of these states as resources in quantum information processing5-8.
TL;DR: Using a superconducting qubit as a quantum sensor, a single magnon is detected in a millimeter-sized ferrimagnetic crystal with a quantum efficiency of up to 0.71, establishing the single-photon detector counterpart for magnonics.
Abstract: The recent development of hybrid systems based on superconducting circuits provides the possibility of engineering quantum sensors that exploit different degrees of freedom. Quantum magnonics, which aims to control and read out quanta of collective spin excitations in magnetically ordered systems, provides opportunities for advances in both the study of magnetism and the development of quantum technologies. Using a superconducting qubit as a quantum sensor, we report the detection of a single magnon in a millimeter-sized ferrimagnetic crystal with a quantum efficiency of up to 0.71. The detection is based on the entanglement between a magnetostatic mode and the qubit, followed by a single-shot measurement of the qubit state. This proof-of-principle experiment establishes the single-photon detector counterpart for magnonics.
TL;DR: This work implements two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ that can provide a threefold reduction in circuit depth as compared to a standard decomposition.
Abstract: Quantum algorithms offer a dramatic speedup for computational problems in material science and chemistry. However, any near-term realizations of these algorithms will need to be optimized to fit within the finite resources offered by existing noisy hardware. Here, taking advantage of the adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a threefold reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an imaginary swap-like (iSWAP-like) gate to attain an arbitrary swap angle, θ, and a controlled-phase gate that generates an arbitrary conditional phase, ϕ. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic simulation (fSim) gate set. We benchmark the fidelity of the iSWAP-like and controlled-phase gate families as well as 525 other fSim gates spread evenly across the entire fSim(θ,ϕ) parameter space, achieving a purity-limited average two-qubit Pauli error of 3.8×10^{-3} per fSim gate.
06 Feb 2020
TL;DR: In this article, the authors acknowledge CaixaBank for its support of this work through Barcelona Supercomputing Center project CaixABank Computacion Cuantica, and also acknowledge Xanadu Quantum Computing, in particular Shahnawaz Ahmed, for writing a tutorial of this quantum classifier using its full-stack library Pennylane
Abstract: APS and JIL acknowledge CaixaBank for its support of this work through Barcelona Supercomputing Center project CaixaBank Computacion Cuantica. The authors acknowledge the interesting discussions with Quantic group team members. The authors also acknowledge Xanadu Quantum Computing, in particular Shahnawaz Ahmed, for writing a tutorial of this quantum classifier using its full-stack library Pennylane
TL;DR: In this article, a dynamical quantum simulation of SU(2) non-Abelian gauge field theory on a digital quantum computer is presented, enabled on current quantum hardware by introducing a mapping of the field onto a register of qubits that utilizes local gauge symmetry while preserving local constraints on the fields, reducing the dimensionality of the calculation.
Abstract: A dynamical quantum simulation of SU(2) non-Abelian gauge field theory on a digital quantum computer is presented. This was enabled on current quantum hardware by introducing a mapping of the field onto a register of qubits that utilizes local gauge symmetry while preserving local constraints on the fields, reducing the dimensionality of the calculation. Controlled plaquette operators and gauge-variant completions in the unphysical part of the Hilbert space were designed and used to implement time evolution. The new techniques developed in this work generalize to quantum simulations of higher dimensional gauge field theories.
TL;DR: A local order parameter for measurement-induced phase transitions is uncovered: the average entropy of a single reference qubit initially entangled with the system, which is likely to point to more efficient realizations of fault-tolerant quantum computation.
Abstract: We uncover a local order parameter for measurement-induced phase transitions: the average entropy of a single reference qubit initially entangled with the system. Using this order parameter, we identify scalable probes of measurement-induced criticality that are immediately applicable to advanced quantum computing platforms. We test our proposal on a 1+1 dimensional stabilizer circuit model that can be classically simulated in polynomial time. We introduce the concept of a "decoding light cone" to establish the local and efficiently measurable nature of this probe. We also estimate bulk and surface critical exponents for the transition. Developing scalable probes of measurement-induced criticality in more general models may be a useful application of noisy intermediate scale quantum devices, as well as point to more efficient realizations of fault-tolerant quantum computation.
Posted Content•
TL;DR: The theory of entanglement provides a fundamentally new language for describing interactions and correlations in many body systems, and the syntax is provided by tensor networks as mentioned in this paper, where the tensor network enables the construction of real-space renormalization group flows and fixed points.
Abstract: The theory of entanglement provides a fundamentally new language for describing interactions and correlations in many body systems. Its vocabulary consists of qubits and entangled pairs, and the syntax is provided by tensor networks. We review how matrix product states and projected entangled pair states describe many-body wavefunctions in terms of local tensors. These tensors express how the entanglement is routed, act as a novel type of non-local order parameter, and we describe how their symmetries are reflections of the global entanglement patterns in the full system. We will discuss how tensor networks enable the construction of real-space renormalization group flows and fixed points, and examine the entanglement structure of states exhibiting topological quantum order. Finally, we provide a summary of the mathematical results of matrix product states and projected entangled pair states, highlighting the fundamental theorem of matrix product vectors and its applications.
TL;DR: This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods and various physical realizations for qudit computation.
Abstract: Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP gate, and the multi-level controlled-gate. We then present the qudit version of several representative quantum algorithms including the Deutsch-Jozsa algorithm, the quantum Fourier transform, and the phase estimation algorithm. Finally we discuss various physical realizations for qudit computation such as the photonic platform, iron trap, and nuclear magnetic resonance.
TL;DR: In this article, the authors describe a protocol for the reliable, efficient and precise characterization of quantum noise in an architecture consisting of 14 superconducting qubits, and report its experimental implementation on a 14-qubit quantum architecture.
Abstract: Noise is the central obstacle to building large-scale quantum computers. Quantum systems with sufficiently uncorrelated and weak noise could be used to solve computational problems that are intractable with current digital computers. There has been substantial progress towards engineering such systems1–8. However, continued progress depends on the ability to characterize quantum noise reliably and efficiently with high precision9. Here, we describe such a protocol and report its experimental implementation on a 14-qubit superconducting quantum architecture. The method returns an estimate of the effective noise and can detect correlations within arbitrary sets of qubits. We show how to construct a quantum noise correlation matrix allowing the easy visualization of correlations between all pairs of qubits, enabling the discovery of long-range two-qubit correlations in the 14-qubit device that had not previously been detected. Our results are the first implementation of a provably rigorous and comprehensive diagnostic protocol capable of being run on state-of-the-art devices and beyond. These results pave the way for noise metrology in next-generation quantum devices, calibration in the presence of crosstalk, bespoke quantum error-correcting codes10 and customized fault-tolerance protocols11 that can greatly reduce the overhead in a quantum computation. A protocol for the reliable, efficient and precise characterization of quantum noise is reported and implemented in an architecture consisting of 14 superconducting qubits. Correlated noise within arbitrary sets of qubits can be easily detected.
09 Mar 2020
TL;DR: This work makes the case for software mitigation of crosstalk errors, and develops a scheduler that judiciously serializes high cros stalk instructions balancing the need to mitigate crosStalk and exponential decoherence errors from serialization.
Abstract: Crosstalk is a major source of noise in Noisy Intermediate-Scale Quantum (NISQ) systems and is a fundamental challenge for hardware design. When multiple instructions are executed in parallel, crosstalk between the instructions can corrupt the quantum state and lead to incorrect program execution. Our goal is to mitigate the application impact of crosstalk noise through software techniques. This requires (i) accurate characterization of hardware crosstalk, and (ii) intelligent instruction scheduling to serialize the affected operations. Since crosstalk characterization is computationally expensive, we develop optimizations which reduce the characterization overhead. On 3 20-qubit IBMQ systems, we demonstrate two orders of magnitude reduction in characterization time (compute time on the QC device) compared to all-pairs crosstalk measurements. Informed by these characterization, we develop a scheduler that judiciously serializes high crosstalk instructions balancing the need to mitigate crosstalk and exponential decoherence errors from serialization. On real-system runs on 3 IBMQ systems, our scheduler improves the error rate of application circuits by up to 5.6x, compared to the IBM instruction scheduler and offers near-optimal crosstalk mitigation in practice. In a broader picture, the difficulty of mitigating crosstalk has recently driven QC vendors to move towards sparser qubit connectivity or disabling nearby operations entirely in hardware, which can be detrimental to performance. Our work makes the case for software mitigation of crosstalk errors.
17 Jun 2020
TL;DR: In this article, the authors provide a brief overview of the known characterization methods for certification, benchmarking and tomographic reconstruction of quantum states and processes, and outline their applications in quantum computing, simulation and communication.
Abstract: With the rapid development of quantum technologies, a pressing need has emerged for a wide array of tools for the certification and characterization of quantum devices. Such tools are critical because the powerful applications of quantum information science will only be realized if stringent levels of precision of components can be reached and their functioning guaranteed. This Technical Review provides a brief overview of the known characterization methods for certification, benchmarking and tomographic reconstruction of quantum states and processes, and outlines their applications in quantum computing, simulation and communication. Quantum technologies require an extremely precise functioning of their components which is ensured by sophisticated tools for device characterization. This Technical Review surveys and assesses the currently available tools according to their overall complexity, information gain, and underlying assumptions.
TL;DR: In this paper, the authors implemented the smallest viable instance, capable of repeatedly detecting any single error using seven superconducting qubits (four data qubits and three ancilla qubits) with an average logical fidelity of 96.1%.
Abstract: The realization of quantum error correction is an essential ingredient for reaching the full potential of fault-tolerant universal quantum computation. Using a range of different schemes, logical qubits that are resistant to errors can be redundantly encoded in a set of error-prone physical qubits. One such scalable approach is based on the surface code. Here we experimentally implement its smallest viable instance, capable of repeatedly detecting any single error using seven superconducting qubits—four data qubits and three ancilla qubits. Using high-fidelity ancilla-based stabilizer measurements, we initialize the cardinal states of the encoded logical qubit with an average logical fidelity of 96.1%. We then repeatedly check for errors using the stabilizer readout and observe that the logical quantum state is preserved with a lifetime and a coherence time longer than those of any of the constituent qubits when no errors are detected. Our demonstration of error detection with its resulting enhancement of the conditioned logical qubit coherence times is an important step, indicating a promising route towards the realization of quantum error correction in the surface code. In a surface code consisting of four data and three ancilla qubits, repeated error detection is demonstrated. The lifetime and coherence time of the logical qubit are enhanced over those of any of the constituent qubits when no errors are detected.
TL;DR: In this paper, it was shown that the constrained Hamiltonian dynamics induced by strong Rydberg interactions maps exactly onto the one of a U(1) lattice gauge theory and that the recently observed anomalously slow dynamics corresponds to a string-inversion mechanism, reminiscent of the string breaking typically observed in gauge theories.
Abstract: Gauge theories are the cornerstone of our understanding of fundamental interactions among elementary particles. Their properties are often probed in dynamical experiments, such as those performed at ion colliders and high-intensity laser facilities. Describing the evolution of these strongly coupled systems is a formidable challenge for classical computers and represents one of the key open quests for quantum simulation approaches to particle physics phenomena. In this work, we show how recent experiments done on Rydberg atom chains naturally realize the real-time dynamics of a lattice gauge theory at system sizes at the boundary of classical computational methods. We prove that the constrained Hamiltonian dynamics induced by strong Rydberg interactions maps exactly onto the one of a U(1) lattice gauge theory. Building on this correspondence, we show that the recently observed anomalously slow dynamics corresponds to a string-inversion mechanism, reminiscent of the string breaking typically observed in gauge theories. This underlies the generality of this slow dynamics, which we illustrate in the context of one-dimensional quantum electrodynamics on the lattice. Within the same platform, we propose a set of experiments that generically show long-lived oscillations, including the evolution of particle-antiparticle pairs, and discuss how a tunable topological angle can be realized, further affecting the dynamics following a quench. Our work shows that the state of the art for quantum simulation of lattice gauge theories is at 51 qubits and connects the recently observed slow dynamics in atomic systems to archetypal phenomena in particle physics.
TL;DR: In this article, a quantum bit is encoded in the field quadrature space of a superconducting resonator endowed with a special mechanism that dissipates photons in pairs, and the process pins down two computational states to separate locations in phase space.
Abstract: A quantum system interacts with its environment—if ever so slightly—no matter how much care is put into isolating it1. Therefore, quantum bits undergo errors, putting dauntingly difficult constraints on the hardware suitable for quantum computation2. New strategies are emerging to circumvent this problem by encoding a quantum bit non-locally across the phase space of a physical system. Because most sources of decoherence result from local fluctuations, the foundational promise is to exponentially suppress errors by increasing a measure of this non-locality3,4. Prominent examples are topological quantum bits, which delocalize information over real space and where spatial extent measures non-locality. Here, we encode a quantum bit in the field quadrature space of a superconducting resonator endowed with a special mechanism that dissipates photons in pairs5,6. This process pins down two computational states to separate locations in phase space. By increasing this separation, we measure an exponential decrease of the bit-flip rate while only linearly increasing the phase-flip rate7. Because bit-flips are autonomously corrected, only phase-flips remain to be corrected via a one-dimensional quantum error correction code. This exponential scaling demonstrates that resonators with nonlinear dissipation are promising building blocks for quantum computation with drastically reduced hardware overhead8. The choice of the physical system that represents a qubit can help reduce errors. Encoding them in the quadrature space of a superconducting resonator leads to exponentially reduced bit-flip rates, while phase-flip errors increase only linearly.
TL;DR: The teleportation algorithm, which connects to recent proposals for studying traversable wormholes in the laboratory, demonstrates how quantum information processing technology based on higher dimensional systems can exploit a larger and more connected state space to achieve the resource efficient encoding of complex quantum circuits.
Abstract: The theory of quantum information provides a common language which links disciplines ranging from cosmology to condensed-matter physics. For example, the delocalization of quantum information in strongly-interacting many-body systems, known as quantum information scrambling, has recently begun to unite our understanding of black hole dynamics, transport in exotic non-Fermi liquids, and many-body analogs of quantum chaos. To date, verified experimental implementations of scrambling have dealt only with systems comprised of two-level qubits. Higher-dimensional quantum systems, however, may exhibit different scrambling modalities and are predicted to saturate conjectured speed limits on the rate of quantum information scrambling. We take the first steps toward accessing such phenomena, by realizing a quantum processor based on superconducting qutrits (three-level quantum systems). We implement two-qutrit scrambling operations and embed them in a five-qutrit teleportation algorithm to directly measure the associated out of-time-ordered correlation functions. Measured teleportation fidelities, Favg = 0.568 +- 0001, confirm the occurrence of scrambling even in the presence of experimental imperfections. Our teleportation algorithm, which connects to recent proposals for studying traversable wormholes in the laboratory, demonstrates how quantum information processing technology based on higher dimensional systems can exploit a larger and more connected state space to achieve the resource efficient encoding of complex quantum circuits.