Fault-tolerant quantum computation techniques rely on weakly correlated noise. Here, I show that it is enough to assume weak spatial correlations: Time correlations can take any form. In particular, single-shot error-correction techniques exhibit a noise threshold for quantum memories under spatially local stochastic noise.

Entanglement, and, in particular, the entanglement spectrum, plays a major role in characterizing many-body quantum systems. While there has been a surge of theoretical works on the subject, no experimental measurement has been performed to date because of the lack of an implementable measurement scheme. Here, we propose a measurement protocol to access the entanglement spectrum of many-body states in experiments with cold atoms in optical lattices. Our scheme effectively performs a Ramsey spectroscopy of the entanglement Hamiltonian and is based on the ability to produce several copies of the state under investigation, together with the possibility to perform a global swap gate between two copies conditioned on the state of an auxiliary qubit. We show how the required conditional swap gate can be implemented with cold atoms, either by using Rydberg interactions or coupling the atoms to a cavity mode. We illustrate these ideas on a simple (extended) Bose-Hubbard model where such a measurement protocol reveals topological features of the Haldane phase.

Markovian reservoir engineering, in which time evolution of a quantum system is governed by a Lindblad master equation, is a powerful technique in studies of quantum phases of matter and quantum information. It can be used to drive a quantum system to a desired (unique) steady state, which can be an exotic phase of matter difficult to stabilize in nature. It can also be used to drive a system to a unitarily evolving subspace, which can be used to store, protect, and process quantum information. In this paper, we derive a formula for the map corresponding to asymptotic (infinite-time) Lindbladian evolution and use it to study several important features of the unique state and subspace cases. We quantify how subspaces retain information about initial states and show how to use Lindbladians to simulate any quantum channels. We show that the quantum information in all subspaces can be successfully manipulated by small Hamiltonian perturbations, jump operator perturbations, or adiabatic deformations. We provide a Lindblad-induced notion of distance between adiabatically connected subspaces. We derive a Kubo formula governing linear response of subspaces to time-dependent Hamiltonian perturbations and determine cases in which this formula reduces to a Hamiltonian-based Kubo formula. As an application, we show that (for gapped systems) the zero-frequency Hall conductivity is unaffected by many types of Markovian dissipation. Finally, we show that the energy scale governing leakage out of the subspaces, resulting from either Hamiltonian or jump-operator perturbations or corrections to adiabatic evolution, is different from the conventional Lindbladian dissipative gap and, in certain cases, is equivalent to the excitation gap of a related Hamiltonian.

A major signature of quantum mechanics beyond classical physics is coherence, the existence of superposition states. The recently developed resource theory of quantum coherence allows the formalization of incoherent operations—those operations which cannot create coherence. We identify the set of operations which additionally do not use coherence. These are such that coherence cannot be exploited by a classical observer, who measures incoherent properties of the system, to go beyond classical dynamics. We give a physical interpretation in terms of interferometry and prove a dilation theorem, showing how these operations can always be constructed by the system interacting, in an incoherent way, with an ancilla. Such a physical justification is not known for the incoherent operations; thus, our results lead to a physically well-motivated resource theory of coherence. Next, we investigate the implications for coherence in multipartite systems. We show that quantum correlations can be defined naturally with respect to a fixed basis, providing a link between coherence and quantum discord. We demonstrate the interplay between these two quantities in the operations that we study and suggest implications for the theory of quantum discord by relating these operations to those which cannot create discord.

We investigate the connection between recent results in quantum thermodynamics and fluctuation relations by adopting a fully quantum mechanical description of thermodynamics. By including a work system whose energy is allowed to fluctuate, we derive a set of equalities that all thermodynamical transitions have to satisfy. This extends the condition for maps to be Gibbs preserving to the case of fluctuating work, providing a more general characterization of maps commonly used in the information theoretic approach to thermodynamics. For final states, block diagonal in the energy basis, this set of equalities is a necessary and sufficient condition for a thermodynamical state transition to be possible. The conditions serve as a parent equation that can be used to derive a number of results. These include writing the second law of thermodynamics as an equality featuring a fine-grained notion of the free energy. It also yields a generalization of the Jarzynski fluctuation theorem which holds for arbitrary initial states, and under the most general manipulations allowed by the laws of quantum mechanics. Furthermore, we show that each of these relations can be seen as the quasiclassical limit of three fully quantum identities. This allows us to consider the free energy as an operator, and allows one to obtain more general and fully quantum fluctuation relations from the information theoretic approach to quantum thermodynamics.

