跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 20:44 — 2026-11-18 20:44(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 302 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
新论文 · v1arXiv:2611.23196

Nonlinearity-preserving quantum simulation of flows in the early fault-tolerant regime

Hansol Noh, Unam Oh, Sangkyu Baek, Doyeol, Ahn

原文摘要

Ensemble prediction of nonlinear dynamics propagates a probability density whose linear transport equation retains the nonlinear drift, but grid-dependent circuit costs leave end-to-end feasibility in early fault-tolerant quantum computing unresolved. We couple polynomial reduced-order models fitted by sparse identification of nonlinear dynamics to Walsh-synthesized Koopman-von Neumann (KvN) transport and surface-code resource estimation. At fixed model dimension and drift degree, per-step transport rotation counts scale polylogarithmically with cells per reduced coordinate. Balancing model accuracy against circuit costs makes reduced-model polynomial degree a design variable for early fault-tolerant quantum simulation. For a cylinder wake approaching saturation, preparation, propagation and sampling to 1% relative root-mean-square field error against the radial model are estimated to take 1.62 h on about 560,000 physical qubits. Estimated three-coordinate wake runtimes span hours to weeks below one million qubits. IBM hardware experiments demonstrate nonlinear radial KvN transport for this wake, using reference circuits to mitigate noise.

quant-ph · cs.CE · nlin.CD

新论文 · v1arXiv:2611.23186

Integral Tensor Isomorphism via Cubic Rings and Lattice Methods

Thomas Huffstutler

原文摘要

We prove that isomorphism of integral $2\times3\times3$ tensors under $\mathrm{GL}_2(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z})$ is decidable in bounded-error quantum polynomial time. For a tensor $T=(A,B)$ with nonzero determinant form $\det(xA-yB)$, we use the parametrization of Wood by balanced modules to reduce the isomorphism problem to principality tests for compatible lattices, and use the algorithms of Bley, Hofmann, and Johnston to solve this in BQP. When the determinant form vanishes identically, we get either an integral $2\times2\times2$ core, or a polynomial kernel vector of degree one or two. The linear-kernel case yields another compatible lattice problem, while the quadratic-kernel case reduces to a fixed system of polynomial congruences and unimodular lifting. A quantifier-elimination argument decides these congruences in deterministic polynomial time given the prime factorization of the modulus, which quantum integer factorization supplies. Finally, we show that zero padding preserves integral $2\times2\times2$ tensor isomorphism, yielding a polynomial-time reduction from real-quadratic principality to the identically singular $2\times3\times3$ problem.

quant-ph · cs.CC

新论文 · v1arXiv:2611.23116

Optimal Min-Entropy Estimation with High Probability

Qisheng Wang

原文摘要

Min-entropy plays a fundamental role in assessing the unpredictability of randomness sources. In particular, NIST SP 800-90B specifies min-entropy estimation as a key procedure for entropy sources used in cryptographic random bit generators, illustrating the practical importance of reliable min-entropy estimation. In this paper, we settle the sample complexity of min-entropy estimation with high probability in both the classical and quantum cases. Specifically, for min-entropy estimation with additive error $\varepsilon$ and probability at least $1-δ$, the sample complexity is $Θ(d\log(d/δ)/\varepsilon^2)$ for classical distributions on $d$ symbols and $Θ((d^2+d\log(1/δ))/\varepsilon^2)$ for quantum states on a $d$-dimensional Hilbert space. Our results admit short and simple proofs.

cs.IT · math.ST · quant-ph

版本更新 · v3arXiv:2609.39747

A depolarizing choir sings in Gaussian harmony

Rabsan Galib Ahmed, Sujeet Bhalerao, Sungjai Lee, Felix Leditzky, Debbie Leung, Luke Schaeffer, Graeme Smith

原文摘要

We study the noise threshold for positive quantum capacity for the qubit depolarizing channel. We explore analytically the action of the qubit depolarizing channel on the symmetric subspaces of the input qubits, in the limit of asymptotically many uses of the channel. We observe the emergence of a bosonic Gaussian channel. Furthermore, the codes previously developed for the depolarizing channel can be translated to codes for the emergent Gaussian channel, and it is easier to further optimize these codes for the simpler emergent Gaussian channel. Translating these codes back to the depolarizing channel leads to extremely good input states for the coherent information of the depolarizing channel producing new lower bounds on the noise threshold for positive capacity. In addition to improved lower bounds on the threshold, this newly found link between depolarizing noise and Gaussian channels offers a novel perspective contributing to our understanding of these symmetric codes.

quant-ph · cs.IT

新论文 · v1arXiv:2611.22635

A Quantum Support Vector Regression Framework for Missing Data Imputation in Ship Performance Data

Daniel Maroto Sanchez, Christian Velasco-Gallego, Miriam Bastante Chichon, Jaime Álvarez-Benayas, Tsoulakos Nikolaos, J. A. Bravo-Montes

原文摘要

