Showing papers on "Quantum error correction published in 2018"

Quantum Convolutional Neural Networks

Abstract: We introduce and analyze a novel quantum machine learning model motivated by convolutional neural networks. Our quantum convolutional neural network (QCNN) makes use of only $O(\log(N))$ variational parameters for input sizes of $N$ qubits, allowing for its efficient training and implementation on realistic, near-term quantum devices. The QCNN architecture combines the multi-scale entanglement renormalization ansatz and quantum error correction. We explicitly illustrate its potential with two examples. First, QCNN is used to accurately recognize quantum states associated with 1D symmetry-protected topological phases. We numerically demonstrate that a QCNN trained on a small set of exactly solvable points can reproduce the phase diagram over the entire parameter regime and also provide an exact, analytical QCNN solution. As a second application, we utilize QCNNs to devise a quantum error correction scheme optimized for a given error model. We provide a generic framework to simultaneously optimize both encoding and decoding procedures and find that the resultant scheme significantly outperforms known quantum codes of comparable complexity. Finally, potential experimental realization and generalizations of QCNNs are discussed.

Extending the computational reach of a noisy superconducting quantum processor

Abstract: 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 computation based off expectation values of quantum observables can be enhanced through an extrapolation of results from a collection of varying noisy experiments. Here, we demonstrate this error mitigation protocol on a superconducting quantum processor, enhancing its computational capability, with no additional hardware modifications. We apply the protocol to mitigate errors on canonical single- and two-qubit experiments and then extend its application to the variational optimization of Hamiltonians for quantum chemistry and magnetism. We effectively demonstrate that the suppression of incoherent errors helps unearth otherwise inaccessible accuracies to the variational solutions using our noisy processor. These results demonstrate that error mitigation techniques will be critical to significantly enhance the capabilities of near-term quantum computing hardware.

Molecular spin qudits for quantum algorithms

Abstract: Presently, one of the most ambitious technological goals is the development of devices working under the laws of quantum mechanics. One prominent target is the quantum computer, which would allow the processing of information at quantum level for purposes not achievable with even the most powerful computer resources. The large-scale implementation of quantum information would be a game changer for current technology, because it would allow unprecedented parallelised computation and secure encryption based on the principles of quantum superposition and entanglement. Currently, there are several physical platforms racing to achieve the level of performance required for the quantum hardware to step into the realm of practical quantum information applications. Several materials have been proposed to fulfil this task, ranging from quantum dots, Bose–Einstein condensates, spin impurities, superconducting circuits, molecules, amongst others. Magnetic molecules are among the list of promising building blocks, due to (i) their intrinsic monodispersity, (ii) discrete energy levels (iii) the possibility of chemical quantum state engineering, and (iv) their multilevel characteristics that lead to Qudits, where the dimension of the Hilbert space is d > 2. Herein we review how a molecular nuclear spin qudit, (d = 4), known as TbPc2, gathers all the necessary requirements to perform as a molecular hardware platform with a first generation of molecular devices enabling even quantum algorithm operations.

Fast quantum logic gates with trapped-ion qubits.

Abstract: Quantum bits (qubits) based on individual trapped atomic ions are a promising technology for building a quantum computer. The elementary operations necessary to do so have been achieved with the required precision for some error-correction schemes. However, the essential two-qubit logic gate that is used to generate quantum entanglement has hitherto always been performed in an adiabatic regime (in which the gate is slow compared with the characteristic motional frequencies of the ions in the trap), resulting in logic speeds of the order of 10 kilohertz. There have been numerous proposals of methods for performing gates faster than this natural 'speed limit' of the trap. Here we implement one such method, which uses amplitude-shaped laser pulses to drive the motion of the ions along trajectories designed so that the gate operation is insensitive to the optical phase of the pulses. This enables fast (megahertz-rate) quantum logic that is robust to fluctuations in the optical phase, which would otherwise be an important source of experimental error. We demonstrate entanglement generation for gate times as short as 480 nanoseconds-less than a single oscillation period of an ion in the trap and eight orders of magnitude shorter than the memory coherence time measured in similar calcium-43 hyperfine qubits. The power of the method is most evident at intermediate timescales, at which it yields a gate error more than ten times lower than can be attained using conventional techniques; for example, we achieve a 1.6-microsecond-duration gate with a fidelity of 99.8 per cent. Faster and higher-fidelity gates are possible at the cost of greater laser intensity. The method requires only a single amplitude-shaped pulse and one pair of beams derived from a continuous-wave laser. It offers the prospect of combining the unrivalled coherence properties, operation fidelities and optical connectivity of trapped-ion qubits with the submicrosecond logic speeds that are usually associated with solid-state devices.