If the second law of thermodynamics forbids a transition from one state to another, then it is still possible to make the transition happen by using a sufficient amount of work. But if we do not have access to this amount of work, can the transition happen probabilistically? In the thermodynamic limit, this probability tends to zero, but here we find that for finite-sized and quantum systems it can be finite. We compute the maximum probability of a transition or a thermodynamical fluctuation from any initial state to any final state and show that this maximum can be achieved for any final state that is block diagonal in the energy eigenbasis. We also find upper and lower bounds on this transition probability, in terms of the work of transition. As a by-product, we introduce a finite set of thermodynamical monotones related to the thermomajorization criteria which governs state transitions and compute the work of transition in terms of them. The trade-off between the probability of a transition and any partial work added to aid in that transition is also considered. Our results have applications in entanglement theory, and we find the amount of entanglement required (or gained) when transforming one pure entangled state into any other.

Topological phases of matter are a potential platform for the storage and processing of quantum information with intrinsic error rates that decrease exponentially with inverse temperature and with the length scales of the system, such as the distance between quasiparticles. However, it is less well understood how error rates depend on the speed with which non-Abelian quasiparticles are braided. In general, diabatic corrections to the holonomy or Berry’s matrix vanish at least inversely with the length of time for the braid, with faster decay occurring as the time dependence is made smoother. We show that such corrections will not affect quantum information encoded in topological degrees of freedom, unless they involve the creation of topologically nontrivial quasiparticles. Moreover, we show how measurements that detect unintentionally created quasiparticles can be used to control this source of error.

Recent improvements in the control of quantum systems make it seem feasible to finally build a quantum computer within a decade. While it has been shown that such a quantum computer can in principle solve certain small electronic structure problems and idealized model Hamiltonians, the highly relevant problem of directly solving a complex correlated material appears to require a prohibitive amount of resources. Here, we show that by using a hybrid quantum-classical algorithm that incorporates the power of a small quantum computer into a framework of classical embedding algorithms, the electronic structure of complex correlated materials can be efficiently tackled using a quantum computer. In our approach, the quantum computer solves a small effective quantum impurity problem that is self-consistently determined via a feedback loop between the quantum and classical computation. Use of a quantum computer enables much larger and more accurate simulations than with any known classical algorithm, and will allow many open questions in quantum materials to be resolved once a small quantum computer with around 100 logical qubits becomes available.

The art of imparting information onto a light wave by optical signal modulation is fundamental to all forms of optical communication. Among many schemes, direct modulation of laser diodes stands out as a simple, robust, and cost-effective method. However, the simultaneous changes in intensity, frequency, and phase have prevented its application in the field of secure quantum communication. Here, we propose and experimentally demonstrate a directly phase-modulated light source which overcomes the main disadvantages associated with direct modulation and is suitable for diverse applications such as coherent communications and quantum cryptography. The source separates the tasks of phase preparation and pulse generation between a pair of semiconductor lasers leading to very pure phase states. Moreover, the cavity-enhanced electro-optic effect enables the first example of subvolt half-wave phase modulation at high signal rates. The source is compact, stable, and versatile, and we show its potential to become the standard transmitter for future quantum communication networks based on attenuated laser pulses.

There are two general requirements to harness the computational power of quantum mechanics: the ability to manipulate the evolution of an isolated system and the ability to faithfully extract information from it. Quantum error correction and simulation often make a more exacting demand: the ability to perform nondestructive measurements of specific correlations within that system. We realize such measurements by employing a protocol adapted from Nigg and Girvin [Phys. Rev. Lett. 110, 243604 (2013)], enabling real-time selection of arbitrary register-wide Pauli operators. Our implementation consists of a simple circuit quantum electrodynamics module of four highly coherent 3D transmon qubits, collectively coupled to a high-$Q$ superconducting microwave cavity. As a demonstration, we enact all seven nontrivial subset-parity measurements on our three-qubit register. For each, we fully characterize the realized measurement by analyzing the detector (observable operators) via quantum detector tomography and by analyzing the quantum backaction via conditioned process tomography. No single quantity completely encapsulates the performance of a measurement, and standard figures of merit have not yet emerged. Accordingly, we consider several new fidelity measures for both the detector and the complete measurement process. We measure all of these quantities and report high fidelities, indicating that we are measuring the desired quantities precisely and that the measurements are highly nondemolition. We further show that both results are improved significantly by an additional error-heralding measurement. The analyses we present here form a useful basis for the future characterization and validation of quantum measurements, anticipating the demands of emerging quantum technologies.

