Quantum technology: research

Journal articles, academic blogs, think-tank reports and papers in this section, newest first. Back to the news.

arXiv (research papers) Joao F. Doriguello

The energetic cost of loading classical data in quantum computers

Quantum algorithms for machine learning, chemistry, and cryptanalysis often assume coherent access to classical data at negligible physical cost. We instead treat data loading as a hardware process and quantify the dynamic energetic cost of a quantum random access memory (QRAM) query on a superconducting processor. Using the metric-noise-resource framework, we relate query fidelity and power to gate duration, relative two-qubit drive strength, and the distribution of…

Read at arXiv (research papers)

arXiv (research papers) Khaled Jebari

Multidimensional Quantum Block Turbo Codes

The theory of turbo iterative decoding was brought into the quantum coding framework through the development of quantum serial turbo codes and quantum block turbo codes. In this paper, we present a theory for multidimensional quantum block turbo codes, a turbo decoding technique for multi layer product codes. We describe its algorithm and simulate the performance for the 3D case on a depolarizing channel.

Read at arXiv (research papers)

arXiv (research papers) Soumya Sarkar

Simulating closed- and open-system dynamics of Tavis--Cummings lattices on fault-tolerant quantum computers

Tavis--Cummings lattices couple cavities containing several emitters and host polaritonic many-body dynamics whose real-time correlations are costly to compute classically in two dimensions, especially when unequal emitter relaxation or dephasing rates break permutation symmetry. We analyze logical resources for fault-tolerant closed- and open-system simulation of an atom-resolved lattice with $L$ cavities, $N$ emitters per cavity, and photon cutoff $n\_{\max}$, including…

Read at arXiv (research papers)

arXiv (research papers) Feiyu Li

Implementing rapid reset of superconducting qubits with on-chip dissipation

Rapid and high-fidelity qubit reset is essential for quantum state initialization and quantum error correction. Conventional reset protocols for superconducting qubits often rely on dissipative elements connected to external circuitry, exposing qubits to thermal noise from higher-temperature environments. Here, we experimentally demonstrate a scalable approach to qubit reset and leakage removal over multiple transmon qubits using dedicated dissipation units comprising…

Read at arXiv (research papers)

arXiv (research papers) Roberto Fernández-Barrios

Operational limits of reference renewal for retained quantum-service results

We implement reference renewal to reconsider retained physical quantum-service results under a prespecified protocol. Twelve transitions retained six results each; ten completed renewal, eight met the prespecified endpoint, and five succeeded using retained results alone. The exact one-sided p=0.0546875 does not establish the recovery hypothesis. Incomplete references, binding failures and sequential waits expose operational limits. Offline reconstruction recovers decisions…

Read at arXiv (research papers)

arXiv (research papers) Giuseppe D'Ambruoso

Invariance can prevent overfitting and shortcut learning in Quantum Neural Networks

Many image classification tasks have labels that are unchanged by rotations and reflections. Equivariant quantum neural networks incorporate such symmetries by design, but the specific benefit of symmetry is difficult to isolate. Equivariant quantum circuits are usually compared with architectures that also differ in gates, structure or size. Here, we investigate the role of invariance in a controlled setting, classifying images whose labels are invariant under the dihedral…

Read at arXiv (research papers)

arXiv (research papers) M. V. Bastrakova

High-Speed Control of a Fluxonium Qubit via Picosecond Pulses from Josephson Digital Circuits

We develop a control strategy for fluxonium qubits based on picosecond single-flux-quantum (SFQ) pulses generated by Josephson digital circuits. A major challenge is that SFQ protocols originally designed for transmon control become inefficient for low-frequency fluxonium. In this regime, the asymmetry of flux and charge couplings leads either to excessive leakage or excessively long gate times. We show that this limitation can be overcome by two complementary protocols. The…

Read at arXiv (research papers)

arXiv (research papers) S. Hughes

Dynamical Casimir emission from Floquet-driven Landau polaritons: Gauge invariance forbids a superradiant phase transition

