Showing 1–50 of 677 results for author: Kim, S

Memory-, Circuit-, and Ansatz-Efficient VQLS for CFD on Hybrid Quantum-HPC Systems

Authors: Chao Lu, Muralikrishnan Gopalakrishnan Meena, Eduardo Antonio Coello Perez, Kalyana Chakravarthi Gottiparthi, Seongmin Kim

Abstract: Fluid dynamics workloads are dominated by repeated solves of large, structured linear systems, motivating the search for quantum acceleration. The Variational Quantum Linear Solver (VQLS) is a leading near-term candidate, but practical deployment on hybrid quantum--high--performance computing (HPC) systems faces three persistent challenges: (i) the linear-combination-of-unitaries (LCU) encoding of… ▽ More Fluid dynamics workloads are dominated by repeated solves of large, structured linear systems, motivating the search for quantum acceleration. The Variational Quantum Linear Solver (VQLS) is a leading near-term candidate, but practical deployment on hybrid quantum--high--performance computing (HPC) systems faces three persistent challenges: (i) the linear-combination-of-unitaries (LCU) encoding of the system matrix explodes in memory and runtime as the problem size grows, (ii) ansatz selection is largely empirical, with no clear link between standard circuit metrics and solver convergence, and (iii) end-to-end VQLS pipelines have rarely been exercised on production HPC hardware at non-trivial qubit counts. This work addresses these challenges through three contributions. First, we benchmark four matrix-encoding strategies---naive LCU, PennyLane-integrated, Fast Walsh--Hadamard Transform (FWHT)-based parallel Pauli decomposition, and an singular value decomposition (SVD)-based two-term LCU---and show that the FWHT approach reduces peak memory by up to $1298\times$ on an $11\times 11$ Hele--Shaw grid, while the SVD-based coherent VQLS delivers over $10{,}000\times$ per-iteration speedup over standard Pauli-based VQLS at 8 qubits. Second, we evaluate 11 ansatz families with gradient-free and gradient-based optimizers on canonical Hele--Shaw flow, and find that expressibility and entanglement metrics correlate only weakly with VQLS convergence, motivating problem-aware ansatz design. Third, we deploy the full workflow on the OLCF Frontier supercomputer and successfully simulate a 15-qubit tridiagonal Toeplitz system on a single node. Together, these results establish a practical baseline for VQLS in hybrid quantum--HPC computation fluid dynamic (CFD) workflows and identify the remaining bottlenecks for larger problems. △ Less

Submitted 10 August, 2026; originally announced August 2026.

Ring Optimized M-APSK Modulation for Discrete Modulated CV-QKD

Authors: Seonguk Kim, Jun Heo

Abstract: This paper proposes a multi ring M-APSK constellation optimization method for discrete-modulated continuous variable quantum key distribution. Unlike conventional APSK structures with fixed ring spacing and predefined ring probabilities, the proposed method optimizes the ring radius ratio and ring probability to improve the finite-size secret key rate. A method based on the Gram matrix is used to… ▽ More This paper proposes a multi ring M-APSK constellation optimization method for discrete-modulated continuous variable quantum key distribution. Unlike conventional APSK structures with fixed ring spacing and predefined ring probabilities, the proposed method optimizes the ring radius ratio and ring probability to improve the finite-size secret key rate. A method based on the Gram matrix is used to calculate the nonzero spectrum of the average state $τ$, and fidelity is used to compare the optimized discrete average state with the Gaussian average state. The results show that the proposed structure extends the maximum transmission distance of 16-APSK by approximately 15% compared with the conventional binomial APSK structure. The optimization gain is larger for small size APSK constellations, where the average state has a larger structural gap from Gaussian modulation. △ Less

Submitted 3 August, 2026; originally announced August 2026.

Comments: 16 pages, 6 figures, 2 tables, An earlier conference version covering the 16-APSK results has been accepted for presentation at APWCS 2026

Mixed-state topological order and error-correction thresholds in non-Abelian codes: rigorous results

Authors: Sun Woo P. Kim, Max McGinley

Abstract: We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for n… ▽ More We present a versatile and mathematically rigorous technique for bounding recovery thresholds in topological codes subject to noise. Our method captures the effect of applying an arbitrary (possibly non-Pauli) local noise channel to the code state of a broad class of two-dimensional codes, including surface codes, non-Abelian quantum doubles, and string-net codes. In each case, we prove that for noise strengths up to some explicit constant value, any initially encoded logical information can be recovered to high precision, and that the noise-corrupted state exhibits key hallmarks of mixed-state topological order: long-range entanglement and emergent higher-form symmetries. We also describe how these methods can be adapted to higher dimensions and correlated noise models. △ Less

Submitted 23 July, 2026; originally announced July 2026.

Comments: 24 pages of main text, 40 pages of appendices. 8 figures

The trainability of photonic quantum circuits

Authors: Alexander Makarovskiy, Adam Taylor, Zhenghao Li, Michael Hanks, Aubrey Clark, M. S. Kim, Ian Walmsley, William Clements

Abstract: Variational quantum algorithms are a leading approach to near-term quantum computing, but their scalability can be limited by barren plateaus and the sampling cost of resolving small changes in the loss landscape. Here, we study the trainability of passive linear-optical quantum circuits and introduce a framework based on the ratio of sample variance to circuit variance. This ratio determines the… ▽ More Variational quantum algorithms are a leading approach to near-term quantum computing, but their scalability can be limited by barren plateaus and the sampling cost of resolving small changes in the loss landscape. Here, we study the trainability of passive linear-optical quantum circuits and introduce a framework based on the ratio of sample variance to circuit variance. This ratio determines the number of circuit samples required to resolve local loss differences and gradients to proportional accuracy. We apply this framework to photon-number observables and identify both trainable and non-trainable regimes. Supported by analytic results and a numerically observed polynomial decay of the circuit variance, we find that fixed-order photon-number polynomials require only polynomially many samples as the system size grows, whereas high-order polynomials and observables based on output probabilities generally require exponentially many samples. Within the trainable regime, we further identify classes of observables in which quantum estimation achieves a polynomial speed-up over multiple classical methods. Within this family, neural network observables provide one practical construction that allow measurement outcomes to be efficiently processed into the desired polynomial. These results establish photonic variational quantum computing as a promising platform for near-term applications. △ Less

Submitted 23 July, 2026; originally announced July 2026.

Comments: 53 pages, 10 figures

DQAOA-GPT: AI-Accelerated Distributed Quantum Optimization for Combinatorial Problems

Authors: Seongmin Kim, Abhinav Rijal, Yuri Alexeev, Nora Bauer, Martin Roetteler, Mina Yoon, George Siopsis, In-Saeng Suh

Abstract: While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces. Variational quantum algorithms offer a promising route for tackling such problems, yet their practical performance is limited by repeated quantum circuit evaluations and classical parameter updates. In this work, we intr… ▽ More While combinatorial optimization problems are central to many scientific and engineering applications, their solution remains challenging due to exponentially large search spaces. Variational quantum algorithms offer a promising route for tackling such problems, yet their practical performance is limited by repeated quantum circuit evaluations and classical parameter updates. In this work, we introduce DQAOA-GPT, a hybrid framework that integrates the distributed quantum approximate optimization algorithm (DQAOA), which decomposes a large optimization problem into smaller sub-problems, with GPT-based quantum circuit generation for solving those sub-problems. Rather than relying on iterative variational optimization, the proposed approach uses a trained generative model to directly generate high-quality quantum circuits for the decomposed sub-problems. As a benchmark, we evaluate DQAOA-GPT against conventional DQAOA on dense HUBO optimization problems with up to 100 decision variables. The results demonstrate that DQAOA-GPT significantly reduces computational cost while maintaining competitive solution quality, with larger acceleration observed for larger sub-problem sizes. Although this work focuses on benchmark-scale validation, the framework provides a promising foundation for larger-scale combinatorial optimization in hybrid HPC-QC environments through increased GPU resources and parallel computing capability. △ Less

Submitted 22 July, 2026; originally announced July 2026.

Mean-State Entropy Hierarchies and Classical Communication through Quantum Convolutions

Authors: Chunhe Xiong, Sunho Kim, Qing-hua Zhang, Shao-ming Fei, Junde Wu

Abstract: Quantum convolution provides a discrete-variable analogue of classical convolution, with the mean state capturing the stabilizer structure preserved under repeated convolution. We establish a finite-step entropy hierarchy generated by compatible stabilizer dephasings. Along every compatible isotropic flag, the entropy increases toward the mean-state entropy ceiling, while the relative-entropy dist… ▽ More Quantum convolution provides a discrete-variable analogue of classical convolution, with the mean state capturing the stabilizer structure preserved under repeated convolution. We establish a finite-step entropy hierarchy generated by compatible stabilizer dephasings. Along every compatible isotropic flag, the entropy increases toward the mean-state entropy ceiling, while the relative-entropy distance to the mean state decomposes exactly into successive coherence losses and a terminal classical nonuniformity. Optimizing over compatible subspaces yields an intrinsic entropy profile of the state. For quantum convolutional channels, Weyl covariance reduces the one-shot classical communication problem to minimal output entropy. A spectral-transfer argument shows that suitable stabilizer inputs reproduce stabilizer-measurement distributions of the environment as channel-output spectra. This gives a computable Holevo lower bound over all complete stabilizer measurements; its compatible restriction is characterized by the entropy hierarchy and refines the previous mean-state bound of Bu, Gu, and Jaffe. The bound is exact for stabilizer-diagonal environments, for which the Holevo capacity is strongly additive, and yields a single-letter formula for a nonstabilizer qutrit family. The same family also exhibits a coexistence region with simultaneously positive classical and quantum communication rates △ Less

Submitted 21 July, 2026; v1 submitted 18 July, 2026; originally announced July 2026.

Comments: 10pages, 2 figures, typos corrected

Precision quantum simulation of magnon spectra and interactions

Authors: Trond I. Andersen, Nikita Astrakhantsev, Jeronimo Martinez, Will Morong, Johannes Motruk, Dario Rossi, Brayden Ware, Bryce Kobrin, Weijie Wu, Elizabeth Bennewitz, Manuel Rudolph, Tom Westerhout, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Ross Alcaraz, Sayra Alcaraz, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Juan Atalaya, Christopher Ayala, Ryan Babbush, Brian Ballard , et al. (307 additional authors not shown)