Fidelity benchmarks for two-qubit gates in silicon

Abstract: Universal quantum computation will require qubit technology based on a scalable platform, together with quantum error correction protocols that place strict limits on the maximum infidelities for one- and two-qubit gate operations. While a variety of qubit systems have shown high fidelities at the one-qubit level, superconductor technologies have been the only solid-state qubits manufactured via standard lithographic techniques which have demonstrated two-qubit fidelities near the fault-tolerant threshold. Silicon-based quantum dot qubits are also amenable to large-scale manufacture and can achieve high single-qubit gate fidelities (exceeding 99.9%) using isotopically enriched silicon. However, while two-qubit gates have been demonstrated in silicon, it has not yet been possible to rigorously assess their fidelities using randomized benchmarking, since this requires sequences of significant numbers of qubit operations ($\gtrsim 20$) to be completed with non-vanishing fidelity. Here, for qubits encoded on the electron spin states of gate-defined quantum dots, we demonstrate Bell state tomography with fidelities ranging from 80% to 89%, and two-qubit randomized benchmarking with an average Clifford gate fidelity of 94.7% and average Controlled-ROT (CROT) fidelity of 98.0%. These fidelities are found to be limited by the relatively slow gate times employed here compared with the decoherence times $T_2^*$ of the qubits. Silicon qubit designs employing fast gate operations based on high Rabi frequencies, together with advanced pulsing techniques, should therefore enable significantly higher fidelities in the near future.

Reinforcement Learning with Neural Networks for Quantum Feedback

Abstract: An artificial neural network can discover algorithms for quantum error correction without human guidance.

A crossbar network for silicon quantum dot qubits.

Abstract: The spin states of single electrons in gate-defined quantum dots satisfy crucial requirements for a practical quantum computer. These include extremely long coherence times, high-fidelity quantum operation, and the ability to shuttle electrons as a mechanism for on-chip flying qubits. To increase the number of qubits to the thousands or millions of qubits needed for practical quantum information, we present an architecture based on shared control and a scalable number of lines. Crucially, the control lines define the qubit grid, such that no local components are required. Our design enables qubit coupling beyond nearest neighbors, providing prospects for nonplanar quantum error correction protocols. Fabrication is based on a three-layer design to define qubit and tunnel barrier gates. We show that a double stripline on top of the structure can drive high-fidelity single-qubit rotations. Self-aligned inhomogeneous magnetic fields induced by direct currents through superconducting gates enable qubit addressability and readout. Qubit coupling is based on the exchange interaction, and we show that parallel two-qubit gates can be performed at the detuning-noise insensitive point. While the architecture requires a high level of uniformity in the materials and critical dimensions to enable shared control, it stands out for its simplicity and provides prospects for large-scale quantum computation in the near future.

Achieving the Heisenberg limit in quantum metrology using quantum error correction

Abstract: Quantum metrology has many important applications in science and technology, ranging from frequency spectroscopy to gravitational wave detection. Quantum mechanics imposes a fundamental limit on measurement precision, called the Heisenberg limit, which can be achieved for noiseless quantum systems, but is not achievable in general for systems subject to noise. Here we study how measurement precision can be enhanced through quantum error correction, a general method for protecting a quantum system from the damaging effects of noise. We find a necessary and sufficient condition for achieving the Heisenberg limit using quantum probes subject to Markovian noise, assuming that noiseless ancilla systems are available, and that fast, accurate quantum processing can be performed. When the sufficient condition is satisfied, a quantum error-correcting code can be constructed that suppresses the noise without obscuring the signal; the optimal code, achieving the best possible precision, can be found by solving a semidefinite program.