The Internet of Ships enables vessels to generate vast amounts of data, yet missing values remain a persistent issue. To the best of the authors' knowledge, existing imputation techniques in this domain rely exclusively on classical machine learning. This study investigates quantum support vector regression (QSVR) for imputing missing values in ship performance data. Classical support vector regression and QSVR models based on different quantum feature maps are compared for estimating marine fuel consumption under varying levels of data availability. The case study uses real-world data from a Panamax bulk carrier, covering 37 variables across six categories. Three experiments are conducted: exploratory analysis with three input features, scalability analysis with increasing dimensionality (3 to 18 features), and comparative evaluation under a selected representative configuration. Across all scenarios, both classical and quantum approaches captured the relationship between the inputs and the main-engine fuel-flow rate, maintaining strong imputation performance even under severe data scarcity. ZZFeatureMap_1 achieved the highest average R2 (0.991 in the performance comparison conducted with 60% of the dataset, 90% missing data, and 14 input features, for instance) and the lowest aggregate imputation errors, while the radial basis function kernel was the strongest classical baseline, delivering highly competitive results.

quant-ph · cs.LG

新论文 · v1arXiv:2611.22621

Entanglement Lower Bounds for Symmetric Quantum Circuits

Davi Castro-Silva, Ryan Dancy, Sergii Strelchuk

原文摘要

Symmetric circuits require every symmetry of the input to extend to an automorphism of the circuit. In the classical setting, their connection to descriptive complexity yields strong unconditional lower bounds. We extend this approach to the quantum model of symmetric computation defined by Castro-Silva, Gur, and Strelchuk (ITCS 2026), proving a tradeoff between circuit size and entanglement width (the smallest $b$ such that, on every computational-basis input, the state after each layer factors into states on at most $b$ qubits each). Our main result identifies a graph property decidable in classical polynomial time that no polynomial-size family of symmetric quantum circuits on $n$-vertex graphs with entanglement width $o(n/\log n)$ can compute. The bound holds for circuits with arbitrary one-qubit and two-qubit gates and unrestricted depth, and remains valid under the weaker notion of symmetry with respect to even permutations of vertices. Our proof is based on a new quantum pebble game based on the partial trace. The resulting indistinguishability theorem transfers classical pebble-game lower bounds to quantum circuits with restricted entanglement. By contrast, without entanglement restrictions, we show that every graph property in BQP can be computed by a uniform family of polynomial-size symmetric quantum circuits. Restricting to circuits with no entanglement at all, we show that polynomial-size symmetric quantum circuits with entanglement width 1 can compute every graph property definable in fixed-point logic with counting. Finally, we give an efficient symmetric implementation of QAOA for MAX 3XOR, providing a starting point for studying entanglement lower bounds in quantum optimization algorithms.

quant-ph · cs.CC · cs.LO

版本更新 · v2arXiv:2601.20263

A Quantum Photonic Approach to Graph Coloring

Jesua Epequin, Pascale Bendotti, Joseph Mikael

原文摘要

Gaussian Boson Sampling (GBS) is a quantum computational model that leverages linear optics to solve sampling problems believed to be classically intractable. Recent experimental breakthroughs have demonstrated quantum advantage using GBS, motivating its application to real-world combinatorial optimization problems. In this work, we reformulate the graph coloring problem as an integer programming problem using the independent set formulation. This enables the use of GBS to identify cliques in the complement graph, which correspond to independent sets in the original graph. Our method is benchmarked against classical heuristics and exact algorithms on two sets of instances: Erdős-Rényi random graphs and graphs derived from a smart-charging use case. The results demonstrate that GBS can provide competitive solutions, highlighting its potential as a quantum-enhanced heuristic for graph-based optimization.

quant-ph · cs.DM

新论文 · v1arXiv:2611.22232

MASQ: Measurement-Adaptive Sampling for Near-Clifford Quantum Error Correction Circuits

Chaebin Jung, Sangmin Jeon, Kyeongwon Lee, Sechan Park, Woojoo Lee

原文摘要

Classical sampling of quantum error correction (QEC) circuits supports fault-tolerant protocol evaluation, but estimating rare logical failures requires many independent shots. Frame-active-state simulators isolate non-stabilizer information in a dense active-state vector, yet dense-state processing remains exponential in the active width. This paper presents MASQ, an exact measurement-adaptive sampler for near-Clifford QEC circuits based on selective materialization of non-Clifford rotations. At each measurement boundary, MASQ materializes only rotations in a measurement-relevant closure capturing direct and indirect non-commuting dependencies, deferring the rest to limit active-state expansion. Stabilizer-assisted elimination further removes rotations certified to be invisible to all future measurements. A circuit-dependent schedule is computed once and shared across shots, while adaptive caching of conditional Born probabilities and batched execution reduce repeated sampling work while preserving the measurement-record distribution. Across 19 QEC benchmarks, MASQ reduces peak active width by up to 40 active virtual qubits and achieves up to 8,098-fold CPU throughput speedup over Clifft on multi-round circuits.

cs.ET · quant-ph

版本更新 · v2arXiv:2605.09118

Quantum-to-Quantum Transfer Learning Exhibits Improved Robustness in Low-Data Regimes

Li-An Lo, Li-Yi Hsu, Hsien-Yi Hsieh