Abstract: Quantum simulation promises to advance materials discovery by accurately simulating complex states of matter, their microscopic excitations, and macroscopic response functions. The central challenge in resolving the underlying interacting dynamics is to combine high-fidelity evolution with the sophisticated control necessary to manipulate individual quasi-particles in quantum many-body states. Her… ▽ More Quantum simulation promises to advance materials discovery by accurately simulating complex states of matter, their microscopic excitations, and macroscopic response functions. The central challenge in resolving the underlying interacting dynamics is to combine high-fidelity evolution with the sophisticated control necessary to manipulate individual quasi-particles in quantum many-body states. Here, we report on high-precision simulation of both linear and non-linear response functions in a 2D XY spin-1/2 magnet using an analog-digital superconducting processor of up to 97 qubits. By interleaving digital gates with analog evolution precisely characterized via Hamiltonian learning, we selectively excite magnons at tunable energy densities. Measuring first the linear magnon response -- a central probe in neutron-scattering experiments -- we extract temperature-dependent spectra and lifetimes. Our results reveal stark variations in magnon decay rates across the Brillouin zone, with enhancement near van Hove singularities and suppression for edge-localized modes. Next, we perform a suite of nonlinear measurements, including the study of self-scattering mechanisms, as well as pump-probe spectroscopy to directly characterize the magnon interactions. While matrix-product state simulations capture the dynamics well in either small systems or at low temperatures, their predictions become inaccurate away from these limits. This work demonstrates precise simulation of the interacting dynamics in quantum magnets, and provides key insights into quasi-particles and their microscopic scattering mechanisms. △ Less

Submitted 14 July, 2026; originally announced July 2026.

Private Capacity of Quantum Channels Induced by Non-stabilizer Environmental States

Authors: Chunhe Xiong, Sunho Kim, Long Long, Junde Wu

Abstract: We investigate the private capacity of quantum channels using the recently proposed quantum convolution theory for discrete-variable quantum systems. We focus on the role of the magic resource played in this framework. Firstly, for a large class of convolutional channels, we find that the private capacity is zero if the fixed environmental state is a stabilizer state. Moreover, we show that the pr… ▽ More We investigate the private capacity of quantum channels using the recently proposed quantum convolution theory for discrete-variable quantum systems. We focus on the role of the magic resource played in this framework. Firstly, for a large class of convolutional channels, we find that the private capacity is zero if the fixed environmental state is a stabilizer state. Moreover, we show that the private capacity can be nonzero for some magic environmental states. Furthermore, we show that the private capacity of a discrete beam splitter unitary is upper-bounded by the amount of magic of the environmental state. In addition, if the environmental state exhibits a certain symmetric structure, even if it is magic, the corresponding private capacity will also vanish for a class of convolution. These results emphasize the role of magic resources in quantum communication △ Less

Submitted 13 July, 2026; originally announced July 2026.

Comments: 9 pages,

A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity

Authors: Romain Bourneuf, Nathan Claudet, Sang Yoon Kim, Rose McCarty, Blair D. Sullivan, Stéphan Thomassé

