By how much must the communication complexity of a function increase if we demand that the parties not only correctly compute the function but also return all registers (other than the one containing the answer) to their initial states at the end of the communication protocol? Protocols that achieve this are referred to as clean and the associated cost as the clean communication complexity. Here we present clean protocols for calculating the inner product of two $n$-bit strings, showing that (in the absence of preshared entanglement) at most $n+3$ qubits or $n+O(\sqrt{n})$ bits of communication are required. The quantum protocol provides inspiration for obtaining the optimal method to implement distributed cnot gates in parallel while minimizing the amount of quantum communication. For more general functions, we show that nearly all Boolean functions require close to $2n$ bits of classical communication to compute and close to $n$ qubits if the parties have access to preshared entanglement. Both of these values are maximal for their respective paradigms.

We provide a general construction of quantum generalized master equations with a memory kernel leading to well-defined, that is, completely positive and trace-preserving, time evolutions. The approach builds on an operator generalization of memory kernels appearing in the description of non-Markovian classical processes and puts into evidence the nonuniqueness of the relationship arising due to the typical quantum issue of operator ordering. The approach provides a physical interpretation of the structure of the kernels, and its connection with the classical viewpoint allows for a trajectory description of the dynamics. Previous apparently unrelated results are now connected in a unified framework, which further allows us to phenomenologically construct a large class of non-Markovian evolutions taking as the starting point collections of time-dependent maps and instantaneous transformations describing the microscopic interaction dynamics.

Recently, the physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however, for reasons of practical relevance, the crucial question remained open regarding whether this can be accomplished under the minimal conditions necessary for the task. Namely, is it possible to achieve randomness amplification using only two no-signaling components and in a situation where the violation of a Bell inequality only guarantees that some outcomes of the device for specific inputs exhibit randomness? Here, we solve this question and present a device-independent protocol for randomness amplification of Santha-Vazirani sources using a device consisting of two nonsignaling components. We show that the protocol can amplify any such source that is not fully deterministic into a fully random source while tolerating a constant noise rate and prove the composable security of the protocol against general no-signaling adversaries. Our main innovation is the proof that even the partial randomness certified by the two-party Bell test [a single input-output pair (${\mathbf{u}}^{*}$, ${\mathbf{x}}^{*}$) for which the conditional probability $P({\mathbf{x}}^{*}|{\mathbf{u}}^{*})$ is bounded away from 1 for all no-signaling strategies that optimally violate the Bell inequality] can be used for amplification. We introduce the methodology of a partial tomographic procedure on the empirical statistics obtained in the Bell test that ensures that the outputs constitute a linear min-entropy source of randomness. As a technical novelty that may be of independent interest, we prove that the Santha-Vazirani source satisfies an exponential concentration property given by a recently discovered generalized Chernoff bound.

The weak-value-based metrology is very promising and has attracted a lot of attention in recent years because of its remarkable ability in signal amplification. However, it is suggested that the upper limit of the precision of this metrology cannot exceed that of classical metrology because of the low sample size caused by the probe loss during postselection. Nevertheless, a recent proposal shows that this probe loss can be reduced by the power-recycling technique, and thus enhance the precision of weak-value-based metrology. Here we experimentally realize the power-recycled interferometric weak-value-based beam-deflection measurement and obtain the amplitude of the detected signal and white noise by discrete Fourier transform. Our results show that the detected signal can be strengthened by power recycling, and the power-recycled weak-value-based signal-to-noise ratio can surpass the upper limit of the classical scheme, corresponding to the shot-noise limit. This work sheds light on higher precision metrology and explores the real advantage of the weak-value-based metrology over classical metrology.

We experimentally show that nonlocality can be produced from single-particle contextuality by using two-particle correlations which do not violate any Bell inequality by themselves. This demonstrates that nonlocality can come from an a priori different simpler phenomenon, and connects contextuality and nonlocality, the two critical resources for, respectively, quantum computation and secure communication. From the perspective of quantum information, our experiment constitutes a proof of principle that quantum systems can be used simultaneously for both quantum computation and secure communication.

Trapped ions are a promising tool for building a large-scale quantum computer. However, the number of required radiation fields for the realization of quantum gates in any proposed ion-based architecture scales with the number of ions within the quantum computer, posing a major obstacle when imagining a device with millions of ions. Here, we present a fundamentally different approach for trapped-ion quantum computing where this detrimental scaling vanishes. The method is based on individually controlled voltages applied to each logic gate location to facilitate the actual gate operation analogous to a traditional transistor architecture within a classical computer processor. To demonstrate the key principle of this approach we implement a versatile quantum gate method based on long-wavelength radiation and use this method to generate a maximally entangled state of two quantum engineered clock qubits with fidelity 0.985(12). This quantum gate also constitutes a simple-to-implement tool for quantum metrology, sensing, and simulation.

