Unscrambling Quantum Information with Clifford Decoders.

Quantum information scrambling is a unitary process that destroys local correlations and spreads information throughout the system, effectively hiding it in nonlocal degrees of freedom. In principle, unscrambling this information is possible with perfect knowledge of the unitary dynamics [B. Yoshida and A. Kitaev, arXiv:1710.03363.]. However, this Letter demonstrates that even without previous knowledge of the internal dynamics, information can be efficiently decoded from an unknown scrambler by monitoring the outgoing information of a local subsystem. We show that rapidly mixing but not fully chaotic scramblers can be decoded using Clifford decoders. The essential properties of a scrambling unitary can be efficiently recovered, even if the process is exponentially complex. Specifically, we establish that a unitary operator composed of t non-Clifford gates admits a Clifford decoder up to t≤n.

Quantum Algorithm for Petz Recovery Channels and Pretty Good Measurements.

The Petz recovery channel plays an important role in quantum information science as an operation that approximately reverses the effect of a quantum channel. The pretty good measurement is a special case of the Petz recovery channel, and it allows for near-optimal state discrimination. A hurdle to the experimental realization of these vaunted theoretical tools is the lack of a systematic and efficient method to implement them. This Letter sets out to rectify this lack: Using the recently developed tools of quantum singular value transformation and oblivious amplitude amplification, we provide a quantum algorithm to implement the Petz recovery channel when given the ability to perform the channel that one wishes to reverse. Moreover, we prove that, in some sense, our quantum algorithm's usage of the channel implementation cannot be improved by more than a quadratic factor. Our quantum algorithm also provides a procedure to perform pretty good measurements when given multiple copies of the states that one is trying to distinguish.

Quantum Maxwell's demon assisted by non-Markovian effects.

Maxwell's demon is the quintessential example of information control, which is necessary for designing quantum devices. In thermodynamics, the demon is an intelligent being who utilizes the entropic nature of information to sort excitations between reservoirs, thus lowering the total entropy. So far, implementations of Maxwell's demon have largely been limited to Markovian baths. In our work, we study the degree to which such a demon may be assisted by non-Markovian effects using a superconducting circuit platform. The setup is two baths connected by a demon-controlled qutrit interface, allowing the transfer of excitations only if the overall entropy of the two baths is lowered. The largest entropy reduction is achieved in a non-Markovian regime and, importantly, due to non-Markovian effects, the demon performance can be optimized through proper timing. Our results demonstrate that non-Markovian effects can be exploited to boost the information transfer rate in quantum Maxwell demons.

Resonant quantum principal component analysis.

Principal component analysis (PCA) has been widely adopted to reduce the dimension of data while preserving the information. The quantum version of PCA (qPCA) can be used to analyze an unknown low-rank density matrix by rapidly revealing the principal components of it, i.e., the eigenvectors of the density matrix with the largest eigenvalues. However, because of the substantial resource requirement, its experimental implementation remains challenging. Here, we develop a resonant analysis algorithm with minimal resource for ancillary qubits, in which only one frequency-scanning probe qubit is required to extract the principal components. In the experiment, we demonstrate the distillation of the first principal component of a 4 × 4 density matrix, with an efficiency of 86.0% and a fidelity of 0.90. This work shows the speedup ability of quantum algorithm in dimension reduction of data and thus could be used as part of quantum artificial intelligence algorithms in the future.

Quantum advantage in postselected metrology.

In every parameter-estimation experiment, the final measurement or the postprocessing incurs a cost. Postselection can improve the rate of Fisher information (the average information learned about an unknown parameter from a trial) to cost. We show that this improvement stems from the negativity of a particular quasiprobability distribution, a quantum extension of a probability distribution. In a classical theory, in which all observables commute, our quasiprobability distribution is real and nonnegative. In a quantum-mechanically noncommuting theory, nonclassicality manifests in negative or nonreal quasiprobabilities. Negative quasiprobabilities enable postselected experiments to outperform optimal postselection-free experiments: postselected quantum experiments can yield anomalously large information-cost rates. This advantage, we prove, is unrealizable in any classically commuting theory. Finally, we construct a preparation-and-postselection procedure that yields an arbitrarily large Fisher information. Our results establish the nonclassicality of a metrological advantage, leveraging our quasiprobability distribution as a mathematical tool.

