Quantum technology: research

489 research items

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

arXiv (research papers) Andrew D. Kim

High-temperature Gibbs states are uniformly Markovian and trivial

We prove that, above a constant temperature threshold, Gibbs states of local noncommuting qudit Hamiltonians exhibit exponential decay of mutual information and conditional mutual information (CMI). Specifically, we prove exponential decay of the CMI for arbitrary spatial tripartitions $A \sqcup B \sqcup C$ which need not comprise the entire system, thereby establishing a \textit{uniform Markov property} for high-temperature Gibbs states. A central obstruction to proving…

Read at arXiv (research papers)

arXiv (research papers) Yansheng Zhang

Local velocimetry for atomic superfluids: from Riemann rarefaction waves to quantized vortices

We demonstrate local velocimetry for atomic superfluids in two dimensions (2D). Using matter-wave interferometry based on Raman--Bragg beam splitters, we map the local gradient of the phase of the superfluid's wavefunction onto displacement of the interference fringes and reconstruct the 2D velocity field. We illustrate the capabilities of this technique by applying it to two canonical problems. First, we directly observe the self-similar evolution of the velocity field in…

Read at arXiv (research papers)

arXiv (research papers) Egil Bae

Query-Optimal Quantum Minimum Finding from Numerical Estimators

We propose a quantum minimum-finding algorithm for objectives accessed via numerical estimators that avoids the logarithmic query overhead of amplifying the confidence of estimates before the search. A coherent estimator that is $\varepsilon$-accurate with probability at least $2/3$ on each of $N$ labels suffices to find a $2\varepsilon$-optimal label using $O(\sqrt N)$ base-estimator queries at constant confidence. The query bound and the additive-error constant are…

Read at arXiv (research papers)

arXiv (research papers) David Halpenny

Fast, in-place, and ancilla-free quantum algorithms for integer multiplication and inversion

Arithmetic operations are a fundamental building block in the design of quantum algorithms, with their implementation cost expected to have a significant impact on the viability of a wide variety of quantum applications. In this work, we present novel algorithms for a number of in-place quantum arithmetic operations that are highly efficient in terms of their space and gate count overheads compared to the current state-of-the-art. We show that in-place modular multiplication…

Read at arXiv (research papers)

arXiv (research papers) Runze Chi

Scalable Simulation of Strongly Correlated Fermions with Neural Gaussian Tensor Networks

Accurate simulations of strongly correlated electrons remain a central challenge in computational physics. We introduce neural-network Gaussian projected entangled-pair states (NN-GPEPS), which exploit the locally-entangled subspace of Gaussian states to give an architecture more compatible with modern neural networks and an exact contraction cost of $O(N^{3/2})$ on two-dimensional lattices. For the Hubbard model at $U/t=8$ and $1/8$ hole doping, we obtain state-of-the-art…

Read at arXiv (research papers)

arXiv (research papers) John M. Martyn

High-Accuracy Neural-Network Quantum States via Randomized Real-Time Dynamics

Neural-network quantum states (NQSs) exhibit a disparity in converging to the ground state during energy minimization: while the energy converges quadratically with the error in the variational wave function, other observables converge only linearly, which limits the accuracy of physical predictions. Here we show how to close this gap by introducing a new algorithm that improves the accuracy of NQSs. Our method, termed dynamical averaging, estimates expectation values by…

Read at arXiv (research papers)

arXiv (research papers) Mohsen Bagherimehrab

End-to-End Quantum Algorithm for Differential Equations: Application to Simulating a Biomolecular System

Quantum algorithms for differential equations have the potential for substantial algorithmic speedups over classical methods. However, they rely on certain assumptions and abstract oracle specifications that leave their practical feasibility and computational advantages for realistic applications unclear. Here we formalize the concept of an end-to-end quantum algorithm for differential equations as one that accepts classical inputs and returns classical outputs, and provide…

Read at arXiv (research papers)

arXiv (research papers) Mario Herrero-Gonzalez

Classically Trained Quantum Generative Models with Shared Training and Fine Tuning for Quantum Matter

Ground-state measurement statistics characterize quantum matter. Selected correlations can guide the classical training of a quantum sampler even when sampling the full distribution is difficult. We ask whether training across related ground-state distributions helps the sampler reproduce their correlations more accurately. We train a hypernetwork to map Hamiltonian parameters to circuit angles, sharing information across the phase diagram before local fine-tuning with…

Read at arXiv (research papers)

arXiv (research papers) Alper Cakan Security

Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA

Remark: This work is in submission at STOC'27 and thus the full manuscript has been publicly posted on the conference website since November 3rd, 2026. Inspired by the Codeword-Hash Structure problem recently introduced by Cakan (arXiV, 2026) to separate $\mathsf{QMA}$ from $\mathsf{QCIP}$, we introduce a new problem called Codeword-Hash pairs in Noise ($\mathsf{CHN}$) and prove that, in the query complexity model, it is in $\mathsf{QMA}$ but hard for the $\mathsf{QCMA}$…

Read at arXiv (research papers)

arXiv (research papers) Florian J. Curchod

Authenticating quantum key distribution through random position checks