We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This allows us to prove general results on the monogamy of entanglement and steering quantifiers in continuous variable systems with an arbitrary number of modes per party. A powerful hierarchical relation for correlation measures based on the log-determinant of covariance matrices is further established for all Gaussian states, which has no counterpart among quantities based on the conventional von Neumann entropy.

Dynamic nuclear polarization (DNP) is an attractive method for initializing nuclear spins that are strongly coupled to optically active electron spins because it functions at room temperature and does not require strong magnetic fields. In this Letter, we theoretically demonstrate that DNP, with near-unity polarization efficiency, can be generally realized in weakly coupled electron spin-nuclear spin systems. Furthermore, we theoretically and experimentally show that the nuclear spin polarization can be reversed by magnetic field variations as small as 0.8 Gauss. This mechanism offers new avenues for DNP-based sensors and radio-frequency free control of nuclear qubits.

A tacit assumption underlying most phase field models of nonequilibrium phase transformations is that of scale separation. Stochastic order parameter field theories utilize noise to separate atomic-scale fluctuations from the slowly varying fields that describe microstructure patterns. The mesoscale distribution of such stochastic variables is generally assumed to follow Gaussian statistics, with their magnitude following fluctuation-dissipation relations. However, there is still much debate about how atomic-scale fluctuations map onto the mesoscale upon coarse graining of microscopic theories. This Letter studies interface fluctuations in the phase field crystal (PFC) model and proposes a self-consistent method for relating how the effective noise strength and spectral filtering of the noise in the PFC model, and similar types of microscopic models, should be defined so as to attain the spectrum of mesoscale capillary fluctuations quantitatively.

Tensor network states and specifically matrix-product states have proven to be a powerful tool for simulating ground states of strongly correlated spin models. Recently, they have also been applied to interacting fermionic problems, specifically in the context of quantum chemistry. A new freedom arising in such nonlocal fermionic systems is the choice of orbitals, it being far from clear what choice of fermionic orbitals to make. In this Letter, we propose a way to overcome this challenge. We suggest a method intertwining the optimization over matrix product states with suitable fermionic Gaussian mode transformations. The described algorithm generalizes basis changes in the spirit of the Hartree-Fock method to matrix-product states, and provides a black box tool for basis optimization in tensor network methods.

Certifying entanglement of a multipartite state is generally considered a demanding task. Since an $N$ qubit state is parametrized by $4^N-1$ real numbers, one might naively expect that the measurement effort of generic entanglement detection also scales exponentially with $N$. Here, we introduce a general scheme to construct efficient witnesses requiring a constant number of measurements independent of the number of qubits for states like, e.g., Greenberger-Horne-Zeilinger states, cluster states, and Dicke states. For four qubits, we apply this novel method to experimental realizations of the aforementioned states and prove genuine four-partite entanglement with two measurement settings only.

The low-energy spectra of many body systems on a torus, of finite size $L$, are well understood in magnetically ordered and gapped topological phases. However, the spectra at quantum critical points separating such phases are largely unexplored for $(2+1)\mathrm{D}$ systems. Using a combination of analytical and numerical techniques, we accurately calculate and analyze the low-energy torus spectrum at an Ising critical point which provides a universal fingerprint of the underlying quantum field theory, with the energy levels given by universal numbers times $1/L$. We highlight the implications of a neighboring topological phase on the spectrum by studying the Ising* transition (i.e. the transition between a $Z_2$ topological phase and a trivial paramagnet), in the example of the toric code in a longitudinal field, and advocate a phenomenological picture that provides qualitative insight into the operator content of the critical field theory.

Feynman’s prescription for a quantum simulator was to find a Hamitonian for a system that could serve as a computer. The Pólya-Hilbert conjecture proposed the demonstration of Riemann’s hypothesis through the spectral decomposition of Hermitian operators. Here we study the problem of decomposing a number into its prime factors, $N=xy$, using such a simulator. First, we derive the Hamiltonian of the physical system that simulates a new arithmetic function formulated for the factorization problem that represents the energy of the computer. This function rests alone on the primes below $\sqrt{N}$. We exactly solve the spectrum of the quantum system without resorting to any external ad hoc conditions, also showing that it obtains, for $x\ll \sqrt{N}$, a prediction of the prime counting function that is almost identical to Riemann’s $R(x)$ function. It has no counterpart in analytic number theory, and its derivation is a consequence of the quantum theory of the simulator alone.

According to Landauer’s principle, erasing a memory requires an average work of at least $kT\ln 2$ per bit. Recent experiments have confirmed this prediction for a one-bit memory represented by a symmetric double-well potential. Here, we present an experimental study of erasure for a memory encoded in an asymmetric double-well potential. Using a feedback trap, we find that the average work to erase can be less than $kT\ln 2$. Surprisingly, erasure protocols that differ subtly give measurably different values for the asymptotic work, a result we explain by showing that one protocol is symmetric with the respect to time reversal, while the other is not. The differences between the protocols help clarify the distinctions between thermodynamic and logical reversibility.