Quantum technology: research

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

arXiv (research papers) William Bolduc

Quantum Coloring Games on Complete Graphs

We study the nonlocal game where two players are both given an input ($x$ and $y$, respectively), from a set of size $n$ and, without communicating, must give outputs $a$ and $b$, respectively, from a set of size $m < n$, winning when $(x = y) \leftrightarrow (a = b)$. This can be considered a graph coloring game on the complete graph with $n$ vertices. In the simplest case, the players get random equal inputs with probability $\frac{1}{2}$ and random unequal inputs…

Read at arXiv (research papers)

arXiv (research papers) William S. McGregor

Hidden Momenta due to Magneto-Electric Coupling in Non-Reciprocal Media

From a canonical quantisation approach of macroscopic quantum electrodynamics, we derive the interaction Hamiltonian due to a dipole emitter interacting with a time-symmetry-broken topological insulator (TSB-TI), described by an axionic coupling Lagrangian. This provides an additional interaction term dependent on the magneto-electric coupling strength inherent to the TSB-TI which will modify measurements on related observables. The spontaneous decay rate is calculated in…

Read at arXiv (research papers)

arXiv (research papers) Vicente Leyton-Ortega

Certifying quantum generative models beyond the Fisher trace

Whether a trained quantum generative model has learned its target is usually decided by a diagnostic validated on a labeled benchmark, and such a diagnostic can pass that validation by recovering how the benchmark was built. We analyze Fisher-trace and kernel-based certification of the real-amplitude quantum circuit Born machine in noiseless statevector simulation. For real-amplitude circuits built from half-angle rotations, the classical Fisher information equals the…

Read at arXiv (research papers)

arXiv (research papers) Avani Vivrekar

Gate tunable spin splitting for Andreev spin qubits in Ge quantum well heterostructures

Ge-based super-semi heterostructures are a promising platform for implementing Andreev spin qubits (ASQs). For example, they can be isotopically purified to eliminate nuclear spins that cause decoherence. However, spin-orbit coupling (SOC), which is a key ingredient for ASQs, is cubic in momentum for hole-based materials like Ge, in contrast with more-conventional ASQ materials (e.g., InAs wires), for which the SOC is linear in momentum. In this work, we study the interplay…

Read at arXiv (research papers)

arXiv (research papers) Joel Bierman

Double-Randomized Quantum Singular Value Transformations For Early Fault-Tolerant Quantum Computers

The Quantum Singular Value Transformation (QSVT) is an algorithmic framework which encompasses a wide range of problems, including Hamiltonian dynamics, ground state preparation, Gibbs state preparation, amplitude amplification, and matrix inversion. For many areas of scientific interest such as quantum chemistry and condensed matter, the circuit depth of the block-encoding subroutine in QSVT can be formidable, limiting the scope of problems to which QSVT can be applied on…

Read at arXiv (research papers)

arXiv (research papers) Babak Vakili

Landauer erasure and horizon information in an expanding universe

We investigate the thermodynamic cost of information erasure in Friedmann--Robertson--Walker cosmology by combining Landauer's principle with the thermodynamics of the apparent horizon. Adopting the apparent-horizon temperature as an effective cosmological temperature, we find that for standard non-phantom expansion, the minimum heat required to erase one bit decreases while the entropy-equivalent information content of the horizon increases. We further compare the Landauer…

Read at arXiv (research papers)

arXiv (research papers) Aparna Gupte Security

A Quasipolynomial Quantum Algorithm for the Vector Dihedral Coset Problem with Smooth Modulus

We give a quantum algorithm for the vector dihedral coset problem over $\mathbb{Z}_q^n$, in which the goal is to recover $\mathbf{s} \in \mathbb{Z}_q^n$ given independent samples of the form $\frac{1}{\sqrt{2}}\bigl(|{0,\mathbf{x}}\rangle+|{1,\mathbf{x}+\mathbf{s}}\rangle\bigr)$, for $\mathbf{x}\sim \mathbb{Z}_q^n$. When the modulus $q$ is $B$-smooth, the algorithm uses $n^{O(B^{1+o(1)}\log q)}B^{O(B^{2+o(1)}\log q)}$ samples and time. For $B = \mathrm{polylog}(n)$ and…