It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation. Widely overlooked, however, is the possibility of nontransversal, yet still fault-tolerant, gates that work directly on small quantum codes. Here, we demonstrate precisely the existence of such gates. In particular, we show how the limits of nontransversality can be overcome by performing rounds of intermediate error correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement. Moreover, the logical gates we construct, the most prominent examples being Toffoli and controlled-controlled-$Z$, often complete universal gate sets on their codes. We detail such universal constructions for the smallest quantum codes, the 5-qubit and 7-qubit codes, and then proceed to generalize the approach. One remarkable result of this generalization is that any nondegenerate stabilizer code with a complete set of fault-tolerant single-qubit Clifford gates has a universal set of fault-tolerant gates. Another is the interaction of logical qubits across different stabilizer codes, which, for instance, implies a broadly applicable method of code switching.

Entangling two remote quantum systems that never interact directly is an essential primitive in quantum information science and forms the basis for the modular architecture of quantum computing. When protocols to generate these remote entangled pairs rely on using traveling single-photon states as carriers of quantum information, they can be made robust to photon losses, unlike schemes that rely on continuous variable states. However, efficiently detecting single photons is challenging in the domain of superconducting quantum circuits because of the low energy of microwave quanta. Here, we report the realization of a robust form of concurrent remote entanglement based on a novel microwave photon detector implemented in the superconducting circuit quantum electrodynamics platform of quantum information. Remote entangled pairs with a fidelity of $0.57\pm 0.01$ are generated at 200 Hz. Our experiment opens the way for the implementation of the modular architecture of quantum computation with superconducting qubits.

Rayleigh’s criterion for resolving two incoherent point sources has been the most influential measure of optical imaging resolution for over a century. In the context of statistical image processing, violation of the criterion is especially detrimental to the estimation of the separation between the sources, and modern far-field superresolution techniques rely on suppressing the emission of close sources to enhance the localization precision. Using quantum optics, quantum metrology, and statistical analysis, here we show that, even if two close incoherent sources emit simultaneously, measurements with linear optics and photon counting can estimate their separation from the far field almost as precisely as conventional methods do for isolated sources, rendering Rayleigh’s criterion irrelevant to the problem. Our results demonstrate that superresolution can be achieved not only for fluorophores but also for stars.

Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits, as errors can be fully characterized. For multiqubit operations, though, this is no longer the case, as in the most general case, analyzing the effect of the operation on the system requires a full state tomography for which resources scale exponentially with the system size. Furthermore, in recent experiments, additional electronic levels beyond the two-level system encoding the qubit have been used to enhance the capabilities of quantum-information processors, which additionally increases the number of parameters that need to be controlled. For the optimization of the experimental system for a given task (e.g., a quantum algorithm), one has to find a satisfactory error model and also efficient observables to estimate the parameters of the model. In this manuscript, we demonstrate a method to optimize the encoding procedure for a small quantum error correction code in the presence of unknown but constant phase shifts. The method, which we implement here on a small-scale linear ion-trap quantum computer, is readily applicable to other AMO platforms for quantum-information processing.

A universal quantum computer requires a full set of basic quantum gates. With Majorana bound states one can form all necessary quantum gates in a topologically protected way, bar one. In this paper, we present a scheme that achieves the missing, so-called, $\pi /8$ magic phase gate without the need of fine-tuning for distinct physical realizations. The scheme is based on the manipulation of geometric phases described by a universal protocol and converges exponentially with the number of steps in the geometric path. Furthermore, our magic gate proposal relies on the most basic hardware previously suggested for topologically protected gates, and can be extended to an any-phase gate, where $\pi /8$ is substituted by any $\alpha$.

Quantum annealing (QA) has been proposed as a quantum enhanced optimization heuristic exploiting tunneling. Here, we demonstrate how finite-range tunneling can provide considerable computational advantage. For a crafted problem designed to have tall and narrow energy barriers separating local minima, the D-Wave 2X quantum annealer achieves significant runtime advantages relative to simulated annealing (SA). For instances with 945 variables, this results in a time-to-99%-success-probability that is $\sim 10^8$ times faster than SA running on a single processor core. We also compare physical QA with the quantum Monte Carlo algorithm, an algorithm that emulates quantum tunneling on classical processors. We observe a substantial constant overhead against physical QA: D-Wave 2X again runs up to $\sim 10^8$ times faster than an optimized implementation of the quantum Monte Carlo algorithm on a single core. We note that there exist heuristic classical algorithms that can solve most instances of Chimera structured problems in a time scale comparable to the D-Wave 2X. However, it is well known that such solvers will become ineffective for sufficiently dense connectivity graphs. To investigate whether finite-range tunneling will also confer an advantage for problems of practical interest, we conduct numerical studies on binary optimization problems that cannot yet be represented on quantum hardware. For random instances of the number partitioning problem, we find numerically that algorithms designed to simulate QA scale better than SA. We discuss the implications of these findings for the design of next-generation quantum annealers.