On-demand quantum state transfer and entanglement between remote microwave cavity memories

Abstract: Coupling isolated quantum systems through propagating photons is a central theme in quantum science1,2, with the potential for groundbreaking applications such as distributed, fault-tolerant quantum computing3–5. To date, photons have been used widely to realize high-fidelity remote entanglement6–12 and state transfer13–15 by compensating for inefficiency with conditioning, a fundamentally probabilistic strategy that places limits on the rate of communication. In contrast, here we experimentally realize a long-standing proposal for deterministic, direct quantum state transfer16. Using efficient, parametrically controlled emission and absorption of microwave photons, we show on-demand, high-fidelity state transfer and entanglement between two isolated superconducting cavity quantum memories. The transfer rate is faster than the rate of photon loss in either memory, an essential requirement for complex networks. By transferring states in a multiphoton encoding, we further show that the use of cavity memories and state-independent transfer creates the striking opportunity to deterministically mitigate transmission loss with quantum error correction. Our results establish a compelling approach for deterministic quantum communication across networks, and will enable modular scaling of superconducting quantum circuits.

Quantum Error Correction with Only Two Extra Qubits

Abstract: Noise rates in quantum computing experiments have dropped dramatically, but reliable qubits remain precious. Fault-tolerance schemes with minimal qubit overhead are therefore essential. We introduce fault-tolerant error-correction procedures that use only two extra qubits. The procedures are based on adding "flags" to catch the faults that can lead to correlated errors on the data. They work for various distance-three codes. In particular, our scheme allows one to test the ⟦5,1,3⟧ code, the smallest error-correcting code, using only seven qubits total. Our techniques also apply to the ⟦7,1,3⟧ and ⟦15,7,3⟧ Hamming codes, thus allowing us to protect seven encoded qubits on a device with only 17 physical qubits.

High-Threshold Fault-Tolerant Quantum Computation with Analog Quantum Error Correction

Abstract: A type of quantum bit known as the Gottesman-Kitaev-Preskill qubit could be a key ingredient for practical, fault-tolerant quantum computers, but it has stringent requirements that are beyond current capabilities. New calculations propose a way to reduce these requirements to be achievable in near-term setups.

Fast and Unconditional All-Microwave Reset of a Superconducting Qubit.

Abstract: Active qubit reset is a key operation in many quantum algorithms, and particularly in quantum error correction. Here, we experimentally demonstrate a reset scheme for a three-level transmon artificial atom coupled to a large bandwidth resonator. The reset protocol uses a microwave-induced interaction between the $|f,0⟩$ and $|g,1⟩$ states of the coupled transmon-resonator system, with $|g⟩$ and $|f⟩$ denoting the ground and second excited states of the transmon, and $|0⟩$ and $|1⟩$ the photon Fock states of the resonator. We characterize the reset process and demonstrate reinitialization of the transmon-resonator system to its ground state in less than 500 ns and with 0.2% residual excitation. Our protocol is of practical interest as it has no additional architectural requirements beyond those needed for fast and efficient single-shot readout of transmons, and does not require feedback.

TASI Lectures on the Emergence of Bulk Physics in AdS/CFT

Abstract: These lectures review recent developments in our understanding of the emergence of local bulk physics in AdS/CFT. The primary topics are sufficient conditions for a conformal field theory to have a semiclassical dual, bulk reconstruction, the quantum error correction interpretation of the correspondence, tensor network models of holography, and the quantum Ryu-Takayanagi formula.

Demonstration of quantum error correction and universal gate set on a binomial bosonic logical qubit

