# quantum mechanics

Quantum mechanics is the field of physics explaining how extremely small objects exhibit both particle and wave characteristics.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Measurement-Budget Allocation in Quantum Learning with Finite-Shot Generalization Guarantees

DevFeed: [Measurement-Budget Allocation in Quantum Learning with Finite-Shot Generalization Guarantees](<https://devfeed.tech/articles/measurement-budget-allocation-in-quantum-learning-with-finite-shot-generalization-guarantees-145364.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.24891>)

Author: Ferhat Ozgur Catak

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Error Propagation](<https://devfeed.tech/topics/error-propagation.md>)

Tags: [benchmarks](<https://devfeed.tech/tags/benchmarks.md>), [bounded](<https://devfeed.tech/tags/bounded.md>), [budget](<https://devfeed.tech/tags/budget.md>), [circuit](<https://devfeed.tech/tags/circuit.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [classifiers](<https://devfeed.tech/tags/classifiers.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [data](<https://devfeed.tech/tags/data.md>), [guarantees](<https://devfeed.tech/tags/guarantees.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [learning](<https://devfeed.tech/tags/learning.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [noise](<https://devfeed.tech/tags/noise.md>), [plan](<https://devfeed.tech/tags/plan.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [qubit](<https://devfeed.tech/tags/qubit.md>), [sample](<https://devfeed.tech/tags/sample.md>), [score](<https://devfeed.tech/tags/score.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [study](<https://devfeed.tech/tags/study.md>), [synthetic](<https://devfeed.tech/tags/synthetic.md>)

### AI overview

With a fixed measurement budget, the paper balances the number of training states against shots per state for binary quantum classifiers. Its distribution-free bound has a sample term of order √(d/n) and a shot term of order √(log n/S); under B=nS these trade off. Minimizing a closed-form surrogate yields n*=2√(2dB/log(4B/δ)) and S*=B/n*, with a worst-case rate of B⁻¹⁄⁴. In PennyLane simulations across nine synthetic benchmarks, the empirical gap remained below the bound, but the bound was vacuous at simulated budgets and became non-vacuous only at larger budgets (about B>=5000 for d=4). With concave loss, the gap was U-shaped and the shot contribution matched the analysis; with absolute loss, shot noise was unbiased and no shot-limited regime appeared. The rule is proposed for planning finite-shot evaluations.

### Source excerpt

arXiv:2608.24891v2 Announce Type: replace Abstract: On near-term quantum hardware, estimating a Born probability requires repeated circuit executions. A quantum learning experiment with a fixed measurement budget $B$ must therefore decide how many distinct training states $n$ to use and how many shots $S$ to spend on each. We study this trade-off for binary quantum classifiers whose measurement operator $M$ is learned from the training data and evaluated with fresh measurement outcomes. We prove a distribution-free generalization bound for bounded, $L$-Lipschitz losses with a sample term of order $\sqrt{d/n}$ and a shot term of order $\sqrt{(\log n)/S}$; under $B=nS$ the two terms move in opposite directions. Minimizing a closed-form surrogate of the bound gives the allocation rule $n^* = 2\sqrt{2dB/\log(4B/\delta)}$, $S^* = B/n^*$, whose bound value is within 0.1% of the exact numerical minimum on all budgets we evaluate, and a worst-case rate of $B^{-1/4}$. PennyLane simulations with 2- and 4-qubit variational circuits on nine synthetic benchmarks show that the empirical gap stays below the bound in all configurations, although the bound is vacuous at the simulated budgets and becomes non-vacuous only for larger budgets (e.g., $B \gtrsim 5000$ for $d=4$). For a loss that is concave in the score, the empirical gap is U-shaped under a fixed budget and the measured shot contribution matches its analytical value; for the absolute loss, shot noise is unbiased and no shot-limited regime appears. The rule can be used to plan finite-shot evaluations before an experiment is run.

## Virasoro Symmetry in Neural Network Field Theories

DevFeed: [Virasoro Symmetry in Neural Network Field Theories](<https://devfeed.tech/articles/virasoro-symmetry-in-neural-network-field-theories-144869.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2512.24420>)

Author: Brandon Robinson

Published: 2026-11-20T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>)

Tags: [boundary](<https://devfeed.tech/tags/boundary.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [fields](<https://devfeed.tech/tags/fields.md>), [hep-th](<https://devfeed.tech/tags/hep-th.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [stress](<https://devfeed.tech/tags/stress.md>), [symmetry](<https://devfeed.tech/tags/symmetry.md>)

### AI overview

The work constructs a central-charge-one Virasoro algebra from a neural free-field architecture. A logarithmic momentum law and smooth spectral window produce a weight-one current kernel; its radial-ordering discontinuity determines the oscillator pairing, and limiting current correlations match Fock vacuum correlations. The resulting Sugawara stress tensor and charged vertex insertions give the Virasoro algebra and its highest-weight sectors. Error bounds control finite-mode approximations, while a finite-width auxiliary Fock readout is defined when a Hermitian mixed block is positive. The abstract also describes extensions to fermionic and supersymmetric sectors, ghost systems, and conformal or superconformal gluing via shared reflected features. Numerical comparisons support the current pairing and field correlations; detailed analysis is in the appendices.

### Source excerpt

arXiv:2512.24420v4 Announce Type: replace-cross Abstract: We construct the Virasoro algebra from a neural free-field architecture. A logarithmic momentum law and a smooth spectral window give the weight-one current kernel, whose radial-ordering discontinuity fixes the oscillator pairing. The limiting neural current correlations agree with the Fock vacuum correlations. Their Sugawara stress tensor gives the Virasoro algebra with central charge one, and charged vertex insertions identify its highest-weight sectors. Bounds on regulator and feature errors control finite-mode approximations to this representation. At finite width, an explicit adjoint-compatible projection defines an auxiliary Fock readout when its Hermitian mixed block is positive. Cauchy features extend the construction to fermionic and supersymmetric sectors, including a Clifford zero mode in the Ramond representation, while first-order stress tensors give fermionic and bosonic ghost systems. Shared reflected features impose scalar boundary conditions in every realization and yield conformal and superconformal gluing in the limiting fields. Numerical comparisons support the current pairing and field correlations; their detailed analysis is collected in the appendices.

## How we're putting one of quantum mechanics' deepest features to the test at scale.

DevFeed: [How we're putting one of quantum mechanics' deepest features to the test at scale.](<https://devfeed.tech/articles/how-we-re-putting-one-of-quantum-mechanics-deepest-features-to-the-test-at-scale-144507.md>)

Original publisher: [Read original article](<https://blog.google/innovation-and-ai/models-and-research/quantum-computing/putting-one-of-quantum-mechanics-deepest-features-to-test-at-scale/>)

Author: Blog Team

Published: 2026-11-19T19:00:00Z

Content type: article

Language: en

Sources: [Quantum computing](<https://devfeed.tech/sources/quantum-computing.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [applications](<https://devfeed.tech/tags/applications.md>), [chemistry](<https://devfeed.tech/tags/chemistry.md>), [effect](<https://devfeed.tech/tags/effect.md>), [entanglement](<https://devfeed.tech/tags/entanglement.md>), [errors](<https://devfeed.tech/tags/errors.md>), [game](<https://devfeed.tech/tags/game.md>), [google](<https://devfeed.tech/tags/google.md>), [google-quantum-ai](<https://devfeed.tech/tags/google-quantum-ai.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [limits](<https://devfeed.tech/tags/limits.md>), [materials](<https://devfeed.tech/tags/materials.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [none](<https://devfeed.tech/tags/none.md>), [processor](<https://devfeed.tech/tags/processor.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-ai](<https://devfeed.tech/tags/quantum-ai.md>), [quantum-algorithms](<https://devfeed.tech/tags/quantum-algorithms.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-mechanics](<https://devfeed.tech/tags/quantum-mechanics.md>), [research](<https://devfeed.tech/tags/research.md>), [scale](<https://devfeed.tech/tags/scale.md>)

### AI overview

Google Quantum AI reports evidence that contextuality persists at scale on its quantum processor. In a coordination game, its qubits won 98.3% of the time, above the stated 88.9% classical limit, and the team reports outperforming constrained classical strategies in tasks spanning up to 105 qubits. Contextuality is described as measurement outcomes depending on which other compatible measurements are made. The tests may also help detect subtle hardware errors. The excerpt presents contextuality as a property believed to power certain quantum algorithms and says the findings could help pave the way for applications such as chemistry and materials science; it does not establish those applications.

### Source excerpt

Google Quantum AI research proves contextuality powers quantum algorithms at scale. See how our processor beat classical limits. Get the details.

## Representation Learning with Quantum Signal Processing

DevFeed: [Representation Learning with Quantum Signal Processing](<https://devfeed.tech/articles/representation-learning-with-quantum-signal-processing-139810.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2608.28828>)

Author: Junqi Wang, Junyu Liu

Published: 2026-11-18T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [kernel](<https://devfeed.tech/tags/kernel.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [representation-learning](<https://devfeed.tech/tags/representation-learning.md>), [signal-processing](<https://devfeed.tech/tags/signal-processing.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

The paper presents quantum signal processing (QSP) as a solvable model of quantum representation learning, where training changes the geometry defining data similarity. At arbitrary depth, it derives the exact mean and variance of the quantum neural tangent kernel and finds input-dependent angular geometry whose diagonal does not self-average, even as the unitary approaches Haar randomness. For sparse data, it proves that the full nonlinear gradient flow, without freezing or ensemble-averaging the kernel, converges to an integrable scalar flow with a time-dependent kernel closure and explicit convergence times. It also establishes a finite-depth speed limit for any dataset and trajectory. At higher data density, numerical results show coupled evolution beyond both scalar and frozen-kernel descriptions.

### Source excerpt

arXiv:2608.28828v2 Announce Type: replace-cross Abstract: 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.

## IBM Links Two Nighthawk r3 Chips To Make A 1,040-Qubit Quantum System

DevFeed: [IBM Links Two Nighthawk r3 Chips To Make A 1,040-Qubit Quantum System](<https://devfeed.tech/articles/ibm-links-two-nighthawk-r3-chips-to-make-a-1-040-qubit-quantum-system-139494.md>)

Original publisher: [Read original article](<https://www.nextplatform.com/compute/2026/11/17/ibm-links-two-nighthawk-r3-chips-to-make-a-1040-qubit-quantum-system/5310545>)

Author: Jeff Burt

Published: 2026-11-17T17:13:12Z

Content type: news

Language: en

Sources: [The Next Platform: In-depth coverage of high end computing](<https://devfeed.tech/sources/the-next-platform-in-depth-coverage-of-high-end-computing.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [ibm](<https://devfeed.tech/topics/ibm.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [chips](<https://devfeed.tech/tags/chips.md>), [compute](<https://devfeed.tech/tags/compute.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [nighthawk](<https://devfeed.tech/tags/nighthawk.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [qubit](<https://devfeed.tech/tags/qubit.md>), [system](<https://devfeed.tech/tags/system.md>)

### AI overview

IBM plans to release Nighthawk r3 in 2027, with more than 520 qubits, support for 10,000 quantum operations, and 10 long-range couplers intended to connect processors. Joining two r3 chips would create a 1,040-qubit system. The excerpt reports that Nighthawk r2's on-chip reset capability enabled 7,500 gates to run 19 times faster than on r1; more than 34 billion circuits had run on r2 since September. IBM is also testing coupler links between processors, reporting 99.3% quantum-state-transfer fidelity with four links on r1. The longer-term Starling system, targeted for 2029, is planned to use error-correcting codes and modular components, with milestones still needed in device size and quality, wiring, cryogenic cooling, and real-time decoding. IBM also announced a managed Quantum Platform environment combining quantum execution with classical computing resources from CPUs to GPUs.

### Source excerpt

Big Blue has been on a tear for the past couple of years detailing the strides it's making towards m ...

## Intesa Sanpaolo Finds Value Before Quantum Computers Are Ready

DevFeed: [Intesa Sanpaolo Finds Value Before Quantum Computers Are Ready](<https://devfeed.tech/articles/intesa-sanpaolo-finds-value-before-quantum-computers-are-ready-136937.md>)

Original publisher: [Read original article](<https://www.eetimes.com/intesa-sanpaolo-finds-value-before-quantum-computers-are-ready/>)

Author: Pat Brans

Published: 2026-11-17T09:16:07Z

Content type: news

Language: en

Sources: [EE Times](<https://devfeed.tech/sources/ee-times.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>)

Tags: [airbus](<https://devfeed.tech/tags/airbus.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [analog](<https://devfeed.tech/tags/analog.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [asics](<https://devfeed.tech/tags/asics.md>), [atm](<https://devfeed.tech/tags/atm.md>), [banking](<https://devfeed.tech/tags/banking.md>), [business](<https://devfeed.tech/tags/business.md>), [business-continuity](<https://devfeed.tech/tags/business-continuity.md>), [cash-flow](<https://devfeed.tech/tags/cash-flow.md>), [cfd](<https://devfeed.tech/tags/cfd.md>), [combinatorial-optimization](<https://devfeed.tech/tags/combinatorial-optimization.md>), [community](<https://devfeed.tech/tags/community.md>), [computational-fluid-dynamics](<https://devfeed.tech/tags/computational-fluid-dynamics.md>), [cost-savings](<https://devfeed.tech/tags/cost-savings.md>), [credit-risk](<https://devfeed.tech/tags/credit-risk.md>), [data-preparation](<https://devfeed.tech/tags/data-preparation.md>), [designline](<https://devfeed.tech/tags/designline.md>), [digital](<https://devfeed.tech/tags/digital.md>), [education](<https://devfeed.tech/tags/education.md>), [ee-times](<https://devfeed.tech/tags/ee-times.md>), [ee-times-university](<https://devfeed.tech/tags/ee-times-university.md>), [eelife](<https://devfeed.tech/tags/eelife.md>), [eelive-electronic-design](<https://devfeed.tech/tags/eelive-electronic-design.md>), [eet](<https://devfeed.tech/tags/eet.md>), [electrical-engineering](<https://devfeed.tech/tags/electrical-engineering.md>), [electronic-components](<https://devfeed.tech/tags/electronic-components.md>), [electronic-engineering-times](<https://devfeed.tech/tags/electronic-engineering-times.md>), [electronics](<https://devfeed.tech/tags/electronics.md>), [embedded-systems](<https://devfeed.tech/tags/embedded-systems.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [engineering](<https://devfeed.tech/tags/engineering.md>), [fundamentals-courses](<https://devfeed.tech/tags/fundamentals-courses.md>), [gpus](<https://devfeed.tech/tags/gpus.md>), [intesa-sanpaolo](<https://devfeed.tech/tags/intesa-sanpaolo.md>), [learning](<https://devfeed.tech/tags/learning.md>), [mixed-signal](<https://devfeed.tech/tags/mixed-signal.md>), [news](<https://devfeed.tech/tags/news.md>), [opinion](<https://devfeed.tech/tags/opinion.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [part-search](<https://devfeed.tech/tags/part-search.md>), [product-search](<https://devfeed.tech/tags/product-search.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computers](<https://devfeed.tech/tags/quantum-computers.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-hardware](<https://devfeed.tech/tags/quantum-hardware.md>), [semiconductors](<https://devfeed.tech/tags/semiconductors.md>), [software](<https://devfeed.tech/tags/software.md>), [tech-papers](<https://devfeed.tech/tags/tech-papers.md>), [technology](<https://devfeed.tech/tags/technology.md>), [video](<https://devfeed.tech/tags/video.md>)

### AI overview

Intesa Sanpaolo reports double-digit cost reductions in ATM cash replenishment without compromising service levels, using a QUBO model and GPU-accelerated classical solvers. Tested on historical data from a network of hundreds of ATMs, the approach improved on the bank's previous operational and traditional optimization methods. The result demonstrates value from quantum-inspired modeling on classical hardware, not quantum computational advantage or proof that a quantum processor will outperform the strongest classical alternatives. For quantum hardware to be useful in banking, Intesa says gains must hold across the end-to-end workflow--including data preparation, encoding, system integration and usable results--and be reliable, available at sufficient capacity, and compatible with business continuity and regulatory requirements. The excerpt also notes a separate TU Delft engineering effort using matrix product states, while cautioning that the discussed CFD methods are not production-ready.

### Source excerpt

The banking group reports double-digit cost savings from quantum-inspired optimization, but useful quantum hardware faces a tougher test than faster calculations. The post Intesa Sanpaolo Finds Value Before Quantum Computers Are Ready appeared first on EE Times.

## Live Noise Fingerprints for Quantum Program Analysis

DevFeed: [Live Noise Fingerprints for Quantum Program Analysis](<https://devfeed.tech/articles/live-noise-fingerprints-for-quantum-program-analysis-137984.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19143>)

Author: Avner Bensoussan, Karine Even-Mendoza, Debalina Banerjee, Elena Chachkarova, Sophie Fortz, Vasileios Klimis, Mohammad Reza Mousavi

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Tool](<https://devfeed.tech/topics/tool.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [abstraction](<https://devfeed.tech/tags/abstraction.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [behaviour](<https://devfeed.tech/tags/behaviour.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [error](<https://devfeed.tech/tags/error.md>), [execution](<https://devfeed.tech/tags/execution.md>), [fingerprint](<https://devfeed.tech/tags/fingerprint.md>), [fragments](<https://devfeed.tech/tags/fragments.md>), [framework](<https://devfeed.tech/tags/framework.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [information](<https://devfeed.tech/tags/information.md>), [input](<https://devfeed.tech/tags/input.md>), [interface](<https://devfeed.tech/tags/interface.md>), [interfaces](<https://devfeed.tech/tags/interfaces.md>), [noise](<https://devfeed.tech/tags/noise.md>), [program](<https://devfeed.tech/tags/program.md>), [program-analysis](<https://devfeed.tech/tags/program-analysis.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>)

### AI overview

The paper introduces noise fingerprints: compact descriptions of noise effects on a finite set of input states and output measurements, linked to concrete behavior through a probabilistic Galois connection. The authors report that polynomial-size interfaces produce exponentially smaller fingerprints than full noise models while preserving the chosen observations; fingerprint distance captures the largest discrepancy on that interface. ChanShadow reuses fingerprints for common short program fragments to analyze whole programs and provides a uniform finite-sample error bound. In reported evaluations, fingerprints retained 99 ± 1% of full-model noise-strength information on a synthetic benchmark. Under simulated noise drift, reusing earlier measurements reduced fresh rounds needed for error tolerance 0.10 by 2.3x at 95% confidence and 27x by the median-error criterion.

### Source excerpt

arXiv:2611.19143v1 Announce Type: new Abstract: Quantum programs are probabilistic in nature, and noisy execution due to current imperfect hardware further complicates their analysis. In this paper, we study abstract semantics for analysing quantum programs under these conditions. We introduce noise fingerprints, compact descriptions of the observable effects of noise relative to a finite interface of input states and output measurements. We use them to define our abstract domain with respect to the concrete noise-related behaviour. We relate the concrete and abstract domains through a probabilistic Galois connection, extending the Galois-connection framework to distribution-valued interpretations. We study the resulting abstraction in terms of observational soundness, conciseness, efficiency, and ability to adapt to changing noise. We show that polynomial-size interfaces yield exponentially smaller fingerprints than full noise models while preserving the chosen observations, and that fingerprint distance characterises the largest observational discrepancy over the chosen interface. Further, we develop ChanShadow, which reuses noise fingerprints of commonly used short program fragments to analyse noisy execution of whole programs and provides a uniform finite-sample error bound. We construct working examples showing how fingerprints support program analysis. We evaluate fingerprint precision, representation cost, measurement requirements, and behaviour under noise drift. On a synthetic benchmark, fingerprints retain $(99 \pm 1)\%$ of the noise strength information of a full noise model. On simulated noise drift, reusing earlier measurements reduces the number of fresh measurement rounds needed to reach an error tolerance of $0.10$ by a factor of $2.3$ at $95\%$ confidence and by a factor of $27$ under the median-error criterion.

## Hybrid Quantum-Classical Sequence Models for Sample-Efficient Energy Regression in Simulated Calorimeter Showers

DevFeed: [Hybrid Quantum-Classical Sequence Models for Sample-Efficient Energy Regression in Simulated Calorimeter Showers](<https://devfeed.tech/articles/hybrid-quantum-classical-sequence-models-for-sample-efficient-energy-regression-in-simulated-calorimeter-showers-135058.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17354>)

Author: Tariq Mahmood, Muhammad Ahsan, Talab Hussain, Grecia Itzel Col\\'in-Gonz\\'alez, Alfredo Raya, Muhammad Awais Rafique, HassabAlla M. A. Mahmoud

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [architectures](<https://devfeed.tech/tags/architectures.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [central](<https://devfeed.tech/tags/central.md>), [compare](<https://devfeed.tech/tags/compare.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [dataset](<https://devfeed.tech/tags/dataset.md>), [energy](<https://devfeed.tech/tags/energy.md>), [error](<https://devfeed.tech/tags/error.md>), [features](<https://devfeed.tech/tags/features.md>), [hep-ex](<https://devfeed.tech/tags/hep-ex.md>), [hep-ph](<https://devfeed.tech/tags/hep-ph.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [images](<https://devfeed.tech/tags/images.md>), [incident](<https://devfeed.tech/tags/incident.md>), [lstm](<https://devfeed.tech/tags/lstm.md>), [machine](<https://devfeed.tech/tags/machine.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [models](<https://devfeed.tech/tags/models.md>), [physics-ins-det](<https://devfeed.tech/tags/physics-ins-det.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-classical](<https://devfeed.tech/tags/quantum-classical.md>), [regression](<https://devfeed.tech/tags/regression.md>), [sample](<https://devfeed.tech/tags/sample.md>), [sequence](<https://devfeed.tech/tags/sequence.md>)

### AI overview

On 100,000 simulated CaloGAN electromagnetic showers spanning 1-100 GeV, models using longitudinal shower sequences achieved the highest energy-reconstruction accuracy among three representations: engineered features, images, and sequences. Across eight classical and quantum-enhanced architectures, the hybrid QLSTM had the lowest reported RMSE (0.294 GeV). With 1,500 training events, it reduced error by 52.7% versus a classical LSTM trained on the same amount of data and also outperformed an LSTM trained on the full dataset. The abstract presents these results as preliminary evidence of sample efficiency for hybrid quantum-classical sequence regression in this simulated task.

### Source excerpt

arXiv:2611.17354v1 Announce Type: cross Abstract: Energy reconstruction from electromagnetic calorimeter data underpins particle identification, event reconstruction and precision measurements in high-energy physics. Machine learning already performs well on this task, yet two questions remain open: how much the choice of data representation matters, and whether hybrid quantum-classical models add value in practice. We compare classical and quantum-enhanced models for incident positron energy reconstruction on the CaloGAN dataset, a public benchmark of 100,000 simulated electromagnetic shower events spanning 1 to 100 GeV. Eight architectures, namely SVR, ANN, CNN and LSTM together with their quantum counterparts, are trained on three calorimeter representations: engineered physical features, calorimeter images, and longitudinal shower sequences. Models that follow the longitudinal development of the shower reach the highest accuracy, which points to the value of physically informed representations. The hybrid QLSTM gives the lowest reconstruction error, with an RMSE of 0.294 GeV. Under matched-data conditions with only 1,500 training events, the QLSTM improves on the classical LSTM by 52.7% and also surpasses an LSTM trained on the full set. These observations indicate that longitudinal representations are central to calorimeter energy reconstruction and give preliminary evidence that hybrid quantum-classical sequence models can be more sample-efficient for regression in high-energy physics.

## Minimizing classical resources in variational measurement-based quantum computation for generative modeling

DevFeed: [Minimizing classical resources in variational measurement-based quantum computation for generative modeling](<https://devfeed.tech/articles/minimizing-classical-resources-in-variational-measurement-based-quantum-computation-for-generative-modeling-134972.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2604.11578>)

Author: Arunava Majumder, Hendrik Poulsen Nautrup, Hans J. Briegel

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [generative-ai-tools](<https://devfeed.tech/topics/generative-ai-tools.md>)

Tags: [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [generative](<https://devfeed.tech/tags/generative.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [modeling](<https://devfeed.tech/tags/modeling.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

The paper presents a restricted variational measurement-based quantum computation model that adds only one trainable parameter to the unitary setting, compared with the larger channel model whose parameter count scales as width x depth. The authors report numerical and algebraic evidence that this minimal channel extension can generate probability distributions the corresponding unitary model cannot learn. The abstract notes that the larger model's parameter count may make optimization harder, but provides no further implementation or training details.

### Source excerpt

arXiv:2604.11578v2 Announce Type: replace-cross Abstract: Measurement-based quantum computation (MBQC) is a framework for quantum information processing in which a computational task is carried out through one-qubit measurements on a highly entangled resource state. Due to the indeterminacy of the outcomes of a quantum measurement, the random outcomes of these operations, if not corrected, yield a variational quantum channel family. Traditionally, this randomness is corrected through classical processing in order to ensure deterministic unitary computations. Recently, variational measurement-based quantum computation (VMBQC) has been introduced to exploit this measurement-induced randomness to gain an advantage in generative modeling. A limitation of this approach is that the corresponding channel model has twice as many parameters compared to the unitary model, scaling as $N \times D$, where $N$ is the number of logical qubits (width) and $D$ is the depth of the VMBQC model. This can often make optimization more difficult and may lead to poorly trainable models. In this paper, we present a restricted VMBQC model that extends the unitary setting to a channel-based one using only a single additional trainable parameter. We show, both numerically and algebraically, that this minimal extension is sufficient to generate probability distributions that cannot be learned by the corresponding unitary model.

## Structure makes quantum circuits trainable

DevFeed: [Structure makes quantum circuits trainable](<https://devfeed.tech/articles/structure-makes-quantum-circuits-trainable-135892.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.18378>)

Author: Wenbo Xie, Wojciech Szpankowski, Ananth Grama

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-algorithms](<https://devfeed.tech/tags/quantum-algorithms.md>), [quantum-circuits](<https://devfeed.tech/tags/quantum-circuits.md>), [sampling](<https://devfeed.tech/tags/sampling.md>), [variance](<https://devfeed.tech/tags/variance.md>)

### AI overview

The paper gives analytical tools for assessing whether a variational quantum circuit has a barren plateau, where gradients vanish exponentially with system size. It bounds gradient variance for arbitrary input states and observables using the unitary representation of the associated compact Lie group. When circuit segments on both sides of a gate form 2-designs, it derives the variance exactly and gives a sufficient trainability condition: the squared input state and observable must concentrate on the same polynomial-dimensional irreducible invariant subspace, and the differentiated gate must move that subspace by an inverse-polynomial amount. It also proposes estimating gradient variance by sampling ansatz runs, without constructing representation-theoretic projectors; deciding whether variance exceeds tolerance τ takes polynomially many runs in 1/τ, including when the analytical bounds are inconclusive.

### Source excerpt

arXiv:2611.18378v1 Announce Type: cross Abstract: The scalability of variational quantum algorithms is limited by barren plateaus, where gradients vanish exponentially in system size. This worst-case result raises fundamental questions about the trainability of quantum AI models. We present a major advance towards resolving this trainability question by answering whether a given quantum circuit has a barren plateau. We do this using an analytical framework that bounds the gradient variance for arbitrary input states $\rho$ and observables $\mathcal{M}$ by decomposing the unitary representation of the associated compact Lie group. When the circuit segments on both sides of a gate form $2$-designs, we obtain the variance exactly and prove a sufficient condition for trainability: if $\rho^{\otimes 2}$ and $\mathcal{M}^{\otimes 2}$ are sufficiently concentrated on the same irreducible invariant subspace of polynomial dimension, and the differentiated gate moves this subspace by an inverse-polynomial amount, then the gradient variance is at least inverse-polynomial. We further present a sampling algorithm that estimates the gradient variance from runs of the ansatz, without constructing the representation-theoretic projectors. Our algorithm decides whether the variance exceeds a tolerance $\tau$ with the number of runs polynomial in $1/\tau$, including cases in which the bounds are inconclusive. This resolves the question of the trainability of the circuit before expensive training procedures.

## Quantum Shock and Train-Time Constrained Quantization: A Geometric Study of Finite-Resolution Variational Quantum Circuits

DevFeed: [Quantum Shock and Train-Time Constrained Quantization: A Geometric Study of Finite-Resolution Variational Quantum Circuits](<https://devfeed.tech/articles/quantum-shock-and-train-time-constrained-quantization-a-geometric-study-of-finite-resolution-variational-quantum-circuits-134915.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17817>)

Author: Vinayak Kumar Singh, Jyotsna Rani, Ganesh Prasad

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [quantization](<https://devfeed.tech/topics/quantization.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>)

Tags: [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [quantization](<https://devfeed.tech/tags/quantization.md>), [quantum-circuits](<https://devfeed.tech/tags/quantum-circuits.md>), [training](<https://devfeed.tech/tags/training.md>)

### AI overview

The paper defines Quantum Shock as the average squared Fubini-Study distance between a variational circuit's pre-deployment and quantized states, addressing why coordinate rounding alone can misrepresent deployment changes near periodic chart boundaries. It relates the metric to mean infidelity and derives bounds for bounded-observable displacement and margin-based predictive stability, with extensions to mixed states and finite-shot settings. Its Train-Time Constrained Quantization delays a periodicity-aligned codeword penalty until after task-only optimization. In noiseless simulations of three small binary tasks on a four-qubit, two-layer classifier, T-CQ had lower average local shock than circular post-training quantization for every tested codebook size (K=4, 8, 16). An x86-64 rerun at K=8 preserved the direction of the comparison, though magnitudes varied. The evidence is limited to these small simulated evaluations.

### Source excerpt

arXiv:2611.17817v1 Announce Type: new Abstract: Finite-resolution interfaces map Variational-Circuit angle to discrete codebook. Since Pauli rotations are periodic, so Euclidean rounding may produce wrong codeword near a chart boundary; error due to coordinates alone cannot measure how much the final state was changed. Herein we define a metric, Quantum Shock, for Pure State it is defined as the average of the square of the Fubini-Study distance (over all inputs) between the pre-deployment and deployed states. This value is limited by constant multipliers of the mean of infidelity and provides upper limits on displacement when observing bounded quantities and margin based predictive stability. Extensions to the analytical Bures-angle for mixed-states were derived, along with a finite shot stability bound. The proposed Train-Time Constrained Quantization allows a delay in applying a penalty for selecting a codeword aligned with periodicity until after task only optimizations. Three small binary tasks were evaluated on a four qubit, two layer classifier using ten matched seeds, K = 4, 8, 16 and exact expectation values from simulation under noiseless conditions and state vector simulations. On our primary evaluation, T-CQ exhibited smaller average local quantum shock compared to circular post-training quantization for each task and code-book size tested. The re-execution on the x86-64 platform using K=8 preserved the direction of the mean-shock comparison but had varying magnitudes.

## QSim-Arena: an evolving developer for quantum simulation advantage

DevFeed: [QSim-Arena: an evolving developer for quantum simulation advantage](<https://devfeed.tech/articles/qsim-arena-an-evolving-developer-for-quantum-simulation-advantage-132079.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.15000>)

Author: Jue Xu, Yue Wang, Qi Zhao

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [ai](<https://devfeed.tech/tags/ai.md>), [benchmarking](<https://devfeed.tech/tags/benchmarking.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [co-design](<https://devfeed.tech/tags/co-design.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [framework](<https://devfeed.tech/tags/framework.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-advantage](<https://devfeed.tech/tags/quantum-advantage.md>), [quantum-simulation](<https://devfeed.tech/tags/quantum-simulation.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

QSim-Arena frames quantum simulation advantage assessment as a reproducible process that updates as algorithms, error analysis and hardware improve. AI agents turn published methods into executable components, reproduce results and benchmark them across Hamiltonian families using specified inputs and accuracy targets. Independently crosschecked classical methods provide baselines for quantum resource estimates that combine rigorous error bounds with empirical calibration. The framework also explores recombinations of classical techniques and co-designs fault-tolerant circuits from literature knowledge; its initial applications improve baseline estimates by integrating established techniques.

### Source excerpt

arXiv:2611.15000v1 Announce Type: cross Abstract: Where practical advantage emerges in quantum dynamics simulation remains a central debate in quantum computing. Claimed advantages can be rapidly narrowed or overturned by stronger classical methods, while progress on both sides can outpace the journal publication cycle. We present QSim-Arena, a research framework in which AI agents combine a closed loop of verification and benchmarking with open exploration. Hamiltonians, initial states and accuracy targets for evolved states or observable expectation values provide explicit specifications for evaluating simulation methods. Agents translate published techniques into executable components, reproduce reported results and benchmark their performance across diverse Hamiltonian families. Competing classical methods are implemented and independently crosschecked, providing credible baselines for end-to-end quantum resource estimates based on rigorous error bounds and empirical calibration. Alongside this closed loop, agents recombine classical simulation techniques and co-design fault-tolerant quantum circuits using knowledge extracted from the literature. Initial applications improve baseline resource estimates through the integration of established techniques. QSim-Arena thus treats quantum advantage assessment as an evolving, reproducible research process that can respond to advances in algorithms, error analysis and hardware.

## A New Framework for Quantum Reinforcement Learning

DevFeed: [A New Framework for Quantum Reinforcement Learning](<https://devfeed.tech/articles/a-new-framework-for-quantum-reinforcement-learning-132909.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.14731>)

Author: Alireza Tavakoli, Mohsen Heidari

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [block](<https://devfeed.tech/tags/block.md>), [bounded](<https://devfeed.tech/tags/bounded.md>), [conditional](<https://devfeed.tech/tags/conditional.md>), [control](<https://devfeed.tech/tags/control.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [entanglement](<https://devfeed.tech/tags/entanglement.md>), [environment](<https://devfeed.tech/tags/environment.md>), [estimator](<https://devfeed.tech/tags/estimator.md>), [framework](<https://devfeed.tech/tags/framework.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [horizon](<https://devfeed.tech/tags/horizon.md>), [infinite](<https://devfeed.tech/tags/infinite.md>), [information](<https://devfeed.tech/tags/information.md>), [interaction](<https://devfeed.tech/tags/interaction.md>), [learning](<https://devfeed.tech/tags/learning.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>)

### AI overview

The framework models both the policy and environment as conditional quantum channels, aiming to avoid restrictions of classical interfaces that encode states and actions in computational bases and extract rewards by measurement. It proposes policy gradients for parameterized channels with a trainable control basis. For infinite horizons, where parameters recur across interaction blocks, the new parameter-shift rule shifts one sampled policy block instead of every occurrence; geometric sampling gives an unbiased estimator under bounded rewards. The authors establish convergence to stationary points under standard smoothness and step-size assumptions. The source provides an abstract-level account, not implementation or empirical comparisons.

### Source excerpt

arXiv:2611.14731v1 Announce Type: cross Abstract: Quantum reinforcement learning (QRL) has emerged as a promising approach for controlling quantum systems and accelerating learning tasks with quantum resources. However, most existing QRL formulations still retain a classical reinforcement learning interface: states and actions are often encoded in computational bases and rewards are extracted through measurements. This interface is restrictive for genuinely quantum environments: choosing a measurement can discard entanglement information, while repeated intermediate measurements collapse the evolving state and require costly re-preparation. This motivates a fully QRL framework in which the agent, environment, rewards, and return accumulation are all quantum. In this paper, we take a step toward this goal and introduce a new QRL framework in which both the policy and the environment are modeled by conditional quantum channels. We then propose a quantum policy-gradient algorithm for parameterized conditional quantum channels with a trainable control basis. We also derive finite- and infinite-horizon gradient estimators using a new parameter-shift rule. This rule is needed because policy parameters are shared across repeated interaction blocks and the infinite-horizon objective is not a finite circuit; rather than shifting every occurrence and evaluating the whole trajectory, our estimator shifts only one sampled policy block. Sampling this block from a geometric distribution yields an unbiased gradient estimator under bounded rewards. Finally, we establish convergence of the resulting stochastic gradient-ascent procedure to stationary points under standard smoothness and step-size assumptions.

## Quantum sensor and software maker Q-CTRL raises $290M in funding

DevFeed: [Quantum sensor and software maker Q-CTRL raises $290M in funding](<https://devfeed.tech/articles/quantum-sensor-and-software-maker-q-ctrl-raises-290m-in-funding-131094.md>)

Original publisher: [Read original article](<https://siliconangle.com/2026/11/12/quantum-sensor-and-software-maker-q-ctrl-raises-290m-in-funding/>)

Author: Maria Deutscher

Published: 2026-11-13T01:28:11Z

Content type: news

Language: en

Sources: [SiliconANGLE](<https://devfeed.tech/sources/siliconangle.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Software](<https://devfeed.tech/topics/software.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [emerging-tech](<https://devfeed.tech/tags/emerging-tech.md>), [funding](<https://devfeed.tech/tags/funding.md>), [funding-round](<https://devfeed.tech/tags/funding-round.md>), [gps](<https://devfeed.tech/tags/gps.md>), [ironstone-opal](<https://devfeed.tech/tags/ironstone-opal.md>), [news](<https://devfeed.tech/tags/news.md>), [q-ctrl](<https://devfeed.tech/tags/q-ctrl.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computer](<https://devfeed.tech/tags/quantum-computer.md>), [quantum-navigation](<https://devfeed.tech/tags/quantum-navigation.md>), [quantum-sensor](<https://devfeed.tech/tags/quantum-sensor.md>), [salesforce-ventures](<https://devfeed.tech/tags/salesforce-ventures.md>), [series-c](<https://devfeed.tech/tags/series-c.md>), [software](<https://devfeed.tech/tags/software.md>), [startup](<https://devfeed.tech/tags/startup.md>), [the-latest](<https://devfeed.tech/tags/the-latest.md>)

### AI overview

Q-CTRL raised $290 million in an oversubscribed Series C led by Salesforce Ventures, with participation from more than a dozen investors, and is now valued at over $1 billion. Its Ironstone Opal navigation systems use quantum magnetometers and gravimeters to detect magnetic and gravitational patterns as location fingerprints, then software filters and combines sensor readings and checks them against preloaded maps. Q-CTRL says the systems can operate through GPS jamming and adverse weather. Its other products are Boulder Opal, for qubit calibration, and Fire Opal, for reducing quantum algorithm errors. The company plans to use the funding to improve its software and expand internationally.

### Source excerpt

Q-CTRL Pty Ltd., a provider of quantum sensors and software for managing qubits, today announced that it has raised $290 million in funding. Salesforce Ventures led the oversubscribed Series C deal. It was joined by more than a dozen others, including Bullhound Capital and Affinity Partners, which Q-CTRL says made "significant" contributions, as well as [...] The post Quantum sensor and software maker Q-CTRL raises $290M in funding appeared first on SiliconANGLE.

## What is a spin qubit?

DevFeed: [What is a spin qubit?](<https://devfeed.tech/articles/what-is-a-spin-qubit-130672.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/spin-qubits-explained>)

Author: Ryan Mandelbaum

Published: 2026-11-12T15:30:00Z

Content type: article

Language: en

Sources: [IBM Research](<https://devfeed.tech/sources/ibm-research.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [about](<https://devfeed.tech/tags/about.md>), [advanced](<https://devfeed.tech/tags/advanced.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [also](<https://devfeed.tech/tags/also.md>), [analogue](<https://devfeed.tech/tags/analogue.md>), [anderon](<https://devfeed.tech/tags/anderon.md>), [apply](<https://devfeed.tech/tags/apply.md>), [applying](<https://devfeed.tech/tags/applying.md>), [approach](<https://devfeed.tech/tags/approach.md>), [building](<https://devfeed.tech/tags/building.md>), [computers](<https://devfeed.tech/tags/computers.md>), [encoding](<https://devfeed.tech/tags/encoding.md>), [explainer](<https://devfeed.tech/tags/explainer.md>), [information](<https://devfeed.tech/tags/information.md>), [possible](<https://devfeed.tech/tags/possible.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computers](<https://devfeed.tech/tags/quantum-computers.md>), [quantum-research](<https://devfeed.tech/tags/quantum-research.md>), [qubit](<https://devfeed.tech/tags/qubit.md>), [spin](<https://devfeed.tech/tags/spin.md>), [spin-qubits](<https://devfeed.tech/tags/spin-qubits.md>), [what-is](<https://devfeed.tech/tags/what-is.md>)

### AI overview

Spin qubits encode quantum information in electron spin states confined in quantum dots. In the Loss-DiVincenzo design, one electron per dot is controlled with microwave pulses, and voltage pulses couple neighboring electrons through exchange interactions. Exchange-only designs use three dots and electrons per qubit and rely on voltage pulses for control. HRL reports a 54-dot system configurable for up to 18 qubits that ran a simple quantum-error-detecting code, controlled by a custom CMOS chip at 4 K. The text presents spin qubits as fast, high-fidelity candidates compatible with semiconductor fabrication; their simpler voltage-based control may reduce room-temperature wiring. They still lag superconducting processors in measurement speed and current qubit count, and scaling requires more uniform qubits, better fabrication yield, lower controller power, and less wiring. The source expects superconducting qubits to reach fault tolerance first.

### Source excerpt

A possible path toward building larger quantum computers involves encoding quantum information in the spins of electrons.

## Tracking progress on the path to IBM Quantum Starling

DevFeed: [Tracking progress on the path to IBM Quantum Starling](<https://devfeed.tech/articles/tracking-progress-on-the-path-to-ibm-quantum-starling-129812.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/path-to-starling>)

Author: Matthias Steffen; Matthew Marwick

Published: 2026-11-11T13:00:00Z

Content type: article

Language: en

Sources: [IBM Research](<https://devfeed.tech/sources/ibm-research.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>), [High-Performance Computing](<https://devfeed.tech/topics/high-performance-computing.md>), [ibm](<https://devfeed.tech/topics/ibm.md>)

Tags: [computing](<https://devfeed.tech/tags/computing.md>), [fault-tolerant-quantum-computing](<https://devfeed.tech/tags/fault-tolerant-quantum-computing.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [ibm-quantum](<https://devfeed.tech/tags/ibm-quantum.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [progress](<https://devfeed.tech/tags/progress.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-architectures](<https://devfeed.tech/tags/quantum-architectures.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-error-correction-mitigation](<https://devfeed.tech/tags/quantum-error-correction-mitigation.md>), [research](<https://devfeed.tech/tags/research.md>), [starling](<https://devfeed.tech/tags/starling.md>), [technology](<https://devfeed.tech/tags/technology.md>), [tracking](<https://devfeed.tech/tags/tracking.md>)

### AI overview

IBM reports progress toward its planned 2029 fault-tolerant Quantum Starling, designed for circuits with 100 million operations on 200 qubits. Its modular qLDPC architecture is estimated to need about 10 times fewer physical qubits than prior approaches at the same logical error rate. Updates include validated c-couplers for dense on-chip connections, code and coupler changes that cut required Josephson junctions from about 5,000 to 2,000, and a decoder whose observed performance meets Starling requirements. Two Nighthawk processors have been linked with l-couplers at an average 1% error rate, while Starling will require over 100 such links per module at 0.1%, making reliability and repeatability ongoing challenges. IBM has also tested modular cryostats and cryogenic control ASICs that match or exceed room-temperature gate performance. The overall architecture is unchanged, but Starling remains a few years away, with further work including refining logical processing units and reducing magic-state injection overhead.

### Source excerpt

Advances across parallel technology areas are laying the groundwork for fault-tolerant quantum computing by the end of the decade.

## Normalizing Flows for Classical Simulation of Quantum Circuits in Phase Space

DevFeed: [Normalizing Flows for Classical Simulation of Quantum Circuits in Phase Space](<https://devfeed.tech/articles/normalizing-flows-for-classical-simulation-of-quantum-circuits-in-phase-space-128788.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.14006>)

Author: Edward Jiang, Timothy Heightman, Marcin P{\\l}odzie\\'n

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Simulation](<https://devfeed.tech/topics/simulation.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [generative-models](<https://devfeed.tech/tags/generative-models.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-circuits](<https://devfeed.tech/tags/quantum-circuits.md>), [quantum-physics](<https://devfeed.tech/tags/quantum-physics.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [space](<https://devfeed.tech/tags/space.md>)

### AI overview

The paper represents N-qubit states as probability distributions on a smooth 2N-dimensional manifold and parameterizes unitary gates as normalizing flows between those distributions, enabling quantum circuit simulation with generative models. On three common circuit families, the authors report accuracy exceeding current state-of-the-art neural network methods for large system sizes. The excerpt does not specify the circuit families, metrics, or quantitative results.

### Source excerpt

arXiv:2611.14006v1 Announce Type: cross Abstract: We present a novel framework to learn a representation of quantum circuits based on the phase space formulation of many-body systems. Given that $N$-qubit states can be represented as probability distributions on a smooth $2N$-dimensional manifold, we show how unitary gates can be parameterized as normalizing flows between these distributions, opening a new avenue for quantum circuit simulation using generative models. We evaluate our method on three common families of quantum circuits, and show that its accuracy exceeds that of current state-of-the-art neural network methods for large system sizes.

## Agent-Guided Discovery of Exchange-Correlation Functionals with Physics-based Validation

DevFeed: [Agent-Guided Discovery of Exchange-Correlation Functionals with Physics-based Validation](<https://devfeed.tech/articles/agent-guided-discovery-of-exchange-correlation-functionals-with-physics-based-validation-128290.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.13329>)

Author: Achuth Chandrasekhar, Amir Barati Farimani

Published: 2026-11-11T05:00:00Z

Content type: news

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [Agent Harness](<https://devfeed.tech/topics/agent-harness.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agents](<https://devfeed.tech/tags/agents.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [discovery](<https://devfeed.tech/tags/discovery.md>), [evolution](<https://devfeed.tech/tags/evolution.md>), [exchange](<https://devfeed.tech/tags/exchange.md>), [external](<https://devfeed.tech/tags/external.md>), [functional](<https://devfeed.tech/tags/functional.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [improvement](<https://devfeed.tech/tags/improvement.md>), [iso](<https://devfeed.tech/tags/iso.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llm-agents](<https://devfeed.tech/tags/llm-agents.md>), [model-context-protocol](<https://devfeed.tech/tags/model-context-protocol.md>), [opus-5-5](<https://devfeed.tech/tags/opus-5-5.md>), [physics](<https://devfeed.tech/tags/physics.md>), [physics-based-validation](<https://devfeed.tech/tags/physics-based-validation.md>), [scale](<https://devfeed.tech/tags/scale.md>), [search](<https://devfeed.tech/tags/search.md>), [spin](<https://devfeed.tech/tags/spin.md>), [validation](<https://devfeed.tech/tags/validation.md>)

### AI overview

The study reports O159, a 13-parameter exchange-correlation functional discovered by LLM agents and validated self-consistently. O159 multiplies same-spin correlation by a smooth density window; refitted controls indicate the window scales the full same-spin factor, reducing it by 15-30% at its peak, with reaction-energy effects mainly in near-iso-orbital regions. Against a refitted no-window control, it reduces heavy-atom total-energy errors on GSCDB137 by 29%. On held-out MGCDB84, self-consistent O159 lowers ωB97M-V test error by 11.7%; its mean normalized error ratio across 36 GSCDB137 datasets is similar to ωB97M-V and below GAS22. Opus-5.5 agents passed screening using about 40 times fewer tokens than Codex (GPT-6-Astra). SyFES evolution, with about 400 fits, did not improve on its GAS22 seed, while agents found forms with lower validation error by adding an explicit density scale.

### Source excerpt

arXiv:2611.13329v1 Announce Type: new Abstract: Accurate, compact exchange--correlation functionals are central to predictive density functional theory. Symbolic search and language-model agents can propose new functional forms, but it remains unclear whether their gains survive self-consistency and external evaluation, whether the new terms carry physical content, whether agents outperform evolutionary search, and how language-model backbones compare. We connect frontier LLM agents to a GPU evaluator through the Model Context Protocol, with training-only fitting, persistent memory, and self-consistent and external evaluation. Opus-5.5 agents passed the screening gate with about 40-fold fewer tokens than Codex (GPT-6-Astra) agents and found a candidate with lower validation and held-out errors; only this candidate advanced to self-consistent evaluation. The resulting 13-parameter functional, O159, multiplies same-spin correlation by a smooth density window. Refitted controls favor a window that scales the entire same-spin factor, reducing it by 15--30\% at its peak, and that acts on reaction energies mainly in near-iso-orbital regions; against a refitted no-window control, it lowers heavy-atom total-energy errors on GSCDB137 by 29\%. With about 400 fits each, SyFES evolution did not improve on its GAS22 seed, whereas the agents found forms 0.10--0.13 \kcal\ lower in validation error by adding an explicit density scale. Self-consistent O159 lowers the held-out MGCDB84 test error of $\omega$B97M-V by 11.7\%, and its mean normalized error ratio on 36 GSCDB137 datasets (1.139) is comparable to $\omega$B97M-V (1.144) and below GAS22 (1.190). Frontier-LLM agents thus produced O159, a compact functional whose improvement over $\omega$B97M-V survives self-consistent, physics-based validation.

## Operational limits of reference renewal for retained quantum-service results

DevFeed: [Operational limits of reference renewal for retained quantum-service results](<https://devfeed.tech/articles/operational-limits-of-reference-renewal-for-retained-quantum-service-results-129180.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.14376>)

Author: Roberto Fern\\'andez-Barrios, Iker Pastor-L\\'opez, Amaia Pikatza-Huerga, Pablo Garc\\'ia Bringas

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Software Engineering](<https://devfeed.tech/sources/arxiv-software-engineering.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [reproducibility](<https://devfeed.tech/topics/reproducibility.md>)

Tags: [counts](<https://devfeed.tech/tags/counts.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [failures](<https://devfeed.tech/tags/failures.md>), [hypothesis](<https://devfeed.tech/tags/hypothesis.md>), [implement](<https://devfeed.tech/tags/implement.md>), [incremental](<https://devfeed.tech/tags/incremental.md>), [limits](<https://devfeed.tech/tags/limits.md>), [offline](<https://devfeed.tech/tags/offline.md>), [operational](<https://devfeed.tech/tags/operational.md>), [oracle](<https://devfeed.tech/tags/oracle.md>), [protocol](<https://devfeed.tech/tags/protocol.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [recovery](<https://devfeed.tech/tags/recovery.md>), [reference](<https://devfeed.tech/tags/reference.md>), [results](<https://devfeed.tech/tags/results.md>), [retrospective](<https://devfeed.tech/tags/retrospective.md>), [service](<https://devfeed.tech/tags/service.md>), [study](<https://devfeed.tech/tags/study.md>)

### AI overview

In this 12-transition evaluation, reference renewal completed for 10 transitions and met its prespecified endpoint for eight; five succeeded using retained results alone. The exact one-sided p-value (0.0546875) does not establish the recovery hypothesis. Incomplete references, binding failures, and sequential waits limited operation, though preserved counts allowed offline reconstruction of decisions. Retrospective binding-plus-oracle checking accepted all 60 results from usable transitions without renewal. Because the exact oracle also supplied calibration scores, the study does not demonstrate that renewal adds numerical-correctness value.

### Source excerpt

arXiv:2611.14376v1 Announce Type: cross Abstract: We implement reference renewal to reconsider retained physical quantum-service results under a prespecified protocol. Twelve transitions retained six results each; ten completed renewal, eight met the prespecified endpoint, and five succeeded using retained results alone. The exact one-sided p=0.0546875 does not establish the recovery hypothesis. Incomplete references, binding failures and sequential waits expose operational limits. Offline reconstruction recovers decisions from preserved counts. Retrospective binding-plus-oracle checking accepts all 60 usable-transition results without renewal. With the exact oracle also supplying calibration scores, the study does not demonstrate incremental numerical-correctness utility of renewal.

## How wide must an eavesdropper be? Leakage of a toric-code logical bit to a strip and the Nishimori point

DevFeed: [How wide must an eavesdropper be? Leakage of a toric-code logical bit to a strip and the Nishimori point](<https://devfeed.tech/articles/how-wide-must-an-eavesdropper-be-leakage-of-a-toric-code-logical-bit-to-a-strip-and-the-nishimori-point-128895.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.13174>)

Author: Konstantinos Karagiannis

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Decoding](<https://devfeed.tech/topics/decoding.md>)

Tags: [adversary](<https://devfeed.tech/tags/adversary.md>), [column](<https://devfeed.tech/tags/column.md>), [cond-mat-stat-mech](<https://devfeed.tech/tags/cond-mat-stat-mech.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [data](<https://devfeed.tech/tags/data.md>), [decoder](<https://devfeed.tech/tags/decoder.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [design](<https://devfeed.tech/tags/design.md>), [errors](<https://devfeed.tech/tags/errors.md>), [heron](<https://devfeed.tech/tags/heron.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [identity](<https://devfeed.tech/tags/identity.md>), [ising](<https://devfeed.tech/tags/ising.md>), [logical](<https://devfeed.tech/tags/logical.md>), [noise](<https://devfeed.tech/tags/noise.md>), [observer](<https://devfeed.tech/tags/observer.md>), [operational](<https://devfeed.tech/tags/operational.md>), [point](<https://devfeed.tech/tags/point.md>), [probability](<https://devfeed.tech/tags/probability.md>), [protection](<https://devfeed.tech/tags/protection.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [qubit](<https://devfeed.tech/tags/qubit.md>)

### AI overview

The paper links an observer's optimal advantage in learning a toric-code logical bit to the failure probability of maximum-likelihood decoding restricted to the observer's region: advantage = 1 − 2P_fail, including under correlated Pauli noise. A region missing one code column reveals nothing at any noise level; a region spanning the code relies on noise protection that may require impractical distances. Under i.i.d. noise, a two-row strip is no more revealing than one row, though below threshold the required eavesdropper width grows only logarithmically with code distance. The strip's operational threshold matches the Nishimori point, which the authors estimate using a Walsh-Hadamard transfer matrix. Experiments on IBM Heron processors at distances 3 and 5 show a predicted leakage jump at width three; with non-uniform errors, a trained attacker can benefit from a second row.

### Source excerpt

arXiv:2611.13174v1 Announce Type: cross Abstract: Fault-tolerant quantum computers hand pieces of each logical qubit to separate decoder modules and shared readout lines. How much does a piece reveal? We prove that for any region and any Pauli noise, including correlated noise, an observer's optimal advantage in learning a logical bit is exactly 1 - 2 P_fail, where P_fail is the failure probability of maximum-likelihood decoding confined to that region. Two lessons follow. Geometry, not noise, provides the protection: a region that misses a single column of the code learns exactly nothing at any noise level, while a region that spans the code is protected by noise only at impractical distances (d > 350 for one row at a 10^-3 flip rate). And width is a poor guide to risk: under i.i.d. noise a two-row strip learns exactly as little as one row, yet below threshold an eavesdropper needs a width growing only as ln d. Through the identity, the strip's operational threshold is the Nishimori point of the random-bond Ising model, and a Walsh-Hadamard transfer matrix up to width 16 locates it to within a few thousandths. On two IBM Heron processors (d = 3, 5), an emulated strip adversary shows the predicted jump at width three, and non-uniform qubit errors let a trained attacker profit from the second row that uniform noise makes useless. We turn these results into design rules for partitioned decoding and multiplexed readout. Code and data are included.

## Alchemically Transferable Parameters for Variational Quantum Eigensolvers

DevFeed: [Alchemically Transferable Parameters for Variational Quantum Eigensolvers](<https://devfeed.tech/articles/alchemically-transferable-parameters-for-variational-quantum-eigensolvers-128618.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.11445>)

Author: Jonas Motyl, Jakob S. Kottmann

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [circuit](<https://devfeed.tech/tags/circuit.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [design](<https://devfeed.tech/tags/design.md>), [effective](<https://devfeed.tech/tags/effective.md>), [energy](<https://devfeed.tech/tags/energy.md>), [fragments](<https://devfeed.tech/tags/fragments.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [hydrogen](<https://devfeed.tech/tags/hydrogen.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [models](<https://devfeed.tech/tags/models.md>), [pair](<https://devfeed.tech/tags/pair.md>), [physics-chem-ph](<https://devfeed.tech/tags/physics-chem-ph.md>), [prediction](<https://devfeed.tech/tags/prediction.md>), [projection](<https://devfeed.tech/tags/projection.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [size](<https://devfeed.tech/tags/size.md>), [structure](<https://devfeed.tech/tags/structure.md>), [systems](<https://devfeed.tech/tags/systems.md>), [training](<https://devfeed.tech/tags/training.md>), [type](<https://devfeed.tech/tags/type.md>)

### AI overview

The work proposes transferring learned VQE circuit parameters from hydrogenic systems to organic molecules without retraining the hydrogenic solvers. It geometrically projects surrogate hydrogen atoms along each target bond, mapping local bonding environments to small hydrogenic fragments. A single projection radius for each bond type is fitted on a small reference molecule, then reused unchanged. The approach is demonstrated with separable-pair circuits and extended to multiple circuits that span effective bases for quantum subspaces.

### Source excerpt

arXiv:2611.11445v1 Announce Type: cross Abstract: Machine-learned circuit parameters could remove one of the main bottlenecks of variational quantum eigensolvers: the classical optimization loop, with its typical barren plateaus, local minima, and costly energy and gradient evaluations, is replaced by a direct prediction. Prior work showed that machine-learning models paired with a structured circuit design can transfer across system size and structure within hydrogenic systems. The next step: Extending them to organic molecules would seem to require re-training on use-case-specific training sets. In this work, we show that this is not necessary by establishing an alchemical approach. A geometric projection places surrogate hydrogen atoms along the bond directions of the target molecule and so maps its local bonding environment onto small hydrogenic fragments. Existing hydrogenic solvers can then be reused as they are. The only new quantity is a single projection radius per bond type, which is fitted once on a small reference molecule and reused unchanged thereafter. We demonstrate the approach on the separable-pair circuit designs that have been used in prior work and extend the approach to multi-circuit approaches that span effective bases for quantum subspaces.

## Reducing Provers in Distributed Quantum Verification

DevFeed: [Reducing Provers in Distributed Quantum Verification](<https://devfeed.tech/articles/reducing-provers-in-distributed-quantum-verification-126747.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.12600>)

Author: Alex Della Schiava, Atsuya Hasegawa, Fran\\c{c}ois Le Gall, Harumichi Nishimura

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

In the distributed quantum Merlin-Arthur model with proofs unentangled across nodes, the paper defines a version with k provers and gives reductions in prover count. Reducing to two provers doubles local proof size without extra communication. Reducing to one prover takes four additional rounds and uses at most three times the original local proof size plus a logarithmic term in the number of nodes. For perfectly complete protocols, amplification allows a single prover with constant-factor overhead, yielding equality between the one-prover and k-prover classes. These results concern the model and conditions described in the abstract.

### Source excerpt

arXiv:2611.12600v1 Announce Type: cross Abstract: In the distributed quantum Merlin-Arthur ($\mathsf{dQMA}$) model introduced by Fraigniaud, Le Gall, Nishimura, and Paz (ITCS 2021), a network of quantum computers verifies a global property with the aid of a quantum proof supplied by an untrusted prover. While the nodes are computationally unbounded, the challenge is to limit proof size and the communication required for verification. In this paper, we consider the model of Hasegawa, Kundu, and Nishimura (PODC 2024), where the proof must be unentangled across nodes, and define its extension to $k$ unentangled provers, denoted by $\mathsf{dQMAS}(k)$. In this setting, we investigate the proof size per node and the communication costs of reducing the number of provers. Our first result reduces the number of provers from $k$ to two, doubling the proof size without additional communication. Moreover, with four additional rounds, we can reduce the number of provers from $k$ to one, using at most three times the original local proof size plus a logarithmic term in the number of nodes. Finally, we establish amplification for perfectly complete protocols. In this regime, a single prover suffices with a constant-factor overhead in our reductions, yielding $\mathsf{dQMAS} = \mathsf{dQMAS}(k)$.

## Fast Accurate Quantum Monte Carlo without Metropolis Adjustment

DevFeed: [Fast Accurate Quantum Monte Carlo without Metropolis Adjustment](<https://devfeed.tech/articles/fast-accurate-quantum-monte-carlo-without-metropolis-adjustment-125142.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.10187>)

Author: Reuben Cohn-Gordon, Gabriel Pescia, Sumner N. Hearth, Jakob Robnik, Uro\\v{s} Seljak, Peter Lunts

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [adjustment](<https://devfeed.tech/tags/adjustment.md>), [allows](<https://devfeed.tech/tags/allows.md>), [applications](<https://devfeed.tech/tags/applications.md>), [approach](<https://devfeed.tech/tags/approach.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [bias](<https://devfeed.tech/tags/bias.md>), [call](<https://devfeed.tech/tags/call.md>), [can](<https://devfeed.tech/tags/can.md>), [central](<https://devfeed.tech/tags/central.md>), [context](<https://devfeed.tech/tags/context.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [design](<https://devfeed.tech/tags/design.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [effective](<https://devfeed.tech/tags/effective.md>), [energy](<https://devfeed.tech/tags/energy.md>), [error](<https://devfeed.tech/tags/error.md>), [fast](<https://devfeed.tech/tags/fast.md>), [metropolis](<https://devfeed.tech/tags/metropolis.md>), [monte-carlo](<https://devfeed.tech/tags/monte-carlo.md>), [quantum](<https://devfeed.tech/tags/quantum.md>)

### AI overview

The work adapts unadjusted Hamiltonian Monte Carlo (HMC) to quantum Monte Carlo, evaluating it on a high-dimensional spin-fermion model of a quantum phase transition. Standard adjusted HMC uses the Metropolis-Hastings criterion to ensure estimates converge to their true values with increasing sample size; the unadjusted approach accepts some asymptotic bias. The authors report that this bias remains small relative to finite-sample variance, and that unadjusted methods deliver higher effective sample size per gradient call than adjusted HMC while retaining accurate results.

### Source excerpt

arXiv:2611.10187v1 Announce Type: new Abstract: In quantum systems, physical quantities of interest can be expressed as expectation values of a probability distribution, which allows their estimation by Markov Chain Monte Carlo (MCMC) methods. This approach, an instance of Quantum Monte Carlo (QMC), plays a central role in obtaining predictions of system properties relevant to condensed matter and high energy physics. The use of Hamiltonian dynamics to design a Markov kernel, known as Hybrid or Hamiltonian Monte Carlo (HMC), is widespread in quantum applications. In this context, it is standard to use an HMC kernel that is ``adjusted'' with the Metropolis-Hastings (MH) criterion, so that estimates of expectations converge to their true value in the limit of infinite sample size. However, recent work in computational statistics suggests that an \emph{unadjusted} HMC kernel can be significantly more efficient, while safely maintaining an asymptotic bias which is small relative to the error arising from the variance of the finite sample size. We adapt this approach to the QMC setting, focusing on a challenging and high-dimensional \emph{spin-fermion} model of a quantum phase transition. We find that unadjusted methods outperform adjusted HMC in terms of effective sample size per gradient call, while retaining accurate results.

## Breaking the Bounded Entanglement Barrier for Quantum Position Verification

DevFeed: [Breaking the Bounded Entanglement Barrier for Quantum Position Verification](<https://devfeed.tech/articles/breaking-the-bounded-entanglement-barrier-for-quantum-position-verification-126897.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2609.39234>)

Author: Amit Behera, Vipul Goyal

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [2014](<https://devfeed.tech/tags/2014.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [adversarial](<https://devfeed.tech/tags/adversarial.md>), [adversary](<https://devfeed.tech/tags/adversary.md>), [all](<https://devfeed.tech/tags/all.md>), [allows](<https://devfeed.tech/tags/allows.md>), [also](<https://devfeed.tech/tags/also.md>), [apply](<https://devfeed.tech/tags/apply.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [attack](<https://devfeed.tech/tags/attack.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [based](<https://devfeed.tech/tags/based.md>), [bounded](<https://devfeed.tech/tags/bounded.md>), [call](<https://devfeed.tech/tags/call.md>), [can](<https://devfeed.tech/tags/can.md>), [challenge](<https://devfeed.tech/tags/challenge.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [entanglement](<https://devfeed.tech/tags/entanglement.md>), [position](<https://devfeed.tech/tags/position.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [verification](<https://devfeed.tech/tags/verification.md>)

### AI overview

The paper presents a BB84-based quantum position verification protocol secure in an idealized continuous-time model against any finite coalition of LOCC adversaries with finite storage and preshared entanglement, including potentially exponential amounts. It also gives a discrete-time instantiation with an information-theoretic polynomial gap, chosen as desired, between honest parties' communication and storage and the adversarial resource bound. The gap depends on clock precision: improving precision raises the adversary's bound while leaving honest resources largely unchanged. The techniques also yield position-based message authentication and quantum key exchange with the stated guarantees in both models.

### Source excerpt

arXiv:2609.39234v2 Announce Type: replace-cross Abstract: Position verification, introduced by Chandran et al. (SIAM J. Computing 2014), allows verifiers to test a prover's claimed position by an interactive protocol. Classical position verification is impossible. Even for Quantum Position Verification (QPV), there always exists an LOCC (Local Operations and Classical Communication) attack if the adversary can hold an exponentially large amount of preshared entanglement. Somewhat surprisingly, we show that we can circumvent this barrier in the idealized continuous-time model, where time is represented by a real-valued parameter and challenge messages can be sent at a time sampled uniformly from a real interval. In this model, we give a BB84-based protocol that remains secure against any finite coalition of LOCC adversaries with arbitrary finite (possibly exponential) quantum storage and entanglement. Our construction can also be instantiated in the discrete-time model. Although prior impossibility results apply, our information-theoretic QPV protocol achieves any desired polynomial gap between the honest parties' total resources (communication and storage) and the adversarial resource bound. To our knowledge, all prior constructions that do not rely on idealized oracles required resources of the honest parties to be at least as large as the proven adversarial entanglement bound. Interestingly, the resource gap depends on the precision in measuring time. As clock precision improves, the adversarial resource bound increases while honest resources remain largely unchanged. We call this the "I sleep, you work" paradigm. Finally, we show that our techniques extend to an information-theoretic, position-based message authentication protocol, which in turn extends to an information-theoretic, position-based quantum key exchange protocol with the same guarantees as our position-verification protocol in the continuous-time and discrete-time models.

[Next page](<https://devfeed.tech/topics/quantum-mechanics.md?cursor=WyIyMDI2LTExLTEwVDA1OjAwOjAwKzAwOjAwIiwgImJhNjZkMWM4LWUyZWItNGIwNC1iNWI4LTk2OTFjMzJlZDY5MSJd>)