Phononic quantum networks feature distinct advantages over photonic networks for on-chip quantum communications, providing a promising platform for developing quantum computers with robust solid-state spin qubits. Large mechanical networks including one-dimensional chains of trapped ions, however, have inherent and well-known scaling problems. In addition, chiral phononic processes, which are necessary for conventional phononic quantum networks, are difficult to implement in a solid-state system. To overcome these seemingly unsolvable obstacles, we have developed a new network architecture that breaks a large mechanical network into small and closed mechanical subsystems. This architecture is implemented in a diamond phononic nanostructure featuring alternating phononic crystal waveguides with specially designed band gaps. The implementation also includes nanomechanical resonators coupled to color centers through phonon-assisted transitions as well as quantum state transfer protocols that can be robust against the thermal environment.

We solve a minimal model for an ergodic phase in a spatially extended quantum many-body system. The model consists of a chain of sites with nearest-neighbor coupling under Floquet time evolution. Quantum states at each site span a $q$-dimensional Hilbert space, and time evolution for a pair of sites is generated by a $q^2\times q^2$ random unitary matrix. The Floquet operator is specified by a quantum circuit of depth two, in which each site is coupled to its neighbor on one side during the first half of the evolution period and to its neighbor on the other side during the second half of the period. We show how dynamical behavior averaged over realizations of the random matrices can be evaluated using diagrammatic techniques and how this approach leads to exact expressions in the large-$q$ limit. We give results for the spectral form factor, relaxation of local observables, bipartite entanglement growth, and operator spreading.

The realization of a coherent interface between distant charge or spin qubits in semiconductor quantum dots is an open challenge for quantum information processing. Here, we demonstrate both resonant (real) and nonresonant (virtual) photon-mediated coherent interactions between double quantum-dot charge qubits separated by several tens of micrometers. We present clear spectroscopic evidence of the resonant collective enhancement of the coupling of two qubits and the resonator. With both qubits in resonance with each other but detuned from the resonator, we observe exchange coupling between the qubits mediated by virtual photons. In both instances, pronounced bright and dark states governed by the symmetry of the qubit-field interaction are found. Our observations are in excellent quantitative agreement with master-equation simulations. The extracted two-qubit coupling strengths significantly exceed the linewidths of the combined resonator-qubit system, which indicates that this approach is viable for creating photon-mediated two-qubit gates in quantum-dot-based systems.

Randomness is a defining element of mixing processes in nature and an essential ingredient to many protocols in quantum information. In this work, we investigate how much randomness is required to transform a given quantum state into another one. Specifically, we ask whether there is a gap between the power of a classical source of randomness compared to that of a quantum one. We provide a complete answer to these questions, by identifying provably optimal protocols for both classical and quantum sources of randomness, based on a dephasing construction. We find that in order to implement any noisy transition on a $d$-dimensional quantum system it is necessary and sufficient to have a quantum source of randomness of dimension $\sqrt{d}$ or a classical one of dimension $d$. Interestingly, coherences provided by quantum states in a source of randomness offer a quadratic advantage. The process we construct has the additional features to be robust and catalytic; i.e., the source of randomness can be reused. Building upon this formal framework, we illustrate that this dephasing construction can serve as a useful primitive in both equilibration and quantum information theory: We discuss applications describing the smallest measurement device, capturing the smallest equilibrating environment allowed by quantum mechanics, or forming the basis for a cryptographic private quantum channel. We complement the exact analysis with a discussion of approximate protocols based on quantum expanders deriving from discrete Weyl systems. This gives rise to equilibrating environments of remarkably small dimension. Our results highlight the curious feature of randomness that residual correlations and dimension can be traded against each other.