Ultrastrong light--matter coupling of linear systems, such as Landau polaritons formed by a two-dimensional electron gas in a terahertz cavity, is described by the bosonic Hopfield model, and gauge invariance forbids a superradiant phase transition (SRPT). Modulating the magnetic field alone has been predicted to enhance the cycle-averaged coupling and induce a Floquet SRPT. We develop an exact theory of periodically driven Landau polaritons. Including the electric field…

Read at arXiv (research papers)

arXiv (research papers) Yuming Bao

A New Computational Model for the Spin-Free Sum-of-Squares Energy Bounds of Electronic Hamiltonian

Optimizing spin-free sum-of-squares (SOS) energy bounds for electronic Hamiltonians leads to semidefinite programs whose expanded size grows rapidly with the orbital dimension. We derive an exact reformulation of an established spin-free SOS model as a convex quadratic problem over a single symmetric matrix constrained between zero and the identity. Explicit recovery maps connect feasible quadratic-program iterates to certificates in the original SOS formulation, and…

Read at arXiv (research papers)

arXiv (research papers) Zheng-Hang Sun

Error Resilience and Unitary 2-Designs

Encoding-error-decoding circuits provide a setting for studying protection of quantum information against errors. In these circuits, an encoding unitary is followed by an error layer, decoding by the inverse unitary, and ancilla postselection. For encoders drawn from unitary 2-design ensembles, these circuits exhibit an error-protecting phase below a threshold error strength in which the fidelity between the input and recovered logical states approaches unity. Here, we show…

Read at arXiv (research papers)

arXiv (research papers)

Electrical Stark Tuning and In Situ Field Sensing of $V_{2}$ Silicon Vacancies in a 4H-SiC a-Plane Lateral pin-Diode

Silicon carbide has emerged as a highly promising platform for scalable quantum technologies, with the silicon vacancy serving as a robust spin qubit and quantum sensor. However, conventional c-plane 4H-SiC restricts the experimental scheme and resonant optical excitation to the sample's geometry. The usage of a-plane substrates enables more versatile resonant optical access to the color center through the wafer surface. Here, we demonstrate the electrical control and…

Read at arXiv (research papers)

arXiv (research papers) Qingtian Miao

Reading long-range information from a separable quantum record requires entangled measurements

Qubit probes record the relative orientation of neighboring, initially uncorrelated Ising spins through local interactions. Each probe encodes one bond label in two states with overlap $1-p$. The resulting probe record is fully separable. A receiver gets one copy and guesses whether two distant spins point in the same or opposite directions. On the square lattice, the best readout with separable measurement effects approaches success probability $1/2$ as the spin separation…

Read at arXiv (research papers)

arXiv (research papers) Rohit Narula

Edge quantum weight of finite Chern flakes and its topological floor

The zero-point energy of a circuit measures the polarization fluctuation of an insulator coupled to it. In a crystal this is the bulk quantum weight $K_\mathrm{bulk}$, which the Chern number $C$ bounds below by $|C|$. We show that a finite Chern flake adds an edge term that survives as the flake grows. The low-frequency transitions of its chiral edge carry a dipole weight, the sum of their squared dipole matrix elements, $K_\mathrm{edge}\geq|C|$ per unit area, a floor that…

Read at arXiv (research papers)

arXiv (research papers) Tushar Kumar Jain

Classical phase unwrapping enables large-time-step unitary quantum Krylov subspace diagonalization

For computing molecular energies on early fault-tolerant hardware, unitary quantum Krylov subspace diagonalization (UQKSD) avoids both the deep circuits of quantum phase estimation and the Pauli-term sampling of variational methods by extracting the energies from a projected real-time propagator. At a small time step $τ$, nearly linearly dependent Krylov vectors make the overlap matrix ill-conditioned. Our tests at fixed total evolution time show that additional Krylov…

Read at arXiv (research papers)

arXiv (research papers) Ang Yang

Disorder-Induced Logarithmic Spreading and Localization of Quantum Fluctuations

Disorder can localize quantum particles, even in the presence of interactions, but its influence on quantum fluctuations beyond mean--field dynamics remains poorly understood. Here, we investigate the propagation of quantum fluctuations in weakly interacting disordered bosonic systems by comparing the Bose--Hubbard model with the Gross--Pitaevskii equation. We find that, in contrast to ballistic spreading in the disorder--free system, quantum fluctuations exhibit logarithmic…