原文摘要

Transfer learning under limited data is a challenging setting, where models must adapt to new tasks with minimal supervision. Prior work has primarily focused on improving absolute accuracy in transfer learning. However, empirical evidence comparing quantum and classical models in realistic transfer learning settings remains limited, especially in low-data regimes. In this work, we systematically study the robustness of quantum models under reduced training data. We evaluate multiple quantum and classical architectures across diverse transfer tasks and retraining configurations, and quantify robustness using accuracy degradation and relative performance retention (RPR). Our results show that, although classical models often achieve higher peak performance, they exhibit significantly larger degradation when training data is limited. In contrast, quantum models maintain more stable performance across data regimes, indicating improved robustness and data efficiency. These findings provide empirical evidence that quantum models can offer improved robustness in low-resource transfer learning scenarios.

quant-ph · cs.LG

版本更新 · v2arXiv:2608.28828

Representation Learning with Quantum Signal Processing

Junqi Wang, Junyu Liu

原文摘要

Representation learning begins when training changes the features that define similarity between data. A frozen-kernel model only reweights a fixed geometry. We establish quantum signal processing (QSP) as a solvable quantum model of the representation-learning regime. At arbitrary depth, we compute the exact mean and variance of its quantum neural tangent kernel, revealing an input-dependent angular geometry whose diagonal remains non-self-averaging even when the underlying unitary approaches Haar randomness. We also prove a sparse-data guarantee for the full nonlinear gradient flow without freezing or ensemble-averaging the kernel: the realized dynamics converges to an integrable scalar flow with a time-dependent kernel closure and explicit convergence times. A finite-depth speed limit holds for every data set and trajectory. At higher data density, numerical results show coupled evolution beyond both the scalar and frozen-kernel descriptions. These results give a controlled theory of learned quantum data geometry with provable training dynamics beyond the frozen limit.

quant-ph · cs.AI · cs.LG · stat.ML

新论文 · v1arXiv:2611.21994

An alternate proof of the QMA lower bound for set-size estimation

Chinmay Nirkhe

原文摘要

In the set-size estimation query task, a query algorithm decides whether an $N$-bit input has Hamming weight $\ge B$ or $\le A$ (with $\ge B$ as the yes instances and $\le A$ as the no instances). When $B = 2A$, this is sometimes called approximate counting. The query complexity for this problem with a quantum witness (i.e., $\mathsf{QMA}$ query bounds) was resolved by Aaronson, Kothari, Kretschmer, and Thaler (CCC 2020) and proved using Laurent polynomials. Here we give a morally similar but distinct proof of the lower bound using the polynomial method.

quant-ph · cs.CC

新论文 · v1arXiv:2611.21941

Complexity and precision in quantum associative retrieval

Carlo A. Trugenberger

原文摘要

We show that efficient and high-precision quantum associative retrieval is possible with an exponential complexity advantage with respect to the classical brute force approach and with a polynomial capacity advantage with respect to classical neural network implementations for any number of patterns scaling polynomially in the number of qubits. Both classical neural and quantum associative memories store the patterns in a Hamiltonian; in the classical case the dynamics is irreversible relaxation toward attractors, in the quantum case it is unitary transformations generating an effective thermal distribution, followed by a measurement.

quant-ph · cs.CC · cs.IR · cs.NE

版本更新 · v3arXiv:2506.03199

Quantum Cognition Machine Learning for Forecasting Chromosomal Instability

Giuseppe Di Caro, Vahagn Kirakosyan, Alexander G. Abanov, Jerome R. Busemeyer, Luca Candelori, Nadine Hartmann, Ernest T. Lam, Kharen Musaelian 等 14 位作者

原文摘要

The accurate prediction of chromosomal instability from the morphology of circulating tumor cells (CTCs) enables real-time detection of CTCs with high metastatic potential in the context of liquid biopsy diagnostics. However, it presents a significant challenge due to the high dimensionality and complexity of single-cell digital pathology data. Here, we introduce the application of Quantum Cognition Machine Learning (QCML), a quantum-inspired computational framework, to estimate morphology-predicted chromosomal instability in CTCs from patients with metastatic breast cancer. QCML leverages quantum mechanical principles to represent data as state vectors in a Hilbert space, enabling context-aware feature modeling, dimensionality reduction, and enhanced generalization without requiring curated feature selection. QCML outperforms conventional machine learning methods when tested on out of sample verification CTCs, achieving higher accuracy in identifying predicted large-scale state transitions (pLST) status from CTC-derived morphology features. These preliminary findings support the application of QCML as a novel machine learning tool with superior performance in high-dimensional, low-sample-size biomedical contexts. QCML enables the simulation of cognition-like learning for the identification of biologically meaningful prediction of chromosomal instability from CTC morphology, offering a novel tool for CTC classification in liquid biopsy.

q-bio.QM · cs.LG · quant-ph

新论文 · v1arXiv:2611.21855

Shortest-path percolation and structural robustness of quantum internet networks

Victor H. F. Francheto, Thomas Peron

原文摘要