We construct quantum circuits that exactly encode the spectra of correlated electron models up to errors from rotation synthesis. By invoking these circuits as oracles within the recently introduced “qubitization” framework, one can use quantum phase estimation to sample states in the Hamiltonian eigenbasis with optimal query complexity $\mathcal{O}(\lambda /\epsilon )$, where $\lambda$ is an absolute sum of Hamiltonian coefficients and $\epsilon$ is the target precision. For both the Hubbard model and electronic structure Hamiltonian in a second quantized basis diagonalizing the Coulomb operator, our circuits have T-gate complexity $\mathcal{O}\mathbf{(}N+\log (1/\epsilon )\mathbf{)}$, where $N$ is the number of orbitals in the basis. This scenario enables sampling in the eigenbasis of electronic structure Hamiltonians with T complexity $\mathcal{O}\mathbf{(}{N}^3/\epsilon +N^2\log (1/\epsilon )/\epsilon \mathbf{)}$. Compared to prior approaches, our algorithms are asymptotically more efficient in gate complexity and require fewer T gates near the classically intractable regime. Compiling to surface code fault-tolerant gates and assuming per-gate error rates of one part in a thousand reveals that one can error correct phase estimation on interesting instances of these problems beyond the current capabilities of classical methods using only about a million superconducting qubits in a matter of hours.

Quantum coherence, present whenever a quantum system exists in a superposition of multiple classically distinct states, marks one of the fundamental departures from classical physics. Quantum coherence has recently been investigated rigorously within a resource-theoretic formalism. However, the finer-grained notion of multilevel coherence, which explicitly takes into account the number of superposed classical states, has remained relatively unexplored. A comprehensive analysis of multilevel coherence, which acts as the single-party analogue to multipartite entanglement, is essential for understanding natural quantum processes as well as for gauging the performance of quantum technologies. Here, we develop the theoretical and experimental groundwork for characterizing and quantifying multilevel coherence. We prove that nontrivial levels of purity are required for multilevel coherence, as there is a ball of states around the maximally mixed state that do not exhibit multilevel coherence in any basis. We provide a simple, necessary, and sufficient analytical criterion to verify the presence of multilevel coherence, which leads to a complete classification of multilevel coherence for three-level systems. We present the robustness of multilevel coherence, a bona fide quantifier, which we show to be numerically computable via semidefinite programming and experimentally accessible via multilevel coherence witnesses, which we introduce and characterize. We further verify and lower bound the robustness of multilevel coherence by performing a semi-device-independent phase discrimination task, which is implemented experimentally with four-level quantum probes in a photonic setup. Our results contribute to understanding the operational relevance of genuine multilevel coherence, also by demonstrating the key role it plays in enhanced phase discrimination—a primitive for quantum communication and metrology—and suggest new ways to reliably and effectively test the quantum behavior of physical systems.

Machine learning with artificial neural networks is revolutionizing science. The most advanced challenges require discovering answers autonomously. In the domain of reinforcement learning, control strategies are improved according to a reward function. The power of neural-network-based reinforcement learning has been highlighted by spectacular recent successes such as playing Go, but its benefits for physics are yet to be demonstrated. Here, we show how a network-based “agent” can discover complete quantum-error-correction strategies, protecting a collection of qubits against noise. These strategies require feedback adapted to measurement outcomes. Finding them from scratch without human guidance and tailored to different hardware resources is a formidable challenge due to the combinatorially large search space. To solve this challenge, we develop two ideas: two-stage learning with teacher and student networks and a reward quantifying the capability to recover the quantum information stored in a multiqubit system. Beyond its immediate impact on quantum computation, our work more generally demonstrates the promise of neural-network-based reinforcement learning in physics.

The scrambling of quantum information in closed many-body systems, as measured by out-of-time-ordered correlation functions (OTOCs), has received considerable attention lately. Recently, a hydrodynamical description of OTOCs has emerged from considering random local circuits. Numerical work suggests that aspects of this description are universal to ergodic many-body systems, even without randomness; a conjectured explanation for this is that while the random circuits have noise built into them, deterministic quantum systems, much like classically chaotic ones, “generate their own noise” and look effectively random on sufficient length scales and timescales. In this paper, we extend this approach to systems with locally conserved quantities (e.g., energy). We do this by considering local random unitary circuits with a conserved U(1) charge and argue, with numerical and analytical evidence, that the presence of a conservation law slows relaxation in both time-ordered and out-of-time-ordered correlation functions; both can have a diffusively relaxing component or “hydrodynamic tail” at late times. We verify the presence of such tails also in a deterministic, periodically driven system. We show that for OTOCs, the combination of diffusive and ballistic components leads to a wave front with a specific asymmetric shape, decaying as a power law behind the front. These results also explain existing numerical investigations in non-noisy ergodic systems with energy conservation. Moreover, we consider OTOCs in Gibbs states, parametrized by a chemical potential $\mu$, and apply perturbative arguments to show that for $\mu \gg 1$ the ballistic front of information spreading can only develop at times exponentially large in $\mu$—with the information traveling diffusively at earlier times. We also develop a new formalism for describing OTOCs and operator spreading, which allows us to interpret the saturation of OTOCs as a form of thermalization on the Hilbert space of operators.