Abstract: Logical qubit encoding and quantum error correction (QEC) have been experimentally demonstrated in various physical systems with multiple physical qubits, however, logical operations are challenging due to the necessary nonlocal operations. Alternatively, logical qubits with bosonic-mode-encoding are of particular interest because their QEC protection is hardware efficient, but gate operations on QEC protected logical qubits remain elusive. Here, we experimentally demonstrate full control on a single logical qubit with a binomial bosonic code, including encoding, decoding, repetitive QEC, and high-fidelity (97.0% process fidelity on average) universal quantum gate set on the logical qubit. The protected logical qubit has shown 2.8 times longer lifetime than the uncorrected one. A Ramsey experiment on a protected logical qubit is demonstrated for the first time with two times longer coherence than the unprotected one. Our experiment represents an important step towards fault-tolerant quantum computation based on bosonic encoding.

A CNOT gate between multiphoton qubits encoded in two cavities

Abstract: Entangling gates between qubits are a crucial component for performing algorithms in quantum computers. However, any quantum algorithm must ultimately operate on error-protected logical qubits encoded in high-dimensional systems. Typically, logical qubits are encoded in multiple two-level systems, but entangling gates operating on such qubits are highly complex and have not yet been demonstrated. Here we realize a controlled NOT (CNOT) gate between two multiphoton qubits in two microwave cavities. In this approach, we encode a qubit in the high-dimensional space of a single cavity mode, rather than in multiple two-level systems. We couple two such encoded qubits together through a transmon, which is driven by an RF pump to apply the gate within 190 ns. This is two orders of magnitude shorter than the decoherence time of the transmon, enabling a high-fidelity gate operation. These results are an important step towards universal algorithms on error-corrected logical qubits. Quantum computing platforms allowing quantum error correction usually rely on complex redundant encoding within multiple two-level systems. Here, instead, the authors realize a CNOT gate between two qubits encoded in the multiphoton states of two microwave cavities nonlinearly coupled by a transmon.

Machine-learning-assisted correction of correlated qubit errors in a topological code

Abstract: A fault-tolerant quantum computation requires an efficient means to detect and correct errors that accumulate in encoded quantum information. In the context of machine learning, neural networks are a promising new approach to quantum error correction. Here we show that a recurrent neural network can be trained, using only experimentally accessible data, to detect errors in a widely used topological code, the surface code, with a performance above that of the established minimum-weight perfect matching (or blossom) decoder. The performance gain is achieved because the neural network decoder can detect correlations between bit-flip (X) and phase-flip (Z) errors. The machine learning algorithm adapts to the physical system, hence no noise model is needed. The long short-term memory layers of the recurrent neural network maintain their performance over a large number of quantum error correction cycles, making it a practical decoder for forthcoming experimental realizations of the surface code.

Repeated multi-qubit readout and feedback with a mixed-species trapped-ion register.

Abstract: Quantum error correction is essential for realizing the full potential of large-scale quantum information processing devices1,2. Fundamental to its experimental realization is the repetitive detection of errors via projective measurements of quantum correlations among qubits, as well as corrections using conditional feedback3. Repetitive application of such tasks requires that they neither induce unwanted crosstalk nor impede further control operations, which is challenging owing to the need to dissipatively couple qubits to the classical world for detection and reinitialization. For trapped ions, state readout involves scattering large numbers of resonant photons, which increases the probability of stray light causing errors on nearby qubits and leads to undesirable recoil heating of the ion motion. Here we demonstrate up to 50 sequential measurements of correlations between two beryllium ion microwave qubits using an ancillary optical qubit in a calcium ion, and implement feedback that allows us to stabilize two-qubit subspaces as well as Bell states, a class of maximally entangled states. Multi-qubit mixed-species gates are used to transfer information within the register from the qubit to the ancilla, enabling readout with negligible crosstalk to the data qubits. Heating of the ion motion during detection is mitigated by recooling all three ions using light that interacts with only the calcium ion, known as sympathetic cooling. A key element of our experimental setup is a powerful classical control system that features flexible in-sequence processing for feedback control. The methods employed here provide essential tools for scaling trapped-ion quantum computing, quantum-state control and entanglement-enhanced quantum metrology4.