We study shortest-path percolation on spatial networks that model the quantum internet based on optical fibers. In this process, the removal of paths describes the consumption of the entangled links used for communication. We compare finite and unrestricted path-length bounds for networks whose average degree either increases with system size or remains approximately constant. We show that networks become more robust as the average degree increases, whereas networks with approximately constant average degree exhibit a data collapse for the fixed finite bounds considered. Using Monte Carlo sampling of the shortest-path-length distribution, we estimate an equivalent path cost, a finite bound that approximately reproduces the degradation of the network in the unrestricted case. For networks with fixed average degree, this cost grows approximately as the square root of the number of nodes. Increasing the bound beyond this value requires additional computation time without appreciably changing the percolation dynamics. As a complementary result, for Erdős-Rényi random networks, we find an empirical relation between the initial average degree and the approximately common crossing point of the percolation curves for different path-length bounds.

physics.soc-ph · cond-mat.stat-mech · cs.SI · quant-ph

新论文 · v1arXiv:2611.21840

Quantum-Classical Separation in Probability Distribution Transport via Nonlocal Games

Fangjun Hu, Xun Gao

原文摘要

In many-body physics and generative artificial intelligence, locality provides a natural notion of phase equivalence: two quantum states or classical probability distributions are regarded as in the same phase when local dynamics can reversibly transform one into the other. This raises a fundamental question: can local quantum dynamics transport classical probability distributions in ways that local classical dynamics cannot? We establish a quantum-classical separation in distribution transport: two classical distributions can be connected exactly and reversibly by a constant-depth local quantum circuit, whereas classical stochastic transport requires a substantially larger spatial range. We demonstrate this separation explicitly on a one-dimensional chain and develop a general construction principle on graphs, based on nonlocal games. Moreover, the source distribution can itself be generated by a simple local classical process, establishing a quantum advantage in distribution generation as well. Our results reveal a fundamental distinction between classical and quantum local reversibility, even when both the initial and final states are entirely classical.

quant-ph · cs.CC · cs.LG

新论文 · v1arXiv:2611.21552

量子循环神经网络在时间序列预测中的记忆与非线性处理能力基准测试

Benchmarking memory and nonlinear processing capacity of quantum recurrent neural networks for time series prediction

José Daniel Viqueira, Andrés Gómez, David Mera

AI 速读 基于摘要

作者对变分量子循环神经网络(QRNN)在时间序列预测中的记忆与非线性处理能力进行了基准测试,并与经典循环基线比较。

quant-ph · cs.LG

查看原文摘要

Quantum machine learning has emerged as a promising approach to time series prediction. While quantum reservoir computing has been widely explored for this setting, variational quantum models tailored to sequential data remain comparatively understudied, largely because they are difficult to train. In this work, we present a rigorous benchmark of variational quantum recurrent neural networks (QRNNs) on time series prediction tasks, focusing on two key capabilities: memory and nonlinear processing. We introduce a task-driven methodology that quantifies model capacity, enabling an intuitive and fair comparison across architectures, including classical recurrent baselines. We evaluate the proposed framework on two generic benchmark tasks and on a synthetic dataset describing a chaotic system. Overall, the quantum models achieve performance comparable to their classical counterparts, but classical models scale better with the memory size within the range studied. Notably, one QRNN variant shows higher average capacity on the task designed to jointly probe memory and nonlinear capacity. Moreover, our results show that quantum models offer better capacity when we are able to find a good parameter initialization. However, the increasing sensitivity to initialization leads to a lower probability of finding good solutions as the model size increases. These results provide a principled starting point for designing richer quantum recurrent architectures and for assessing where they may offer practical benefits.

版本更新 · v3arXiv:2611.09822

Discovering formally verified quantum programs with AI

Sergey Shirobokov, Ben Jaderberg, Katerina Hristova, George Tsoukalas, Johannes Bausch, Eric Wieser, Francisco J. H. Heras, Nicholas C. Rubin 等 25 位作者

原文摘要

The timeline by which quantum computers can solve breakthrough problems in science depends on improved quantum algorithms as much as on better hardware. Such algorithmic advances are typically achieved through many years of expert human collaboration. In mathematics and computer science, large language models have accelerated progress through automated discovery loops. However, quantum algorithms can only be evaluated by classical computers on restricted or small instances. Here we demonstrate automated discovery of quantum programs beyond these regimes including order-of-magnitude improvements on scientific applications. To achieve this, we build a quantum program library in the Lean theorem prover in which Gemini 4 agents synthesize novel programs against formal problem specifications and verify their correctness and cost. Agent teams collaborate, sharing results and knowledge through wikis and discussing ideas at organized conferences. Our results improve on prior baselines for parallel search (up to 2.57x), quantum arithmetic (290x), and simulations relevant to fusion, photochemistry and drug-metabolism by 12x, 8x and 2.5x respectively. Combining human and artificial intelligence at scale, under the rigor of mathematical proof, lets researchers design algorithms that today's classical and quantum computers cannot test, shortening the path to practical quantum computation.

quant-ph · cs.AI · cs.PL

版本更新 · v6arXiv:1905.09084

重新审视Shor计算一般离散对数的量子算法