We study the scrambling of local quantum information in chaotic many-body systems in the presence of a locally conserved quantity like charge or energy that moves diffusively. The interplay between conservation laws and scrambling sheds light on the mechanism by which unitary quantum dynamics, which is reversible, gives rise to diffusive hydrodynamics, which is a slow dissipative process. We obtain our results in a random quantum circuit model that is constrained to have a conservation law. We find that a generic spreading operator consists of two parts: (i) a conserved part which comprises the weight of the spreading operator on the local conserved densities, whose dynamics is described by diffusive charge spreading; this conserved part also acts as a source that steadily emits a flux of (ii) nonconserved operators. This emission leads to dissipation in the operator hydrodynamics, with the dissipative process being the slow conversion of operator weight from local conserved operators to nonconserved, at a rate set by the local diffusion current. The emitted nonconserved parts then spread ballistically at a butterfly speed, thus becoming highly nonlocal and, hence, essentially nonobservable, thereby acting as the “reservoir” that facilitates the dissipation. In addition, we find that the nonconserved component develops a power-law tail behind its leading ballistic front due to the slow dynamics of the conserved components. This implies that the out-of-time-order commutator between two initially separated operators grows sharply upon the arrival of the ballistic front, but, in contrast to systems with no conservation laws, it develops a diffusive tail and approaches its asymptotic late-time value only as a power of time instead of exponentially. We also derive these results within an effective hydrodynamic description which contains multiple coupled diffusion equations.

Quantum key distribution allows remote parties to generate information-theoretic secure keys. The bottleneck throttling its real-life applications lies in the limited communication distance and key generation speed, due to the fact that the information carrier can be easily lost in the channel. For all the current implementations, the key rate is bounded by the channel transmission probability $\eta$. Rather surprisingly, by matching the phases of two coherent states and encoding the key information into the common phase, this linear key-rate constraint can be overcome—the secure key rate scales with the square root of the transmission probability $O(\sqrt{\eta })$, as proposed in twin-field quantum key distribution [M. Lucamarini et al. Overcoming the Rate–Distance Limit of Quantum Key Distribution without Quantum Repeaters, Nature (London) 557, 400 (2018)]. To achieve this, we develop an optical-mode-based security proof that is different from the conventional qubit-based security proofs. Furthermore, the proposed scheme is measurement device independent; i.e., it is immune to all possible detection attacks. The simulation result shows that the key rate can even exceed the transmission probability $\eta$ between two communication parties. In addition, we apply phase postcompensation to devise a practical version of the scheme without phase locking, which makes the proposed scheme feasible with the current technology. This means that quantum key distribution can enjoy both sides of the world—practicality and security.

We analyze the production of entropy along nonequilibrium processes in quantum systems coupled to generic environments. First, we show that the entropy production due to final measurements and the loss of correlations obeys a fluctuation theorem in detailed and integral forms. Second, we discuss the decomposition of the entropy production into two positive contributions, adiabatic and nonadiabatic, based on the existence of invariant states of the local dynamics. Fluctuation theorems for both contributions hold only for evolutions verifying a specific condition of quantum origin. We illustrate our results with three relevant examples of quantum thermodynamic processes far from equilibrium.

We show how to accurately study two-dimensional quantum critical phenomena using infinite projected entangled-pair states (iPEPS). We identify the presence of a finite correlation length in the optimal iPEPS approximation to Lorentz-invariant critical states which we use to perform a finite correlation length scaling analysis to determine critical exponents. This is analogous to the one-dimensional finite entanglement scaling with infinite matrix product states. We provide arguments why this approach is also valid in 2D by identifying a class of states that, despite obeying the area law of entanglement, seems hard to describe with iPEPS. We apply these ideas to interacting spinless fermions on a honeycomb lattice and obtain critical exponents which are in agreement with quantum Monte Carlo results. Furthermore, we introduce a new scheme to locate the critical point without the need of computing higher-order moments of the order parameter. Finally, we also show how to obtain an improved estimate of the order parameter in gapless systems, with the 2D Heisenberg model as an example.

