An open question of fundamental importance in thermodynamics is how to describe the fluctuations of work for quantum coherent processes. In the standard approach, based on a projective energy measurement both at the beginning and at the end of the process, the first measurement destroys any initial coherence in the energy basis. Here we seek extensions of this approach which can possibly account for initially coherent states. We consider all measurement schemes to estimate work and require that (i) the difference of average energy corresponds to average work for closed quantum systems and that (ii) the work statistics agree with the standard two-measurement scheme for states with no coherence in the energy basis. We first show that such a scheme cannot exist. Next, we consider the possibility of performing collective measurements on several copies of the state and prove that it is still impossible to simultaneously satisfy requirements (i) and (ii). Nevertheless, improvements do appear, and in particular, we develop a measurement scheme that acts simultaneously on two copies of the state and allows us to describe a whole class of coherent transformations.
Quantum simulation traditionally relies on unitary dynamics, inherently imposing efficiency constraints on the generation of intricate entangled states. In principle, these limitations can be superseded by nonunitary, dynamic circuits. These circuits exploit measurements alongside conditional feed-forward operations, providing a promising approach for long-range entangling gates, higher effective connectivity of near-term hardware, and more efficient state preparations. Here, we explore the utility of shallow dynamic circuits for creating long-range entanglement on large-scale quantum devices. Specifically, we study two tasks: controlled- gate teleportation between up to 101 qubits by feeding forward 99 midcircuit measurement outcomes, and the preparation of Greenberger–Horne–Zeilinger states with genuine entanglement. In the former, we observe that dynamic circuits can outperform their unitary counterparts. In the latter, by tallying instructions of compiled quantum circuits, we provide an error budget detailing the obstacles that must be addressed to unlock the full potential of dynamic circuits. Looking forward, we expect dynamic circuits to be useful for generating long-range entanglement in the near term on large-scale quantum devices. Published by the American Physical Society 2024
In dynamic quantum circuits, classical information from midcircuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful protocols by drastically reducing the resource requirements for certain core algorithmic primitives. In particular, in the case of the n-qubit quantum Fourier transform followed immediately by measurement, the scaling of resource requirements is reduced from O(n^{2}) two-qubit gates in an all-to-all connectivity in the standard unitary formulation to O(n) midcircuit measurements in its dynamic counterpart without any connectivity constraints. Here, we demonstrate the advantage of dynamic quantum circuits for the quantum Fourier transform on IBM's superconducting quantum hardware with certified process fidelities of >50% on up to 16 qubits and >1% on up to 37 qubits, exceeding previous reports across all quantum computing platforms. These results are enabled by our contribution of an efficient method for certifying the process fidelity, as well as of a dynamical decoupling protocol for error suppression during midcircuit measurements and feed forward within a dynamic quantum circuit that we call "feed-forward-compensated dynamical decoupling." Our results demonstrate the advantages of leveraging dynamic circuits in optimizing the compilation of quantum algorithms.
The depth of quantum circuits is a critical factor when running them on state-of-the-art quantum devices owing to their limited coherence times. Reducing circuit depth decreases noise in near-term quantum computations and reduces overall computation time. This also benefits fault-tolerant quantum computations. Here, we show how to reduce the depth of quantum subroutines that typically scale linearly with the number of qubits, such as quantum fan-out and long-range CNOT gates, to a constant depth using mid-circuit measurements and feedforward operations, while only requiring a 1D line topology. We compare our protocols with existing ones to highlight their advantages. Additionally, we verify the feasibility by implementing the measurement-based quantum fan-out gate and long-range CNOT gate on real quantum hardware, demonstrating significant improvements over their unitary implementations.
Increasingly sophisticated quantum computers motivate the exploration of their abilities in certifying genuine quantum phenomena. Here, we demonstrate the power of state-of-the-art IBM quantum computers in correlation experiments inspired by quantum networks. Our experiments feature up to 12 qubits and require the implementation of paradigmatic Bell-State Measurements for scalable entanglement-swapping. First, we demonstrate quantum correlations that defy classical models in up to nine-qubit systems while only assuming that the quantum computer operates on qubits. Harvesting these quantum advantages, we are able to certify 82 basis elements as entangled in a 512-outcome measurement. Then, we relax the qubit assumption and consider quantum nonlocality in a scenario with multiple independent entangled states arranged in a star configuration. We report quantum violations of source-independent Bell inequalities for up to ten qubits. Our results demonstrate the ability of quantum computers to outperform classical limitations and certify scalable entangled measurements.