Revisiting Shor's quantum algorithm for computing general discrete logarithms

Martin Ekerå

AI 速读 基于摘要

作者对采用半经典QFT的Shor离散对数算法做精确概率分析,证明通过少量额外量子群运算与后处理有限搜索可将单次成功率提升至接近1。

cs.CR · quant-ph

查看原文摘要

We heuristically show that Shor's quantum algorithm for the DLP achieves an expected success probability of approximately 60-82% in a single run when modified to enable efficient implementation with the semi-classical QFT. By slightly increasing the number of group operations that are evaluated quantumly and performing a single limited search in the post-processing, or by performing two limited searches in the post-processing, we rigorously prove that the modified algorithm can be made to achieve a success probability that, e.g., exceeds $1 - 10^{-4}$ in a single run. Specifically, we give an exact analysis of the probability distribution induced by the algorithm and use it to prove a lower bound on the success probability, as a function of the group order $r$, the size of the search space in the post-processing, and the number of additional group operations evaluated quantumly. In the limit as $r \rightarrow \infty$, we show that the lower bound can be made to tend to one. In analogy with our earlier work, we explain how the limited searches in the post-processing can be performed efficiently using meet-in-the-middle or random-walk techniques, and we show how slightly better tradeoffs can be achieved, compared to our earlier work, when $r$ is known. We generalize our exact analysis to cover several quantum algorithms analyzed in our earlier works, including for parameter regimes not covered by our earlier analyses, yielding a unified lens on all of these algorithms. Furthermore, we generalize our exact analysis to the setting where information on multiple discrete logarithms is computed in each run of the algorithm so as to amortize costs. Last but not least, we give a novel exact simulator, which is based on our generalized exact analysis, and which hence works for all quantum algorithms covered by said analysis.

新论文 · v1arXiv:2611.21500

Exponential Quantum Memory Advantage for Late-Graph Smoothness and Spectral Estimation

Burhan Gülbahar

原文摘要

Graph signal processing tests how smoothly the decisions of next-generation massive sensor networks with $N$ nodes vary over their neighbour graph. Memory becomes the bottleneck when the neighbour graph arrives only after data erasure, a late-graph setting motivated by dispersed sensor networks and telemetry. We analyse three collection scenarios, reliable rounds, continuous broadcast and ordered capture, and test the Dirichlet energy $\mathcal E_G=\mathbf z^{\mathsf T}\mathbf L\mathbf z/N$ of the fused decision map $\mathbf z\in\{\pm1\}^N$, with late-graph Laplacian $\mathbf L$, against two thresholds. Hidden Matching uses $O(\log N)$ qubits on fused bits, but in reliable rounds and continuous broadcast, where nodes report $b$ sub-bits separately, a classical record buffer before it uses $O(N b)$ bits; classical methods need $Ω(\sqrt N)$ bits in the worst case. The recently introduced Quantum Oracle Sketching builds quantum oracles from random data streams without storing them. We combine coherent loading of separately reported sub-bits, exact in reliable rounds and by Quantum Oracle Sketching in continuous broadcast, with nonlinear fusion and Hidden Matching readout. The register count $R$ does not grow with $N$, and the memory is $O(\log N)$ logical qubits and classical bits, at fixed $b$, graph bounds, thresholds and error targets: an exponential memory advantage over every classical receiver and over Hidden Matching with that buffer. We prove unbiasedness in reliable rounds, preparation bounds in continuous broadcast, classical lower bounds and, for a planner-supplied multi-hop coefficient stream, spectral error bounds. Broadcast simulations match analytic averages at $N=1024$, without resolved bias growth up to $N=2^{20}$. Fault-tolerant hardware, gate rates and, in continuous broadcast, report counts remain open.

quant-ph · cs.IT · eess.SP

新论文 · v1arXiv:2611.21389

Vanishing Relative Distance of Uniformly Random CSS LDPC Codes Built from Permutation Matrices

Kenta Kasai

原文摘要

Classical random regular low-density parity-check codes can have minimum distance growing linearly with block length. We study CSS check matrices formed as full $J\times L$ arrays of arbitrary $P\times P$ permutation matrices, sampled uniformly subject to commutation. For fixed column weight $J\ge3$ and fixed even row weight $L>2J$, we prove that the relative minimum distance converges to zero in probability as $P\to\infty$, with block length $n=LP$. We analyze the weight enumerators that count all nontrivial logical representatives after excluding stabilizers. A coefficientwise lower bound shows that, at every fixed relative weight $0<α<1$ along even-weight sequences, exponentially many such representatives exist with high probability. Their typical and mean counts have exponent lower bound $h_2(α)/2$, where $h_2$ is the binary entropy function. We compare this bound with the classical LDPC and dense CSS mean weight-distribution exponents. The existence, with high probability, of a logical operator below every fixed target weight $δn$ yields the distance conclusion.

quant-ph · cs.IT

新论文 · v1arXiv:2611.21270

SCOPE: A Physical Execution Latency-Guided Quantum Circuit Compilation Framework