It is vital to minimize the impact of errors for near-future quantum devices that will lack the resources for full fault tolerance. Two quantum error mitigation (QEM) techniques have been introduced recently, namely, error extrapolation [Y. Li and S. C. Benjamin, Phys. Rev. X 7, 021050 (2017); K. Temme et al., Phys. Rev. Lett. 119, 180509 (2017)] and quasiprobability decomposition [K. Temme et al., Phys. Rev. Lett. 119, 180509 (2017)]. To enable practical implementation of these ideas, here we account for the inevitable imperfections in the experimentalist’s knowledge of the error model itself. We describe a protocol for systematically measuring the effect of errors so as to design efficient QEM circuits. We find that the effect of localized Markovian errors can be fully eliminated by inserting or replacing some gates with certain single-qubit Clifford gates and measurements. Finally, having introduced an exponential variant of the extrapolation method we contrast the QEM techniques using exact numerical simulation of up to 19 qubits in the context of a “swap” test circuit. Our optimized methods dramatically reduce the circuit’s output error without increasing the qubit count.

Quantum mechanics implies that a single photon can be in the superposition of two distant spatial modes and enable nonlocal interferences. The most vivid example is the two-photon coalescence on a $50:50$ beam splitter, known as Hong-Ou-Mandel interference. In the past decade, this experiment has been used to characterize the suitability of different single-photon sources for linear optical quantum gates. This characterization alone cannot guarantee the suitability of the photons in a scalable quantum network. As for a deeper insight, we perform a number of nonclassical interference measurements of single photons emitted by a single organic molecule that are optimized by an atomic Faraday filter. Our measurements reveal near unity visibility of the quantum interference, and a one-port correlation measurement proves the ideal Fourier limited nature of our single-photon source. A delayed choice quantum eraser allows us to observe a constructive interference between the photons, and a Hong-Ou-Mandel peak is formed additionally to the commonly observed dip. These experiments comprehensively characterize the involved photons for their use in a future quantum Internet, and they attest to the fully efficient interaction of the molecular photons with a next subsequent quantum node. They can be adapted to other emitters and will allow us to gain insights to their applicability for quantum information processing. We introduce a quality number that describes the photon’s properties for their use in a quantum network; this states that effectively 97% of the utilized molecular photons can be used in a scalable quantum optical system and interact with other quantum nodes. The experiments are based on a hybridization of solid state quantum optics, atomic systems, and all-optical quantum information processing.

Quantum-classical hybrid algorithms are emerging as promising candidates for near-term practical applications of quantum information processors in a wide variety of fields ranging from chemistry to physics and materials science. We report on the experimental implementation of such an algorithm to solve a quantum chemistry problem, using a digital quantum simulator based on trapped ions. Specifically, we implement the variational quantum eigensolver algorithm to calculate the molecular ground-state energies of two simple molecules and experimentally demonstrate and compare different encoding methods using up to four qubits. Furthermore, we discuss the impact of measurement noise as well as mitigation strategies and indicate the potential for adaptive implementations focused on reaching chemical accuracy, which may serve as a cross-platform benchmark for multiqubit quantum simulators.

Local operations assisted by classical communication (LOCC) constitute the free operations in entanglement theory. Hence, the determination of LOCC transformations is crucial for the understanding of entanglement. We characterize here almost all LOCC transformations among pure multipartite multilevel states. Combined with the analogous results for qubit states shown by Gour et al. [J. Math. Phys. (N.Y.) 58, 092204 (2017)], this gives a characterization of almost all local transformations among multipartite pure states. We show that nontrivial LOCC transformations among generic, fully entangled, pure states are almost never possible. Thus, almost all multipartite states are isolated. They can neither be deterministically obtained from local-unitary-inequivalent (LU-inequivalent) states via local operations, nor can they be deterministically transformed to pure, fully entangled LU-inequivalent states. In order to derive this result, we prove a more general statement, namely, that, generically, a state possesses no nontrivial local symmetry. We discuss further consequences of this result for the characterization of optimal, probabilistic single-copy and probabilistic multicopy LOCC transformations and the characterization of LU-equivalence classes of multipartite pure states.