Quantum key distribution (QKD) requires some form of authentication in order for the parties to be sure they are not unknowingly generating a key with an adversary pretending to be one of the honest parties. In this work, we propose a protocol in which the position of one of the parties is used as the authentication credential for key distribution. Our protocol essentially consists of a BB84 QKD protocol with quantum position verification (QPV) rounds randomly interleaved…

Read at arXiv (research papers)

arXiv (research papers) Javier Rey-Domínguez

On the design of sequential quantum repeaters with error detection

Long-distance, trust-free quantum communications rely on the development of scalable quantum repeater schemes. Sequential entanglement generation with error detection is a promising approach that combines manageable implementation requirements with a hop-by-hop architecture compatible with existing classical infrastructure. In this paper, we investigate key design choices for such schemes over a repeater chain using quantum key distribution as a benchmark. We find that…

Read at arXiv (research papers)

arXiv (research papers) Pradip Laha

Hamiltonian Stabilization of the Two-Photon Dicke Model

Collective two-photon light--matter interactions enable pair amplification but can destroy spectral confinement, preventing a stable thermodynamic bright phase. We show that a positive Kac-scaled number-Kerr interaction renders the two-photon Dicke Hamiltonian of \(N\) emitters lower-bounded at all couplings while preserving its generalized \(\mathbb Z_4\) symmetry. We determine the exact zero-temperature thermodynamic energy density with \(O(N^{-1})\) finite-size control…

Read at arXiv (research papers)

arXiv (research papers) Cory T. Aitchison

When the Noise Gets Noisy: Quantum Error Correction with Disordered Noise and Misinformed Decoding

Experimental demonstrations of quantum error correction often exhibit noise that varies across space and time, and attempting to characterize this disorder has been shown to substantially improve decoding performance. However, theoretical studies of quantum error correction typically assume fixed, perfectly known, homogeneous noise. Here we model decoding with incomplete or inaccurate knowledge of disordered noise channels by treating physical error rates as random…

Read at arXiv (research papers)

arXiv (research papers) Zhiyao Hu

Optimal Error corrected Hamiltonian estimation with nuisance parameters

Realistic quantum sensing is often affected by both noise and unknown nuisance parameters. Under Markovian dynamics, existing error correction approaches have often sought to suppress nuisance responses alongside environmental noise. Here we show that this local suppression of nuisance parameters is unnecessary and can be overly restrictive: nuisance parameters and Markovian noise impose fundamentally different constraints and require distinct treatments. We establish a…

Read at arXiv (research papers)

arXiv (research papers) Chenyang Jin

Scaling classical hardware for accurate real-time quantum error correction

Fault-tolerant quantum computation requires a classical decoder fast enough to process syndrome measurements at the rate at which they are generated, and to return its decisions with low latency. This is most demanding for superconducting processors, whose fast syndrome cycles force a trade-off between decoding speed and accuracy. Decoders fast enough to keep up sacrifice accuracy, which must be compensated for with larger codes and thus additional physical qubits. Here we…

Read at arXiv (research papers)

arXiv (research papers) Maria Gragera Garces

When lies look like noise: certifying untrusted entanglement swapping

Entanglement swapping lets quantum repeaters distribute entanglement over long distances, a prerequisite for the quantum internet. We study its security in a noisy network whose intermediate nodes perform the quantum operations faithfully but may misreport the classical outcome that end users rely on. We show that the ideal functionality of entanglement swapping cannot be realised, because it gives the adversary no influence over the delivered state, whereas a node that…

Read at arXiv (research papers)

arXiv (research papers) Donghoon Kim

Tunable Ground-State Entanglement in Fully Connected Quantum Systems: From Logarithmic to Volume-Law Scaling

Entanglement scaling is a central probe of the complexity of quantum many-body ground states, yet once geometric locality is absent, it can depend sensitively on the structure and normalization of interactions. For fully connected Hamiltonians with the natural Kac normalization, nondegenerate gapped ground states are known to obey a logarithmic entanglement bound. Here we ask how the ground-state entanglement changes when this interaction normalization is continuously…

Read at arXiv (research papers)

arXiv (research papers) Stefano Tinelli

Non-Binary Detector Error Models

A key challenge in fault-tolerant quantum error correction (QEC) is that the syndrome extraction circuits are themselves faulty. Such circuit-level noise is commonly described by a detector error model (DEM). In Stim and in almost all related works, DEMs are binary: every non-binary circuit error (e.g., CNOT gate), is decomposed into independent binary error mechanisms. In this work, we introduce non-binary DEMs, in which each fault location of the syndrome extraction…

Read at arXiv (research papers)

arXiv (research papers) Ziyi Yang

Efficient Classical Algorithms for Ground Energy Estimation of Fermions with Conjugate-Pair Orbital Interactions

Estimating the ground energy of interacting fermions is central to quantum many-body physics, and recent quantum algorithms provide polynomial-time guarantees for some structured families. Classical approaches commonly rely on quantum Monte Carlo, where the sign problem is a major obstacle. However, even when a nonnegative expansion without sign problem is available, rigorous guarantees for rapid mixing are still far from well understood. In this paper, we give an efficient…