We report the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation. We use a programmable array of superconducting qubits to compute the energy surface of molecular hydrogen using two distinct quantum algorithms. First, we experimentally execute the unitary coupled cluster method using the variational quantum eigensolver. Our efficient implementation predicts the correct dissociation energy to within chemical accuracy of the numerically exact result. Second, we experimentally demonstrate the canonical quantum algorithm for chemistry, which consists of Trotterization and quantum phase estimation. We compare the experimental performance of these approaches to show clear evidence that the variational quantum eigensolver is robust to certain errors. This error tolerance inspires hope that variational quantum simulations of classically intractable molecules may be viable in the near future.

We construct a new class of quantum error-correcting codes for a bosonic mode, which are advantageous for applications in quantum memories, communication, and scalable computation. These “binomial quantum codes” are formed from a finite superposition of Fock states weighted with binomial coefficients. The binomial codes can exactly correct errors that are polynomial up to a specific degree in bosonic creation and annihilation operators, including amplitude damping and displacement noise as well as boson addition and dephasing errors. For realistic continuous-time dissipative evolution, the codes can perform approximate quantum error correction to any given order in the time step between error detection measurements. We present an explicit approximate quantum error recovery operation based on projective measurements and unitary operations. The binomial codes are tailored for detecting boson loss and gain errors by means of measurements of the generalized number parity. We discuss optimization of the binomial codes and demonstrate that by relaxing the parity structure, codes with even lower unrecoverable error rates can be achieved. The binomial codes are related to existing two-mode bosonic codes, but offer the advantage of requiring only a single bosonic mode to correct amplitude damping as well as the ability to correct other errors. Our codes are similar in spirit to “cat codes” based on superpositions of the coherent states but offer several advantages such as smaller mean boson number, exact rather than approximate orthonormality of the code words, and an explicit unitary operation for repumping energy into the bosonic mode. The binomial quantum codes are realizable with current superconducting circuit technology, and they should prove useful in other quantum technologies, including bosonic quantum memories, photonic quantum communication, and optical-to-microwave up- and down-conversion.

We propose examples of a hybrid quantum-classical simulation where a classical computer assisted by a small quantum processor can efficiently simulate a larger quantum system. First, we consider sparse quantum circuits such that each qubit participates in $O(1)$ two-qubit gates. It is shown that any sparse circuit on $n+k$ qubits can be simulated by sparse circuits on $n$ qubits and a classical processing that takes time $2^{O(k)}\mathrm{poly}(n)$. Second, we study Pauli-based computation (PBC), where allowed operations are nondestructive eigenvalue measurements of $n$-qubit Pauli operators. The computation begins by initializing each qubit in the so-called magic state. This model is known to be equivalent to the universal quantum computer. We show that any PBC on $n+k$ qubits can be simulated by PBCs on $n$ qubits and a classical processing that takes time $2^{O(k)}\mathrm{poly}(n)$. Finally, we propose a purely classical algorithm that can simulate a PBC on $n$ qubits in a time $2^{\alpha n}\mathrm{poly}(n)$, where $\alpha \approx 0.94$. This improves upon the brute-force simulation method, which takes time $2^n\mathrm{poly}(n)$. Our algorithm exploits the fact that $n$-fold tensor products of magic states admit a low-rank decomposition into $n$-qubit stabilizer states.

The realization of a network of quantum registers is an outstanding challenge in quantum science and technology. We experimentally investigate a network node that consists of a single nitrogen-vacancy center electronic spin hyperfine coupled to nearby nuclear spins. We demonstrate individual control and readout of five nuclear spin qubits within one node. We then characterize the storage of quantum superpositions in individual nuclear spins under repeated application of a probabilistic optical internode entangling protocol. We find that the storage fidelity is limited by dephasing during the electronic spin reset after failed attempts. By encoding quantum states into a decoherence-protected subspace of two nuclear spins, we show that quantum coherence can be maintained for over 1000 repetitions of the remote entangling protocol. These results and insights pave the way towards remote entanglement purification and the realization of a quantum repeater using nitrogen-vacancy center quantum-network nodes.