Bolin Zhang, Zhiyuan Zhang, Yongguang Lv, Ruiqing He, Hengliang Guo, Jiandong Shang, Qiang Chen

原文摘要

Quantum computing requires compilers to translate algorithms represented in the quantum circuit model into unitary operations supported by physical devices. Limited coherence time makes physical execution latency an important compilation objective. Gate fusion can shorten pulses, but gate count and depth do not capture fused targets' control demands. Evaluating every candidate with quantum optimal control (QOC) would embed pulse optimization in structural search. We present Schmidt-guided Compilation for Optimized Pulse Execution (SCOPE), driven by an operator Schmidt time surrogate. The target's angular distance from product operators measures the required nonlocal change; dividing it by a coupling-limited evolution-rate bound gives a lower bound on exact implementation time. Trace-angle and waveform constraints complete block scores for critical-path evaluation during genetic search. Local QOC determines final pulse durations. Under a numerical nearest-neighbor control model, all 104 results across 13 instances from four application families have shorter QOC critical-path durations than an adapted efficient pulse generation framework with advanced synthesis for quantum circuits (EPOC). Using eight-run instance means, the equally weighted reduction is 42.50\%, with a geometric mean speedup of 2.00. In a shared six-qubit quantum Fourier transform (QFT) ablation, time-surrogate guidance reduces mean QOC duration by 22.21\% relative to gate-count guidance and 21.01\% relative to depth guidance, validating the surrogate's joint use in fitness evaluation and mutation-region selection.

quant-ph · cs.AR · cs.ET

新论文 · v1arXiv:2611.21236

Specifying & Verifying Quantum Error-Correcting Codes

Stavan Jain, Nithin Raveendran, Aws Albarghouthi

原文摘要

Building quantum computers is challenging due to the noise that affects qubits. Quantum error correction tackles noise by encoding information in quantum error-correcting (QEC) codes. These codes are often complex, increasingly found by computational search, presented in diverse formalisms with informal arguments, and hard to reason about algorithmically. Given that the rest of the quantum computing stack relies on a QEC code's properties for correct computation, we propose a formally verified foundation for QEC codes. We present QECLean, a Lean-based framework for formally specifying and verifying QEC codes. QECLean backs every claimed QEC-code property with a machine-checked proof, unifies the diverse presentations of codes in the literature through common abstractions, and makes new codes easy to specify. We present a new compositional technique, code combinators, for proving code distance analytically. Code combinators allow us to prove the distance of large codes that are out of reach for algorithmic techniques; for example, we show that IBM's $[[360, 12, \leq 24]]$ code has distance 24, which was previously only known as an upper bound. Furthermore, we show how our approach allows us to formalize and prove entire code families, such as the surface code. Our work lays the foundation required for reasoning about circuit-level implementations of codes on given architectures and for building end-to-end verified compilers for quantum computers. QECLean is available at https://github.com/Stavan-Jain/QECLean

quant-ph · cs.PL

新论文 · v1arXiv:2611.21189

Separations Between Randomized and Exact Quantum Query Complexity for Boolean Functions

Zekun Ye

原文摘要

We construct a family of total Boolean functions $F_{\mathrm{tot}}$ whose randomized and exact quantum query complexities satisfy $R(F_{\mathrm{tot}}) \ge Q_E(F_{\mathrm{tot}})^{2-o(1)}$. Chiruvella, Kayal, Mittal, Paraashar, and Saurabh (2026) also obtained a nearly quadratic separation for total functions in the query model by a different method. For every fixed $\varepsilon \in (0,1)$, we construct a family of partial Boolean functions $F_{\mathrm{par}}$ on $n$ bits satisfying $Q_E(F_{\mathrm{par}})=O_\varepsilon(1)$ and $R(F_{\mathrm{par}})=Ω_\varepsilon(n^{1-\varepsilon})$. This matches the asymptotic separation previously obtained with bounded error (STOC 2021; SICOMP 2023). Lifting yields a family of partial communication functions $G_{\mathrm{par}}$ with $Q_E^{\mathrm{cc}}(G_{\mathrm{par}})=O_\varepsilon(\log n)$ and $R^{\mathrm{pub,cc}}(G_{\mathrm{par}})=Ω_\varepsilon(n^{1-\varepsilon})$, where $n$ is the total number of input bits held by the two parties.

quant-ph · cs.CC

版本更新 · v2arXiv:2610.41398

Distilling Knowledge from Search: Decoder Model Factory for Quantum LDPC Codes

Anil Bilgin, Wanda Hou, Pranav Srinivas Murali, Yi-Zhuang You

原文摘要

We introduce GraphMP, a learning-based message-passing decoder for quantum low-density parity-check codes that transfers without fine-tuning across code families, code sizes, physical error rates, and noise models. Its local message passing keeps computation scalable as the decoding graph grows. We further embed GraphMP in a beam-search algorithm that progressively refines candidate error patterns, trading additional decoding time for lower logical error rates. To turn this decoding effort into lasting improvements, we propose the decoder model factory, a paradigm for training successive models on data collected by earlier models during decoding. In our implementation, verified search trajectories provide reusable training data for distilling knowledge into subsequent models. Across generations, the model factory yields a search-enhanced decoder that is broadly competitive with Relay-BP. On the largest code block, which encodes $4612$ logical qubits, it achieves a lower logical error rate and about $20$ times the decoding throughput of the standard Relay-BP baseline. These results motivate a coupled quantum-classical architecture with two interacting cycles: rapid decoding protects quantum information, while slower learning adapts the models to changing noise conditions. The long-term vision is a scalable decoder model factory that continually produces high-performance, low-latency decoders for evolving quantum hardware.