Read at arXiv (research papers)

arXiv (research papers) Sagi Meir

Imaginary-Time Density Correlations Encode Quantum Entropy and Free Energy

In the classical limit, maximum-entropy inference yields an estimate of the excess entropy from the static structure factor through a single momentum sum. Quantum mechanically this estimate fails, because interactions also change the kinetic energy, while delocalization and exchange add information that equal-time correlations do not contain. We show that imaginary-time density correlations contain this information, and that with them the classical relation carries over to…

Read at arXiv (research papers)

arXiv (research papers) Yamen Hamdouni

Effect of coupling asymmetry on the spontaneous decay and entanglement of two atoms in a common cavity

We investigate the dynamics and the spontaneous decay of two identical two-level atoms into the vacuum in a cavity at low temperature. We analytically derive the survival probability and the amplitudes of the state of the system by calculating the exact self-energy when the atoms are both initially excited. It is found that moderate asymmetry enhances the decay of the survival probability and increases the entanglement production in either lossless and lossy cavities.

Read at arXiv (research papers)

arXiv (research papers) Olivia Seidel

Quantum Zeno Effect with a Superposed Measurement Schedule in Relational Time

Motivated by the Page-Wootters construction in which time is a quantum clock reading and the global system state is stationary, we propose a quantum circuit that explores the observable consequences of treating measurement timing as a quantum degree of freedom. We place two Zeno measurement schedules of a driven qubit in a coherent superposition using a schedule qubit. We show that, for a fixed drive strength, the interference visibility between the two schedules depends…

Read at arXiv (research papers)

arXiv (research papers) Sugumi Kanno

Entanglement, records, and quantum recovery in qubit chains

We investigate entanglement, readable records and quantum recovery using an exactly solvable chain of sequentially interacting qubits. For weak interactions, entanglement reaches a later environment site before that site carries an equally strong local record. The leading local record is encoded in an off-diagonal element of the reduced density matrix and can be detected by a Pauli measurement, while a population measurement gives a higher-order signal. We further…

Read at arXiv (research papers)

arXiv (research papers) Shuai Zhang

Quantum Autoencoder on Real Hardware for New Physics Searches at Muon Colliders

We apply a quantum autoencoder to search for new physics (NP) in the tri-photon process $μ^+μ^-\toγγγ$ at muon colliders. Using a six-qubit circuit on the Tianyan176 quantum computer, we measure the reconstruction losses for Standard Model (SM) events and anomalous quartic gauge couplings (aQGCs) events. The results demonstrate that the hardware-implemented quantum autoencoder effectively discriminates NP signals from the SM background. Concurrently, we derive the expected…

Read at arXiv (research papers)

arXiv (research papers) Pedro R. Dieguez

Quantifying the irrealism required by quantum random access codes

How far must decoding observables be from having elements of reality to achieve a given quantum advantage in a communication task? We answer this question for quantum random access codes. Here, an observable has an element of reality when its unrevealed measurement leaves the preparation undisturbed; its irrealism is the relative entropy to the closest such preparation. Because it comprises local coherence and the correlations destroyed by the unrevealed measurement…

Read at arXiv (research papers)

Quantum (journal)

Improved parameter initialization for the (local) unitary cluster Jastrow ansatz

Quantum 10, 2278 (2026). https://doi.org/10.22331/q-2026-11-19-2278 The unitary cluster Jastrow (UCJ) ansatz and its variant known as local UCJ (LUCJ) are promising choices for variational quantum algorithms for chemistry due to their combination of physical motivation and hardware efficiency. The parameters of these ansatzes can be initialized from the output of a coupled cluster, singles and doubles (CCSD) calculation performed on a classical computer. However, truncating…

Read at Quantum (journal)

arXiv (research papers) Xin Jin Security

Correctable Enrollment and One-Transaction Seed Proofs for Ethereum's Post-Quantum Transition

A quantum computer running Shor's algorithm can extract the private key of every Ethereum account whose public key is published, and accounts exposed by their own transactions hold 54.6% of execution-layer ETH. As the first such machine may stay secret, a migration cannot wait for visible thefts, and once keys are extractable, legacy signatures no longer tell owners from attackers. We design a migration in which owners enroll post-quantum keys cheaply with their existing…

Read at arXiv (research papers)

arXiv (research papers) Jungmin Park Security

From FIPS to FPGA with LLM Agents: Measuring What Tests and Reviews Miss in Post-Quantum Cryptographic Hardware

As LLM agents increasingly generate RTL alongside the tests and reviews that validate it, self-generated evidence is a weak foundation for trustworthy hardware. We present our seven-stage verification-gated workflow, evolved during a post-quantum design port, in which a gate counts only if shown able to fail on negative controls and fault mutants, and reviewer agents audit work before commit. We then audit this evidence with tool-selected netlist mutants, flaw replays, and…

Read at arXiv (research papers)

npj Quantum Information HANWEN YIN

High-key-rate fully-passive quantum access network with thermal source

npj Quantum Information, Published online: 19 November 2026; doi:10.1038/s41534-026-01412-x High-key-rate fully-passive quantum access network with thermal source

Read at npj Quantum Information

Older stories