The observation of an unequivocal quantum speedup remains an elusive objective for quantum computing. A more modest goal is to demonstrate a scaling advantage over a class of classical algorithms for a computational problem running on quantum hardware. The D-Wave quantum annealing processors have been at the forefront of experimental attempts to address this goal, given their relatively large numbers of qubits and programmability. A complete determination of the optimal time-to-solution using these processors has not been possible to date, preventing definitive conclusions about the presence of a scaling advantage. The main technical obstacle has been the inability to verify an optimal annealing time within the available range. Here, we overcome this obstacle using a class of problem instances constructed by systematically combining many-spin frustrated loops with few-qubit gadgets exhibiting a tunneling event—a combination that we find to promote the presence of tunneling energy barriers in the relevant semiclassical energy landscape of the full problem—and we observe an optimal annealing time using a D-Wave 2000Q processor over a range spanning up to more than 2000 qubits. We identify the gadgets as being responsible for the optimal annealing time, whose existence allows us to perform an optimal time-to-solution benchmarking analysis. We perform a comparison to several classical algorithms, including simulated annealing, spin-vector Monte Carlo, and discrete-time simulated quantum annealing (SQA), and establish the first example of a scaling advantage for an experimental quantum annealer over classical simulated annealing. Namely, we find that the D-Wave device exhibits certifiably better scaling than simulated annealing, with 95% confidence, over the range of problem sizes that we can test. However, we do not find evidence for a quantum speedup: SQA exhibits the best scaling for annealing algorithms by a significant margin. This is a finding of independent interest, since we associate SQA’s advantage with its ability to transverse energy barriers in the semiclassical energy landscape by mimicking tunneling. Our construction of instance classes with verifiably optimal annealing times opens up the possibility of generating many new such classes based on a similar principle of promoting the presence of energy barriers that can be overcome more efficiently using quantum rather than thermal fluctuations, paving the way for further definitive assessments of scaling advantages using current and future quantum annealing devices.

Causal asymmetry is one of the great surprises in predictive modeling: The memory required to predict the future differs from the memory required to retrodict the past. There is a privileged temporal direction for modeling a stochastic process where memory costs are minimal. Models operating in the other direction incur an unavoidable memory overhead. Here, we show that this overhead can vanish when quantum models are allowed. Quantum models forced to run in the less-natural temporal direction not only surpass their optimal classical counterparts but also any classical model running in reverse time. This holds even when the memory overhead is unbounded, resulting in quantum models with unbounded memory advantage.

Generative modeling, which learns joint probability distribution from data and generates samples according to it, is an important task in machine learning and artificial intelligence. Inspired by probabilistic interpretation of quantum physics, we propose a generative model using matrix product states, which is a tensor network originally proposed for describing (particularly one-dimensional) entangled quantum states. Our model enjoys efficient learning analogous to the density matrix renormalization group method, which allows dynamically adjusting dimensions of the tensors and offers an efficient direct sampling approach for generative tasks. We apply our method to generative modeling of several standard data sets including the Bars and Stripes random binary patterns and the MNIST handwritten digits to illustrate the abilities, features, and drawbacks of our model over popular generative models such as the Hopfield model, Boltzmann machines, and generative adversarial networks. Our work sheds light on many interesting directions of future exploration in the development of quantum-inspired algorithms for unsupervised machine learning, which are promisingly possible to realize on quantum devices.

A remarkable feature of typical ground states of strongly correlated many-body systems is that the entanglement entropy is not an extensive quantity. In one dimension, there exists a proof that a finite correlation length sets a constant upper bound on the entanglement entropy, called the area law. However, the known bound exists only in a hypothetical limit, rendering its physical relevance highly questionable. In this paper, we give a simple proof of the area law for entanglement entropy in one dimension under the condition of exponentially decaying correlations. Our proof dramatically reduces the previously known bound on the entanglement entropy, bringing it into a realistic regime for the first time. The proof is composed of several simple and straightforward steps based on elementary quantum information tools. We discuss the underlying physical picture, based on a renormalization-like construction underpinning the proof, which transforms the entanglement entropy of a continuous region into a sum of mutual information in different length scales and the entanglement entropy at the boundary.