Read at arXiv (research papers)

arXiv (research papers) Yi Liang

Low-energy spectral-window truncation for compact U(1) lattice gauge theory

We prove a nonasymptotic electric-flux truncation bound for the entire vacuum-relative low-energy window of the original pure compact $U(1)$ lattice Hamiltonian. On a three-dimensional periodic cubic lattice with $N\geq3$ sites per direction at $θ=0$, in the gauge-invariant zero-global-flux sector, the factorial-squared tail-norm estimate holds for every normalized vector in the window, without physical eigenvalue-isolation, window-edge gap, or nondegeneracy assumptions and…

Read at arXiv (research papers)

arXiv (research papers) Gabriel Maresch

Quantum-Assisted Counterfactual Regret Minimization for Bounded-Payoff Imperfect-Information Games

Imperfect-information games with a graded-reward structure present significant computational challenges for equilibrium computation, since the payoff expectations must be estimated across exponentially large strategy spaces. Counterfactual Regret Minimization over the years has proven effective for approximating Nash equilibria, but Monte Carlo variants create a large overhead of sampling costs when the counterfactual values are estimated from sampled game-tree trajectories…

Read at arXiv (research papers)

arXiv (research papers) Matthew Brunet

Quantum-Informed Graph Decomposition

The Quantum Approximate Optimization Algorithm (QAOA) is a near-term quantum algorithm for solving combinatorial optimization problems, but its accuracy and resource requirements may scale poorly with problem size or structure, reducing its utility in practice. Approaches such as the Graph Decomposition for Optimization Algorithm (GDOA) seek to address this by iteratively reducing an input problem until it reaches a size where it can be solved using QAOA while maintaining…

Read at arXiv (research papers)

arXiv (research papers) Alejandro Giraldo

Quantum-Enhanced QSAR for DYRK1A: Evaluating Complementary and Utility QPU-Derived Molecular Representations

In drug discovery, hit identification selects a limited set of compounds for experimental evaluation from a larger collection of candidates. Because laboratory screening capacity is limited, that choice determines which chemical series continue into further investigation. A hit that is not assayed does not enter confirmation or the analog series, and that chemical series is not opened. For the DYRK1A kinase, the same test molecules were scored from a tabular representation…

Read at arXiv (research papers)

arXiv (research papers) Chellasamy Jebarathinam

Quantum Advantage in Assisted Work Distillation from Complementary Correlations

We establish an operational bridge between microscale thermodynamic work extraction and the foundational characterization of nonclassical correlations in bipartite quantum systems. Within the resource theory of thermal operations, we analyze a generalized framework of assisted work distillation where the trusted receiver's system is divided into separate, independent particle storage pools. We demonstrate that concurrent information-theoretic correlations measured across…

Read at arXiv (research papers)

arXiv (research papers) Zhicheng Zhang Security

Secure Information Flow in Quantum Programs

Information-flow security aims to prevent the leakage of confidential information through program execution. This problem becomes fundamentally subtler for quantum programs, because their states may involve superposition and entanglement, and their executions may involve intricate interactions between classical and quantum variables. This paper develops semantic foundations and verification methods for secure information flow in quantum programs. We formulate two notions of…

Read at arXiv (research papers)

Quantum (journal) Hyun-Soo Kim, Isaac H. Kim, and Daniel Ranard

Learning State Preparation Circuits for Quantum Phases of Matter

Quantum 10, 2270 (2026). https://doi.org/10.22331/q-2026-11-10-2270 Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of many-body ground states. We introduce polynomial-time classical algorithms that take reduced density matrices over $\mathcal{O}(1)$-sized balls as inputs, and output a circuit…

Read at Quantum (journal)

arXiv (research papers) Stefano Pirandola

CV-TF-QKD

We introduce a continuous-variable version of twin-field quantum key distribution, using independent Gaussian-modulated coherent states and an untrusted single-photon relay. Full-record reconciliation and a binary phase-disclosure protocol achieve nearly equal asymptotic key rates against collective attacks. At fixed weak input-referred excess noise per arm, both rates per relay use scale as $\sqrtη$, where $η$ is the end-to-end transmissivity. For phase disclosure, we…