Read at arXiv (research papers)

arXiv (research papers) Hari Timsina

Flexible ground-state search algorithm on hybrid Clifford-tensor network manifolds

Tensor network algorithms face challenges in highly entangled regimes, such as systems with periodic boundary conditions (PBC), long-range interactions, or higher dimensions, where the required bond dimension quickly renders computations infeasible. To overcome this limitation, we introduce a novel approach that integrates the stabilizer formalism directly into the traditional density-matrix renormalization group (DMRG) algorithm. While previous methods have used Clifford…

Read at arXiv (research papers)

arXiv (research papers) Andreas Raikos

Gapless Nature of Spin Liquid in the $S=1/2$ Kagome Heisenberg Antiferromagnet with Neural-Network Quantum States

Whether the spin-$1/2$ kagome Heisenberg antiferromagnet hosts a gapped $\mathbb{Z}_2$ or a gapless $U(1)$ Dirac spin liquid remains a central open question in frustrated magnetism. Here, we address this question by directly computing the triplet gap with a neural-network quantum state that does not presuppose any specific spin-liquid structure. Applying a time-reversal symmetric transformer-based ansatz to clusters of up to $768$ sites, we obtain state-of-the-art…

Read at arXiv (research papers)

arXiv (research papers) Boyu Gao

Real-time simulation of scattering in $φ^4$ theory: localized excitation, scalable wave packet preparation, and peak-generating artifacts

Probing real-time dynamics is essential for understanding non-perturbative scattering and interactions in quantum field theory. A common challenge in real-time simulation is preparing accurate asymptotic incoming states. Through efficiently solvable eigenvalue problems, we jointly optimize a superposition of single particle momentum eigenstates and a single site interpolating operator to maximize preparation fidelity from the interacting vacuum. This leads to a localized…

Read at arXiv (research papers)

arXiv (research papers) Robert Schade

Complex fluid flow dynamics by bright scattershot boson sampling

Boson sampling machines have become a fruitful tool for establishing new concepts, which connect fundamental physics with computer science applications. Here, we exploit the intrinsically high-dimensional correlations generated by the measurement outcomes of a multiphoton boson sampling machine and demonstrate how a reconfigurable architecture can be programmed to autonomously model the time evolution of nonlinear dynamical systems that describe complex fluid flows. By…

Read at arXiv (research papers)

arXiv (research papers) Aritra Lahiri SI

Agentic AI for Discovering Fault-Tolerant Quantum Circuits

Scaling quantum computing toward practical quantum advantage is currently limited by the efficiency of circuits that operate on information encoded by quantum error-correcting codes. The full stack of quantum computing encompasses several tasks: preparation of logical code states, implementation of logical gates, logical routines on encoded qubits, etc. Yet, these circuits are largely designed by hand for individual cases, with some recent works incorporating machine…

Read at arXiv (research papers)

arXiv (research papers) David A. Mazziotti

Solution of the Qubit Marginal Problem from Fermionic Representability

Whether local reduced states are compatible with a global quantum state---the quantum marginal problem---is central to quantum information and simulation. Here we present a solution to the ensemble marginal problem for qubits based on the representability theory of fermions. Encoding each qubit as one fermion in two orbitals, we prove that the representable qubit marginals form an exposed face of the set of $N$-representable fermionic reduced density matrices, selected by…

Read at arXiv (research papers)

arXiv (research papers) Ellen Martins Fernandes

Dissipation as a Resource for Entanglement via High-Spin Mediator Purification

We study entanglement generation between two spin qubits mediated by a single, thermally mixed, high-spin ($S=5/2$) magnetic impurity, using the Lindblad master equation to compare coherent and dissipative control of the mediator. We show that no coherent drive, however strong or resonant, can purify the mediator beyond its thermal value --- a direct consequence of unitary evolution exactly preserving state purity --- while a dissipative channel purifies it up to the limit…

Read at arXiv (research papers)

arXiv (research papers) Jiayu Fu

Beyond Blossom: Accelerating MWPM Decoding for Surface Codes With Local Predecoding and Architecture-Aware Optimizations

