184,531 papers in this slice of arXiv.
Jakob Wahl, Alexander Zesar, Philipp Hurdax +9
We present an ion-trap platform on borosilicate glass with an integrated femtosecond-laser-written waveguide for on-chip light delivery. The optical layer is physically separated from the electrode substrate and bonded atop the trap, remaining compatible with silicon-based integration. We engineer single-mode low-loss guidance at 729 nm with tunable mode-field diameter and achieve low-loss curved waveguides down to a radius of curvature of 6 mm. We also extend single-mode operation to a wavelength of 405 nm. The fabrication process is compatible with the industrial fabrication of a single-metal-layer surface-electrode trap, including active fiber alignment and bonding. We validate the platform in a cryogenic trapped-ion system with 40Ca+
Yu Cao
The data processing inequality is a fundamental property that describes the loss of information through noisy channels. A more refined description is characterized by the strong data processing inequality (SDPI). In classical information theory, the tensorization of strong data processing inequality holds for a whole family of f-divergences. However, its quantum counterpart is less known. The tensorization of SDPI was shown only for some special cases previously, and the general understanding about the tensorization property of SDPI for quantum divergences remains open. In this work, we report two negative results: the tensorization property fails for certain quantum chi-square divergences, and it also does not hold for the quantum relative entropy.
Sean Brudney, Connor Burns, Gabriel J. Gregory +4
The trapped-ion optical-metastable-ground (omg) architecture for quantum processors promises the full functionality of two-species experiments, including sympathetic cooling and non-destructive ancilla readout, without the corresponding hardware overhead. We confirm that we can cool a global motional mode of a mixed metastable-ground state Coulomb crystal to the motional ground state via dissipative operations on the ground (g) qubit without disturbing coherence of the metastable (m) qubit. This enables quantum logic spectroscopy to non-destructively readout the state of the m qubit using fluorescence detection of the g qubit. Extensions of these demonstrations to larger system sizes should enable the mitigation of motional heating after ion shuttling and syndrome extraction for quantum error correction, both crucial primitives for future fault-tolerant quantum computers based on trapped ions.
Angelo Gelmini Rodriguez, Louis Nicolas, Théo Sanchez Mejia +6
Entanglement generation between telecommunication photons and matter is central to fibre-based quantum repeaters. Achieving practical communication rates requires multiplexing, which multimode quantum memories can provide. Rare-earth-ion ensembles offer large temporal multimode storage by exploiting the numerous spectral channels within their absorption spectrum. Here, we report on a quantum repeater node comprised of a 171Yb3+:Y2SiO5 multimode quantum memory, featuring a 250 MHz bandwidth and a 76.6 μs lifetime, and a bandwidth-matched entangled photon-pair source. We introduce and validate a quantitative measure of the effective temporal mode capacity using a Schmidt decomposition. With this platform, we demonstrate entanglement between a telecom photon propagating through a 25.3 km fiber spool and a 979 nm photon stored for 125 μs across 16340 temporal modes. Finally, we report a field deployment distributing entanglement over 5.66 km through the Geneva metropolitan fibre network while storing 8235 modes for 63 μs.
Raphaël Mothe, Otfried Gühne
Determining whether a target unitary can be implemented within a prescribed quantum circuit architecture is a fundamental problem in quantum information, with direct implications for optimisation and compilation of quantum circuits, and hardware-efficient quantum computation. While existing synthesis and compilation methods are primarily constructive, they generally do not provide rigorous certificates that a unitary cannot be realised using given implementation resources. Here we introduce a general framework to define quantum circuit architecture witnesses, which certify the incompatibility of a unitary transformation with a specified quantum circuit architecture. We formulate the witness construction as a semidefinite program by maximising the fidelity between the Choi state of the target unitary and those of tested circuits. The resulting witnesses provide practical and quantitative certificates of incompatibility, implying lower bounds on implementation resources such as the gate count or circuit depth, and can also be used experimentally to benchmark quantum devices by certifying that an implemented unitary channel goes beyond the capabilities of a given circuit architecture. For Clifford unitaries, we exploit the stabiliser formalism to reduce the construction to linear programming, enabling both more efficient numerical certification for circuits containing on the order of seven two-qubit gates, and analytical witnesses for some families of architectures made of an arbitrary number of gates.
Vikash Mittal, Tomasz Sowiński
We investigate a discrete-time quantum walk of a three-component quantum particle on a one-dimensional lattice. As coin operators, we employ parameterized rotations generated by the Gell-Mann matrices, which enable systematic tuning of the couplings between the internal components. We analyze how these couplings influence and control the dynamics by systematically exploring the position-space probability distribution across a broad region of the parameter space. To quantify the impact of different inter-component couplings, we further examine the ratio of the mean position to the variance in each half of the lattice. Our results indicates that the system supports a rich variety of transport regimes, ranging from nearly symmetric, rapidly spreading walks to strongly anisotropic dynamics with partial localization. This framework thus provides a new avenue for engineering targeted spreading and trapping behavior in multicomponent discrete-time quantum walks.
Hidetaka Manabe, Hanfeng Gu, Feng Pan
We classically simulate the IBM doped Clifford random circuit sampling experiment, comprising 70 qubits, 70 entangling layers, and 468 inserted T gates. A deterministic temporal-boundary tensor network contraction approach is specifically designed to tackle such open-boundary one-dimensional brickwork circuits with operator-Schmidt-rank-2 entangling gates. For an n-qubit circuit of depth d, the resulting unsliced path evaluates an exact amplitude with contraction width ⌈d/2⌉; Ratcatcher calculations certify that no smaller width is possible for the tested instances. Because one-qubit gates are absorbed without changing the network topology, the width and dense scheduled contraction cost are independent of their values and of the number and placement of T gates. For the IBM instance, its largest intermediate tensor contains 235 complex64 entries (256 times smaller than IBM's estimation), corresponding to a tensor payload of 256 GiB, and is distributed across eight GPUs within a node. Using 32 nodes, with eight NVIDIA H100 GPUs per node, we completed all 2051 amplitude batches corresponding to IBM's published output bitstrings in 37.3 minutes. The resulting probabilities yield a log-XEB estimate of 0.35034 with a 95% interval of [0.29763,0.40305]. Under the Porter--Thomas and scrambled-noise assumptions, this is numerically compatible with IBM's fidelity lower bound; separately, fidelity-weighted resource accounting projects a 583-contraction workload with a 10.6-minute makespan on the same 32 nodes. More broadly, the approach provides a practical diagnostic for experimental outputs and a quantitative tool for designing future doped Clifford sampling experiments.
Jesús Casado-Pascual, Luis Octavio Castaños-Cervantes
Temporal modulation of the measurement rate provides a powerful mechanism for controlling open-system dynamics through measurement backaction. We demonstrate this mechanism in a minimal exactly solvable model of a continuously monitored quantum particle on a switching lattice. We derive exact analytical expressions for the long-time current under both periodic and stochastic switching, revealing a common slow-switching limit and identifying a measurement-induced crossover between Zeno- and anti-Zeno-dominated transport regimes that controls the direction of the current.
Jiqi Li, Jingyi Mei, Wang Fang +1
Ensuring ancilla safety is a critical correctness requirement for quantum compilation, since ancilla qubits are routinely introduced to implement complex operations with fewer gates and reduced depth. However, formally verifying this property is computationally hard due to state-space explosion in the number of qubits, particularly for dirty ancillae, which carry unknown initial states and must be restored after use. We propose an end-to-end verification-and-repair framework that rigorously addresses both clean and dirty ancilla safety. Our core contribution is a two-step reduction strategy: we first prove that verifying an m-qubit dirty ancilla register decomposes into 2m independent clean ancilla safety checks; subsequently, we reduce each clean ancilla safety instance to an algebraic commutativity check against Pauli-Z and Pauli-X operators. This approach yields an efficient and naturally parallel verifier and enables actionable diagnosis by classifying violations into logic errors and phase errors. Leveraging this diagnosis, we further design lightweight repair routines that append local single-qubit rotations to eliminate a broad class of local ancilla faults. We implement the full pipeline in a prototype tool using a dual-backend architecture combining decision diagrams and weighted model counting, and validate it on diverse circuits ranging from arithmetic benchmarks to Grover's algorithm. Our experiments demonstrate scalability to thousands of qubits and show that the proposed repairs effectively improve ancilla safety while preserving circuit functionality.
Jiun-Shiuan Shiu, Chang-Wei Lin, Chi-Ming Yang +2
Memory-assisted quantum networks require photon sources with controllable temporal and correlation properties. The Duan-Lukin-Cirac-Zoller (DLCZ) protocol provides a platform based on spontaneous Raman scattering in atomic ensembles, but a unified predictive theory connecting control parameters to correlations under realistic propagation and noise conditions remains lacking. Here we present a propagation-inclusive open-system quantum theory that retains write-induced population redistribution while combining Heisenberg-Langevin dynamics with Maxwell-Schrödinger propagation. We experimentally validate its key predictions. The theory predicts time-dependent Stokes generation, spin-wave evolution, retrieved anti-Stokes wavepackets, and time-resolved cross-correlations. Experiments confirm robust correlations under retrieval tuning and enhanced correlations for shorter write pulses, consistent with the different scaling of correlated coincidences and accidental backgrounds with the mean spin-wave excitation number. Classically controlled retrieval enables temporal gating and slicing of the anti-Stokes wavepacket, establishing a quantitative framework for correlation engineering in memory-compatible DLCZ photon sources.
Yichi Zhang, Zhenqi Bai, Xu Zhao +3
We propose a controlled-Z gate scheme for Rydberg atoms based on level-crossing-free echoing rapid adiabatic population transfer. We design antisymmetric Rabi frequency pulses and symmetric detuning pulses, enabling the system to completely avoid level-crossing points throughout the evolution, and the dynamical phase is naturally eliminated by the time-reversal symmetry of the double-pulse sequence. We incorporate dissipative effects through the Lindblad master equation. The numerical simulation yields a two-qubit CZ gate fidelity of 0.9999. When the Rabi-frequency fluctuation is within ±2%, and the detuning offset is within ±1%, the fidelity can still remain above 0.999. Under the same dissipative model, the three-qubit CCZ gate achieves a fidelity of 0.999. When a single-parameter fluctuation does not exceed ±3%, the fidelity is always higher than 0.997. Our scheme requires no laser phase jumps or fast switching operations. The zero-area pulse structure suppresses first-order intensity noise, and the symmetric double-pulse sequence avoids spatially resolved laser switching, making it suitable for parallel gate operations in large-scale neutral-atom arrays.
Abdul Sattar Khan, Mehdi Abdi
We introduce an operational measure of nonclassicality for qubit systems based on the violation of Kolmogorov consistency conditions in sequential measurements. In contrast to previous work by Milz et al. Milz-2020, who characterized classicality via NCGD maps, and Sakuldee et al. Sakuldee-2022a, Sakuldee-2022b, who studied quantum correlations under measurement disturbance, our witness explicitly quantifies nonclassicality in terms of the POVM unsharpness parameter az. For projective measurements on an initially diagonal state, the witness vanishes identically, showing that such measurements cannot reveal nonclassicality. However, by generalizing to positive operator-valued measures (POVMs), we find that non-projective measurements can reveal nonclassicality even for diagonal initial states. We derive explicit expressions for the witness for general initial states, including coherences, and show that its maximum value is 1/4, which is a new result achieved for unbiased POVMs, maximal dephasing, and equal initial populations. Our results connect Kolmogorov consistency, Leggett-Garg inequalities, and POVMs, providing an experimentally accessible tool for detecting nonclassicality in qubit systems with potential applications in quantum technology certification.
Tomaž Prosen
Using patch-matrix-product methods, we study two reversible three-state interaction-round-a-face cellular automata introduced by Klobas and Prosen [J. Phys. A 55, 094003 (2022)] - the species-preserving and species-flipping rules - and a coherent quantum deformation interpolating between them. Within an explicit translationally invariant ansatz, the two classical rules share a one-parameter family of quasi-local conservation laws with an auxiliary-dimension-three realization. Every regular member is also the first centered logarithmic derivative of an analytic auxiliary-dimension-two family passing through the identity observable. On the closed span of this family and the three elementary local charges, the only nonzero Euler velocities are ±3/23. Consequently, 3/23 is a rigorous lower bound on the maximal Euler speed in any larger conserved sector. For the species-flipping rule, this value agrees with the reported extrapolated value 0.361 of Klobas and Prosen, strongly supporting completeness of the known sound-active charges. The species-preserving rule admits, in addition, a staggered generating family whose logarithmic derivatives form an infinite tower of strictly local charges. In the quantum deformation, the same algebraic structures yield exact low-bond-dimension invariant states (scar candidates), exponentially long-lived quasi-local quasimodes, and diagonal quasi-local charges that produce a nonzero Mazur bound after projection away from the three elementary local charges.
José Diogo da Costa Jesus, Abhishek Setty, Tommaso Calarco +3
From fluid flow and transport to collective dynamics, numerical simulation of nonlinear partial differential equations underpins modern scientific computing. Extending this capability to quantum computers remains a longstanding challenge because nonlinear and non-Hermitian evolution is fundamentally incompatible with conventional Hamiltonian-based quantum simulation. Here we experimentally realize the time evolution of nonlinear fluid dynamics on a quantum processor using a hybrid variational framework for the viscous and inviscid Burgers equations. Our approach directly encodes the nonlinear dynamics into a variational optimization procedure, avoiding the enlarged linear embeddings and truncation overhead associated with Carleman linearization-based quantum algorithms. We further demonstrate convection-dominated dynamics corresponding to Reynolds numbers of order 102. We encode the governing evolution into parametrized quantum circuits and iteratively reconstruct the time-dependent field through quantum-classical optimization. By introducing a zero-noise extrapolation method without additional circuit-folding overhead, we accurately execute deep error-circuits with entangling-gate counts beyond those typical of Hadamard test circuits. We accurately reconstruct the time evolution across multiple timesteps despite hardware noise and finite device coherence. Our results constitute, to our knowledge, the first experimental realization of nonlinear time propagation on a quantum processor, extending quantum simulation beyond predominantly linear settings and establishing a route toward quantum computation for nonlinear continuum dynamics.
Miriam Backens, Simon Perdrix
Complete sets of graphical rewrite rules enable fully graphical reasoning about quantum computations and have been an area of active research for more than a decade. Many recent applications of the ZX-calculus have made use of the close correspondence between ZX-diagrams and computations in the one-way model of measurement-based quantum computation. In this model, various kinds of flow properties ensure deterministic implementability; for ZX-diagrams, these same properties allow efficient translation into quantum circuits (a problem that is known to be #P-hard in general). Therefore, flow-preserving ZX-calculus rewrite rules are of strong interest. Here, we extend the set of flow-preserving rules appearing in the literature with a few new rules and extensions of existing rules. We then show that the resulting rule set is complete for all flow-preserving translations between ZX-diagrams of appropriate form. The proof employs a manifestly flow-preserving equivalent of circuit extraction, where a diagram with gflow is transformed, using only flow-preserving rewrite rules, into a diagram with causal flow.
Vyom Kulkarni, Mohammed Ali Aamir, Simon Sundelin +1
Efficient detection of single microwave photons is a key capability for emerging quantum technologies. Yet, it remains far less developed than its optical domain counterpart. Realizing detectors that simultaneously achieve high efficiency, low dark counts, and continuous operation has proved challenging. Existing detectors operate cyclically, forcing a trade-off between efficiency and duty cycle. Here, we demonstrate a continuously operated microwave single-photon detector based on a superconducting artificial molecule. In our scheme, an incoming photon is captured by a bright state of the molecule and then transferred to a long-lived dark state via a driven-dissipative process. Photon ``clicks'' are revealed as quantum jumps in the continuously monitored dark state. We observe a cyclic detection efficiency of 0.73, and a continuous detection efficiency of 0.47 over a 5MHz instantaneous bandwidth, with a 1μs temporal resolution and a 15μs dead time. By overcoming the trade-off between efficiency and duty cycle, this approach establishes continuous microwave photon detection for quantum sensing, quantum thermodynamics, and fundamental physics.
Sougata Bhattacharyya, Sovik Roy, Fatih Ozaydin
We investigate how network geometry and excitation sector separately control pairwise entanglement decay in asymmetric multipartite W states. To disentangle these effects, we introduce an analytically tractable N-qubit generalization of the asymmetric Lohmayer geometry and its complementary-excitation partner, yielding inequivalent vertex-base (VB) and base-base (BB) pair classes that can be compared directly with symmetric W-state references. We derive closed-form concurrence dynamics under representative one-sided noise models and find that, within either excitation sector, the VB concurrence has exactly the same noise dependence as the corresponding symmetric reference, preserving a noise-independent proportional advantage wherever both remain entangled. The amplitude-damping reordering previously identified for the three-qubit Lohmayer state is therefore a cross-sector effect rather than an intrinsic fragility of the VB geometry. In contrast, the BB pair exhibits a genuine same-sector structural fragility, with lower entanglement-sudden-death thresholds than the VB pair under depolarizing noise and, in the (N−1)-excitation sector, under amplitude damping. The results establish network geometry, excitation sector, and noise symmetry as distinct ingredients governing pairwise entanglement robustness in asymmetric quantum networks.
Ruo Cheng Huang, Isha Singh Le Xue, Yuxuan Qu +3
How much work can an agent extract from a temporal sequence of quantum states when it can only operate online under causal constraints---deciding which energy extraction method to use with knowledge of what it has observed before? Here, we study this problem in the context of quantum state sequences that are potentially non-Markovian---generated by some underlying hidden Markov machine that the agent cannot observe. Using techniques from dynamic programming and computational mechanics, we present a method to identify the provably optimal agent strategy, with time complexity that scales linearly with sequence length. This motivates us to introduce the maximum work such agents can extract---time-ordered free energy(TOFE)---as a fundamental measure of free energy available in a temporally correlated quantum system subject to causal considerations.
Haotian Ji, Zhangjie Qin, Zheng An +6
Rydberg atom arrays natively encode the maximum-weight independent set (MWIS) problem through the blockade mechanism, so the Boolean circuit satisfiability problem (Circuit-SAT) can be brought onto the platform once it is reduced to MWIS. The conventional encoding of Circuit-SAT in the Rydberg atom array proceeds through conjunctive normal form (CNF) and incurs a substantial atom overhead. We introduce CAMERA (Circuit-SAT Atom-efficient MWIS Encoding for Rydberg Arrays), a method that provides MWIS encodings of Circuit-SAT instances on the king subgraph geometry of the array. CAMERA represents each logic gate as a compact weighted gadget and assembles the gadgets with a placement and routing compiler inspired by very large scale integration (VLSI) design. On random multi-gate benchmarks, the direct encoding route lowers the atom cost relative to the CNF route by an average factor of 22.4±1.8. To demonstrate that the encoding extends from individual weighted gadgets to multi-gate arithmetic blocks, we compile a full adder and a multiplier, verifying each against its complete truth table by exact classical ground state calculations. We further showcase solving a representative Circuit-SAT instance end-to-end, from gate level compilation through a closed-system tensor-network simulation of a hardware-compatible annealing protocol on the encoded 30-atom instance to readout of a satisfying assignment. These results establish a complete encoding and simulation workflow as a proof of principle, and a concrete route toward solving a broader family of combinatorial problems on Rydberg atom arrays.
Harshkumar Oza, Aritra Sarkar, Syed Naqi Abbas +4
As quantum computing progresses from proof-of-principle demonstrations toward practical utility, a significant impediment is the need to augment algorithmic feasibility with system-level optimization across heterogeneous hardware and software stacks. Quantum resource estimation (QRE) plays a central role in this transition, yet existing approaches remain largely compilation-heavy or domain-knowledge-guided symbolic annotations, and tightly coupled to long-term fault-tolerant assumptions, limiting their topical applicability. In this work, we introduce AutoQuREO, an Automated framework for full-stack Quantum Resource Estimation and Optimization. AutoQuREO is built around four core novelties: (i) a flexible, user-defined abstraction of the quantum computing stack; (ii) a modular library of reusable stack components enabling rapid full-stack prototyping; (iii) surrogate modeling of layer-wise resources via algorithmic profiling and neuro-symbolic learning; and (iv) integrated multi-objective optimization that embeds QRE directly into deployment pipelines. Together, these design choices enable AutoQuREO to serve as a digital twin for quantum computing stacks, supporting the tractable exploration of complex design spaces. We demonstrate the capabilities of AutoQuREO through representative co-design case studies, including early-fault-tolerant quantum algorithms, small error correction codes, gate decomposition and variational training of parametric quantum circuits. These examples illustrate how AutoQuREO enables systematic discovery of unexploited resource trade-offs that are computationally intractable or abstruse using existing QRE tools. AutoQuREO is positioned as a general-purpose platform for advancing quantum technology readiness.