Read at arXiv (research papers)

Quantum (journal) Carlos E. Lopetegui-Gonzalez, Massimo Frigerio, and Mattia Walschaers

Geometric characterization of non-Gaussian entanglement for finite stellar rank states

Quantum 10, 2269 (2026). https://doi.org/10.22331/q-2026-11-10-2269 We introduce a general framework for the analysis of non-Gaussian entanglement in bosonic states of finite stellar rank. The central result is the full characterization of their entanglement structure through the atomic decomposition of their stellar polynomial and its associated structural graph, whose connected components determine the mode-intrinsic entanglement content of the state and all partitions…

Read at Quantum (journal)

arXiv (research papers) Gubio G De Lima

PINNverse meets Jordan--Wigner: learning the Hamiltonian of long spin chains

Inverse physics-informed neural networks (PINNverse) learn the parameters of a quantum Hamiltonian from measured expectation values, but the network output grows as $4^N$ with the number of qubits $N$. We show that, for spin chains with nearest-neighbor exchange interactions, the Jordan-Wigner transformation removes this exponential cost: the dynamics closes on an $N\times N$ one-body density matrix, so the network needs only $N^2$ outputs and the data are local observables…

Read at arXiv (research papers)

arXiv (research papers) Edward Jiang

Normalizing Flows for Classical Simulation of Quantum Circuits in Phase Space

We present a novel framework to learn a representation of quantum circuits based on the phase space formulation of many-body systems. Given that $N$-qubit states can be represented as probability distributions on a smooth $2N$-dimensional manifold, we show how unitary gates can be parameterized as normalizing flows between these distributions, opening a new avenue for quantum circuit simulation using generative models. We evaluate our method on three common families of…

Read at arXiv (research papers)

Quantum (journal)

Simulating Gaussian boson sampling on graphs in polynomial time

Quantum 10, 2268 (2026). https://doi.org/10.22331/q-2026-11-10-2268 We show that a distribution related to Gaussian Boson Sampling (GBS) on graphs can be sampled classically in polynomial time. Graphical applications of GBS typically sample from this distribution, and thus quantum algorithms do not provide exponential speedup for these applications. We also show that another distribution related to Boson sampling can be sampled classically in polynomial time.

Read at Quantum (journal)

arXiv (research papers) Yu-Hao Chen

Pool-free, residual-triggered ansatz growth for variational imaginary-time evolution: when a fixed operator order beats adaptive screening

Adaptive variational algorithms such as ADAPT-VQE and AVQITE screen an operator pool at every growth step, and ADAPT-VQE also re-optimizes all parameters. We study a pool-free alternative for variational imaginary-time evolution (VITE). The layers are fixed in advance by nested commutators of the Hamiltonian, grouped by symmetry and particle number, and the next layer is appended when the relative McLachlan residual exceeds a threshold. On five non-integrable systems (the…

Read at arXiv (research papers)

Quantum (journal) Jahan Claes

Lower-depth local encoding circuits for the surface code

Quantum 10, 2267 (2026). https://doi.org/10.22331/q-2026-11-10-2267 The surface code is the most studied error-correcting code thanks to its high threshold, simple decoding, and locality in two dimensions (2D). A key component of any code is its encoding circuit, which maps an unencoded state to the corresponding encoded state. The best previous surface code encoding circuit compatible with 2D local connectivity requires depth $2d$ to encode distance-$d$ surface codes. This…

Read at Quantum (journal)

arXiv (research papers) Kan He

Maximal Violation of Mermin Inequality for Commuting von Neumann Algebras and Multipartite Vacuum Entanglement in QFT

Summers and Werner proved that Bell inequalities are violated maximally and generically in the vacuum of a relativistic quantum field theory in [S. J. Summers and R. Werner, Commun. Math. Phys. 110 (1987), 247-259]. Their criterion concerns two-party case, that is, there are two algebras of quantum observables: one algebra and its commutant. In this case, the maximal CHSH value is converged to in every normal state exactly when the algebra is strongly stable. In the paper…

Read at arXiv (research papers)

Older stories