Minimum-weight perfect matching (MWPM) is widely used to decode surface codes, but its computational cost increases with code distance. We present Beyond Blossom, a state-of-the-art CPU-based MWPM decoder for surface codes. It combines algorithmic optimization through local predecoding, architecture-aware optimization, and pipeline-wide parallelism to reduce matching workload and execution overhead while preserving MWPM optimality. Across rotated surface codes with distances…

Read at arXiv (research papers)

arXiv (research papers) Adnan Jaljuli

Symmetry-Controlled Quantum State Transfer in Poly-bi-[8]-annulenylene: From Heisenberg to Hubbard Dynamics

We investigate quantum state transfer in the poly-bi-[8]-annulenylene lattice using isotropic Heisenberg and Hubbard models. For a 16-site lattice, reflection symmetry separates the single-excitation Hamiltonian into independent triplet and singlet sectors, allowing analytical determination of the energy spectra. Although perfect state transfer is forbidden for positive couplings, appropriately chosen coupling ratios enable pretty-good transfer with arbitrarily high…

Read at arXiv (research papers)

arXiv (research papers) Yuehaw Khoo

Learning observable propagation with sparse local moments

We propose a unified framework for predicting local moment dynamics in high-dimensional many-body systems from short-time trajectories. Thanks to the locality of the dynamics, we construct the transition moment matrices by projecting the Markov operator onto low-order connected-cluster basis functions supported near the target observable. Exploiting the spatial decay of time-lagged correlations, {these matrices} can be approximated in sparse-plus-low-rank form using…

Read at arXiv (research papers)

arXiv (research papers) Xiangqian Wua

Nesting in additive manufacturing using quantum annealing

Nesting in powder bed fusion (PBF), an additive manufacturing (AM) process, determines the positions and orientations of parts within the build space and influences build height and build time. As the number of parts and feasible placements increases, the nesting problem becomes computationally demanding. Exact approaches are limited to small problem sizes as computational effort increases rapidly with the problem size, while heuristic and metaheuristic approaches involve a…

Read at arXiv (research papers)

arXiv (research papers) Daniel Bultrini

Tessa: Encoding Classical Data Across an Entire Quantum Processor

We present Tessa, a hardware-aware, device-wide scheme to encode classical data on quantum computers. We use it to experimentally encode and decode up to $1568$ real values using IBM's Phoenix and Fez quantum computers on a variety of data. Tessa's construction is an extension of QPIXL and QCrank. However, it checkerboards address and data qubits across a coupling graph with neighbouring data qubits sharing only a subset of address qubits. When using the device's coupling…

Read at arXiv (research papers)

arXiv (research papers) Shachar Fraenkel

Entanglement and information dynamics in charged dual-unitary circuits with impurities

Local parts of a closed, non-equilibrium quantum many-body system can reach stationarity through the buildup of entanglement between different regions. In this paper we investigate how this process is affected by the presence of a quantum impurity that breaks a global symmetry of the bulk. In particular, we study a charged dual-unitary quantum circuit perturbed by a symmetry-breaking, non-dual-unitary gate acting on a spatially fixed pair of sites. In this setup we calculate…

Read at arXiv (research papers)

arXiv (research papers) Qi Yang

Transfer-Matrix Calculus for Infinite Matrix Product States

Long-range interactions, from the Coulomb repulsion between electrons to the power-law interactions of trapped ions and Rydberg atoms, are widespread in quantum many-body physics. For infinite systems, however, MPS algorithms, the standard classical reference in one dimension, conventionally rely on a computational compromise: replacing these interactions by fitted sums of exponentials. We develop transfer-matrix calculus (TMC), a unified framework for deriving infinite-MPS…

Read at arXiv (research papers)

arXiv (research papers) Christian Niehof

Number fluctuations and particle loss in Dicke superradiance

Dicke superradiance, the collective spontaneous emission of identical quantum emitters into a common reservoir, produces a burst with a characteristic delay $t_{\mathrm{SR}}$ and a peak intensity that scales quadratically with the emitter number $N$. This strong dependence makes the burst sensitive to how many emitters actually participate. In experiments, however, this number is rarely fixed: it fluctuates between preparations and decreases during emission through atom…

Read at arXiv (research papers)