Bravyi-Kitaev Superfast simulation of electronic structure on a quantum computer.

Abstract: Present quantum computers often work with distinguishable qubits as their computational units. In order to simulate indistinguishable fermionic particles, it is first required to map the fermionic state to the state of the qubits. The Bravyi-Kitaev Superfast (BKSF) algorithm can be used to accomplish this mapping. The BKSF mapping has connections to quantum error correction and opens the door to new ways of understanding fermionic simulation in a topological context. Here, we present the first detailed exposition of the BKSF algorithm for molecular simulation. We provide the BKSF transformed qubit operators and report on our implementation of the BKSF fermion-to-qubits transform in OpenFermion. In this initial study of a hydrogen molecule we have compared BKSF, Jordan-Wigner, and Bravyi-Kitaev transforms under the Trotter approximation. The gate count to implement BKSF is lower than Jordan-Wigner but higher than Bravyi-Kitaev. We considered different orderings of the exponentiated terms and found lower Trotter errors than the previously reported for Jordan-Wigner and Bravyi-Kitaev algorithms. These results open the door to the further study of the BKSF algorithm for quantum simulation.

Coherent Manipulation of a Molecular Ln-Based Nuclear Qudit Coupled to an Electron Qubit.

Abstract: We demonstrate that the [Yb(trensal)] molecule is a prototypical coupled electronic qubit-nuclear qudit system. The combination of noise-resilient nuclear degrees of freedom and large reduction of nutation time induced by electron-nuclear mixing enables coherent manipulation of this qudit by radio frequency pulses. Moreover, the multilevel structure of the qudit is exploited to encode and operate a qubit with embedded basic quantum error correction.

A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

Abstract: Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are strategies for space-time trade-offs, going from slow computations using few qubits to fast computations using many qubits. Our schemes are based on surface-code patches, which not only feature a low space cost compared to other surface-code schemes, but are also conceptually simple, simple enough that they can be described as a tile-based game with a small set of rules. Therefore, no knowledge of quantum error correction is necessary to understand the schemes in this paper, but only the concepts of qubits and measurements. As an example, assuming a physical error rate of $10^{-4}$ and a code cycle time of 1 $\mu$s, a classically intractable 100-qubit quantum computation with a $T$ count of $10^8$ and a $T$ depth of $10^6$ can be executed in 4 hours using 55,000 qubits, in 22 minutes using 120,000 qubits, or in 1 second using 330,000,000 qubits.

Correction: Corrigendum: Fault-tolerant quantum computation with a soft-decision decoder for error correction and detection by teleportation

Abstract: Fault-tolerant quantum computation with quantum error-correcting codes has been considerably developed over the past decade. However, there are still difficult issues, particularly on the resource requirement. For further improvement of fault-tolerant quantum computation, here we propose a soft-decision decoder for quantum error correction and detection by teleportation. This decoder can achieve almost optimal performance for the depolarizing channel. Applying this decoder to Knill's C4/C6 scheme for fault-tolerant quantum computation, which is one of the best schemes so far and relies heavily on error correction and detection by teleportation, we dramatically improve its performance. This leads to substantial reduction of resources.

Stabilized Cat in Driven Nonlinear Cavity: A Fault-Tolerant Error Syndrome Detector

Abstract: In quantum error correction, information is encoded in a high-dimensional system to protect it from the environment. A crucial step is to use natural, low-weight operations with an ancilla to extract information about errors without causing backaction on the encoded system. Essentially, ancilla errors must not propagate to the encoded system and induce errors beyond those which can be corrected. The current schemes for achieving this fault-tolerance to ancilla errors come at the cost of increased overhead requirements. An efficient way to extract error syndromes in a fault-tolerant manner is by using a single ancilla with strongly biased noise channel. Typically, however, required elementary operations can become challenging when the noise is extremely biased. We propose to overcome this shortcoming by using a bosonic-cat ancilla in a parametrically driven nonlinear cavity. Such a cat-qubit experiences only bit-flip noise and is stabilized against phase-flips. To highlight the flexibility of this approach, we illustrate the syndrome extraction process in a variety of codes such as qubit-based toric codes, bosonic cat- and Gottesman-Kitaev-Preskill (GKP) codes. Our results open a path for realizing hardware-efficient, fault-tolerant error syndrome extraction.