quant-ph · cond-mat.dis-nn · cs.AI

版本更新 · v2arXiv:2607.21186

On the effects of emulated quantum layers on CNN performance and explainability for OCT and dementia imaging

Guillermo Rubiños Rodríguez, Martín Ottavianelli, Mateo Alonso, Gonzalo Blázquez Gil, Boris-Stephan Rauchmann, Pablo Díez-Valle, Sergio Altares-López

原文摘要

Hybrid quantum-classical convolutional neural networks have been proposed as an alternative to classical deep learning models. However, executing network components on quantum hardware imposes fundamental limitations, such as gradient estimation through repeated measurements, and increasing the number of qubits can lead to trainability problems such as barren plateaus. Moreover, the reported success of these hybrid networks has been linked to quantum architectures that can be efficiently simulated on classical computers. We investigate whether small, classically simulated quantum circuits can serve as useful components within larger models, as a substitute for purely classical layers. We present a systematic comparison between a Hybrid Quantum-inspired CNN (HQiCNN) and standard CNN architectures, where the models differ only in a single intermediate layer: an emulated quantum circuit in the HQiCNN and classical counterparts in the CNN. The models are evaluated on two medical imaging datasets while varying training set size, learning rate, batch size, circuit entanglement and observable se. Under a strict parameter budget, the HQiCNN outperforms the classical baselines. When the classical layer is given more parameters, overall performance becomes comparable, with the HQiCNN showing improvements only in the intermediate-data regime. Removing entanglement yields comparable performance and richer observable sets yield no performance improvement. Finally, we introduce two SHAP-based metrics for comparing model explanations, $|$SHAP$|$IoU and EMD$_{\mathrm{pos}}$. They show that all architectures attend to anatomically plausible regions, and that the spatial attention agreement between them increases with training set size. These results indicate that, under specific data regimes, quantum-inspired hybrid models are a competitive alternative to classical CNNs for medical image classification.

quant-ph · cs.AI · cs.LG

新论文 · v1arXiv:2611.20622

Observable Spectral Framework for Noisy Amplitude Amplification: Stopping Stability and Correction

Ge Zhong, Charith Jayasekara, Nisal De Silva, Muhammad Usman, Muhammad Aamir Cheema, Chetan Arora

原文摘要

Stopping rules for noisy amplitude amplification often rely on channel-specific success-probability formulas, limiting their transfer across noise mechanisms. We develop an observable spectral framework for stationary noisy standard amplitude amplification under explicit leading-mode, spectral-separation, and residual-control conditions. Within this class, the first amplification lobe has a damped-oscillatory leading component and a bounded non-leading contribution. We derive how frequency shift, damping, and observable phase offset displace the leading peak, and establish sampled-gap criteria for retaining the ideal integer stopping depth, certifying recalibration, or selecting a robust candidate window. In single-target Grover search, frequency and damping errors have stopping-coordinate sensitivities proportional to the search-space size, whereas phase offsets scale with its square root; residual modes can independently reverse the ordering of neighbouring depths. Analytical constructions, circuit simulations, finite-shot inference, and calibration-derived device-like trajectories examine these predictions and their operational limits. For a 64-element search, an a posteriori sampled-set check selects depth five over six, with success probability increasing from 0.595 to 0.626. The resulting theory links observable spectral dynamics to conditional integer stopping guarantees without requiring a separate microscopic channel solution.

quant-ph · cs.ET

新论文 · v1arXiv:2611.20613

Noise-Aware Testing of NISQ Quantum Programs: Self-Baseline Oracle with a Controlled False-Positive Rate

Mir Mohammad Yousuf, Shabir Ahmad Sofi

原文摘要

Testing quantum programs on Noisy Intermediate-Scale Quantum (NISQ) devices faces a test-oracle problem: hardware noise and finite-shot sampling make the runs of a correct program vary as much as those of a faulty one, so oracles with a fixed acceptance threshold produce false positives that depend on the program and the backend. We present a noise-aware testing framework built on self-baseline calibration: each run of the program under test is compared with repeated executions of a trusted reference program on the same backend, and the acceptance threshold is the $(1-α)$ quantile of the finite-shot null distribution of the Jensen-Shannon divergence, so the oracle's false-positive rate is a level set in advance. A noncentral chi-square model predicts detection power, a homogeneity test and a two-run sentinel detect drift, a mutation engine labels every mutant exactly within a three-class noise-aware taxonomy, and zero-noise extrapolation attributes rejections to faults or noise. In simulation on nine core benchmarks, 32 QASMBench programs, ten real bugs, seven noise regimes and three device snapshots, the oracle's false-positive rate is 0.0011 at $α= 10^{-3}$ over 9,000 correct runs, against 36-74% for fixed thresholds, 8.9% for a QOIN-style filter and 10.8% for a globally calibrated threshold, while attaining the highest F1 on non-equivalent faults (0.941). On an IBM Heron device, using about 14 minutes of QPU time, it rejected none of 82 correct runs and detected 120 of 121 faults and semantic mutants, and a two-run sentinel reduced drift-induced false positives from 27.4% to 1.8%.