arXiv (research papers) Payman Mahmoudi

Quantum computational spectroscopy of complex resonances and optical residues

Optical spectra of dissipative molecular systems depend on both complex resonance energies and the way each resonance couples to an optical probe. In a non-Hermitian description, these con- tributions are determined by complex residues involving left and right eigenvectors. We introduce a quantum protocol that reconstructs the resonance poles and their biorthogonal optical residues within a common spectral-filtering and measurement framework. A Hermitian dilation embeds the…

Read at arXiv (research papers)

arXiv (research papers) Wenbo Xie

Structure makes quantum circuits trainable

The scalability of variational quantum algorithms is limited by barren plateaus, where gradients vanish exponentially in system size. This worst-case result raises fundamental questions about the trainability of quantum AI models. We present a major advance towards resolving this trainability question by answering whether a given quantum circuit has a barren plateau. We do this using an analytical framework that bounds the gradient variance for arbitrary input states $ρ$ and…

Read at arXiv (research papers)

arXiv (research papers) Dingwei Zhao

Efficient Parameter Estimation through Quantum Extreme Learning

Quantum sensing protocols rely on the efficient processing of measurement outcomes to infer unknown physical parameters. Conventional optimal estimators, such as Bayesian inference and maximum likelihood estimation, require to construct a likelihood function whose efficient classical construction requires full knowledge of the dynamics, which may practically be infeasible. Model-free experimental construction of the likelihood is also very resource intensive. Here, we…

Read at arXiv (research papers)

arXiv (research papers) Jorge López González

Quantum thermometry with k-local Hamiltonians

In equilibrium quantum thermometry, the precision of temperature estimation increases with the heat capacity of the probe thermometer. For an n-body thermometer, the maximum heat capacity is attained by a Hamiltonian that requires n-local interactions, making its physical implementation challenging. In the thermodynamic limit, the optimal heat capacity scales quadratically with n. Although more experimentally accessible 2-local Hamiltonians can achieve this optimal scaling…

Read at arXiv (research papers)

arXiv (research papers) Bonan Su

Formulating Uncomputation Beyond Classical Ancilla Use

Ancilla qubits are routinely used to simplify quantum circuit construction and reduce implementation costs, but their use introduces the burden of designing proper uncomputation afterward. To alleviate this, prior work has developed automated uncomputation synthesis based on a computational-basis formulation of ancilla use. However, this formulation is tailored to classically structured ancilla computations. For more general circuits, it may be undefined, yield unintended…

Read at arXiv (research papers)

arXiv (research papers) Jiale Mi

Chip-Based Discrete-Modulated Continuous-Variable Quantum Key Distribution with Uncertainty-Principle-Based Composable Security

Continuous-variable quantum key distribution offers a promising platform for scalable quantum networks through its compatibility with standard telecommunications technology and photonic integration. High-order discrete modulation facilitates practical implementation while approaching the key-rate performance of ideal Gaussian modulation, but its finite-size composable security analysis entails substantial computational overhead. Here, we develop an…

Read at arXiv (research papers)

arXiv (research papers) K. G. S. H. Gunawardana

Observing Enhanced Entanglement in an Ising Quantum Register Beyond Weak Measurement

Measurements often yield a disentangled quantum state which is the most probable measurement outcome while the measurement outcomes with enhanced entanglement could be exponentially less probable or absent. Higher probability in measurement outcomes with enhanced entanglement is virtue in experimental observation of enhance entanglement in post-selected or Born-rule measurements with less resources in noisy quantum devices. We develop a periodic measurement sampling(PMS)…

Read at arXiv (research papers)

arXiv (research papers) Lorenzo Bagnasacco

Fer expansion converges almost twice as far as Magnus for qubits

The Fer expansion writes the propagator of a time-dependent Hamiltonian as a product of unitary exponentials whose error decreases doubly exponentially with the number of factors, while the Magnus expansion improves by one order at a time. Its convergence, however, was guaranteed only below a radius of about $2.6058$, smaller than the Magnus radius $π$. We establish a guaranteed convergence threshold of about $6.2106$, or $1.98\,π$, for a qubit. This is almost twice the…

Read at arXiv (research papers)

Older stories