Emergent Prethermalization Signatures in Out-of-Time Ordered Correlations.

How a many-body quantum system thermalizes-or fails to do so-under its own interaction is a fundamental yet elusive concept. Here we demonstrate nuclear magnetic resonance observation of the emergence of prethermalization by measuring out-of-time ordered correlations. We exploit Hamiltonian engineering techniques to tune the strength of spin-spin interactions and of a transverse magnetic field in a spin chain system, as well as to invert the Hamiltonian sign to reveal out-of-time ordered correlations. At large fields, we observe an emergent conserved quantity due to prethermalization, which can be revealed by an early saturation of correlations. Our experiment not only demonstrates a new protocol to measure out-of-time ordered correlations, but also provides new insights in the study of quantum thermodynamics.

Entropic Energy-Time Uncertainty Relation.

Energy-time uncertainty plays an important role in quantum foundations and technologies, and it was even discussed by the founders of quantum mechanics. However, standard approaches (e.g., Robertson's uncertainty relation) do not apply to energy-time uncertainty because, in general, there is no Hermitian operator associated with time. Following previous approaches, we quantify time uncertainty by how well one can read off the time from a quantum clock. We then use entropy to quantify the information-theoretic distinguishability of the various time states of the clock. Our main result is an entropic energy-time uncertainty relation for general time-independent Hamiltonians, stated for both the discrete-time and continuous-time cases. Our uncertainty relation is strong, in the sense that it allows for a quantum memory to help reduce the uncertainty, and this formulation leads us to reinterpret it as a bound on the relative entropy of asymmetry. Because of the operational relevance of entropy, we anticipate that our uncertainty relation will have information-processing applications.

Quantum Generative Adversarial Learning.

Generative adversarial networks represent a powerful tool for classical machine learning: a generator tries to create statistics for data that mimics those of a true data set, while a discriminator tries to discriminate between the true and fake data. The learning process for generator and discriminator can be thought of as an adversarial game, and under reasonable assumptions, the game converges to the point where the generator generates the same statistics as the true data and the discriminator is unable to discriminate between the true and the generated data. This Letter introduces the notion of quantum generative adversarial networks, where the data consist either of quantum states or of classical data, and the generator and discriminator are equipped with quantum information processors. We show that the unique fixed point of the quantum adversarial game also occurs when the generator produces the same statistics as the data. Neither the generator nor the discriminator perform quantum tomography; linear programing drives them to the optimal. Since quantum systems are intrinsically probabilistic, the proof of the quantum case is different from-and simpler than-the classical case. We show that, when the data consist of samples of measurements made on high-dimensional spaces, quantum adversarial networks may exhibit an exponential advantage over classical adversarial networks.

Generalized Entanglement Entropies of Quantum Designs.

The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high energy and many-body physics. This Letter investigates the interplay between the degrees of entanglement and randomness in pure states and unitary channels. We reveal strong connections between designs (distributions of states or unitaries that match certain moments of the uniform Haar measure) and generalized entropies (entropic functions that depend on certain powers of the density operator), by showing that Rényi entanglement entropies averaged over designs of the same order are almost maximal. This strengthens the celebrated Page's theorem. Moreover, we find that designs of an order that is logarithmic in the dimension maximize all Rényi entanglement entropies and so are completely random in terms of the entanglement spectrum. Our results relate the behaviors of Rényi entanglement entropies to the complexity of scrambling and quantum chaos in terms of the degree of randomness, and suggest a generalization of the fast scrambling conjecture.

Photochemical Control of Exciton Superradiance in Light-Harvesting Nanotubes.

Photosynthetic antennae and organic electronic materials use topological, structural, and molecular control of delocalized excitons to enhance and direct energy transfer. Interactions between the transition dipoles of individual chromophore units allow for coherent delocalization across multiple molecular sites. This delocalization, for specific geometries, greatly enhances the transition dipole moment of the lowest energy excitonic state relative to the chromophore and increases its radiative rate, a phenomenon known as superradiance. In this study, we show that ordered, self-assembled light-harvesting nanotubes (LHNs) display excitation-induced photobrightening and photodarkening. These changes in quantum yield arise due to changes in energetic disorder, which in turn increases/decreases excitonic superradiance. Through a combination of experiment and modeling, we show that intense illumination induces different types of chemical change in LHNs that reproducibly alter absorption and fluorescence properties, indicating control over excitonic delocalization. We also show that changes in spectral width and shift can be sensitive measures of system dimensionality, illustrating the mixed 1-2D nature of LHN excitons. Our results demonstrate a path forward for mastery of energetic disorder in an excitonic antenna, with implications for fundamental studies of coherent energy transport.

Programmable dispersion on a photonic integrated circuit for classical and quantum applications.

We demonstrate a large-scale tunable-coupling ring resonator array, suitable for high-dimensional classical and quantum transforms, in a CMOS-compatible silicon photonics platform. The device consists of a waveguide coupled to 15 ring-based dispersive elements with programmable linewidths and resonance frequencies. The ability to control both quality factor and frequency of each ring provides an unprecedented 30 degrees of freedom in dispersion control on a single spatial channel. This programmable dispersion control system has a range of applications, including mode-locked lasers, quantum key distribution, and photon-pair generation. We also propose a novel application enabled by this circuit - high-speed quantum communications using temporal-mode-based quantum data locking - and discuss the utility of the system for performing the high-dimensional unitary optical transformations necessary for a quantum data locking demonstration.

Quantum machine learning.

Fuelled by increasing computer power and algorithmic advances, machine learning techniques have become powerful tools for finding patterns in data. Quantum systems produce atypical patterns that classical systems are thought not to produce efficiently, so it is reasonable to postulate that quantum computers may outperform classical computers on machine learning tasks. The field of quantum machine learning explores how to devise and implement quantum software that could enable machine learning that is faster than that of classical computers. Recent work has produced quantum algorithms that could act as the building blocks of machine learning programs, but the hardware and software challenges are still considerable.

Efficiently Controllable Graphs.

We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that, when a controllable quantum network is described by such a graph and the gaps in eigenfrequencies and in transition frequencies are bounded exponentially in the number of vertices, the network is efficiently controllable, in the sense that universal quantum computation can be performed using a control sequence polynomial in the size of the network while controlling a vanishingly small fraction of subsystems. We show that networks corresponding to finite-dimensional lattices are efficiently controllable and explore generalizations to percolation clusters and random graphs. We show that the classical computational complexity of estimating the ground state of Hamiltonians described by controllable graphs is polynomial in the number of subsystems or qubits.

Resource Destroying Maps.

Resource theory is a widely applicable framework for analyzing the physical resources required for given tasks, such as computation, communication, and energy extraction. In this Letter, we propose a general scheme for analyzing resource theories based on resource destroying maps, which leave resource-free states unchanged but erase the resource stored in all other states. We introduce a group of general conditions that determine whether a quantum operation exhibits typical resource-free properties in relation to a given resource destroying map. Our theory reveals fundamental connections among basic elements of resource theories, in particular, free states, free operations, and resource measures. In particular, we define a class of simple resource measures that can be calculated without optimization, and that are monotone nonincreasing under operations that commute with the resource destroying map. We apply our theory to the resources of coherence and quantum correlations (e.g., discord), two prominent features of nonclassicality.

Gaussian Hypothesis Testing and Quantum Illumination.

Quantum hypothesis testing is one of the most basic tasks in quantum information theory and has fundamental links with quantum communication and estimation theory. In this paper, we establish a formula that characterizes the decay rate of the minimal type-II error probability in a quantum hypothesis test of two Gaussian states given a fixed constraint on the type-I error probability. This formula is a direct function of the mean vectors and covariance matrices of the quantum Gaussian states in question. We give an application to quantum illumination, which is the task of determining whether there is a low-reflectivity object embedded in a target region with a bright thermal-noise bath. For the asymmetric-error setting, we find that a quantum illumination transmitter can achieve an error probability exponent stronger than a coherent-state transmitter of the same mean photon number, and furthermore, that it requires far fewer trials to do so. This occurs when the background thermal noise is either low or bright, which means that a quantum advantage is even easier to witness than in the symmetric-error setting because it occurs for a larger range of parameters. Going forward from here, we expect our formula to have applications in settings well beyond those considered in this paper, especially to quantum communication tasks involving quantum Gaussian channels.

Room-Temperature Micron-Scale Exciton Migration in a Stabilized Emissive Molecular Aggregate.

We report 1.6 ± 1 µm exciton transport in self-assembled supramolecular light-harvesting nanotubes (LHNs) assembled from amphiphillic cyanine dyes. We stabilize LHNs in a sucrose glass matrix, greatly reducing light and oxidative damage and allowing the observation of exciton-exciton annihilation signatures under weak excitation flux. Fitting to a one-dimensional diffusion model, we find an average exciton diffusion constant of 55 ± 20 cm2/s, among the highest measured for an organic system. We develop a simple model that uses cryogenic measurements of static and dynamic energetic disorder to estimate a diffusion constant of 32 cm2/s, in agreement with experiment. We ascribe large exciton diffusion lengths to low static and dynamic energetic disorder in LHNs. We argue that matrix-stabilized LHNS represent an excellent model system to study coherent excitonic transport.

Quantum algorithms for topological and geometric analysis of data.

Extracting useful information from large data sets can be a daunting task. Topological methods for analysing data sets provide a powerful technique for extracting such information. Persistent homology is a sophisticated tool for identifying topological features and for determining how such features persist as the data is viewed at different scales. Here we present quantum machine learning algorithms for calculating Betti numbers--the numbers of connected components, holes and voids--in persistent homology, and for finding eigenvectors and eigenvalues of the combinatorial Laplacian. The algorithms provide an exponential speed-up over the best currently known classical algorithms for topological data analysis.

Quantum enigma machine: Experimentally demonstrating quantum data locking.

Shannon proved in 1949 that information-theoretic-secure encryption is possible if the encryption key is used only once, is random, and is at least as long as the message itself. Notwithstanding, when information is encoded in a quantum system, the phenomenon of quantum data locking allows one to encrypt a message with a shorter key and still provide information-theoretic security. We present one of the first feasible experimental demonstrations of quantum data locking for direct communication and propose a scheme for a quantum enigma machine that encrypts 6 bits per photon (containing messages, new encryption keys, and forward error correction bits) with less than 6 bits per photon of encryption key while remaining information-theoretically secure.

Enhanced energy transport in genetically engineered excitonic networks.

One of the challenges for achieving efficient exciton transport in solar energy conversion systems is precise structural control of the light-harvesting building blocks. Here, we create a tunable material consisting of a connected chromophore network on an ordered biological virus template. Using genetic engineering, we establish a link between the inter-chromophoric distances and emerging transport properties. The combination of spectroscopy measurements and dynamic modelling enables us to elucidate quantum coherent and classical incoherent energy transport at room temperature. Through genetic modifications, we obtain a significant enhancement of exciton diffusion length of about 68% in an intermediate quantum-classical regime.

Quantum brachistochrone curves as geodesics: obtaining accurate minimum-time protocols for the control of quantum systems.

Most methods of optimal control cannot obtain accurate time-optimal protocols. The quantum brachistochrone equation is an exception, and has the potential to provide accurate time-optimal protocols for a wide range of quantum control problems. So far, this potential has not been realized, however, due to the inadequacy of conventional numerical methods to solve it. Here we show that the quantum brachistochrone problem can be recast as that of finding geodesic paths in the space of unitary operators. We expect this brachistochrone-geodesic connection to have broad applications, as it opens up minimal-time control to the tools of geometry. As one such application, we use it to obtain a fast numerical method to solve the brachistochrone problem, and apply this method to two examples demonstrating its power.