quant-ph · cs.SE

新论文 · v1arXiv:2611.20517

Postselection on Halting and Reductions to the Halting Problem

Saman Farhat, Farzad Didehvar

原文摘要

A probabilistic Turing machine is an ordinary Turing machine that may also toss fair coins, with no limit on its running time or memory. If it always halts, it decides only computable problems. Aaronson et al. studied machines that may run forever on some coin tosses, with the answer read only from the runs that halt. Suppose the correct answer must be more than twice as likely as the wrong one. They showed that these machines decide exactly the problems solvable with a fixed list of questions about the halting problem. They asked what happens when the correct answer need only be the more likely one. We show that the machines then decide exactly the problems solvable by asking such questions one after another, each chosen after the earlier answers. We also show that the factor two can be replaced by any fixed factor greater than one. A machine may promise two numbers: a lower bound on its probability of halting, and a lower bound on its probability of being right when it halts. From these two numbers we compute exactly how many questions fixed in advance the machine can replace. The main idea is that probability acts as a budget for how often a computable guess may change its mind. The results extend to oracle machines and to machines nested inside each other. Quantum machines decide the same problems.

cs.CC · cs.LO · math.LO · quant-ph

版本更新 · v4arXiv:2608.09115

Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search

Liangdong Lu, Guanmin Guo, Yang Liu, Ruipan Yang

原文摘要

Bicycle (two-block circulant) quantum low-density parity-check (LDPC)codes include some of the best known small quantum codes, yet their design has relied on group-algebra formulations in which the dimension and distance are accessible only through matrix computation. We show that in the cyclic case the construction collapses into the polynomial ring $\F_2[x]/(x^{l}-1)$: self-orthogonality is automatic, the quantum dimension is read off from a polynomial gcd, and the minimum distance is certified exactly through the Calderbank correspondence to additive codes over $\F_4$, turning code search into an algebraically pre-filtered enumeration that reaches parameter regimes poorly covered by existing tables. A computer search based on this framework recovers the short codes $[[42,12,4]]_2$ and $[[62,12,4]]_2$ and produces a family of codes with competitive figure of merit $kd^2/n$, including $[[66,20,7]]_2$ with $kd^2/n=14.85$, above the bivariate bicycle code $[[144,12,12]]_2$ ($kd^2/n=12$) at less than half the block length, together with $[[46,2,8]]_2$, $[[66,2,9]]_2$, $[[66,4,8]]_2$, $[[66,6,8]]_2$ and, at $n=90$, $[[90,16,7]]_2$, $[[90,18,6]]_2$, $[[90,20,6]]_2$. An exhaustive census at $n=48$ delineates the boundary of this picture: we exhibit a $[[48,10,6]]_2$ code from a minimal $48$-element group (the Aydin--Tamo--Barg realization uses $72$ elements), and prove that distance $5$ forces a stabilizer-rank loss, which excludes $[[48,10,5]]_2$ from the weight-$8$ symmetric coset family. The framework thus opens a systematic route to bicycle-type quantum LDPC codes beyond the reach of group-theoretic searches, and identifies exactly where genuinely coset-theoretic phenomena begin.

cs.IT · quant-ph

新论文 · v1arXiv:2611.20339

Response-Threshold Framework for First-Peak Preservation in Noisy Grover Search

Ge Zhong, Charith Jayasekara, Nisal De Silva, Chetan Arora

原文摘要

Grover search is executed only after integer iterations, so noise can alter the stopping decision even when a continuous first peak remains visible. We develop a response-threshold framework separating continuous peak motion, stroboscopic geometry, and the discrete sampled-success argmax. For a Drude-Lorentz environment, linearized HEOM supplies an a priori timing coefficient and sampled-probability differentials. The first-order layer is used as a conservative screen: well-separated points retain the nominal step, whereas near-threshold points escalate to finite-$λ$ evaluation. Across 260 unique HEOM points drawn from five overlapping validation sets, it detects all 15 observed stopping changes with zero regret on the changed subset; its residual errors are 45 one-step-early calls on otherwise stable points; the 245-point stable subset has mean regret $4.42\times10^{-3}$. An empirically validated two-stage workflow escalates every observed change while avoiding 160 of 260 unique full-HEOM propagations. Same-bath NZ2 reduces early calls. A heterogeneous three-qubit circuit exhibits three stopping-transition scales, each replicated across eight marked targets, and finite-shot recovery is 96.18% overall, with failures localized to a near-degenerate boundary at $s=1.5$. A depth-refined transfer test supports the predicted local quadratic timing-to-loss relation.

quant-ph · cs.ET