Using topology to reveal all mutually unbiased bases in dimension sixMutually unbiased bases (MUBs) describe complementary quantum measurements: certainty in one basis gives no information about the others. In dimension six, triples of MUBs are known, but whether a…Mateo Cárdenes Wuttig, Joseph Tindall·Nov 4, 2026SaveLearn
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic ProgramsResource analyses for quantum programs commonly provide safe upper bounds on qubits, gates, or non-Clifford operations. We study a single-qubit dyadic fragment in which the deepest exact resource…Tony Newton, Dan-Adrian German·Nov 4, 2026SaveLearn
Probing gravity at megahertz frequencies with levitated rotorsThe near-field gravitational interaction between masses is always thought of as instantaneous, an assumption experimentally tested only up to 1.7 kHz, where measurements yield a bounds at the…Matteo Fadel, Andrea Vinante·Nov 4, 2026SaveLearn
Optimal Holding Times for Entanglement SwappingWe revisit the optimization of entanglement holding times in memory-based quantum repeaters for maximizing entanglement swapping throughput under different fidelity constraints - strict,…Van Sy Mai, Richard J. La, Abdella Battou·Nov 4, 2026SaveLearn
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route ComparisonQuantum algorithms for molecular response functions have mostly been studied one route at a time, most prominently the indicator-binning algorithm of Kharazi et al. We compare six routes within one…Yunlong Liu, Yujin Tang, Miao Xu et al.·Nov 4, 2026SaveLearn
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC CodesChoosing a quantum error-correcting code for a real device means scoring candidates with circuit-level simulations so slow that only a few hundred can be run. So every evaluation counts, and a search…Nuno Batista, Gabriel Falcao, Penousal Machado·Nov 4, 2026SaveLearn
Linear-time erasure recovery for quantum expander codesErasures are used to model faults at a subset of known locations in various platforms used to construct fault-tolerant quantum computers. Beyond the utility in erasure recovery, efficient decoders…Anirudh Krishna, Christopher A. Pattison·Nov 4, 2026SaveLearn
Finite-temperature transition-window weights on a fault-tolerant quantum computer: duplex filtering on a thermal purificationThe excite-filter-readout framework of Kharazi et al. computes zero-temperature response windows on a fault-tolerant quantum computer from a pure ground state. We extend it to Gibbs states, where the…Yujin Tang, Yunlong Liu, Miao Xu et al.·Nov 4, 2026SaveLearn
Resource-efficient formulations of the Knapsack problem for quantum computingQuantum computing has emerged as a new tool for solving combinatorial optimization problems. Quantum optimization approaches usually operate on the subclass of Quadratic Unconstrained Binary…Pim van den Heuvel, Vrinda Mehta, Dennis Willsch et al.·Nov 4, 2026SaveLearn
Entanglement Entropy in Non Relativistic CollisionsWe study numerically the build-up of entanglement entropy between two colliding, non relativistic particles, that are driven by the plain Schrödinger equation containing local, finite range…Bertrand Giraud, Robi Peschanski·Nov 4, 2026SaveLearn
Non-compact Kogut-Susskind gauge theories: 1D lattice models with exact SL(2,R) gauge invarianceThe Kogut-Susskind (KS) formulation of gauge theories constructs quantum many-body Hamiltonians with gauge invariance under a compact Lie group exactly implemented on a spatial lattice. Here, we…Carlos Fulgado-Claudio, Torsten V. Zache·Nov 4, 2026SaveLearn
Near-Quantum-Limited Readout for the Princeton Axion Search using a sub-GHz Kinetic Inductance Traveling Wave Parametric AmplifierParametric amplifiers are a workhorse for near-quantum-limited measurements above 1 GHz. However, amplifier development has been more limited below 1 GHz. We present a kinetic inductance…Joe Wiedemann, Roman Kolevatov, Jianyang Fu et al.·Nov 4, 2026SaveLearn
A Quantum Lower Bound for Triangle FindingTriangle finding is a fundamental problem in graph theory that has played a central role in the development of quantum algorithmic techniques. For N-vertex graphs given by their adjacency matrices,…Arjan Cornelissen, Amin Shiraz Gilani, Xingyu Zhou·Nov 4, 2026SaveLearn
Solving a non-abelian hidden subgroup problem on a trapped-ion quantum computer: the power of the measurement basisThe hidden subgroup problem (HSP) unifies many of the best-known quantum speed-ups. For abelian groups it is solved efficiently by weak Fourier sampling, but for non-abelian groups, which include the…Oliver O'Brien·Nov 4, 2026SaveLearn
Phase-Locked Quantum Battery Charging via Dissipative Mode SelectionWe investigate how dynamical instability and reservoir engineering can be harnessed to enhance the quality of quantum-battery charging in a bosonic two-mode system. We show that reservoir-engineered…Borhan Ahmadi, Lei Du, André H. A. Malavazi et al.·Nov 4, 2026SaveLearn
QASPA-MaxCut on Unweighted Graphs: Edge Encoding and QAOA RestartsMax-Cut is a common testbed for near-term quantum optimization because it has a simple Ising Hamiltonian, established classical baselines, and a parameterized quantum circuit whose performance…Dmytro Sapozhnyk·Nov 4, 2026SaveLearn
Experimental activation of hidden metrological steerability in quantum channels via stochastic filteringQuantum steering-assisted metrology allows a trusted party (Bob) to improve local phase estimation by exploiting classical information communicated by an untrusted party (Alice). In realistic…H. S. Karthik, J. Bermúdez, D. Montoya et al.·Nov 4, 2026SaveLearn
Flux Crosstalk Calibration from Zero Knowledge to High Precision in Fully Tunable Superconducting CircuitsPrecise and independent flux control is essential for scalable superconducting processors built from frequency-tunable qubits and couplers, but flux crosstalk undermines it. Conventional calibration…Y. Gao, A. Galicia, J. R. Guimarães et al.·Nov 4, 2026SaveLearn
Efficient quantum ultraspherical transform and a well-conditioned quantum spectral methodSolving differential equations is a promising application of quantum computing. Spectral methods, where the solution is represented by coefficients in a basis, are particularly well suited to quantum…Trong Duong, Norbert Hosters·Nov 4, 2026SaveLearn
Precision Limits and Non-Gaussian Advantage in Optical Phase Estimation under Preparation ConstraintsIn optical quantum metrology, the scaling of the quantum Fisher information (QFI) with the mean photon number is a standard benchmark for relating precision to probe resources. For phase estimation,…Víctor Izquierdo, Javier Lalueza-Puértolas·Nov 4, 2026SaveLearn
Noise-regularized training of quantum circuit Born machines under a finite shot budgetQuantum circuit Born machines (QCBMs) can learn distributions that are hard to sample from classically, but their value depends on generalizing from finite training data. Here, we study how hardware…Hoang M. Ngo, Quan Nguyen, Jung Taek Seo et al.·Nov 4, 2026SaveLearn
Discovering correlated error mechanisms: data-driven augmentation of detector error models improving decodingAccurate decoder priors are essential for high-performance quantum error correction. Theoretical noise models inevitably omit physically relevant error mechanisms, most notably correlated errors,…Zohar Schwartzman-Nowik, Matthew P. Stafford, Boris M. Varbanov et al.·Nov 4, 2026SaveLearn
Compatibility of Pauli ObservablesGiven an arbitrary finite family of Pauli observables, how sharply can they be approximated by a single measurement? We derive an exact state-space correspondence that characterises the resulting…Daniel McNulty, Paolo Facchi, Saverio Pascazio·Nov 4, 2026SaveLearn
Equivalence of Correlated Catalytic and Marginal Asymptotic Transformations in Quantum Resource TheoriesWe prove that correlated-catalytic state conversion is possible if and only if the marginal asymptotic conversion rate is at least one. Under general operational assumptions, this equivalence holds…Jingsong Ao, Aby Philip, Alexander Streltsov·Nov 4, 2026SaveLearn
Parrondo's paradox for three discrete-time quantum walks with distinct shift operatorsParrondo's paradox describes a surprising phenomenon in which certain combinations of biased quantum walks result in an unexpected reversal of their bias direction. To date, research on this…Zbigniew Walczak, Jarosław H. Bauer·Nov 4, 2026SaveLearn