Quantum Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 20 May
Optomechanical systems provide a versatile platform for precision measurements and investigations of fundamental physics, where bringing macroscopic resonators into the quantum regime is a widely pursued goal. Achieving such quantum behavior of solid-state mechanical resonators at room temperature would greatly broaden their applications by removing the need for cryogenic environments. Reaching this goal requires efficient cooling of mechanical motion, among various laser cooling methods, dynamical backaction cooling (DBC) is widely utilized in experiments but fundamentally limited when operating in the sideband-unresolved regime. Coherent feedback cooling (CFC) can overcome this limitation, while avoiding state collapse and the electronic restrictions inherent to measurement-based feedback. Here, we experimentally demonstrate CFC using an ultracoherent density phononic crystal membrane. By combining CFC with strong DBC in a relatively narrow cavity, we achieve a phonon occupation reduction from $5.5\times10^{6}$ to $166\pm7$, corresponding to a cooling factor of $3.3\times10^{4}$ at room temperature, even with current experimental limitations. Our results show the potential of CFC for approaching the ground state of high-$Q$ membranes at room temperature.
Quantum Physics
Enhancing Phase Estimation in a Hybrid Interferometer via Kerr Nonlinearity and Photon Subtraction
We propose a high-precision phase estimation scheme in a hybrid interferometer by synergistically combining a Kerr nonlinear phase shifter and multi-photon subtraction operations. Using a coherent state and a vacuum state as input resources, we systematically evaluate the phase sensitivity via homodyne detection and analyze the quantum Fisher information as well as the quantum Cramér-Rao bound under both ideal and lossy conditions. Our results show that the joint integration of Kerr nonlinearity and multi-photon subtraction yields remarkable advantages over either technique used alone. The proposed scheme enables the phase sensitivity to surpass the standard quantum limit, exceed the conventional Heisenberg scaling ($1/N$), and approach the super-Heisenberg scaling ($1/N^{2}$)-a direct consequence of Kerr nonlinearity. More precisely, the super-Heisenberg scaling $\propto $ $1/N^{2}$ is the ultimate precision limit permitted by the $k=2$ Kerr nonlinearity and does not violate the fundamental Heisenberg limit for linear phase accumulation. Even under moderate internal photon loss, the system maintains high precision and exhibits enhanced robustness to decoherence. The Kerr nonlinearity introduces an intensity-dependent phase shift proportional to the squared photon number, while multi-photon subtraction tailors non-Gaussian states to strengthen phase information extraction. Compared with existing schemes based on hybrid interferometers or SU(1,1) interferometers, our architecture achieves superior precision and stronger loss resilience. All components are experimentally accessible with current quantum optical technologies. This work provides a promising route for practical high-precision quantum metrology and quantum sensing.
Read the full abstract
Quantum Physics
Decoy State based Time Synchronization
Time synchronization is a crucial requirement in quantum key distribution (QKD)8 protocols, ensuring accurate key generation via the correct assignment of bits of raw key and9 enabling eavesdropping detection via the precise recording of photon statistics. State-of-the-art10 experiments typically use an extra channel to synchronize the clocks of the transmitter and receiver11 via classical signals. In this work, we study the possibility of performing clock synchronization12 via the signals used for the key generation, which are already present in decoy-state-based BB8413 protocols.14 Without altering the protocol in any way, we use the different mean photon numbers of the15 signal and decoy states for time synchronization without a dedicated physical channel capable of16 clock synchronization. The proposed method relies only on the photons sent and received for17 key generation and does not require any change to the QKD protocol. The only change in the18 experiment is on the software level, thus making it very simple to implement.19 We demonstrate clock synchronization method in a simulation of a specific fiber-based QKD20 experiment. Like other decoy-state-based BB84 protocols, it is based on weak coherent pulses.21 In this simulation, we investigate the parameter space to find limits and optimal choices of our22 proposed method.23 In addition to the non-protocol-altering clock synchronization method, we also discuss an24 approach that significantly improves performance in lossy channels by introducing an additional25 decoy state with a very high mean photon number.26 By eliminating the need for an extra channel capable of clock synchronization, both methods27 proposed potentially reduce the complexity and cost of QKD systems and improve their agility
Read the full abstract
Quantum Physics · Cross-listed from cs.RO
Q-SpiRL: Quantum Spiking Reinforcement Learning for Adaptive Robot Navigation
Adaptive robot navigation in dynamic environments requires policies that can reach the target reliably while producing efficient and stable trajectories. This paper presents Q-SpiRL, a quantum spiking reinforcement learning framework for obstacle-aware robot navigation. The framework develops and evaluates five agent families: tabular Q-learning, classical MLP, classical SNN, quantum-enhanced MLP (QMLP), and quantum-enhanced spiking neural network (QSNN). While all models are implemented under a unified training and evaluation pipeline, the QSNN is the central architecture of interest, as it combines spike-based temporal processing with variational quantum feature transformation. Experiments are conducted across three grid-world environments of increasing size, namely 20x20, 30x30, and 40x40, with both static and dynamic obstacles. Performance is assessed using success rate, success-weighted path length, path length, and turn rate under deterministic inference. Results show that QSNN achieves the strongest overall trade-off between task completion, trajectory efficiency, and motion smoothness, reaching up to 99% success rate while maintaining high path efficiency in the most challenging setting. Execution on IBM quantum hardware further demonstrates the feasibility of deploying the proposed hybrid policy under real-device conditions.
Read the full abstract
Quantum Physics · Cross-listed from cond-mat.mes-hall
Field-tunable spin-valley transport in monolayer MoS$_2$
We study field-controlled spin-valley transport in monolayer MoS$_2$ through a single electrostatic barrier and a uniform off-resonant elliptically polarized irradiation. Starting from the massive Dirac Hamiltonian with intrinsic spin-orbit coupling, we use a high-frequency Floquet expansion to obtain an effective static model with a laser-renormalized mass (gap) term. We solve the scattering problem by spinor matching and derive the exact analytic expression for the transmission. The numerical results show that the drive tunes both the spin-valley-dependent propagation threshold inside the barrier and the Fabry-Pérot phase, creating controllable pass/stop bands. By varying both the laser intensity (amplitude) and the polarization shape, we show that the same junction can be switched between broadband valley filtering and resonance-selective operation, and the valley contrast remains visible in the Landauer conductance. Our findings establish an efficient route for realizing optically reconfigurable valleytronic and spintronic functionalities in MoS$_2$.
Read the full abstract
Quantum Physics
Circuits of Quantum Hashing and Quantum Fourier Transform for a Cactus as a Qubit Connectivity Graph
We present a quantum circuit implementation of the quantum hashing algorithm (quantum fingerprinting) for a quantum device with restrictions on the application of two-qubit gates by a qubit connectivity graph. We present an optimization technique for the shallow circuit for quantum hashing in the case of a cactus as a qubit connectivity graph. The algorithm has $O(n^3)$ complexity to build the circuit, where $n$ is the number of qubits and $m$ is the number of connections (edges) in the graph. It is improvement compared to the existing exponential-time algorithm in the case of arbitrary graphs. The algorithm uses solution for the shortest non-simple 1-covering path problem as a subroutine. We present an $O(n^3)$-time solution for this graph-theory problem in the case of a cactus. This result can be interesting independently. The algorithm also used for improving of the quantum circuit for Quantum Fourier Transform.
Read the full abstract
Quantum Physics
Multi-Qubit Entanglement of Unit Cell Pairs in SiMOS
Spin qubits in silicon-MOS (SiMOS) quantum dots have recently demonstrated compatibility with existing industry standard CMOS fabrication techniques. These devices have routinely achieved single- and two-qubit gate fidelities above 99% and demonstrated highly entangled two-qubit Bell states in isolated double quantum dot (DQD) unit cells, however coupling between unit cells has remained challenging. In this work, we present a two unit cell, four-qubit SiMOS processor with universal controllability and fully parallelised state initialisation and readout. We use this processor to generate maximally entangled three-qubit states, including the Greenberger-Horne-Zeilinger (GHZ) state, and certify multipartite entanglement through violation of the classical Mermin-witness bound. By using a fully symmetric dynamically decoupled gate sequence to create our entangled states, we are able to preserve the lifetime of the entanglement beyond $T_2^*$, to a time limited instead by $T_2^\textrm{Hahn}$. These demonstrations pave a road to the scalable operation of larger SiMOS processors, and achieving high purity, long-lived multi-qubit entangled states in them.
Read the full abstract
Quantum Physics
Generalized quantum Stein's lemma for mixed sources
The generalized quantum Stein's lemma characterizes the optimal asymptotic exponent of the type-II error in quantum hypothesis testing for an independent and identically distributed (IID) null hypothesis against a composite alternative hypothesis. Classically, a probabilistic mixture of IID sources arises as a natural generalization of IID sources, and, in the non-composite setting, the optimal type-II error exponent in hypothesis testing for such classical mixed sources is known to be characterized concisely by the worst-case component of the mixture. In this work, we extend these foundational results to composite quantum hypothesis testing where the null hypothesis is a mixed source, i.e., a probabilistic mixture of IID quantum states, and the alternative hypothesis is composite as in the generalized quantum Stein's lemma. When the type-I error vanishes asymptotically, we characterize the optimal type-II error exponent of this composite quantum hypothesis testing problem in terms of the worst-case component of the mixture, by developing techniques for the non-commutative quantum setting inspired by the classical information-spectrum analysis. We also show that the analogous characterization does not hold in general for a fixed nonzero type-I error threshold, by providing a counterexample beyond the vanishing type-I error regime. These results clarify the applicability of the generalized quantum Stein's lemma to highly non-IID null hypotheses arising from arbitrary finite probabilistic mixtures of IID quantum states.
Read the full abstract
Quantum Physics
Precision and Privacy in Distributed Quantum Sensing: A Quantum Fisher Information Duality
We establish a quantum Fisher information (QFI) duality for distributed quantum sensor networks with local phase encoding. For any $N$-qubit probe state, where $N$ denotes the number of sensors, $F_Q(\boldsymbol{w}^\top \boldsymbol{\theta}) + F_Q(\boldsymbol{v}^\top \boldsymbol{\theta}) \leq N$ for all unit orthogonal sensing directions $\boldsymbol{w}$ and $\boldsymbol{v}$, with equality for all equatorial states when $N=2$ and for Greenberger–Horne–Zeilinger (GHZ) states when $N\geq 2$. Heisenberg-limited precision for direction $\boldsymbol{w}$, $F_Q(\boldsymbol{w}^\top \boldsymbol{\theta})=N$, saturates the bound and simultaneously forces zero QFI for all other independent directions. This can be interpreted as the condition for parameter privacy in distributed quantum sensing: attaining Heisenberg-limited precision for the sensing target renders all alternative privacy-intrusive estimations impossible.
Read the full abstract
Quantum Physics
Strongly-coupled non-Markovian waveguide QED with input-output HEOM
We consider the problem of modeling a single qubit in contact with a one-dimensional waveguide beyond the standard perturbative and Markovian approximations. Using the recently developed input-output hierarchical equations of motion (io-HEOM), we investigate multiple examples of such waveguides, characterized by different spectral densities. Our examples highlight that the io-HEOM method can accurately capture non-Markovianity in waveguide QED from two distinct origins. The first source of non-Markovianity is spatially non-local coupling between the qubit and the waveguide. By examining two examples with non-local coupling, we show how the coupling function affects the steady-state bound photons, and demonstrate the release of these photons when the qubit energy is quenched. The second source of non-Markovianity is non-linear dispersion. We illustrate this scenario using the example of a cavity array with point-like coupling, where the non-linear dispersion leads to persistent oscillations due to Van Hove singularities in the spectral density.
Read the full abstract
Quantum Physics
Entangling Power: A Probe of Symmetry and Integrability in Quantum Many-Body Systems
The entangling power of a unitary operator quantifies its ability to generate entanglement from product states and provides a natural probe of quantum many-body dynamics. Entanglement extremization at points of enhanced symmetry has previously been observed in high-energy scattering. In this work we compute the time-averaged entangling power of anisotropic Heisenberg spin chains across two-site models and finite-size systems, as well as the entangling power of the two-magnon $S$-matrix in the thermodynamic limit. For two-site models we establish a monotonic hierarchy: the entangling power decreases as the symmetry group grows, reaching its minimum at the $SU(2)$ XXX point. Finite-size XXZ chains exhibit sharp dips at the $SU(2)$ points $\Delta=\pm 1$ and the free-fermion point $\Delta=0$, with the free-fermion dip decaying much more slowly with system size. In the thermodynamic limit, we decompose the two-magnon $S$-matrix into quantum logic gates – Identity, SWAP, and $\sigma_z\otimes\sigma_z$ – and show that the entangling power vanishes for all scattering energies at the $SU(2)$ points, where the $S$-matrix reduces to the Identity gate, while the free-fermion point achieves the maximum – the opposite of the finite-size many-body behavior. The entangling power can serve as an operator diagnostic for symmetry and selected aspects of integrability in quantum simulations of spin-chain dynamics.
Read the full abstract
Quantum Physics
Entanglement Growth from Structured Initial States in Many-Body Localized Systems
Understanding how complex entanglement structures emerge is a central problem in quantum many-body physics. Recent work by Zhang et al. [Phys. Rev. Lett. 137, 020404 (2026)] has considered structured initial states prepared by evolving a product state under a chaotic Hamiltonian for a finite time before quenching to the target Hamiltonian. In this setup, total entanglement entropy growth in many-body localized systems exhibits two distinct regimes, first increasing and then decreasing as the initial entanglement is tuned. In this work, we identify the physical origin of this behavior by analyzing the dynamics of both the Rényi entanglement entropy and the Wehrl-Rényi entropy in the random-field XXZ model, the latter of which characterizes multipartite entanglement. We show that a similar non-monotonic dependence on the initial entanglement also appears in the net growth of the Wehrl-Rényi entropy for product states polarized along the $z$-direction. The first regime is governed by a finite magnetization associated with local integrals of motion, while the second reflects inter-site correlations. In contrast, for product states in the $x/y$-direction, the entanglement growth exhibits a monotonic decay. Our results provide a more fine-grained picture of how distinct initial-state properties shape entanglement dynamics in many-body localized systems.
Read the full abstract
Quantum Physics
WSi weak link element with a non-sinusoidal current-phase relation
Nonlinearity is an essential ingredient for encoding quantum states with non-uniform energy spacing, implementing coherent quantum gates, reading out qubits, amplifying, and mixing electromagnetic signals. In this work, we demonstrate the nonlinear behavior of a constriction fabricated from an amorphous, high-kinetic inductance material, tungsten silicide, embedded in a three-dimensional RF-SQUID. We find that the results are consistent with the weak link behaving as a Josephson junction with a sawtooth-like current-phase relation or a quantum phase slip element. Finally, we measure relaxation times of the metastable, persistent-current states trapped in the local minima of the potential.
Read the full abstract
Quantum Physics
PUBO Formulation for MST and Application to Optimum-Path Forest
The Optimum-Path Forest is a graph-based framework for designing classifiers that exploit inter-sample connectivity. A particular variant constructs decision boundaries based on prototypes computed by a Minimum Spanning Tree (MST) over the training data, which might become prohibitive for large-scale datasets. In this context, Quantum Machine Learning has emerged as a promising approach to overcome the high computational burden of combinatorial problems. We propose a quantum-inspired approach for prototype selection in OPF classifiers by reformulating the MST problem as a Polynomial Unconstrained Binary Optimization (PUBO) task and further employing the Feedback-Based Quantum Optimization (FALQON) algorithm for Hamiltonian minimization. The PUBO formulation reduces the need for qubits and eliminates the need for auxiliary variables, thereby addressing scalability constraints in current quantum hardware. Experiments on real-world datasets demonstrate that the FALQON-optimized MST achieves accuracies comparable to those of the classical Prim's algorithm while maintaining prototype quality. While FALQON occasionally reached local minima, it did not significantly impact the accuracy of the prototype selection process.
Read the full abstract
Tuesday 19 May
Quantum Physics
Quantum-Inspired Hamiltonian Optimization, Stochastic Tensor Networks and Adaptive Congestion Routing for Large-Scale QKD Networks
Quantum Key Distribution (QKD) networks require routing methodologies capable of jointly optimizing latency, secret key generation rate, congestion, finite capacity and operational security constraints under dynamically evolving traffic conditions. In this work we introduce a quantum-inspired optimization framework for adaptive multi-demand routing in QKD communication networks based on effective Hamiltonian modelling, Quantum Monte Carlo inspired annealing and stochastic Tensor-Network State (TNS) compression. The communication network is represented as a stochastic interacting graph whose routing configurations evolve under an effective Hamiltonian containing latency, keyrate, congestion, risk and capacity terms. The resulting optimization landscape is explored through two complementary approaches: a stochastic Metropolis annealer based on incremental local Hamiltonian updates, and a stochastic boundary-MPS tensor-network approximation that compresses the low-energy routing sector through thermal branch selection. The resulting framework establishes a scalable bridge between QKD network orchestration, statistical-physics-inspired optimization, tensor-network compression and future quantum-native routing systems.
Read the full abstract
Quantum Physics
Agreement and Compatibility in Wigner's Friend Paradox
There has been an upsurge of interest in the consequences for quantum physics of the so-called Wigner's Friend Paradox. In its original formulation, the paradox has been turned inside out, and virtually every aspect of it has been looked into. Consequently, it is becoming widely accepted that we can find the potentially puzzling consequences of Wigner's thought experiment only in light of its many-parties extensions. Nonetheless, this contribution returns to the source. Reframing the question as an inference problem, we advance a radically Bayesian interpretation that shows no contradiction between Wigner's and Wigner's Friend's descriptions-neither classically nor quantumly. Therefore, with no paradoxical conclusion. In doing so, we flesh out and expose previously untouched aspects of Wigner's thought experiment, in particular, the fact that compatibility and agreement are fundamental to our understanding of it. Also, by conservatively extending Wigner's original setup and incorporating what we call the 'benefit of the doubt', we see how either Wigner's or his Friend's description can be driven to match one another's – an impossibility if either agent does not keep an open mind.
Read the full abstract
Quantum Physics
Quantum Speed Limit under Calibration Uncertainty
Standard quantum speed limits presuppose exactly known parameters, overestimating operational speed under calibration uncertainty. We introduce a projected speed limit based on the quantum Fisher information that profiles out these nuisance parameters on a quotient manifold. We derive constructive bounds for general Markovian evolution using sensitivity equations. Applying this to Jaynes–Cummings sensors, we obtain explicit detuning tolerances and quantify speed limits arising from field-dependent Purcell loss. This framework turns geometric bounds into concrete design rules for calibration and interrogation time.
Read the full abstract
Quantum Physics
Full characterization of informative subsets in Quantum Encrypted Cloning
Quantum encrypted cloning, introduced by Yamaguchi and Kempf, is a Pauli-based protocol that distributes an unknown input qubit into multiple encrypted signal-noise pairs in such a way that redundancy is created without violating the no-cloning theorem, since at most one clone can later be perfectly recovered through an appropriate decoding procedure. In previous work we showed that unauthorized subsets of the storage register are not, in general, completely uninformative, and we identified a parity-dependent leakage pattern. In the present work we extend the analysis to subsets that also include the transformed source qubit A. Exploiting the purity of the global encoded state and the complementarity between storage-only subsets and subsets containing A, we derive a full classification of the informativeness of all sets of the form $H=\{A\}\cup C$. We show that these subsets are fully informative in the generic case. Two exceptions arise. First, if all pairs are incomplete and |C|<n, then the reduced state is completely uninformative. Second, if |C|=n, n is odd, and the number q of signal qubits in C is even, then the reduced state is partially informative. In this latter case, the residual dependence on the input state is confined to the y-component of the Bloch vector. These results provide a complete parity-based characterization of leakage for subsets containing the transformed input qubit.
Read the full abstract
Quantum Physics
Hybrid Classical-Quantum Neural Networks for Multi-Characteristic Co-Optimization of Recessed-Gate AlGaN/GaN MIS-HEMTs
Optimizing recessed-gate AlGaN/GaN MIS-HEMTs requires accurate multi-characteristic models, but experimental semiconductor datasets remain costly and encode process-induced variability that simulations cannot faithfully reproduce. This work proposes a hybrid classical-quantum neural network (HQNN) for joint optimization of six electrical targets from a 24-dimensional fabrication/process vector. We systematically screen quantum-circuit templates to extract circuit-design guidance, then select a final HQNN and compare it directly with classical baselines. On 468 experimental fabricated devices spanning 17 process splits, the selected HQNN, Circuit (13, 5) at L = 2, reduces overall normalized root mean square error (nRMSE) by 24.4% relative to ANN. Target-wise, the HQNN lowers Vth,lin RMSE from 0.297 V to 0.270 V, Vth,rev RMSE from 0.278 V to 0.263 V, DeltaVth RMSE from 0.049 V to 0.045 V, SS RMSE from 22.22 mV/dec to 19.87 mV/dec, and Id RMSE from 5.75 x 10^-8 A to 4.35 x 10^-8 A, while Ion RMSE remains competitive (0.053 A vs. 0.056 A). Controlled ansatz ablations further show that performance depends strongly on architecture: parameter count, depth, and two-qubit gate count correlate positively with accuracy, expressibility (DKL) correlates negatively, and controlled-rotation entanglers outperform static controlled-NOT (CNOT)-based circuits in aggregate. A depolarizing-noise study on a representative 4-qubit circuit further suggests that comparable HQNNs may be trainable or deployable on near-term quantum hardware.
Read the full abstract
Quantum Physics
Mean-field and fluctuation dynamics in off-resonant two-mode atom-field interactions
We study a two-level system coupled to two quantized electromagnetic modes within the Jaynes-Cummings framework. While the single-mode model is exactly solvable due to its conserved excitation number, yielding finite-dimensional invariant subspaces, the two-mode model extension presents a fundamental challenge: although the total excitation number remains conserved, each invariant subspace is infinite-dimensional, preventing a closed-form analytical solution. Our scheme separates the dynamics into a dominant, exactly solvable semiclassical component, the atom interacting with the mean fields of both modes, and treats the remaining quantum fluctuations through a sequence of unitary transformations that preserve essential quantum features. We validate our approach through direct comparison with numerical solutions, focusing on the non-resonant regime where multiple detunings give rise to rich interference effects and multi-timescale dynamics inaccessible to standard approximations. The method accurately reproduces atomic inversion, field observables, and fidelity over relevant timescales, while remaining computationally efficient.
Read the full abstract
Quantum Physics · Cross-listed from math.NA
A Simple GPU-Accelerated Solver for the Schrödinger Operator with Applications to Ground States and Hamiltonian Simulation
We extend the tensor-product direct solver from the Laplacian to the Schrödinger operator $-\Delta + V$. When the potential $V_1$ is separable, the operator $-\Delta + V_1$ is inverted or exponentiated at cost $O(N^{1+1/d})$ in $d$ dimensions via per-axis eigendecomposition. On a single NVIDIA A100 GPU, this costs less than one second for $10^9$ degrees of freedom in 3D. For non-separable potentials $V = V_1 + V_2$, the same solver provides a preconditioner $(-\Delta + V_1)^{-1}$ for the preconditioned conjugate gradient (PCG) method and a propagator for operator-splitting time integrators. For bounded $V_2$, we prove that the preconditioned operator has a bounded condition number and a clustered spectrum with at most finitely many outlier eigenvalues, independently of the mesh size, and also independently of the domain size when $V_1$ is a confining potential. This explains the mesh- and domain-independent PCG iteration counts observed in practice. We apply this method to ground state computation via inverse iteration for linear problems and via the $a_u$ gradient flow for Gross–Pitaevskii energy in 3D, and also Hamiltonian simulation via the approximated qHOP and Magnus-2 splitting methods from 3D to 9D on a single NVIDIA GH200 GPU.
Read the full abstract
Quantum Physics
Self-Trapping Bounds for Continuous-Time Nonlinear Quantum Walks on Path and Cycle Graphs
We explore a continuous-time quantum walk starting at a single vertex on the discrete path and cycle with a cubic nonlinearity. Such nonlinearities arise in Bose-Einstein condensates described by the Gross-Pitaevskii equation or by nonlinear optical waveguide arrays. When the nonlinearity is sufficiently strong, the walker remains localized at its initial vertex, a phenomenon known as self-trapping. This contrasts with linear quantum walks, which are known for spreading quickly in one dimension. While self-trapping has been known numerically, we introduce an analytical method that proves self-trapping and yields a quantitative relationship between the nonlinearity coefficient and the trapping probability. We propose that this trapping can be used for timing in quantum state transfer, where a qubit is held at a node until it is ready to be transferred, and it can also be held again at the receiving node. This scheme can also be interpreted as a form of quantum memory, with the trap and transfer corresponding to the storage and release of quantum information.
Read the full abstract
Quantum Physics
Compact narrowband photon-pair generation by slow-light spectral engineering
Efficiently generating photon pairs with high heralding efficiency and high single photon purity that are bandwidth matched to quantum emitters, quantum memories, and other matter-based qubits is critical for quantum networking applications. However, nonlinear optics-based sources require substantial spectral engineering to overcome the orders of magnitude bandwidth mismatch between those sources and qubit systems. A popular solution is cavity-enhanced spontaneous parametric down conversion (SPDC) where the cavity sets the photon bandwidth and simultaneously enhances the spectral brightness of the SPDC. Bulk, free-space configurations are generally required to achieve the MHz-scale bandwidths required to interface with most qubit systems. Replicating these in scalable integrated photonic architectures is an ongoing challenge due to the much higher propagation losses that limit the size and linewidth of chip-based resonators. We show here how an intra-cavity slow light medium, acting as an ultra-narrow filter, would enable narrowband photon pair generation in broadband cavities with high single photon purity and without compromising the heralding efficiency. We show that such metrics can be readily realized in erbium doped thin-film lithium niobate microrings using realistic design parameters.
Read the full abstract
Quantum Physics
Interpreting Bohm-like quantum potentials in "Computing quantum waves exactly from classical action"
Comment on arXiv:2605.02621 [23] and arXiv:2606.05197 [24]: In contrast to his earlier comment [23] on rspa.2025.0413 [12] and answered in arXiv:2605.20443 [11], the same author of [24] does not seem to dispute any longer that the use in [12] of tools from Feynman's [5] namely - the kernel approach, which computes a wave starting at a given initial position or momentum, and is a key element in [12] to ensure that the Bohm-like quantum potential vanishes. This is directly verified in all examples of [12] as well as in the Pauli, Dirac and Maxwell derivations from classical action. This approach is very different from the standard Bohm-Madelung potential on the overall wave, as illustrated in detail in [11] for the two-slit experiment. - for the harmonic oscillator, the kernel computation directly from a Taylor series expansion, which does not involve any circularity. His second post [24] now - criticizes the use in [12], [11] of Duru and Kleinert's time-independent eigenwave equivalence of the original and the time-scaled Schrödinger equations [4], confusing this standard result with a multivariable chain rule in the time-dependent kernel computation from action in [12]. - claims that "The mathematical framework presented by the authors remains identical to the well-established semiclassical Van Vleck propagator [sic]" which requires that the "Hamiltonian is at most quadratic in position and momentum [sic]". This confuses a quadratic action in the vector case with a harmonic propagated density based on the Laplacian of the action (with harmonicity always fulfilled e.g., for holomorphic complex functions [10]. In addition, it ignores the extension of a real position to a complex or quaternion position or spin, the key result on multi-valued action branches (which enables a classical derivation of quantum randomness) and the quantization of classical action in [12].
Read the full abstract
Quantum Physics · Cross-listed from hep-lat
Quantum Simulation of Gauge Theories for Particle and Nuclear Physics
Lattice field theory, along with its algorithmic and hardware ecosystems, has been at the forefront of computational particle and nuclear physics. It continues to deliver impressive results on the hadronic spectrum, structure, decays, and reactions. Yet, this vigorous campaign has fallen short in addressing a range of problems involving dense matter and general dynamical phenomena. The reason is that such problems require an exponential scaling of computing time and space in system size. Quantum simulation, enabled by quantum-computing algorithms and hardware technology, promises a way forward by offering several polynomially efficient algorithms compared with their inefficient classical counterparts. Lattice gauge theorists have engaged in a multi-pronged program to leverage such new possibilities, and have steadily advanced the state of theory, algorithm, and hardware implementations and co-design. In this talk, I motivate the quantum-computational lattice-field-theory program; introduce the questions such a program is expected to address and the strategies it involves; report on recent progress; and end with a note on challenges and opportunities ahead.
Read the full abstract
Quantum Physics
Sampling Noise and Optimized Measurement Distribution in Imaginary-Time Quantum Dynamics Simulations
Variational quantum dynamics simulations (VQDS) provide a promising route to simulate real- and imaginary-time quantum dynamics on noisy intermediate-scale quantum devices using fixed-depth circuits. However, their practical performance is strongly limited by sampling noise arising from a finite number of circuit measurements. In this work, we systematically investigate the impact of sampling noise on VQDS, with a focus on ground-state preparation in one-dimensional Ising spin models using imaginary time evolution. We compare different regularization strategies for stabilizing the equations of motion and show that Tikhonov regularization provides robust performance in noisy imaginary-time evolution. We then benchmark measurement-distribution strategies that allocate shots by minimizing a cost function that characterizes the error in solving the equation of motion. Using noisy circuit simulations, we demonstrate that such optimized shot allocation can significantly improve state fidelity and reduce the total measurement cost by more than a factor of two compared to uniform shot distributions. We observe that the best results are found if a sufficiently large number of measurements is guaranteed for all circuits, suggesting that a finite fraction of shots should be distributed evenly. Our results provide practical guidelines for implementing measurement-efficient variational quantum dynamics and ground-state preparation on near-term quantum hardware.
Read the full abstract
Quantum Physics
Resource generation and dynamical complexities in open random quantum circuits
Realistic quantum devices are inherently open and often involve environments with memory. Here, we investigate quantum resource generation in two classes of random circuits, namely, memoryless open and memoryful open random circuits, and compare their behavior with the well-explored random unitary circuit model. We show that environmental memory qualitatively alters the dynamics: while unitary and memoryful circuits exhibit sustained growth and saturation of entanglement and non-stabilizerness (magic); memoryless dynamics leads to a distinct behavior where entanglement decays to zero after transient growth, even though non-stabilizerness remains non-zero, indicating the persistence of nonclassical features beyond entanglement. Consistently, Krylov complexity reveals suppressed spreading of quantum states in memoryless circuits, in contrast to strong growth in unitary and memoryful dynamics, which saturates at the maximum value. Finally, we show that memoryful circuits more effectively approach low-order quantum-state k-designs than the other two circuits. Closed dynamics are therefore usually the most resource-generating, but are ideal; realistic dynamics are open and seem to generate less, but if they possess memory, they can sometimes even outdo closed dynamics.
Read the full abstract
Quantum Physics
Forced Gap Post-Selection for Quantum LDPC Codes and their Operations
We develop a simple and general post-selection strategy for high-rate quantum codes that is transferrable across decoders. After an initial baseline run, the decoder is re-run once per logical observable, and forced in these latter runs to provide a solution where the given observable has the complementary outcome. Shots are rejected that find logically complementary solutions with similar likelihoods compared to the baseline. Using the Relay-BP decoder, we benchmark the strategy on the $72$-qubit and $144$-qubit bivariate bicycle codes, as well as surgery gadgets for the latter. In comparison to previous post-selection strategies, our results offer an improved logical error rate by over a factor of $4$ on the same circuit and physical error rate, and at the same rate of post-selection. Our strategies are also lightweight, relying only on FPGA-friendly belief propagation, whereas the previous best used repeated rounds of a high-latency BP-OSD decoder.
Read the full abstract
Quantum Physics
Halving the cost of QROM
Table lookup, often referred to as quantum read only memory (QROM), is one of the most widely used subroutines in quantum algorithms, and constitutes the majority share of algorithmic overheads in most practical applications of quantum computers. It involves the coherent loading of $N$ bitstrings of length $b$ in superposition, and naively has a non-Clifford cost of $N$ Toffolis. It is known that given access to $b\, \lambda$ dirty qubits, one can reduce the Toffoli cost of QROM to $2\frac{N}{\lambda} + 4b(\lambda - 1)$. In this work, we first present an optimization to reduce this cost to $2\frac{N}{\lambda} + 2b(\lambda - 1) + 2\lambda-6$ by replacing the “SelectSwap" architecture with “SelectCopy". We then provide a further optimization for the qubit-constrained regime where the Toffoli cost is typically $\sim 2\frac{N}{\lambda}$, and reduce it to $\sim (1+\frac{1}{b})\frac{N}{\lambda}$, cutting the cost by approximately $50\%$ and effectively matching the performance of clean-qubit QROM using dirty qubits for practical values of $b$. Lastly, we provide a parametric family of methods that allow the interpolation of the prefactor of the $\frac{N}{\lambda} $ term from $2$ to ($\, 1+\frac{1}{b}\,$) to obtain the best cost for different qubit availability regimes.
Read the full abstract
Quantum Physics
Bowtie VarQTE: A Resource-Efficient Quantum State Preparation Primitive
The preparation of quantum states is a fundamental requirement for many quantum algorithms. A native route to preparing physically structured states is based on short-time simulation of dynamical processes, such as real or imaginary time evolution. This work presents a resource-efficient framework for the approximation thereof with \textit{bowtie \ac{VarQTE}} which uses classical simulation where possible and quantum resources where necessary. We introduce a framework that leverages existing causal light-cones to minimize quantum resource requirements in the evaluation of gradient and quantum geometric tensor terms by utilizing classical simulation methods for causally relevant subcircuits. This in turn enables exact parameter updates according to McLachlan's variational principle and, thereby, improves numerical stability. We conduct a comparison with a state preparation method that is based on a tensor-network compiled Trotter algorithm: approximate quantum compilation (AQC). In recent work, this approach has shown impressive performance. However, its key-bottleneck is the necessity to have a classical (approximate) representation of the target state. Our numerical experiments indicate that bowtie VarQTE can achieve comparable fidelities without this requirement. We further illustrate how bowtie VarQTE can facilitate a state-preparation pipeline that combines the simulation of imaginary and real time evolution for a sample-based quantum algorithm. In fact, results on 2D systems show how bowtie VarQTE can reduce the quantum requirements compared to standard, sample-based Krylov diagonalization calculations. Our results indicate that VarQTE is a promising primitive for the preparation of physically structured quantum states that reduces requirements on quantum resources by leveraging existing structures and the associated possibility of enabling classical simulations.