Repeated multi-qubit readout and feedback with a mixed-species trapped-ion register

Abstract: Quantum error correction will be essential for realizing the full potential of large-scale quantum information processing devices. Fundamental to its experimental realization is the repetitive detection of errors via projective measurements of quantum correlations among qubits, and correction using conditional feedback. Performing these tasks repeatedly requires a system in which measurement and feedback decision times are short compared to qubit coherence times, where the measurement reproduces faithfully the desired projection, and for which the measurement process has no detrimental effect on the ability to perform further operations. Here we demonstrate up to 50 sequential measurements of correlations between two beryllium-ion qubits using a calcium ion ancilla, and implement feedback which allows us to stabilize two-qubit subspaces as well as Bell states. Multi-qubit mixed-species gates are used to transfer information from qubits to the ancilla, enabling quantum state detection with negligible crosstalk to the stored qubits. Heating of the ion motion during detection is mitigated using sympathetic recooling. A key element of the experimental system is a powerful classical control system, which features flexible in-sequence processing to implement feedback control. The methods employed here provide a number of essential ingredients for scaling trapped-ion quantum computing, and provide new opportunities for quantum state control and entanglement-enhanced quantum metrology.

Measurement of a superconducting qubit with a microwave photon counter

Abstract: Fast, high-fidelity measurement is a key ingredient for quantum error correction. Conventional approaches to the measurement of superconducting qubits, involving linear amplification of a microwave probe tone followed by heterodyne detection at room temperature, do not scale well to large system sizes. We introduce an approach to measurement based on a microwave photon counter demonstrating raw single-shot measurement fidelity of 92 % . Moreover, the intrinsic damping of the photon counter is used to extract the energy released by the measurement process, allowing repeated high-fidelity quantum nondemolition measurements. Our scheme provides access to the classical outcome of projective quantum measurement at the millikelvin stage and could form the basis for a scalable quantum-to-classical interface.

Coherent Oscillations inside a Quantum Manifold Stabilized by Dissipation

Abstract: Manipulating the state of a logical quantum bit usually comes at the expense of exposing it to decoherence. Fault-tolerant quantum computing tackles this problem by manipulating quantum information within a stable manifold of a larger Hilbert space, whose symmetries restrict the number of independent errors. The remaining errors do not affect the quantum computation and are correctable after the fact. Here we implement the autonomous stabilization of an encoding manifold spanned by Schroedinger cat states in a superconducting cavity. We show Zeno-driven coherent oscillations between these states analogous to the Rabi rotation of a qubit protected against phase-flips. Such gates are compatible with quantum error correction and hence are crucial for fault-tolerant logical qubits.

Bulk entanglement gravity without a boundary: Towards finding Einstein’s equation in Hilbert space

Abstract: We consider the emergence from quantum entanglement of spacetime geometry in a bulk region. For certain classes of quantum states in an appropriately factorized Hilbert space, a spatial geometry can be defined by associating areas along codimension-one surfaces with the entanglement entropy between either side. We show how radon transforms can be used to convert these data into a spatial metric. Under a particular set of assumptions, the time evolution of such a state traces out a four-dimensional spacetime geometry, and we argue using a modified version of Jacobson’s “entanglement equilibrium” that the geometry should obey Einstein’s equation in the weak-field limit. We also discuss how entanglement equilibrium is related to a generalization of the Ryu-Takayanagi formula in more general settings, and how quantum error correction can help specify the emergence map between the full quantum-gravity Hilbert space and the semiclassical limit of quantum fields propagating on a classical spacetime.