Abstract: We introduce a new notion of distance between two graph states $|G\rangle$ and $|G'\rangle$ on the same set of qubits. This distance is the minimum number of ancilla qubits in a graph state $|\widehat{G}\rangle$ from which both $|G\rangle$ and $|G'\rangle$ can be ``easily prepared''. (When preparing graph states, we are only allowed to use one-qubit Clifford gates, one-qubit Pauli measurements, an… ▽ More We introduce a new notion of distance between two graph states $|G\rangle$ and $|G'\rangle$ on the same set of qubits. This distance is the minimum number of ancilla qubits in a graph state $|\widehat{G}\rangle$ from which both $|G\rangle$ and $|G'\rangle$ can be ``easily prepared''. (When preparing graph states, we are only allowed to use one-qubit Clifford gates, one-qubit Pauli measurements, and classical communication.) We give a graphical description of this distance through the lens of vertex-minors. We then show how this distance yields quantum network analogs of many graph edit-distance problems. Using this framework, we develop classical algorithms for identifying the ``highly entangled clusters'' of a graph state $|G\rangle$. The ancilla integrity problem asks, given a graph $G$ and integer $k$, for the minimum -- over all graph states $|G'\rangle$ with distance at most $k$ from $|G\rangle$ -- of the maximum component size of $G'$. Up to a factor of $2$ in the number of ancilla qubits, this problem is equivalent to rank integrity, where the distance between $G$ and $G'$ is instead the minimum rank of the sum of their adjacency matrices over $\text{GF}(2)$. We prove that rank integrity is XP parameterized by $k$. We also prove the complementary hardness result that rank integrity is W[1]-hard in $k$. Finally, we give an explicit $\mathcal{O}(n^6)$-time algorithm for ancilla integrity when $G$ has $n$ vertices and $k=1$. △ Less

Submitted 10 July, 2026; originally announced July 2026.

(2,m)-threshold quantum data hiding

Authors: Donghoon Ha, Jeong San Kim

Abstract: We consider multiparty quantum state discrimination and present a multiparty quantum data-hiding scheme for one classical bit to be shared among multiple parties. In the proposed scheme, any pair of parties can collaborate to perfectly recover the hidden bit through a joint measurement, whereas measurements based on local operations and classical communication(LOCC) performed even by all parties r… ▽ More We consider multiparty quantum state discrimination and present a multiparty quantum data-hiding scheme for one classical bit to be shared among multiple parties. In the proposed scheme, any pair of parties can collaborate to perfectly recover the hidden bit through a joint measurement, whereas measurements based on local operations and classical communication(LOCC) performed even by all parties reveal only an arbitrarily small amount of information. We further provide bounds on the optimal LOCC discrimination of multiparty quantum states. The proposed scheme can be implemented using only separable states of low-dimensional quantum systems, enhancing its practical feasibility. △ Less

Submitted 8 July, 2026; originally announced July 2026.

Comments: 11 pages, 2 figures

Interfacial chirality-induced magnetic-field-free switching with high energy efficiency in all-vdW heterostructures

Authors: Kai-Xuan Zhang, Suik Cheon, Seungbok Lee, Joonyoung Choi, Jihoon Keum, Hyuncheol Kim, Yeochan An, Woonghee Cho, Suhan Son, Jingyuan Cui, Pyeongjae Park, Younjung Jo, Jun Sung Kim, Hyun-Woo Lee, Je-Geun Park

Abstract: Chirality, a central concept across many scientific disciplines, continues to inspire the discovery of novel physical phenomena. In condensed matter physics, structural chirality - defined by the absence of mirror plane symmetries - has primarily been explored in bulk materials. However, new chiral phenomena can emerge uniquely at the interface, distinct from their bulk counterparts, when a chiral… ▽ More Chirality, a central concept across many scientific disciplines, continues to inspire the discovery of novel physical phenomena. In condensed matter physics, structural chirality - defined by the absence of mirror plane symmetries - has primarily been explored in bulk materials. However, new chiral phenomena can emerge uniquely at the interface, distinct from their bulk counterparts, when a chiral material forms a heterostructure. Here, we demonstrate that all van-der-Waals (vdW) heterostructure composed of the chiral Co1/3TaS2 and the achiral vdW ferromagnet Fe3GeTe2 exhibits two distinct and unconventional spin-orbit torques originating from the interfacial chirality. These torques enable magnetic-field-free switching of perpendicular magnetization with ultralow current density ~ 10^6 A/cm^2 and minimal power dissipation < 10^15 W/m^3. Moreover, by replacing Fe3GeTe2 with a similar vdW ferromagnet, Fe3GaTe2, but of higher Curie temperature, we achieved the magnetic-field-free switching at room temperature in the Fe3GaTe2/Co1/3TaS2 vdW heterostructure. Our findings establish interfacial chirality as a powerful new handle for spintronic control, opening a new pathway to explore chirality-induced phenomena beyond the bulk symmetry constraints - and paving the way toward highly efficient, low-power spintronic devices based on all-vdW heterostructures. △ Less

Submitted 8 July, 2026; originally announced July 2026.

Comments: Accepted by Nature Communications; 30 pages; 4 main figures; 12 supporting figures

Journal ref: Nature Communications 17, 8620 (2026)

Complexity of Normalized Persistence Problems for Topological Data Analysis and Local Hamiltonians

Authors: Dominic Lowe, M. S. Kim, Roberto Bondesan, Ryu Hayakawa

Abstract: Topological data analysis (TDA) is a machine learning technique that uses topology to extract patterns from data and has shown the potential to exhibit quantum advantage. A key concept in TDA is persistent homology, which measures the robustness of topological information at different lengthscales. In this paper, we introduce and study the problem of normalized persistence, a practically motivated… ▽ More Topological data analysis (TDA) is a machine learning technique that uses topology to extract patterns from data and has shown the potential to exhibit quantum advantage. A key concept in TDA is persistent homology, which measures the robustness of topological information at different lengthscales. In this paper, we introduce and study the problem of normalized persistence, a practically motivated and easily interpretable version of persistent homology that counts the fraction of holes that persist at different lengthscales. We prove that a variant of normalized persistence is $\mathsf{DQC}_1$-hard and contained in $\mathsf{BQP}$, giving evidence of an exponential quantum speedup for TDA under the standard assumption that $\mathsf{DQC}_1 \not\subseteq \mathsf{BPP}$. These are the first $\mathsf{DQC}_1$-hardness results that are directly applicable to TDA instances. We also find a close connection between normalized persistence and the complexity of estimating spectral quantities in the low-energy subspace of local Hamiltonians. We study a family of such problems, including a low-energy normalized subtrace and spectral density. We show that these are $\mathsf{DQC}_1$-hard for $O(1)$-local Hamiltonians, strengthening previous results that required log-local interactions. We also introduce a variant of $\mathsf{DQC}_1$ with perfect completeness ($\mathsf{SDQC}_1$) to characterize the hardness of problems normalized by an exact kernel. This includes normalized persistence for $O(1)$-local Hamiltonians, which we show is $\mathsf{SDQC}_1$-hard. △ Less

Submitted 3 July, 2026; originally announced July 2026.

Comments: 61 pages, 4 figures

Report number: YITP-26-81

Characterization of Unlearnable Noise with Mid-Circuit-Measurement-Based Cycle Benchmarking

Authors: M. H. Cheng, Stefano Mangini, V. Bartsch, A. C. Medina, Sergey N. Filippov, Matteo A. C. Rossi, M. S. Kim

Abstract: Noise characterization of multi-qubit entangling Clifford operations is a key practical bottleneck for quantum error mitigation and for the calibration, validation, and optimization of quantum error-correction protocols, especially in the presence of state preparation and measurement (SPAM) errors. Although cycle benchmarking can isolate some Pauli error components, it cannot resolve the problem o… ▽ More Noise characterization of multi-qubit entangling Clifford operations is a key practical bottleneck for quantum error mitigation and for the calibration, validation, and optimization of quantum error-correction protocols, especially in the presence of state preparation and measurement (SPAM) errors. Although cycle benchmarking can isolate some Pauli error components, it cannot resolve the problem of coupled error parameters, which leads to unlearnable degrees of freedom even in simple noisy gates, not to mention general $n$-qubit Clifford gates. Here we introduce mid-circuit-measurement-based generalized cycle benchmarking, a framework that makes otherwise unidentifiable Pauli fidelities and non-Markovian noise learnable via repeated measurements and classical post-processing. Applying the deferred feed-forward principle to generalized cycle benchmarking, we show that an insertion of mid-circuit measurements can reverse Pauli cycles induced by a general Clifford gate. This fact enables us to reveal a Pauli-noise learnability condition for Clifford gates. Assuming sufficient state preparation quality, we numerically demonstrate the feasibility of characterizing the previously unlearnable noise components. We implement the protocol on superconducting quantum processing units and validate its effectiveness in disambiguating the coupled noise components, benchmarked against conventional tomography. Finally, we observe consistent measurement-induced bit-flip bias and non-Markovian correlations, which define a range of applicability for the Pauli noise model and the proposed noise-characterization protocol. △ Less

Submitted 30 June, 2026; v1 submitted 28 June, 2026; originally announced June 2026.

Graph Structures for Local Distinguishability of Quantum Product States

Authors: Sooyeong Kim, David W. Kribs, Michael Nathanson, Rajesh Pereira, Sarah Plosker

Abstract: We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distingu… ▽ More We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments. △ Less

Submitted 24 June, 2026; originally announced June 2026.

Comments: 16 pages, 6 figures

MSC Class: 05C90; 15B48; 81P45; 81P48

Influence-solvability: a systematic theory of $(1+1)D$ solvability and its application to brickwork circuits

Authors: Friedrich Hübner, Sun Woo P. Kim

Abstract: `Solvable' circuits, such as dual unitaries and its generalisations, have arisen as paradigmatic examples of tractable chaotic non-equilibrium dynamics, both in classical and quantum systems. However, while increasingly more complicated sufficient conditions have been proposed, a systematic theory classifying and understanding general features of solvable circuits is missing. We develop such a the… ▽ More `Solvable' circuits, such as dual unitaries and its generalisations, have arisen as paradigmatic examples of tractable chaotic non-equilibrium dynamics, both in classical and quantum systems. However, while increasingly more complicated sufficient conditions have been proposed, a systematic theory classifying and understanding general features of solvable circuits is missing. We develop such a theory by introducing influence-solvable circuits, a class of $(1+1)D$ circuits whose influence matrix, which represents the `bath' generated by its own evolution, is given by a uniform MPS with finite bond-dimension $χ$. This property allows for efficient computation of subsystem dynamics and essentially contains all known examples of solvable circuits. We derive a set of necessary and sufficient local conditions by using a version of the fundamental theorem of MPS for open boundary conditions. Next we apply our theory to brickwork circuits with $χ=1$ influence-solvability and perform a systematic classification of classical brickwork circuits with local dimension up to $d=3$ and quantum brickwork circuits with $d=2$. Our search reveals new solvable circuits that are not captured by known solvability conditions. △ Less

Submitted 10 June, 2026; originally announced June 2026.

Comments: 49 pages

Consistent Evaluation of Operators Involving the Position Operator in the Bloch Representation: Application to the Orbital Moment

Authors: Daehyeon An, Junmo Jeon, Se Kwon Kim

Abstract: The position operator plays a central role in condensed-matter observables such as velocity, orbital moment, and electric polarization. In solid-state physics, the evaluation of operators incorporating the position operator has not reached a consensus, as observed in the operator-level discrepancy between the local circulation of Wannier functions and the self-rotation of wave packets. Here, to ac… ▽ More The position operator plays a central role in condensed-matter observables such as velocity, orbital moment, and electric polarization. In solid-state physics, the evaluation of operators incorporating the position operator has not reached a consensus, as observed in the operator-level discrepancy between the local circulation of Wannier functions and the self-rotation of wave packets. Here, to achieve a consistent evaluation of such operators, we propose three rules for evaluating operators involving the position operator in the Bloch representation. The rules are devised to satisfy physical conditions: independence from the choice of unit cell, preservation of Hermitian conjugacy for the product of operators, and recovery of the correct intraband velocity. We further address the gauge dependence of the position operator and introduce a scheme termed gauge filtration, which systematically removes gauge-dependent contributions from the operators containing the position operator. This methodology ensures that the quantities obtained from the operator evaluation correspond to observable physical phenomena. By applying our framework, we reconcile the results concerning the self-rotation of the wave packet and the local circulation of the Wannier function. We expect our proposal to establish a consistent framework for evaluating operators involving the position operator. △ Less

Submitted 10 June, 2026; originally announced June 2026.

Quantum Synchronization of Fock States

Authors: Fabian Hassler, David Scheer, Samah Saquaque, Steven Kim

Abstract: Synchronization, a ubiquitous phenomenon in classical systems, has recently been extended to the quantum domain. Here, we show quantum synchronization of a bosonic mode exhibiting a Fock state-like limit cycle, manifesting as a steady state with a negative Wigner function. We demonstrate that this non-classical state can be phase-locked to an external drive, achieving synchronization within an Arn… ▽ More Synchronization, a ubiquitous phenomenon in classical systems, has recently been extended to the quantum domain. Here, we show quantum synchronization of a bosonic mode exhibiting a Fock state-like limit cycle, manifesting as a steady state with a negative Wigner function. We demonstrate that this non-classical state can be phase-locked to an external drive, achieving synchronization within an Arnold tongue regime. We argue that synchronization is a dynamical property and fundamentally tied to the suppression of phase slips, which we show to occur with exponentially decreasing probability. We introduce a novel method to extract the phase slip rate from the Lindblad time evolution of the system. This work opens new avenues for understanding and manipulating non-classical synchronization dynamics. △ Less

Submitted 28 May, 2026; originally announced May 2026.

Comments: main text: 4 pages, 3 figures, appendix: 4 pages, 1 figure

Adaptive Shot Allocation for Recursive QAOA via Reinforcement Learning

Authors: Euimin Lee, Shiho Kim

Abstract: Recursive QAOA (RQAOA) solves combinatorial optimization problems by using shallow quantum circuits to estimate pairwise correlations and recursively eliminate variables until a classical solver can handle the residual instance. Each elimination step requires measurement shots, and the total shot cost grows with the number of recursive stages. On near-term quantum devices, increasing shot counts c… ▽ More Recursive QAOA (RQAOA) solves combinatorial optimization problems by using shallow quantum circuits to estimate pairwise correlations and recursively eliminate variables until a classical solver can handle the residual instance. Each elimination step requires measurement shots, and the total shot cost grows with the number of recursive stages. On near-term quantum devices, increasing shot counts can translate directly into greater exposure to hardware-level noise sources such as readout errors and decoherence, making shot-efficient execution not merely a cost-reduction measure but a factor with direct implications for solution reliability. While shot reduction has been studied broadly across NISQ algorithms, step-wise measurement control inside the recursive loop of RQAOA has received little attention. We formulate this step-wise allocation as a sequential decision problem and propose two strategies for depth-1 RQAOA on weighted Max-Cut instances. A hand-crafted heuristic assigns shots based on local indicators of step difficulty, and a tabular Double Q-learning agent learns a residual policy that adjusts this baseline under a Lagrangian-constrained objective. Both methods are evaluated under a fixed-cap fairness protocol that equalizes the per-step budget across all strategies, and the elimination rule itself is kept unchanged so that the contribution of adaptive measurement control can be isolated. On a diverse set of weighted graph instances spanning a range of sizes and structures, the heuristic reduces total shots by approximately 23% relative to uniform allocation, and the RL policy achieves a 36% reduction with a lower effective shots per success ratio than both baselines. The improvement persists on problem sizes not seen during training, suggesting that reinforcement learning can discover efficient, instance-adaptive measurement strategies in recursive quantum optimization. △ Less

Submitted 26 May, 2026; originally announced May 2026.

Spacetime Formation under Requirements: Contextual Realization and Form-Dependent Probability

Authors: Song-Ju Kim

Abstract: Quantum cognition often explains order effects, contextuality, and violations of the law of total probability by replacing classical probability with quantum probability on a fixed event structure. This paper proposes a different interpretation: quantum probability is the fixed-spacetime projection of contextual spacetime formation under finite-state requirements. The framework begins not with t… ▽ More Quantum cognition often explains order effects, contextuality, and violations of the law of total probability by replacing classical probability with quantum probability on a fixed event structure. This paper proposes a different interpretation: quantum probability is the fixed-spacetime projection of contextual spacetime formation under finite-state requirements. The framework begins not with time, space, objects, or probabilities, but with requirements such as finite representational capacity, single-state semantic stability, context-sensitive intervention, avoidance of explicit context labels, coherent world-formation, and intersubjective transformability. When these requirements cannot be realized within a single global Boolean event structure, the mismatch appears, under fixed-spacetime projection, as noncommutativity, interference, and quantum-like probability. Building on prior single-state approaches to contextuality, we reinterpret classical contextual bookkeeping cost as the fixed-spacetime shadow of contextual spacetime formation. Auxiliary memory or context labels in a classical representation correspond, in this account, to holonomy-like mismatch among locally Boolean logic-worlds. The interference term is the cross term generated when locally classical realization contributions are nontrivially glued and projected back into a fixed classical spacetime form. The result is a transcendental-operational realist account: objecthood, eventhood, probability, and spacetime are treated as forms of realization under requirements, while objectivity is defined by invariants preserved across observer- and history-dependent spacetime formations. △ Less

Submitted 1 May, 2026; originally announced May 2026.

Comments: 19 pages, 1 figure

Quantum Parity Representations: Learnable Basis Discovery, Encoders, and Shadow Deployment

Authors: Sang Hyub Kim, Oliver Knitter, Jonathan Mei, Claudio Girotto, Masako Yamada, Martin Roetteler, Chi Chen

Abstract: We study parity features as representations that can be evaluated entirely classically once the binary or quantized input representation and parity words are fixed, particularly when labels depend on higher-order feature interactions or when discrete inference interfaces support perturbation robustness. A parity feature is a signed product over selected bits of a binary input: once the participati… ▽ More We study parity features as representations that can be evaluated entirely classically once the binary or quantized input representation and parity words are fixed, particularly when labels depend on higher-order feature interactions or when discrete inference interfaces support perturbation robustness. A parity feature is a signed product over selected bits of a binary input: once the participating bits are known, evaluation requires no quantum resources. Reaching a useful parity representation requires solving two challenges. When the input is parity-ready (a meaningful binary string), the challenge is basis discovery: selecting useful parity words from a combinatorial search space. Otherwise, the challenge is encoding: constructing a binary vector on which parity computation is meaningful. We use hybrid quantum-classical training pipelines to address these: learnable Pauli word selection for basis discovery, learned projection encodings for continuous embeddings, and sPQC-Parity for discrete inputs. On three native-binary parity tasks with 5-10 qubits, the learned parity basis improves mean accuracy by 23.9% to 41.7% over logistic-regression and support-vector baselines. A model comparison shows that the improvement comes primarily from discovering the right parity basis, rather than from quantum moment computation at inference. On five continuous text benchmarks, learned projection recovers much of the loss introduced by dimensionality reduction and fixed binarization, exceeding the full continuous baseline on CR, SST-2, and SST-5. On three encoding-limited discrete datasets, when compared with PCA-bin as the baseline, sPQC-Parity reaches 94.6% improvement on mushroom, 3.0% on splice, and matches PCA-bin on promoter. We also analyze inference robustness under binary or quantized inference, where rounding gives exact invariance below half the quantization step. △ Less

Submitted 11 May, 2026; originally announced May 2026.

Comments: 8 pages, 2 figures, 10 tables

Scalable Liquid-Crystal Integrated Silicon Nitride Photonic Circuits for Reconfigurable Quantum Interference

Authors: Chunghyun Ahn, Yongjin Hwang, Sangbaek Lee, Jinil Lee, Hyunjin Ko, Sunghyun Moon, Hojoong Jung, Hyun-Yong Yu, Se-Um Kim, Hyounghan Kwon

Abstract: Integrated quantum photonics requires compact, efficient, and low-power phase modulators. While silicon nitride (SiN) is a promising platform, existing modulators suffer from high power consumption, thermal crosstalk, or high driving voltages. Liquid crystal (LC) offers a compelling alternative because of the large index changes and industrial maturity. However, their suitability for supporting va… ▽ More Integrated quantum photonics requires compact, efficient, and low-power phase modulators. While silicon nitride (SiN) is a promising platform, existing modulators suffer from high power consumption, thermal crosstalk, or high driving voltages. Liquid crystal (LC) offers a compelling alternative because of the large index changes and industrial maturity. However, their suitability for supporting various applications in the photonic quantum system has not been experimentally confirmed.Here, we report the first experimental demonstration that LC-based phase modulators integrated on a SiN platform show highly visible quantum interference. We fabricated a liquid-crystal integrated Mach-Zehnder interferometer (LC-MZI) that achieved CMOS-compatible performance with V_pi * L < 1 V-mm. In two-photon interference experiments, the devices exhibited high-visibility quantum interference (~98.5%) with voltage-tunable phase control. Furthermore, we validated the scalability of our approach by demonstrating wafer-scale fabrication using stepper lithography. This work establishes LC-integrated SiN photonics as a scalable, reconfigurable, and energy-efficient platform for quantum photonic circuits. △ Less

Submitted 8 May, 2026; originally announced May 2026.

Comments: 22 pages, 5 figures. Final version for submission

Polarization-Controlled Photon Mode Switching and Photon--Magnon Coupling in a Planar Cavity--Magnonic System

Authors: Abhishek Maurya, Sachin Verma, Bojong Kim, Biswanath Bhoi, Rajeev Singh, Sang-Koog Kim

Abstract: This work presents polarization-selective photon-magnon coupling (PMC) in a planar cavity-magnonic platform consisting of an electric-LC resonator (ELCR) side-coupled to a microstrip transmission line and integrated with a yttrium iron garnet (YIG) thin film. The ELCR supports two orthogonal photon modes at $\sim 3.93$ GHz and $\sim 5.73$ GHz, whose excitation and radiative damping are governed by… ▽ More This work presents polarization-selective photon-magnon coupling (PMC) in a planar cavity-magnonic platform consisting of an electric-LC resonator (ELCR) side-coupled to a microstrip transmission line and integrated with a yttrium iron garnet (YIG) thin film. The ELCR supports two orthogonal photon modes at $\sim 3.93$ GHz and $\sim 5.73$ GHz, whose excitation and radiative damping are governed by the resonator orientation relative to the microwave-field polarization. Rotating the resonator enables controlled switching between these modes and tunable photon-magnon hybridization. An equivalent circuit model including intrinsic and extrinsic damping successfully reproduces the polarization-driven mode switching, while an effective three-mode Hamiltonian accurately captures the coupled-mode evolution. The results reveal strong angular tunability of the PMC strength through redistribution between two competing interaction channels. At $θ= 0^\circ$, only the lower-frequency photon mode is excited, yielding $g_{31}=56.5$ MHz, while the higher-frequency mode remains inactive. As the angle increases, both channels become active: $g_{31}$ increases from $56.5$ to $98$ MHz over $0^\circ$-$60^\circ$ before vanishing at $90^\circ$, whereas $g_{23}$ decreases from $76$ to $30$ MHz over $30^\circ$-$90^\circ$. The observed evolution yields a measured transition near $25.7^\circ$ and a symmetry-related model-predicted transition near $154.3^\circ$. These findings establish resonator-orientation--driven polarization selectivity as a versatile mechanism for controllable photon--magnon interactions in planar architectures. △ Less

Submitted 6 May, 2026; originally announced May 2026.

Measuring Accuracy and Energy-to-Solution of Quantum Fine-Tuning of Foundational AI Models

Authors: Oliver Knitter, Sang Hyub Kim, Maximilian Wurzer, Jonathan Mei, Claudio Girotto, Karen Horovitz, Chi Chen, Masako Yamada, Frederik F. Flöther, Martin Roetteler

Abstract: We present an experimental study of energy-to-solution (ETS) of hybrid quantum-classical applications, enabled by direct instrumentation of power consumption of a Forte Enterprise trapped-ion quantum processor. We apply this methodology to a hybrid quantum-classical pipeline for quantum fine-tuning of foundational AI models, and validate the approach end-to-end on quantum hardware. Despite noise a… ▽ More We present an experimental study of energy-to-solution (ETS) of hybrid quantum-classical applications, enabled by direct instrumentation of power consumption of a Forte Enterprise trapped-ion quantum processor. We apply this methodology to a hybrid quantum-classical pipeline for quantum fine-tuning of foundational AI models, and validate the approach end-to-end on quantum hardware. Despite noise and limited qubit counts, the resulting models achieve accuracy competitive with and exceeding classical baselines such as logistic regression and support vector classifiers. Our results show that QPU energy consumption scales approximately linearly with qubit number for shallow circuits, while classical simulation exhibits exponential scaling, indicating a break-even for ETS around 34 qubits. The classification error improvement of the best quantum fine-tuned model over the best classical fine-tuned model considered in this study is around 24%. We further contextualize these findings with comparisons to tensor network methods. This work establishes energy-to-solution as a measurable and scalable metric for evaluating quantum applications and provides experimental evidence of favorable energy-accuracy trade-offs. △ Less

Submitted 4 May, 2026; originally announced May 2026.

Comments: 10 pages, 4 figures

Distributed Quantum Optimization for Large-Scale Higher-Order Problems with Dense Interactions

Authors: Seongmin Kim, Vincent R. Pascuzzi, Travis S. Humble, Thomas Beck, Sanghyo Hwang, Tengfei Luo, Eungkyu Lee, In-Saeng Suh

Abstract: Many real-world problems are naturally formulated as higher-order optimization (HUBO) tasks involving dense, multi-variable interactions, which are challenging to solve with classical methods. Quantum optimization offers a promising route, but hardware constraints and limitations to quadratic formulations have hampered their practicality. Here, we develop a distributed quantum optimization framewo… ▽ More Many real-world problems are naturally formulated as higher-order optimization (HUBO) tasks involving dense, multi-variable interactions, which are challenging to solve with classical methods. Quantum optimization offers a promising route, but hardware constraints and limitations to quadratic formulations have hampered their practicality. Here, we develop a distributed quantum optimization framework (DQOF) for dense, large-scale HUBO problems. DQOF assigns quantum circuits a central role in directly capturing higher-order interactions, while high-performance computing orchestrates large-scale parallelism and coordination. A clustering strategy enables wide quantum circuits without increasing depth, allowing efficient execution on near-term quantum hardware. We demonstrate high-quality solutions for HUBOs up to 500 variables within 170 seconds, significantly outperforming conventional approaches in solution quality and scalability. Applied to optical metamaterial design, DQOF efficiently discovers high-performance structures and shows that higher-order interactions are important for practical optimization problems. These results establish DQOF as a practical and scalable computational paradigm for large-scale scientific optimization. △ Less

Submitted 22 April, 2026; originally announced April 2026.

Comments: 4 figures, 15 supplementary figures

Verifying random matrix product states with autoregressive local measurements

Authors: Hyunho Cha, Subin Kim, Jungwoo Lee

Abstract: Matrix product states (MPS) are a central language for one-dimensional quantum matter and a practical target for near-term quantum simulators and variational algorithms. Yet, while substantial effort has focused on preparing MPS with shallow circuits, scalable methods to \emph{verify} that a many-body device has actually produced the intended state remain underdeveloped. Direct fidelity estimation… ▽ More Matrix product states (MPS) are a central language for one-dimensional quantum matter and a practical target for near-term quantum simulators and variational algorithms. Yet, while substantial effort has focused on preparing MPS with shallow circuits, scalable methods to \emph{verify} that a many-body device has actually produced the intended state remain underdeveloped. Direct fidelity estimation (DFE) relies only on local Pauli measurements, but in many-body settings it suffers an exponential classical overhead from the preprocessing needed to sample Pauli strings. We eliminate this obstacle by introducing an \emph{autoregressive} importance sampler that draws Pauli strings sequentially from efficiently computable conditional distributions, reducing the per-shot classical overhead to linear scaling in the number of qubits. We further develop a grouped extension that constructs qubit-wise commuting measurement settings via a \emph{sorting string} and simultaneously estimates the entire commuting group from a single setting, significantly reducing estimator variance while preserving efficient postprocessing. Our approach extends naturally to matrix product operators (MPO), enabling scalable verification of tensor-network states and observables in long one-dimensional quantum systems. We utilize random MPS as a natural benchmark for generic 1D entangled states. △ Less

Submitted 17 April, 2026; originally announced April 2026.

Comments: 16 pages, 6 figures

Ultrafast Current Switching from Quantum Geometry in Semimetals

Authors: Youngjae Kim, Sejoong Kim, Jun-Won Rhim

Abstract: Technological progress towards next-generation electronics critically relies on achieving faster switching with reduced energy consumption. Because device operation speeds are fundamentally constrained by the intrinsic properties of constituent materials, identifying systems with inherently superior switching capabilities is essential. Here, we propose that semimetallic systems characterized by no… ▽ More Technological progress towards next-generation electronics critically relies on achieving faster switching with reduced energy consumption. Because device operation speeds are fundamentally constrained by the intrinsic properties of constituent materials, identifying systems with inherently superior switching capabilities is essential. Here, we propose that semimetallic systems characterized by non-trivial quantum geometry, including quadratic band-touching semimetals and singular flat bands, can serve as a promising platform for ultrafast switching at voltages compatible with modern electronics. We show that, in such quantum geometric semimetals, an electric current is generated instantaneously upon application of a moderate external electric field, reaching its steady-state value. As a consequence, the current exhibits rapid and stable on-off switching behaviour under periodic optical pulse trains, demonstrating robustness under experimentally feasible conditions. In terms of switching speed, this quantum geometric semimetal outperforms conventional metals, semiconductors, and graphene. We identify the microscopic origin of this behaviour as interband coupling governed by the Hilbert-Schmidt quantum distance, together with a finite density of states at the band-touching point. This mechanism further leads to a universal classification of conductivity for both gapless and gapped quantum geometric semimetals. Finally, first-principles calculations suggest realistic material platforms, including bilayer graphene, cyclic graphene, monolayer bismuth and V3F8-in which the predicted instantaneous current switching can be directly realized, further supported by time-dependent density functional theory simulations performed for representative systems. △ Less

Submitted 20 April, 2026; v1 submitted 17 April, 2026; originally announced April 2026.

Comments: 23 pages, 5 figures

Impact of Pump Phase-Noise on Josephson Traveling-Wave Parametric Amplifiers

Authors: Daryoush Shiri, Likai Yang, Saesun Kim, Mohamed A. Hassan, Philip Krantz, Eric T. Holland

Abstract: Superconducting traveling-wave parametric amplifiers (TWPAs) are essential elements for enhancing the signal-to-noise ratio (SNR) and thus the read-out fidelity of superconducting qubits because of their high gain and near quantum-limited noise. However, the impact of the pump source, e.g., phase noise on these amplifiers, has not yet been studied. In this work, we show that among the two amplific… ▽ More Superconducting traveling-wave parametric amplifiers (TWPAs) are essential elements for enhancing the signal-to-noise ratio (SNR) and thus the read-out fidelity of superconducting qubits because of their high gain and near quantum-limited noise. However, the impact of the pump source, e.g., phase noise on these amplifiers, has not yet been studied. In this work, we show that among the two amplification processes in JTWPAs, the three-wave mixing (3WM) process is more sensitive to the pump phase noise than the four-wave mixing (4WM) process. We show that the even-order nonlinearity of 4th order and above in three-wave mixing is responsible for more than 10 dB increase of phase noise at high frequency offsets within the phase noise mask as the power of the pump increases. A polynomial model of the amplifier and cyclo-stationary property of phase noise also corroborate with the simulations. The Harmonic Balance (HB) periodic noise analysis tool and Leeson phase noise model in Keysight Advanced Design System (ADS) simulator were used in this study. △ Less

Submitted 10 April, 2026; originally announced April 2026.

Comments: 6 pages, 8 figures,

Experimental Demonstrations of Coherence de Broglie Wavelength for Scalable Superresolution with Near-perfect Fringe Visibility

Authors: S. Kim, B. S. Ham

Abstract: Quantum sensing and metrology have been extensively investigated over the past several decades to surpass the classical shot noise limit and approach the Heisenberg limit. The hallmark of N00N state based quantum sensing is superresolution, characterized by the interference fringe pattern (1+cosNphi). However, practical implementations are severely constrained by the achievable photon number N, re… ▽ More Quantum sensing and metrology have been extensively investigated over the past several decades to surpass the classical shot noise limit and approach the Heisenberg limit. The hallmark of N00N state based quantum sensing is superresolution, characterized by the interference fringe pattern (1+cosNphi). However, practical implementations are severely constrained by the achievable photon number N, reduced fringe visibility, and vulnerability to photon loss. Recently, several coherence-based approaches without using N00N states have been explored as alternative routes to superresolution. Among them, the coherence de Broglie wavelength (CBW) approach is fully compatible with coherence optics. Here, we experimentally demonstrate CBW based superresolution up to N=3. In contrast to N00N state based schemes, the observed CBW fringes exhibit near unity visibility that is essentially independent of N and remain robust against photon loss. Although CBW does not attain the Heisenberg limited phase sensitivity, its phase sensitivity exhibits an N fold enhancement over conventional classical interferometric approaches. These results suggest that CBW provides a practical and scalable platform for superresolution based sensing and metrology. △ Less

Submitted 26 June, 2026; v1 submitted 12 March, 2026; originally announced March 2026.

Comments: 9 pages, 3 figures

Mitigating crosstalk errors for simultaneous single-qubit gates on a superconducting quantum processor

Authors: Jaap J. Wesdorp, Eric Hyyppä, Joona Andersson, Janos Adam, Rohit Beriwal, Ville Bergholm, Saga Dahl, Simone Diego Fasciati, Alejandro Gomez Friero, Zheming Gao, Daria Gusenkova, Andrew Guthrie, Johannes Heinsoo, Tuukka Hiltunen, Keiran Holland, Amin Hosseinkhani, Sinan Inel, Joni Ikonen, Shan W. Jolin, Kristinn Juliusson, Seung-Goo Kim, Anton Komlev, Roope Kokkoniemi, Otto Koskinen, Joonas Kylmälä , et al. (39 additional authors not shown)

Abstract: Single-qubit gates on superconducting quantum processors are typically implemented using microwave pulses applied through dedicated control lines. However, these microwave pulses may also drive other qubits due to crosstalk arising from capacitive coupling and wavefunction overlap in systems with closely spaced transition frequencies. Crosstalk and frequency crowding increase errors during simulta… ▽ More Single-qubit gates on superconducting quantum processors are typically implemented using microwave pulses applied through dedicated control lines. However, these microwave pulses may also drive other qubits due to crosstalk arising from capacitive coupling and wavefunction overlap in systems with closely spaced transition frequencies. Crosstalk and frequency crowding increase errors during simultaneous single-qubit operations relative to isolated gates, thus forming a major bottleneck for scaling superconducting quantum processors. In this work, we combine model-based qubit frequency optimization with pulse shaping to demonstrate crosstalk error mitigation in single-qubit gates on a 49-qubit superconducting quantum processor. We introduce and experimentally verify an analytical model of simultaneous single-qubit gate error caused by microwave crosstalk that depends on a given pulse shape. By employing a model-based optimization strategy of qubit frequencies, we minimize the crosstalk-induced error across the processor and achieve a mean simultaneous single-qubit gate fidelity of 99.96% for a 16-ns gate duration, approaching the mean individual gate fidelity. To further reduce the simultaneous error and required qubit frequency bandwidth on high-crosstalk qubit pairs, we introduce a crosstalk transition suppression (CTS) pulse shaping technique that minimizes the spectral energy around transitions inducing leakage and crosstalk errors. Finally, we combine CTS with model-based frequency optimization across the device and experimentally show a systematic reduction in the required qubit frequency bandwidth for high-fidelity simultaneous gates, supported by simulations of systems with up to 1000 qubits. By alleviating constraints on qubit frequency bandwidth for parallel single-qubit operations, this work represents an important step for scaling towards larger quantum processors. △ Less

Submitted 11 March, 2026; originally announced March 2026.

Comments: 45 pages, 6 figures in the main text, 20 figures in the Appendices. Eric Hyyppä and Jaap J. Wesdorp contributed equally to this work

Universal Family-Vicsek scaling in quantum gases far from equilibrium

Authors: Kiryang Kwon, Kazuya Fujimoto, Junhyeok Hur, Byungjin Lee, Samgyu Hwang, Sumin Kim, Ryusuke Hamazaki, Yuki Kawaguchi, Jae-yoon Choi

Abstract: Fluctuations in the growing surfaces of classical systems can exhibit universal scaling behavior, known as Family-Vicsek (FV) scaling. Although this phenomenon was originally discovered in classical stochastic models, recent theoretical studies have demonstrated the presence of FV scaling in quantum many-body systems as well. Here, we observe the universal FV scaling in a one-dimensional Bose gas… ▽ More Fluctuations in the growing surfaces of classical systems can exhibit universal scaling behavior, known as Family-Vicsek (FV) scaling. Although this phenomenon was originally discovered in classical stochastic models, recent theoretical studies have demonstrated the presence of FV scaling in quantum many-body systems as well. Here, we observe the universal FV scaling in a one-dimensional Bose gas in an optical lattice. By monitoring the fluctuations of particle number in half of the system, which corresponds to the surface roughness, we extract all scaling exponents and demonstrate that the entire relaxation-from the growth of quantum fluctuations to their saturation-is captured by a single universal scaling function. Our results demonstrate that universal scaling laws of classical surface growth extend to quantum many-body systems, establishing a unified framework for nonequilibrium universality across classical and quantum systems. △ Less

Submitted 9 March, 2026; originally announced March 2026.

Comments: 9 pages, 5 figures, and supplemental materials

Stochastic Loop Corrections to Belief Propagation for Tensor Network Contraction

Authors: Gi Beom Sim, Tae Hyeon Park, Kwang S. Kim, Yanmei Zang, Xiaorong Zou, Hye Jung Kim, D. ChangMo Yang, Soohaeng Yoo Willow, Chang Woo Myung

Abstract: Tensor network contraction is a fundamental computational challenge underlying quantum many-body physics, statistical mechanics, and machine learning. Belief propagation (BP) provides an efficient approximate solution, but introduces systematic errors on graphs with loops. Here, we introduce a hybrid method that achieves accurate results by stochastically sampling loop corrections to BP and showca… ▽ More Tensor network contraction is a fundamental computational challenge underlying quantum many-body physics, statistical mechanics, and machine learning. Belief propagation (BP) provides an efficient approximate solution, but introduces systematic errors on graphs with loops. Here, we introduce a hybrid method that achieves accurate results by stochastically sampling loop corrections to BP and showcase our method by applying it to the two-dimensional ferromagnetic Ising model. For any pairwise Markov random field with symmetric edge potentials, our approach exploits an exact factorization of the partition function into the BP contribution and a loop correction factor summing over all valid loop configurations, weighted by edge weights derived directly from the potentials. We sample this sum using Markov chain Monte Carlo with moves that preserve the loop constraint, combined with umbrella sampling to ensure efficient exploration across all correlation strengths. Our stochastic approach provides unbiased estimates with controllable statistical error in any parameter regime. △ Less

Submitted 7 April, 2026; v1 submitted 9 March, 2026; originally announced March 2026.

Comments: 12+4 pages, 5+1 figures

Optimal recovery for quantum error correction

Authors: Sun Woo P. Kim

Abstract: The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operat… ▽ More The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operations could be used to recover quantum information. The true optimal threshold should be optimised over all possible recovery schemes, which can be described by quantum channels. Here, we study such optimal recovery channels and their thresholds $p_\mathrm{th}^\mathrm{opt}$. We introduce an information-theoretic quantity, mutual trace distance, which provides a necessary and sufficient diagnostic for sharply determining $p_\mathrm{th}^\mathrm{opt}$ without explicit optimisation. In contrast, previous works give a lower bound on $p_\mathrm{th}^\mathrm{opt}$ by specifying particular recovery schemes, e.g. Schumacher-Westmoreland (SW) which provides coherent information as a diagnostic to lower bound $p^\mathrm{opt}_\mathrm{th}$. We prove that the Petz and SW recovery schemes are optimal, i.e. their threshold is $p_\mathrm{th}^\mathrm{opt}$. With their optimality established, we explore the structure of optimal and non-optimal recovery schemes and their phase diagrams. △ Less

Submitted 4 March, 2026; originally announced March 2026.

Comments: 7 pages, 2 figures

Machine learning of quantum data using optimal similarity measurements

Authors: Zhenghao Li, Hao Zhan, Shana H. Winston, Ewan Mer, Zhenghao Yin, Shang Yu, Yazeed K. Alwehaibi, Gerard J. Machado, Dayne Marcus Lopena, Lijian Zhang, M. S. Kim, Aonan Zhang, Ian A. Walmsley, Raj B. Patel

Abstract: Quantum machine learning seeks a computational advantage in data processing by evaluating functions of quantum states, such as their similarity, that can be classically intractable to compute. For quantum advantage to be possible, however, it is essential to bypass costly characterisation of individual data instances in favour of efficient, direct similarity evaluation. Here we demonstrate a sampl… ▽ More Quantum machine learning seeks a computational advantage in data processing by evaluating functions of quantum states, such as their similarity, that can be classically intractable to compute. For quantum advantage to be possible, however, it is essential to bypass costly characterisation of individual data instances in favour of efficient, direct similarity evaluation. Here we demonstrate a sample-optimal, hardware-efficient protocol for estimating quantum similarity -- the state overlap -- using bosonic quantum interference. The sample complexity of this approach is independent of the system dimension and is information-theoretically optimal up to a constant factor. Experimentally, we implement the scheme on \emph{Prakash-1}, a quantum computing platform based on a fully programmable integrated photonic processor. By preparing and interfering qudit states on the chip to directly extract their overlap, we demonstrate classification and online learning of quantum data with high accuracy in realistic noisy experiments. Our results establish joint overlap measurements as a scalable pathway to efficient quantum data analysis and a practical building block for network-integrated quantum machine learning. △ Less

Submitted 26 February, 2026; originally announced February 2026.

Comments: 32 pages, 10 figures, 1 table, including Supplementary Information

Contextuality from Single-State Ontological Models: An Information-Theoretic Obstruction

Authors: Song-Ju Kim

Abstract: Contextuality is a central feature of quantum theory, traditionally understood as the impossibility of reproducing quantum measurement statistics using noncontextual ontological models. We study classical ontological descriptions in which a fixed subsystem-level ontic state space is reused across multiple interventions. Our main result is an information-theoretic obstruction: whenever a classical… ▽ More Contextuality is a central feature of quantum theory, traditionally understood as the impossibility of reproducing quantum measurement statistics using noncontextual ontological models. We study classical ontological descriptions in which a fixed subsystem-level ontic state space is reused across multiple interventions. Our main result is an information-theoretic obstruction: whenever a classical single-state model reproduces operational statistics using an auxiliary contextual register, the required contextual information is lower-bounded by the conditional mutual information $I(C;O\mid λ)$ between intervention $C$ and outcome $O$ conditioned on the subsystem ontic state $λ$. The mathematical inequality itself is elementary, but its interpretive significance is structural: under shared-state reuse, contextual distinctions need not be fully internalized within the subsystem ontic state alone. We provide a constructive illustration of this point and clarify how the issue should be understood as a limitation of subsystem-level classical representation, rather than as a dualism about physical reality. We further discuss how this perspective relates to ontological models and to contextuality in quantum foundations. △ Less

Submitted 15 April, 2026; v1 submitted 3 February, 2026; originally announced February 2026.

Comments: Version 3: The main result was reframed as an information-theoretic obstruction rather than a no-go theorem. We clarified that ontic states are subsystem-level and reformulated interventions operationally to avoid dualism. The main claim was weakened to a proposition, restricting strict positivity to contextual regimes, with corresponding revisions to the abstract, intro, and appendix

Photon counting beyond the rotating-wave approximation

Authors: Steven Kim, Fabian Hassler

Abstract: Open quantum systems are often described by a Lindblad master equation, which relies on a set of approximations, most importantly the rotating-wave approximation which is only valid for weak damping. In the Lindblad setting, dissipative processes are described through jump operators, distinguishing between absorption and emission of photons. This enables the simple identification of emitted photon… ▽ More Open quantum systems are often described by a Lindblad master equation, which relies on a set of approximations, most importantly the rotating-wave approximation which is only valid for weak damping. In the Lindblad setting, dissipative processes are described through jump operators, distinguishing between absorption and emission of photons. This enables the simple identification of emitted photons which provides a straightforward way to obtain the radiation statistics. Outside the rotating-wave limit, the Lindblad approach does not work. Open quantum systems can then be described by, e.g., the quantum Langevin equation. However, in this framework the number of emitted photons is not easily accessible. In this work, we point out how to obtain the photon counting statistics from a quantum Langevin equation and provide an expression for the photon current operator, for arbitrary systems coupled to linear environments. As an example, we employ the method to study the radiation statistics of a damped harmonic oscillator at finite temperature beyond the rotating-wave approximation. We show that even outside the rotating-wave limit, the most important contribution to the radiation statistics can be captured by an effective Lindblad equation, thus extending the range of possible applications of the Lindblad framework. △ Less

Submitted 4 June, 2026; v1 submitted 11 February, 2026; originally announced February 2026.

Comments: 10 pages, 5 figures

Kinematic Modulation in Driven Spin Resonance

Authors: Sunghyun Kim

Abstract: The transition probability of a spin driven by a rotating magnetic field is reformulated. This work shows that, once projection onto the measurement basis is properly accounted for, the laboratory measured probability is governed by both intrinsic spin dynamics and the time dependence of the measurement basis. For the rotating-field eigenbasis, this yields an additional kinematic modulation, leadi… ▽ More The transition probability of a spin driven by a rotating magnetic field is reformulated. This work shows that, once projection onto the measurement basis is properly accounted for, the laboratory measured probability is governed by both intrinsic spin dynamics and the time dependence of the measurement basis. For the rotating-field eigenbasis, this yields an additional kinematic modulation, leading to measurable deviations under strong driving. A unified probability expression is derived that subsumes the classic 1937 and 1954 formulations as limiting cases, while correcting the conventional treatment of magnetic resonance transitions. △ Less

Submitted 26 April, 2026; v1 submitted 7 February, 2026; originally announced February 2026.

Comments: 4 pages, 0 figures

Extensible universal photonic quantum computing with nonlinearity

Authors: Shang Yu, Jinzhao Sun, Kuan-Cheng Chen, Zhi-Huai Yang, Zhenghao Li, Ewan Mer, Yazeed K. Alwehaibi, Shana H. Winston, Dayne Marcus D. Lopena, Zi-Cheng Zhang, Guang Yang, Runxia Tao, Mingti Zhou, Gerard J. Machado, Ying Dong, Roberto Bondesan, Vlatko Vedral, M. S. Kim, Ian A. Walmsley, Raj B. Patel

Abstract: Universal quantum computing requires an architecture that supports both linear circuits and, crucially, strong nonlinear resources. For quantum photonic systems, integrating such nonlinearities with scalable linear circuitry has been a major bottleneck, leaving most optical experiments without nonlinear operations and, consequently, incapable of achieving universality. Here, we report an extensibl… ▽ More Universal quantum computing requires an architecture that supports both linear circuits and, crucially, strong nonlinear resources. For quantum photonic systems, integrating such nonlinearities with scalable linear circuitry has been a major bottleneck, leaving most optical experiments without nonlinear operations and, consequently, incapable of achieving universality. Here, we report an extensible photonic computer that supports a universal gate set by seamlessly combining fully programmable, scalable linear optical networks with integrated nonlinear modules. This platform enables a broad range of quantum computing and simulation tasks. We demonstrate the quasi-deterministic generation of optical Gottesman-Kitaev-Preskill states, which are essential resources for bosonic error correction, yet had previously been realized only probabilistically. Furthermore, we simulate complex many-body quantum dynamics, exemplified by the Bose-Hubbard model. Such quantum simulation tasks have long been considered beyond the reach of photonic hardware limited to linear operations. These capabilities, enabled by our extensible architecture, establish a viable route towards photonic quantum simulation and fault-tolerant quantum computing. △ Less

Submitted 6 February, 2026; originally announced February 2026.

Comments: 9 pages, 4 figures

Photonic Links for Spin-Based Quantum Sensors

Authors: M. Reefaz Rahman, Karsten Schnier, Ryan Goldsmith, Benjamin J. Lawrie, Joseph M. Lukens, Seongsin M. Kim, Patrick Kung

Abstract: A growing variety of optically accessible spin qubits have emerged in recent years as key components for quantum sensors, qubits, and quantum memories. However, the scalability of conventional spin-based quantum architectures remains limited by direct microwave delivery, which introduces thermal noise, electromagnetic cross-talk, and design constraints for cryogenic, high-field, and distributed sy… ▽ More A growing variety of optically accessible spin qubits have emerged in recent years as key components for quantum sensors, qubits, and quantum memories. However, the scalability of conventional spin-based quantum architectures remains limited by direct microwave delivery, which introduces thermal noise, electromagnetic cross-talk, and design constraints for cryogenic, high-field, and distributed systems. In this work, we present a unified framework for RF-over-fiber (RFoF) control of optically accessible spins through RFoF optically detected magnetic resonance (ODMR) spectroscopy of nitrogen-vacancy (NV) centers in diamond. The RFoF platform relies on an electro-optically modulated telecom-band laser that transmits microwave signals over fiber and a high-speed photodiode that recovers the RF waveform to drive NV center spin transitions. We obtain an RFoF efficiency of 1.81\% at 2.90~GHz, corresponding to $P_{\mathrm{RF,out}}=-0.7$~dBm. The RFoF architecture provides a path toward low-noise, thermally isolated, and cryo-compatible ODMR systems bridging conventional spin-based quantum sensing protocols with emerging distributed quantum technologies. △ Less

Submitted 29 January, 2026; originally announced January 2026.

Contextuality as an External Bookkeeping Cost under Fixed Shared-State Semantics

Authors: Song-Ju Kim

Abstract: Contextuality is a central feature distinguishing quantum from classical probability theories, but its operational meaning is often stated only qualitatively. In this Letter, we study a simple information-theoretic question: how much additional contextual information must a classical simulation introduce when it tries to keep a shared internal description fixed across contexts? To make this questi… ▽ More Contextuality is a central feature distinguishing quantum from classical probability theories, but its operational meaning is often stated only qualitatively. In this Letter, we study a simple information-theoretic question: how much additional contextual information must a classical simulation introduce when it tries to keep a shared internal description fixed across contexts? To make this question precise, we analyze a minimal external-label simulation model in which the remaining context dependence is carried only by an auxiliary label. For this model, we define an obstruction cost as the minimum mutual information between the context and the auxiliary label required to reproduce the observed statistics. We then prove a conservative quantitative lower bound: any linear witness that separates the observed statistics from the zero-obstruction set yields a positive lower bound on this cost. We do not claim that this bound is tight, and we do not claim that the simulation model covers every possible classical architecture. Its role is narrower and more explicit: under fixed shared-state semantics, contextuality can be read as a certificate of irreducible external bookkeeping cost in a simple and well-defined simulation model. △ Less

Submitted 3 April, 2026; v1 submitted 27 January, 2026; originally announced January 2026.

Comments: 5 pages, 0 figure

Sufficient conditions for additivity of the zero-error classical capacity of quantum channels

Authors: Jeonghoon Park, Jeong San Kim

Abstract: The one-shot zero-error classical capacity of a quantum channel is the maximum amount of classical information that can be transmitted with zero probability of error via a single channel use. This capacity is fundamentally characterized by the logarithm of the independence number of the noncommutative graph induced by the quantum channel. Consequently, the additivity of the one-shot zero-error cla… ▽ More The one-shot zero-error classical capacity of a quantum channel is the maximum amount of classical information that can be transmitted with zero probability of error via a single channel use. This capacity is fundamentally characterized by the logarithm of the independence number of the noncommutative graph induced by the quantum channel. Consequently, the additivity of the one-shot zero-error classical capacity is equivalent to the multiplicativity of the independence number of the associated noncommutative graphs. As the independence number is not multiplicative in general, the specific conditions under which multiplicativity is preserved remain an open question in quantum information theory. Here, we establish some sufficient conditions for the multiplicativity of the independence number and provide explicit examples of quantum channels that satisfy these criteria. Furthermore, we investigate the block form of noncommutative graphs and derive the conditions under which the independence number remains multiplicative within this framework. These results offer new insights into the structural properties of noncommutative graphs and the fundamental limits of zero-error quantum communication. △ Less

Submitted 12 July, 2026; v1 submitted 26 January, 2026; originally announced January 2026.

Comments: 8 pages, no figure

Harnessing Quantum Computing for Energy Materials: Opportunities and Challenges

Authors: Seongmin Kim, In-Saeng Suh, Travis S. Humble, Thomas Beck, Eungkyu Lee, Tengfei Luo

Abstract: Developing high-performance materials is critical for diverse energy applications to increase efficiency, improve sustainability and reduce costs. Classical computational methods have enabled important breakthroughs in energy materials development, but they face scaling and time-complexity limitations, particularly for high-dimensional or strongly correlated material systems. Quantum computing (QC… ▽ More Developing high-performance materials is critical for diverse energy applications to increase efficiency, improve sustainability and reduce costs. Classical computational methods have enabled important breakthroughs in energy materials development, but they face scaling and time-complexity limitations, particularly for high-dimensional or strongly correlated material systems. Quantum computing (QC) promises to offer a paradigm shift by exploiting quantum bits with their superposition and entanglement to address challenging problems intractable for classical approaches. This perspective discusses the opportunities in leveraging QC to advance energy materials research and the challenges QC faces in solving complex and high-dimensional problems. We present cases on how QC, when combined with classical computing methods, can be used for the design and simulation of practical energy materials. We also outline the outlook for error-corrected, fault-tolerant QC capable of achieving predictive accuracy and quantum advantage for complex material systems. △ Less

Submitted 23 January, 2026; originally announced January 2026.

Comments: This manuscript is published in ACS Energy Letters at: https://doi.org/10.1021/acsenergylett.5c04009

Journal ref: ACS Energy Lett. 2026

Quantum solver for single-impurity Anderson models with particle-hole symmetry

Authors: Mariia Karabin, Tanvir Sohail, Dmytro Bykov, Eduardo Antonio Coello Pérez, Swarnava Ghosh, Murali Gopalakrishnan Meena, Seongmin Kim, Amir Shehata, In-Saeng Suh, Hanna Terletska, Markus Eisenbach

Abstract: Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we develop and benchmark a quantum-classical hybrid solver tailored for DMF… ▽ More Quantum embedding methods, such as dynamical mean-field theory (DMFT), provide a powerful framework for investigating strongly correlated materials. A central computational bottleneck in DMFT is in solving the Anderson impurity model (AIM), whose exact solution is classically intractable for large bath sizes. In this work, we develop and benchmark a quantum-classical hybrid solver tailored for DMFT applications, using the variational quantum eigensolver (VQE) to prepare the ground state of the AIM with shallow quantum circuits. The solver uses a unified ansatz framework to prepare the particle and hole excitations of the ground-state from parameter-shifted circuits, enabling the reconstruction of the impurity Green's function through a continued-fraction expansion. We evaluate the performance of this approach across a few bath sizes and interaction strengths under noisy, shot-limited conditions. We compare three optimization routines (COBYLA, Adam, and L-BFGS-B) in terms of convergence and fidelity, assess the benefits of estimating a quantum-computed moment (QCM) correction to the variational energies, and benchmark the approach by comparing the reconstructed density of states (DOS) against that obtained using a classical pipeline. Our results demonstrate the feasibility of Green's function reconstruction on near-term devices and establish practical benchmarks for quantum impurity solvers embedded within self-consistent DMFT loops. △ Less

Submitted 9 June, 2026; v1 submitted 15 January, 2026; originally announced January 2026.

Minimal Decision Dynamics and Contextual Probability: A Quantum Tug-of-War Model

Authors: Song-Ju Kim

Abstract: Decision making often exhibits context dependence that challenges classical probability theory. This paper develops a quantum-like extension of the Tug-of-War (QTOW) decision-making model to clarify when such context dependence can be represented by a single minimal internal state. The QTOW construction uses a qutrit internal state, conservation-preserving updates, and measurement-induced disturba… ▽ More Decision making often exhibits context dependence that challenges classical probability theory. This paper develops a quantum-like extension of the Tug-of-War (QTOW) decision-making model to clarify when such context dependence can be represented by a single minimal internal state. The QTOW construction uses a qutrit internal state, conservation-preserving updates, and measurement-induced disturbance to model decision, learning, and probing operations within one coherent state space. Within this minimal representation, KCBS-type probing contexts can be constructed, yielding a witness of non-contextual classical non-embeddability. The main claim is not that quantum theory is uniquely or assumption-freely derived from decision making. Rather, a classical reconstruction of the same operation family requires additional contextual memory, history dependence, or an enlarged hidden-state representation. Thus, contextual probability appears as a resource signature of minimal decision dynamics, while quantum probability provides a compact, memory-efficient realization of this structure. △ Less

Submitted 9 July, 2026; v1 submitted 14 January, 2026; originally announced January 2026.

Comments: 47 pages, 3 figures

Continuous-time noise mitigation in analogue quantum simulation

Authors: Gabriele Bressanini, Yue Ma, Hyukjoon Kwon, M. S. Kim

Abstract: Analogue quantum simulators offer a promising route to explore quantum many-body dynamics beyond classical reach in the near term. However, their vulnerability to noise limits the accuracy of simulations. Here, we establish a new framework for mitigating noise in analogue quantum simulation, operating in a time-continuous manner. To our knowledge, this is the first protocol that is fully analogue… ▽ More Analogue quantum simulators offer a promising route to explore quantum many-body dynamics beyond classical reach in the near term. However, their vulnerability to noise limits the accuracy of simulations. Here, we establish a new framework for mitigating noise in analogue quantum simulation, operating in a time-continuous manner. To our knowledge, this is the first protocol that is fully analogue and that achieves exact noise cancellation. Our method requires a small number of ancillary qubits, whose interaction with the system$-$combined with classical post-processing of joint measurement data$-$is tailored to cancel the effect of noise. Furthermore, the protocol is Hamiltonian-independent, robust to realistic ancilla noise, and avoids any discretization, preserving the continuous-time nature of the system's dynamics. This work opens a new direction for achieving high-fidelity analogue quantum simulation in the presence of noise. △ Less

Submitted 9 January, 2026; originally announced January 2026.

Hilbert space signatures of non-ergodic glassy dynamics

Authors: Aleksey Lunkin, Nicole S. Ticea, Shashwat Kumar, Connie Miao, Jaehong Choi, Mohammed Alghadeer, Ilya Drozdov, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Laleh Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Brian Ballard, Joseph C. Bardin, Hector Bates, Andreas Bengtsson , et al. (270 additional authors not shown)

Abstract: Disorder in quantum many-body systems can drive transitions between ergodic and non-ergodic phases, yet the nature--and even the existence--of these transitions remains intensely debated. Using a two-dimensional array of superconducting qubits, we study an interacting spin model at finite temperature in a disordered landscape, tracking dynamics both in real space and in Hilbert space. Over a broad… ▽ More Disorder in quantum many-body systems can drive transitions between ergodic and non-ergodic phases, yet the nature--and even the existence--of these transitions remains intensely debated. Using a two-dimensional array of superconducting qubits, we study an interacting spin model at finite temperature in a disordered landscape, tracking dynamics both in real space and in Hilbert space. Over a broad disorder range, we observe an intermediate non-ergodic regime with glass-like characteristics: physical observables become broadly distributed and some, but not all, degrees of freedom are effectively frozen. The Hilbert-space return probability shows slow power-law decay, consistent with finite-temperature quantum glassiness. In the same regime, we detect the onset of a finite Edwards-Anderson order parameter and the disappearance of spin diffusion. By contrast, at lower disorder, spin transport persists with a nonzero diffusion coefficient. Our results show that there is a transition out of the ergodic phase in two-dimensional systems. △ Less

Submitted 15 April, 2026; v1 submitted 3 January, 2026; originally announced January 2026.

Observation of disorder-induced superfluidity

Authors: Nicole Ticea, Elias Portoles, Eliott Rosenberg, Alexander Schuckert, Aaron Szasz, Bryce Kobrin, Nicolas Pomata, Pranjal Praneel, Connie Miao, Shashwat Kumar, Ella Crane, Ilya Drozdov, Yuri Lensky, Sofia Gonzalez-Garcia, Thomas Kiely, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Markus Ansmann, Frank Arute, Kunal Arya , et al. (277 additional authors not shown)

Abstract: The emergence of states with long-range correlations in a disordered landscape is rare, as disorder typically suppresses the particle mobility required for long-range coherence. But when more than two energy levels are available per site, disorder can induce resonances that locally enhance mobility. Here we explore phases arising from the interplay between disorder, kinetic energy, and interaction… ▽ More The emergence of states with long-range correlations in a disordered landscape is rare, as disorder typically suppresses the particle mobility required for long-range coherence. But when more than two energy levels are available per site, disorder can induce resonances that locally enhance mobility. Here we explore phases arising from the interplay between disorder, kinetic energy, and interactions on a superconducting processor with qutrit readout and control. Compressibility measurements distinguish an incompressible Mott insulator from surrounding compressible phases and reveal signatures of glassiness, reflected in non-ergodic behavior. Spatially-resolved two-point correlator measurements identify regions of the phase diagram with a non-vanishing condensate fraction. We also visualize the spectrum by measuring the dynamical structure factor. A linearly-dispersing phonon mode materializes in the superfluid, appearing even when disorder is introduced to the clean Mott insulator. Our results provide strong experimental evidence for disorder-induced superfluidity. △ Less

Submitted 3 February, 2026; v1 submitted 24 December, 2025; originally announced December 2025.

Comments: Supplement updated

Quantum data hiding with two-qubit separable states

Authors: Donghoon Ha, Jeong San Kim

Abstract: We consider the discrimination of two-party quantum states and provide a quantum data-hiding scheme using two-qubit separable states. We first provide a bound on the optimal local discrimination of two-party quantum states, and establish a sufficient condition under which a two-party quantum state ensemble can be used to construct a data-hiding scheme. We illustrate this condition with examples of… ▽ More We consider the discrimination of two-party quantum states and provide a quantum data-hiding scheme using two-qubit separable states. We first provide a bound on the optimal local discrimination of two-party quantum states, and establish a sufficient condition under which a two-party quantum state ensemble can be used to construct a data-hiding scheme. We illustrate this condition with examples of two-qubit state ensembles consisting of two orthogonal separable states. As our data-hiding scheme can be implemented with separable states of the lowest possible dimension, its practical realization becomes significantly more attainable. △ Less

Submitted 17 December, 2025; originally announced December 2025.

Comments: 9 pages, 1 figure

Roadmap: 2D Materials for Quantum Technologies

Authors: Qimin Yan, Tongcang Li, Xingyu Gao, Sumukh Vaidya, Saakshi Dikshit, Yue Luo, Stefan Strauf, Reda Moukaouine, Anton Pershin, Adam Gali, Zhenyao Fang, Harvey Stanfield, Ivan J. Vera-Marun, Michael Newburger, Simranjeet Singh, Tiancong Zhu, Mauro Brotons-Gisbert, Klaus D. Jöns, Brian D. Gerardot, Brian S. Y. Kim, John R. Schaibley, Kyle L. Seyler, Jesse Balgley, James Hone, Kin Chung Fong , et al. (7 additional authors not shown)

Abstract: Two-dimensional (2D) materials have emerged as a versatile and powerful platform for quantum technologies, offering atomic-scale control, strong quantum confinement, and seamless integration into heterogeneous device architectures. Their reduced dimensionality enables unique quantum phenomena, including optically addressable spin defects, tunable single-photon emitters, low-dimensional magnetism,… ▽ More Two-dimensional (2D) materials have emerged as a versatile and powerful platform for quantum technologies, offering atomic-scale control, strong quantum confinement, and seamless integration into heterogeneous device architectures. Their reduced dimensionality enables unique quantum phenomena, including optically addressable spin defects, tunable single-photon emitters, low-dimensional magnetism, gate-controlled superconductivity, and correlated states in Moiré superlattices. This Roadmap provides a comprehensive overview of recent progress and future directions in exploiting 2D materials for quantum sensing, computation, communication, and simulation. We survey advances spanning spin defects and quantum sensing, quantum emitters and nonlinear photonics, computational theory and data-driven discovery of quantum defects, spintronic and magnonic devices, cavity-engineered quantum materials, superconducting and hybrid quantum circuits, quantum dots, Moiré quantum simulators, and quantum communication platforms. Across these themes, we identify common challenges in defect control, coherence preservation, interfacial engineering, and scalable integration, alongside emerging opportunities driven by machine$-$learning$-$assisted design and integrated experiment$-$theory feedback loops. By connecting microscopic quantum states to mesoscopic excitations and macroscopic device architectures, this Roadmap outlines a materials-centric framework for integrating coherent quantum functionalities and positions 2D materials as foundational building blocks for next-generation quantum technologies. △ Less

Submitted 16 December, 2025; originally announced December 2025.

Comments: 81 pages; submitted to 2D Materials, IOP Publishing

Magic state cultivation on a superconducting quantum processor

Authors: Emma Rosenfeld, Craig Gidney, Gabrielle Roberts, Alexis Morvan, Nathan Lacroix, Dvir Kafri, Jeffrey Marshall, Ming Li, Volodymyr Sivak, Dmitry Abanin, Amira Abbas, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute, Kunal Arya, Walt Askew, Nikita Astrakhantsev, Juan Atalaya, Ryan Babbush, Brian Ballard , et al. (270 additional authors not shown)

Abstract: Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments… ▽ More Fault-tolerant quantum computing requires a universal gate set, but the necessary non-Clifford gates represent a significant resource cost for most quantum error correction architectures. Magic state cultivation offers an efficient alternative to resource-intensive distillation protocols; however, testing the proposal's assumptions represents a challenging departure from quantum memory experiments. We present an experimental study of magic state cultivation on a superconducting quantum processor. We implement cultivation, including code-switching into a surface code, and develop a fault-tolerant measurement protocol to bound the magic state fidelity. Cultivation reduces the error by a factor of 40, with a state fidelity of 0.9999(1) (retaining 8% of attempts). Our results experimentally establish magic state cultivation as a viable solution to one of quantum computing's most significant challenges. △ Less

Submitted 15 December, 2025; originally announced December 2025.

Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality

Authors: Shashwat Kumar, Eliott Rosenberg, Alejandro Grajales Dau, Rodrigo Cortinas, Dmitri Maslov, Richard Oliver, Adam Zalcman, Matthew Neeley, Alice Pagano, Aaron Szasz, Ilya Drozdov, Zlatko Minev, Craig Gidney, Noureldin Yosri, Stijn J. de Graaf, Aniket Maiti, Dmitry Abanin, Rajeev Acharya, Laleh Aghababaie Beni, Georg Aigeldinger, Ross Alcaraz, Sayra Alcaraz, Trond I. Andersen, Markus Ansmann, Frank Arute , et al. (258 additional authors not shown)

Abstract: The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probab… ▽ More The prevailing view is that quantum phenomena can be harnessed to tackle certain problems beyond the reach of classical approaches. Quantifying this capability as a quantum-classical separation and demonstrating it on current quantum processors has remained elusive. Using a superconducting qubit processor, we show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits. With a few qubits, we illustrate quantum contextuality with the magic square game, as well as quantify it through a Kochen--Specker--Bell inequality violation. To examine many-body contextuality, we implement the N-player GHZ game and separately solve a 2D hidden linear function problem, exceeding classical success rate in both. Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms. △ Less

Submitted 1 December, 2025; originally announced December 2025.