npj Quantum Information最新文献

Harnessing quantum correlations can enable sensing beyond classical precision limits, with the realization of such sensors poised for transformative impacts across science and engineering. Real devices, however, face the accumulated impacts of noise and architecture constraints, making the design and success of practical quantum sensors challenging. Numerical and theoretical frameworks to optimize and analyze sensing protocols in their entirety are thus crucial for translating quantum advantage into widespread practice. Here, we present an end-to-end variational framework for quantum sensing protocols, where parameterized quantum circuits and neural networks form trainable, adaptive models for quantum sensor dynamics and estimation, respectively. The framework is general and can be adapted towards arbitrary qubit architectures, as we demonstrate with experimentally-relevant ansätze for trapped-ion and photonic systems, and enables to directly quantify the impacts that noise and finite data sampling. End-to-end variational approaches can thus underpin powerful design and analysis tools for practical quantum sensing advantage.

Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. In this work we demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network. We apply quantum inflation methods to data obtained in quantum group encryption experiments, guaranteeing the impossibility of producing the observed results in networks with fewer optical elements. Our results pave the way for scalable methods of obtaining device-independent guarantees on the network structure underlying multipartite quantum protocols.

Quantum generative models provide inherently efficient sampling strategies and thus show promise for achieving an advantage using quantum hardware. In this work, we investigate the barriers to the trainability of quantum generative models posed by barren plateaus and exponential loss concentration. We explore the interplay between explicit and implicit models and losses, and show that using quantum generative models with explicit losses such as the KL divergence leads to a new flavor of barren plateaus. In contrast, the implicit Maximum Mean Discrepancy loss can be viewed as the expectation value of an observable that is either low-bodied and provably trainable, or global and untrainable depending on the choice of kernel. In parallel, we find that solely low-bodied implicit losses cannot in general distinguish high-order correlations in the target data, while some quantum loss estimation strategies can. We validate our findings by comparing different loss functions for modeling data from High-Energy-Physics.

The Kirkwood-Dirac quasiprobability distribution, intimately connected with the quantum correlation function of two observables measured at distinct times, is becoming increasingly relevant for fundamental physics and quantum technologies. This quasiprobability distribution can take non-positive values, and its experimental reconstruction becomes challenging when expectation values of incompatible observables are involved. Here, we use an interferometric scheme aided by an auxiliary system to reconstruct the Kirkwood-Dirac quasiprobability distribution. We experimentally demonstrate this scheme in an electron-nuclear spin system associated with a nitrogen-vacancy center in diamond. By measuring the characteristic function, we reconstruct the quasiprobability distribution of work and analyze the behavior of its first and second moments. Our results clarify the physical meaning of the work quasiprobability distribution in the context of quantum thermodynamics. Finally, we study the uncertainty of measuring the Hamiltonian of the system at two times, via the Robertson-Schrödinger uncertainty relation, for different initial states.

Efficiently mapping quantum circuits onto hardware is integral for the quantum compilation process, wherein a circuit is modified in accordance with a quantum processor’s connectivity. Many techniques currently exist for solving this problem, wherein SWAP-gate overhead is usually prioritized as a cost metric. We reconstitute quantum circuit mapping using tools from quantum information theory, showing that a lower bound, which we dub the lightcone bound, emerges for a circuit executed on hardware. We also develop an initial placement algorithm based on graph similarity search, aiding us in optimally placing circuit qubits onto a device. 600 realistic benchmarks using the IBM Qiskit compiler and a brute-force method are then tested against the lightcone bound, with results unambiguously verifying the veracity of the bound, while permitting trustworthy estimations of minimal overhead in near-term realizations of quantum algorithms. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.

Modeling the electrical response of multi-level quantum systems at finite frequency has been typically performed in the context of two incomplete paradigms: (i) input-output theory, which is valid at any frequency but neglects dynamic losses, and (ii) semiclassical theory, which captures dynamic dissipation effects well but is only accurate at low frequencies. Here, we develop a unifying theory, valid for arbitrary frequencies, that captures both the small-signal quantum behavior and the non-unitary effects introduced by relaxation and dephasing. The theory allows a multi-level system to be described by a universal small-signal equivalent-circuit model, a resonant RLC circuit, whose topology only depends on the number of energy levels. We apply our model to a double-quantum-dot charge qubit and a Majorana qubit, showing the capability to continuously describe the systems from adiabatic to resonant and from coherent to incoherent, suggesting new and realistic experiments for improved quantum state readout. Our model will facilitate the design of hybrid quantum–classical circuits and the simulation of qubit control and quantum state readout.

The nitrogen-vacancy center in diamond is an attractive resource for the generation of remote entangled states owing to its optically addressable and long-lived electronic spin. However, its low native fraction of coherent photon emission, ~3%, undermines the achievable spin-photon entanglement rates. Here, we couple a nitrogen-vacancy center with a narrow extrinsically-broadened linewidth (159 MHz), hosted in a micron-thin membrane, to an open microcavity. The resulting Purcell factor of ~1.8 increases the zero-phonon line fraction to over 44%. Operation in the Purcell regime, together with an efficient collection of the zero-phonon-line photons, allows resonance fluorescence to be detected for the first time without any temporal filtering. We achieve a >10 signal-to-laser background ratio. This selective enhancement of the center’s zero-phonon transitions could increase spin-spin entanglement success probabilities beyond an order of magnitude compared to state-of-the-art implementations, and enable powerful quantum optics techniques such as wave-packet shaping or all-optical spin manipulation.

The ultimate precision in quantum sensing could be achieved using optimal quantum probe states. However, current quantum sensing protocols do not use probe states optimally. Indeed, the calculation of optimal probe states remains an outstanding challenge. Here, we present an algorithm that efficiently calculates a probe state for correlated and uncorrelated measurement strategies. The algorithm involves a conic program, which minimizes a linear objective function subject to conic constraints on a operator-valued variable. Our algorithm outputs a probe state that is a simple function of the optimal variable. We prove that our algorithm finds the optimal probe state for channel estimation problems, even in the multiparameter setting. For many noiseless quantum sensing problems, we prove the optimality of maximally entangled probe states. We also analyze the performance of 3D-field sensing using various probe states. Our work opens the door for a plethora of applications in quantum metrology.

We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.

Much is understood about 1-dimensional spin chains in terms of entanglement properties, physical phases, and integrability. However, the Lie algebraic properties of the Hamiltonians describing these systems remain largely unexplored. In this work, we provide a classification of all Lie algebras generated by the terms of 2-local spin chain Hamiltonians, or so-called dynamical Lie algebras, on 1-dimensional linear and circular lattice structures. We find 17 unique dynamical Lie algebras. Our classification includes some well-known models such as the transverse-field Ising model and the Heisenberg chain, and we also find more exotic classes of Hamiltonians that appear new. In addition to the closed and open spin chains, we consider systems with a fully connected topology, which may be relevant for quantum machine learning approaches. We discuss the practical implications of our work in the context of variational quantum computing, quantum control and the spin chain literature.