Correcting coherent errors with surface codes

Abstract: Surface codes are building blocks of quantum computing platforms based on 2D arrays of qubits responsible for detecting and correcting errors. The error suppression achieved by the surface code is usually estimated by simulating toy noise models describing random Pauli errors. However, Pauli noise models fail to capture coherent processes such as systematic unitary errors caused by imperfect control pulses. Here we report the first large-scale simulation of quantum error correction protocols based on the surface code in the presence of coherent noise. We observe that the standard Pauli approximation provides an accurate estimate of the error threshold but underestimates the logical error rate in the sub-threshold regime. We find that for large code size the logical-level noise is well approximated by random Pauli errors even though the physical-level noise is coherent. Our work demonstrates that coherent effects do not significantly change the error correcting threshold of surface codes. This gives more confidence in the viability of the fault-tolerance architecture pursued by several experimental groups. Coherent effects are shown not to play a significant role in error correction with quantum surface codes. To build a quantum computer, the quantum bit (qubit) has to be protected from external noise and steps have to be taken to detect and correct for errors. Surface codes are a type of quantum code that can correct for such errors. However, the models used to study such codes often fail to capture quantum coherent processes, which could play an important role. By performing large-scale simulations, Robert Konig from Technical University of Munich and an international team of collaborators show that coherent effects do not significantly impact the error correction in surface codes, giving confidence in the viability of this approach for developing fault-tolerance quantum computing architectures.

qTorch: The quantum tensor contraction handler.

Abstract: Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests. Tensor network (TN) contraction is an algorithmic method that can efficiently simulate some quantum circuits, often greatly reducing the computational cost over methods that simulate the full Hilbert space. In this study we implement a tensor network contraction program for simulating quantum circuits using multi-core compute nodes. We show simulation results for the Max-Cut problem on 3- through 7-regular graphs using the quantum approximate optimization algorithm (QAOA), successfully simulating up to 100 qubits. We test two different methods for generating the ordering of tensor index contractions: one is based on the tree decomposition of the line graph, while the other generates ordering using a straight-forward stochastic scheme. Through studying instances of QAOA circuits, we show the expected result that as the treewidth of the quantum circuit's line graph decreases, TN contraction becomes significantly more efficient than simulating the whole Hilbert space. The results in this work suggest that tensor contraction methods are superior only when simulating Max-Cut/QAOA with graphs of regularities approximately five and below. Insight into this point of equal computational cost helps one determine which simulation method will be more efficient for a given quantum circuit. The stochastic contraction method outperforms the line graph based method only when the time to calculate a reasonable tree decomposition is prohibitively expensive. Finally, we release our software package, qTorch (Quantum TensOR Contraction Handler), intended for general quantum circuit simulation. For a nontrivial subset of these quantum circuits, 50 to 100 qubits can easily be simulated on a single compute node.

TASI Lectures on the Emergence of the Bulk in AdS/CFT

Abstract: These lectures review recent developments in our understanding of the emergence of local bulk physics in AdS/CFT. The primary topics are sufficient conditions for a conformal field theory to have a semiclassical dual, bulk reconstruction, the quantum error correction interpretation of the correspondence, tensor network models of holography, and the quantum Ryu-Takayanagi formula.

Deutsch, Toffoli, and cnot Gates via Rydberg Blockade of Neutral Atoms

Abstract: Using only Deutsch gates, one could construct a quantum circuit to accomplish $a\phantom{\rule{0}{0ex}}n\phantom{\rule{0}{0ex}}y$ feasible quantum computation, but unfortunately a working Deutsch gate has remained out of reach, due to lack of a protocol. This study proposes an easily realizable Deutsch-gate protocol, based on the blockade interactions in $e.g.$ neutral Rydberg atoms. This protocol can be extended to realize the CNOT gate, as well as the Toffoli gate, which can be used in quantum error correction. Given the very broad applicability of these gates, this result is a significant advance in quantum information science.