# Quantum Computing

An emerging computing technology that uses quantum physics and qubits to process information and solve certain complex problems.

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

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

DevFeed: [Classical Oracle Separation of QMA from the QCMA Hierarchy and Quantum Cryptography Even When P = QCMA](<https://devfeed.tech/articles/classical-oracle-separation-of-qma-from-the-qcma-hierarchy-and-quantum-cryptography-even-when-p-qcma-146065.md>)

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

Author: Alper Cakan

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

Content type: article

Language: en

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

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

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [hierarchy](<https://devfeed.tech/tags/hierarchy.md>), [one-way-functions](<https://devfeed.tech/tags/one-way-functions.md>), [oracle](<https://devfeed.tech/tags/oracle.md>), [public-key](<https://devfeed.tech/tags/public-key.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [query](<https://devfeed.tech/tags/query.md>), [separate](<https://devfeed.tech/tags/separate.md>), [state](<https://devfeed.tech/tags/state.md>)

### AI overview

The paper introduces Codeword-Hash pairs in Noise (CHN), a query-complexity problem in QMA that is hard for the QCMA hierarchy. Using CHN, it constructs a classical oracle where P, BQP, QCMA, and QCMAH coincide, yet QMA is strictly larger and is not contained in QCMAH. The abstract also claims that, relative to such an oracle, quantum cryptographic primitives can exist despite P = QCMA, including pseudorandom states with classical keys and public-key encryption with classical public keys and ciphertexts and copy-protected quantum decryption keys. These are oracle-relative results; the supplied text is an abstract, not the full manuscript.

### Source excerpt

arXiv:2611.26574v1 Announce Type: cross Abstract: Remark: This work is in submission at STOC'27 and thus the full manuscript has been publicly posted on the conference website since November 3rd, 2026. Inspired by the Codeword-Hash Structure problem recently introduced by Cakan (arXiV, 2026) to separate $\mathsf{QMA}$ from $\mathsf{QCIP}$, we introduce a new problem called Codeword-Hash pairs in Noise ($\mathsf{CHN}$) and prove that, in the query complexity model, it is in $\mathsf{QMA}$ but hard for the $\mathsf{QCMA}$ hierarchy $\mathsf{QCMAH} = \bigcup_{d\geq1}\mathsf{QCMA}^{\mathsf{QCMA}^{\cdots^{\mathsf{QCMA}}}}$, the classical-witness quantum-verifier analogue of $\mathsf{PH}=\bigcup_{d\ge1}\mathsf{NP}^{\mathsf{NP}^{\cdots^{\mathsf{NP}}}}$. Using this problem, we show that there exists a classical oracle ${O}$ such that $\mathsf{P}^{{O}}=\mathsf{BQP}^{{O}}=\mathsf{QCMA}^{{O}} =\mathsf{QCMAH}^{{O}} \subset \mathsf{QMA}^{{O}} \text{ but } \mathsf{QMA}^{{O}}\not\subseteq\mathsf{QCMAH}^{{O}},$ thus showing that quantum state or quantum proof advantage could exist even if classical computers can efficiently solve any problem that can be quantumly verified with a classical proof. Further, using our problem, we show that various quantum cryptographic primitives can exist even when $\mathsf{P} = \mathsf{QCMA}$ and thus neither quantum-computable one-way functions nor (verifiable) quantum computational advantage exist. In particular, relative to a classical oracle ${O}$ with $\mathsf{P}^{{O}}=\mathsf{BQP}^{{O}}=\mathsf{QCMA}^{{O}}=\mathsf{QCMAH}^{{O}}$, there exist pseudorandom states with classical keys and public-key encryption with copy-protected quantum decryption keys and classical public keys and ciphertexts, among other primitives, answering an open question of Kretschmer, Qian, and Tal (STOC 2025).

## Inverse ECG Reconstruction via a Preconditioned Variational Quantum Linear Solver

DevFeed: [Inverse ECG Reconstruction via a Preconditioned Variational Quantum Linear Solver](<https://devfeed.tech/articles/inverse-ecg-reconstruction-via-a-preconditioned-variational-quantum-linear-solver-145057.md>)

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

Author: Xizhuo Zhang, Chao Lu, Bing Yao

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 Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Medical imaging](<https://devfeed.tech/topics/medical-imaging.md>), [linear-regression](<https://devfeed.tech/topics/linear-regression.md>)

Tags: [applications](<https://devfeed.tech/tags/applications.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [ecg](<https://devfeed.tech/tags/ecg.md>), [experimental](<https://devfeed.tech/tags/experimental.md>), [framework](<https://devfeed.tech/tags/framework.md>), [healthcare](<https://devfeed.tech/tags/healthcare.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [imaging](<https://devfeed.tech/tags/imaging.md>), [linear](<https://devfeed.tech/tags/linear.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-classical](<https://devfeed.tech/tags/quantum-classical.md>), [theoretical](<https://devfeed.tech/tags/theoretical.md>)

### AI overview

The paper proposes a hybrid method for inverse ECG reconstruction, which infers heart-surface potentials from body-surface measurements. To address the dense, ill-conditioned systems involved, it first uses Laplacian-regularized pre-encoding to reduce system dimension and improve conditioning, then solves the reduced system with a coherent variational quantum linear solver (VQLS). The authors state that a theoretical proof shows the procedure preserves the original problem's exact solution, and report accurate reconstruction in experiments on a realistic heart-torso geometry. The abstract does not provide comparative performance or computational-cost results.

### Source excerpt

arXiv:2611.25450v1 Announce Type: new Abstract: Inverse electrocardiography (ECG) reconstructs heart-surface potentials from body-surface measurements, enabling noninvasive mapping of cardiac electrical activity. However, the reconstruction requires solving dense and ill-conditioned linear systems, whose computational cost grows rapidly with the refined heart mesh. Quantum computing offers new opportunities for solving such systems. This paper presents a hybrid quantum-classical framework for inverse ECG reconstruction, which, to the best of our knowledge, is the first to apply a quantum linear solver to this problem. We first propose a Laplacian-regularized pre-encoding procedure to reduce the dimension of the system while improving its conditioning. Second, the resulting reduced system is encoded and solved using a coherent variational quantum linear solver (VQLS). Finally, we provide a rigorous theoretical proof establishing that the proposed framework preserves the exact solution of the original reconstruction problem throughout all stages of the computational process. Experimental results on a realistic heart-torso geometry demonstrate that our approach holds significant ability for accurate inverse ECG reconstruction. These findings highlight the potential of quantum solvers for noninvasive cardiac imaging, providing a foundation for further research into quantum-enhanced cardiac assessment and other healthcare applications.

## Scaling classical hardware for accurate real-time quantum error correction

DevFeed: [Scaling classical hardware for accurate real-time quantum error correction](<https://devfeed.tech/articles/scaling-classical-hardware-for-accurate-real-time-quantum-error-correction-145183.md>)

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

Author: Chenyang Jin, Susanne F. Yelin, Andi Gu

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

Content type: news

Language: en

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

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

Tags: [arithmetic](<https://devfeed.tech/tags/arithmetic.md>), [bicycle](<https://devfeed.tech/tags/bicycle.md>), [color](<https://devfeed.tech/tags/color.md>), [cs-ar](<https://devfeed.tech/tags/cs-ar.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [custom-silicon](<https://devfeed.tech/tags/custom-silicon.md>), [decoder](<https://devfeed.tech/tags/decoder.md>), [fpga](<https://devfeed.tech/tags/fpga.md>), [fpgas](<https://devfeed.tech/tags/fpgas.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [latency](<https://devfeed.tech/tags/latency.md>), [neural](<https://devfeed.tech/tags/neural.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum-error-correction](<https://devfeed.tech/tags/quantum-error-correction.md>), [real-time](<https://devfeed.tech/tags/real-time.md>), [relay](<https://devfeed.tech/tags/relay.md>), [scaling](<https://devfeed.tech/tags/scaling.md>), [surface](<https://devfeed.tech/tags/surface.md>)

### AI overview

Rapids is a streaming neural decoder co-designed with FPGA hardware, using operations that map cheaply to the device and training in its integer arithmetic. On a single FPGA, it decodes each distance-19 surface-code syndrome round in under a microsecond; the abstract reports a logical error rate 240 times lower than existing real-time hardware decoders. The design also covers the color code and [[144,12,12]] bivariate-bicycle code, where it is reported to be 16 times more accurate than the real-time Relay decoder. Spreading Rapids across multiple FPGAs or implementing it in custom silicon can, according to the abstract, increase speed or accuracy or support larger codes.

### Source excerpt

arXiv:2611.26447v1 Announce Type: cross Abstract: Fault-tolerant quantum computation requires a classical decoder fast enough to process syndrome measurements at the rate at which they are generated, and to return its decisions with low latency. This is most demanding for superconducting processors, whose fast syndrome cycles force a trade-off between decoding speed and accuracy. Decoders fast enough to keep up sacrifice accuracy, which must be compensated for with larger codes and thus additional physical qubits. Here we introduce Rapids, a streaming neural decoder that is both fast and accurate. We achieve this by co-designing the decoder with a field-programmable gate array (FPGA): the network is built from operations that map cheaply onto the device and trained in its integer arithmetic. For the distance-19 surface code, Rapids decodes each round of syndromes in under a microsecond on a single FPGA, fast enough for superconducting processors, and returns its decisions with the low latency that fault-tolerant algorithms require. Its logical error rate is 240 times lower than that of existing real-time hardware decoders. The same design extends to the color code and the [[144,12,12]] bivariate-bicycle code, on which our decoder is 16 times more accurate than the real-time Relay decoder. We further show that the decoder scales: spread over several FPGAs or hardened into custom silicon, it becomes faster, more accurate, or able to decode larger codes. Classical hardware thus becomes a further resource, alongside qubits, that can be scaled to improve fault-tolerant quantum computers.

## Quantum Nondecimated Wavelet Transform: Theory, Circuits, and Applications

DevFeed: [Quantum Nondecimated Wavelet Transform: Theory, Circuits, and Applications](<https://devfeed.tech/articles/quantum-nondecimated-wavelet-transform-theory-circuits-and-applications-144868.md>)

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

Author: Brani Vidakovic

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 Computing](<https://devfeed.tech/topics/quantum-computing.md>), [fourier transform](<https://devfeed.tech/topics/fourier-transform.md>), [fourier analysis](<https://devfeed.tech/topics/fourier-analysis.md>)

Tags: [applications](<https://devfeed.tech/tags/applications.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [denoising](<https://devfeed.tech/tags/denoising.md>), [filter](<https://devfeed.tech/tags/filter.md>), [linear-combination](<https://devfeed.tech/tags/linear-combination.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [model](<https://devfeed.tech/tags/model.md>), [physics-data-an](<https://devfeed.tech/tags/physics-data-an.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [scaling](<https://devfeed.tech/tags/scaling.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [stat-co](<https://devfeed.tech/tags/stat-co.md>), [theory](<https://devfeed.tech/tags/theory.md>)

### AI overview

The transform applies circular shifts to an amplitude-encoded signal before one orthogonal wavelet transform. Tracing out the shift register yields level probabilities matching normalized nondecimated wavelet energies, invariant to circular shifts; the diagonal gives moving averages of squared coefficients. The authors derive a multinomial model for level counts and a way to read lag-one autocovariance for all but the coarsest detail level, while noting that direct Fourier-basis measurement is at least as precise and uses a simpler circuit for these global statistics. For denoising, block-encoded shrinkage is placed between the transform and its inverse; postselection implements cycle spinning exactly as a linear combination of unitaries. Shared level weights yield a zero-phase translation-equivariant filter, while local weights preserve equivariance when indexed by nondecimated translate. Examples include James Stein shrinkage, local empirical Wiener filtering, and turbulent wind scaling; gate simulations verify the construction, with costs reported separately for state preparation, weight estimation, and output.

### Source excerpt

arXiv:2512.21478v2 Announce Type: replace-cross Abstract: The quantum nondecimated wavelet transform uses a shift register to apply circular shifts to an amplitude encoded signal before a single orthogonal wavelet transform. We show that tracing out the shift register gives level probabilities equal to the normalized nondecimated wavelet energies, invariant under circular shifts. Its diagonal gives moving averages of squared coefficients. We derive a multinomial model for the level counts and show how to read the autocovariance at lag one for all but the coarsest detail level. For these global statistics, direct Fourier basis measurement of the input is at least as precise and uses a simpler circuit. For denoising, we insert a block encoded shrinkage operator between the transform and its inverse. Postselection on the shift register implements the cycle spinning average exactly as a linear combination of unitaries. Weights shared within each level give a translation equivariant filter with zero phase. Local weights also preserve translation equivariance when indexed by the nondecimated translate. The circuit provides access to individual decimated branches and combines them coherently. We illustrate the method with James Stein shrinkage, local empirical Wiener filtering, and a scaling analysis of turbulent wind velocity. Gate simulations verify the construction, and we report state preparation, weight estimation, and output costs separately.

## Privacy-Utility Tradeoffs with Quantum Local Differential Privacy

DevFeed: [Privacy-Utility Tradeoffs with Quantum Local Differential Privacy](<https://devfeed.tech/articles/privacy-utility-tradeoffs-with-quantum-local-differential-privacy-144876.md>)

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

Author: Theshani Nuradha, Sujeet Bhalerao, Felix Leditzky

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

Content type: article

Language: en

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

Topics: [Differential Privacy](<https://devfeed.tech/topics/differential-privacy.md>), [Security & Privacy](<https://devfeed.tech/topics/security-privacy.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>)

Tags: [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [differential-privacy](<https://devfeed.tech/tags/differential-privacy.md>), [learning](<https://devfeed.tech/tags/learning.md>), [local](<https://devfeed.tech/tags/local.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [privacy](<https://devfeed.tech/tags/privacy.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [tradeoffs](<https://devfeed.tech/tags/tradeoffs.md>), [utility](<https://devfeed.tech/tags/utility.md>)

### AI overview

Under (ε,δ)-quantum local differential privacy, the paper finds that the depolarizing mechanism is optimal for generic state utility measured by fidelity and trace distance, while task-specific mechanisms can improve utility for learning observable expectations. It derives a high-probability sample lower bound using private quantum hypothesis-testing results and reports optimal sample complexity in the privacy and accuracy parameters, scaling as Θ((εβ)⁻²) for ε ∈ (0,1) and accuracy tolerance β. The abstract also introduces private classical shadows as a direction for future applications.

### Source excerpt

arXiv:2602.10510v2 Announce Type: replace-cross Abstract: When sensitive information is encoded in data, it is important to ensure the privacy of information when attempting to learn useful information from the data. There is a natural tradeoff whereby increasing privacy requirements may decrease the utility of a learning protocol. In the quantum setting of differential privacy, such tradeoffs between privacy and utility have so far remained largely unexplored. In this work, we study optimal privacy-utility tradeoffs for both generic and application-specific utility metrics when privacy is quantified by $(\varepsilon,\delta)$-quantum local differential privacy. In the generic setting, we focus on optimizing fidelity and trace distance between the original state and the privatized state. We show that the depolarizing mechanism achieves the optimal utility for given privacy requirements. We then study the specific application of learning the expectation of an observable with respect to an input state when only given access to privatized states. We derive a lower bound on the number of samples of privatized data required to achieve a fixed accuracy guarantee with high probability. To prove this result, we employ existing lower bounds on private quantum hypothesis testing, thus showcasing the first operational use of them. We also devise private mechanisms that achieve optimal sample complexity with respect to the privacy parameters and accuracy parameters, demonstrating that utility can be significantly improved for specific tasks in contrast to the generic setting. In addition, we show that the number of samples required to privately learn observable expectation values scales as $\Theta((\varepsilon \beta)^{-2})$, where $\varepsilon \in (0,1)$ is the privacy parameter and $\beta$ is the accuracy tolerance. We conclude by initiating the study of private classical shadows, which promise useful applications for private learning tasks.

## 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.

## Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters

DevFeed: [Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters](<https://devfeed.tech/articles/quantum-annealing-with-a-quantum-neural-network-width-of-annealing-matters-143482.md>)

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

Author: Mojtaba Asadollahi, Danial Khajehzadeh, Abolfazl Ramezanpour

Published: 2026-11-19T05: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>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [Operations research and optimization](<https://devfeed.tech/topics/operations-research-and-optimization.md>)

Tags: [cond-mat-dis-nn](<https://devfeed.tech/tags/cond-mat-dis-nn.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [neural-network](<https://devfeed.tech/tags/neural-network.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>)

### AI overview

The paper extends quantum annealing with a quantum neural network to address limitations associated with exponentially shrinking energy gaps at discontinuous quantum phase transitions. In the quantum search problem, a random network of width W = 2 reportedly reduces the required annealing depth exponentially; with tuned parameters, a quantum perceptron of depth L = 1 and width W = 2 achieves exponentially small errors. The authors attribute improved success probability to the wider network's larger, learnable evolution space. These claims are based on the abstract's reported prototypical optimization problem results.

### Source excerpt

arXiv:2611.24089v1 Announce Type: cross Abstract: Quantum annealing is a promising quantum algorithm for dealing with computationally hard optimization problems. Currently available hardware can implement the algorithm for a significant class of Hamiltonian problems. However, its performance is especially limited in discontinuous quantum phase transitions, where the energy gap shrinks exponentially with system size. In this paper, we introduce an extension of quantum annealing to a quantum neural network and study its performance in a number of prototypical optimization problems. In particular, we observe that already a random quantum annealing network of width W = 2 can exponentially reduce the number of evolution layers or depth of the annealing process in the quantum search problem. By tuning the network parameters the search problem can be solved with exponentially small errors by a quantum perceptron of depth L = 1 and width W = 2. The findings show that width of a quantum annealing network is critical to enhance the success probability of the algorithm by providing a larger and learnable evolution space for the annealing process.

## Beyond Corpus-Driven Imitation: Evolving Musical Mindsets in the Agentic Orchestra via Quantum Reinforcement Learning

DevFeed: [Beyond Corpus-Driven Imitation: Evolving Musical Mindsets in the Agentic Orchestra via Quantum Reinforcement Learning](<https://devfeed.tech/articles/beyond-corpus-driven-imitation-evolving-musical-mindsets-in-the-agentic-orchestra-via-quantum-reinforcement-learning-142773.md>)

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

Author: Eduardo Reck Miranda, Moein Fahmideh Vatandoost

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

Content type: article

Language: en

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

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [Artificial Intelligence](<https://devfeed.tech/topics/ai.md>), [generalization in machine learning](<https://devfeed.tech/topics/generalization-in-machine-learning.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [agent](<https://devfeed.tech/tags/agent.md>), [agentic](<https://devfeed.tech/tags/agentic.md>), [agents](<https://devfeed.tech/tags/agents.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [composition](<https://devfeed.tech/tags/composition.md>), [computing](<https://devfeed.tech/tags/computing.md>), [creativity](<https://devfeed.tech/tags/creativity.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [decision](<https://devfeed.tech/tags/decision.md>), [entanglement](<https://devfeed.tech/tags/entanglement.md>), [environment](<https://devfeed.tech/tags/environment.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [ibm-quantum](<https://devfeed.tech/tags/ibm-quantum.md>), [interaction](<https://devfeed.tech/tags/interaction.md>), [interactive](<https://devfeed.tech/tags/interactive.md>), [learning](<https://devfeed.tech/tags/learning.md>), [midi](<https://devfeed.tech/tags/midi.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 agentic orchestra uses quantum reinforcement learning to develop musical agents through interaction with a musical environment rather than large-dataset imitation. Parameterised quantum circuits operate in a hybrid quantum-classical loop; atomistic agents process pitch and rhythm separately, while holistic agents treat pitch and duration as unified note events. Musically grounded reward functions can be combined and weighted to shape agents' distinct compositional mindsets. The abstract reports generalisation to unseen material in interactive and offline MIDI modes, and musically meaningful learning on IBM quantum hardware. It presents the agents as adaptive musical partners; quantum computers remain in development.

### Source excerpt

arXiv:2611.24290v1 Announce Type: new Abstract: This paper presents a framework for computer-aided music composition and performance based on quantum reinforcement learning and multi-agent interaction. We introduce the agentic orchestra, where musical agents evolve distinct mindsets through trial-and-error engagement with a musical environment, rather than through training on large datasets. The agents are implemented as parameterised quantum circuits. They evolve distinct compositional behaviours, referred to as mindsets. This enables the exploration of musical decision spaces using quantum superposition and entanglement within a hybrid quantum-classical loop. We present two complementary agent architectures: atomistic agents, which process pitch and rhythm independently, and holistic agents, which handle pitch and duration as unified note events. Mindsets are shaped through musically grounded reward functions, which can be combined and weighted to develop different mindsets across agents. The resulting system positions quantum computing agents less as autonomous composers and more as adaptive musical partners, each developing its own musical personality through interaction rather than imitation. Demonstrations show how agents generalise their learned behaviour to previously unseen material, operating in interactive and offline batch modes using MIDI-encoded music. While quantum computers are still in development, experiments conducted on IBM quantum hardware confirmed that musically meaningful learning is achievable with existing quantum computers. For composers and performers, the agentic orchestra opens new possibilities for emergent, process-oriented musical creativity, offering a scalable foundation for quantum computer-aided music composition as quantum computing technology continues to advance.

## Efficient simulation of variational quantum circuits: representation, accuracy and CPU/GPU allocation

DevFeed: [Efficient simulation of variational quantum circuits: representation, accuracy and CPU/GPU allocation](<https://devfeed.tech/articles/efficient-simulation-of-variational-quantum-circuits-representation-accuracy-and-cpu-gpu-allocation-142982.md>)

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

Author: Vojt\\v{e}ch Nov\\'ak, Radovan Re\\v{c}ka, Ond\\v{r}ej Knebl, Ivan Zelinka

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

Content type: news

Language: en

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

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>)

Tags: [abstract](<https://devfeed.tech/tags/abstract.md>), [accelerate](<https://devfeed.tech/tags/accelerate.md>), [acceleration](<https://devfeed.tech/tags/acceleration.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [benefits](<https://devfeed.tech/tags/benefits.md>), [can](<https://devfeed.tech/tags/can.md>), [change](<https://devfeed.tech/tags/change.md>), [circuit](<https://devfeed.tech/tags/circuit.md>), [circuit-simulation](<https://devfeed.tech/tags/circuit-simulation.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [compare](<https://devfeed.tech/tags/compare.md>), [complete](<https://devfeed.tech/tags/complete.md>), [complex](<https://devfeed.tech/tags/complex.md>), [compression](<https://devfeed.tech/tags/compression.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [gpu](<https://devfeed.tech/tags/gpu.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>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

The study compares statevector simulation, direct Pauli evolution, and matrix product states for molecular and spin variational Hamiltonian ansätze and hardware-efficient circuits across CPU/GPU systems. In the tested implementations, direct Pauli evolution benefits complex molecular circuits, while GPUs accelerate wider spin and hardware-efficient circuits. Matrix product states can reduce cost when entanglement is limited enough for accurate compression. Corrected CPU FP32 met the tested tolerance but cost more than FP64. Allocation choices depend on workload size, startup costs, worker memory, and profiling: matched NumPy Pauli updates sped up two-layer full LiH by 3.45x, and a GPU was about 30x faster than 18-thread Aer for a 28-qubit, four-layer TFIM, both in FP64. The proposed procedure jointly selects representation, precision, and worker allocation by comparing complete energy-evaluation costs under accuracy, memory, and core constraints.

### Source excerpt

arXiv:2611.24444v1 Announce Type: cross Abstract: Classical circuit simulation supports quantum software development and verification and provides a baseline for assessing quantum advantage. We compare gate-based statevector simulation, direct Pauli evolution and matrix product states for molecular and spin Variational Hamiltonian Ansatze and hardware-efficient ansatze on CPU/GPU systems, varying width, depth, precision and resource allocation. In the tested implementations, direct Pauli evolution benefits complex molecular VHA, whereas GPUs accelerate wider spin and hardware efficient circuits. Matrix product state is useful when limited entanglement permits accurate compression; corrected CPU FP32 can meet the tested tolerance while costing more than FP64. Workload size, startup, worker memory and task-specific profiling can change the preferred allocation. Matched NumPy Pauli updates accelerate two-layer full LiH by 3.45-fold; the GPU gives approximately 30-fold acceleration over 18-thread Aer for 28-qubit, four-layer TFIM, both in FP64. We provide a procedure for choosing representation, precision and worker allocation jointly, comparing the cost of complete energy evaluations under accuracy, memory and core constraints.

## Quantum computing drops its decade-away tag as error rates fall 200-fold in two years

DevFeed: [Quantum computing drops its decade-away tag as error rates fall 200-fold in two years](<https://devfeed.tech/articles/quantum-computing-drops-its-decade-away-tag-as-error-rates-fall-200-fold-in-two-years-140708.md>)

Original publisher: [Read original article](<https://siliconangle.com/2026/11/18/quantum-error-correction-ushers-data-center-sc26/>)

Author: Ryan Stevens

Published: 2026-11-18T14:28:21Z

Content type: news

Language: en

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

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

Tags: [accelerated-computing](<https://devfeed.tech/tags/accelerated-computing.md>), [agentic-ai](<https://devfeed.tech/tags/agentic-ai.md>), [ai](<https://devfeed.tech/tags/ai.md>), [ai-data-centers](<https://devfeed.tech/tags/ai-data-centers.md>), [ai-inference](<https://devfeed.tech/tags/ai-inference.md>), [ai-infrastructure](<https://devfeed.tech/tags/ai-infrastructure.md>), [ai-supercomputers](<https://devfeed.tech/tags/ai-supercomputers.md>), [artificial-intelligence](<https://devfeed.tech/tags/artificial-intelligence.md>), [cloud](<https://devfeed.tech/tags/cloud.md>), [compute-express-link](<https://devfeed.tech/tags/compute-express-link.md>), [cube-event-coverage](<https://devfeed.tech/tags/cube-event-coverage.md>), [cxl](<https://devfeed.tech/tags/cxl.md>), [data-centers](<https://devfeed.tech/tags/data-centers.md>), [developer-tools](<https://devfeed.tech/tags/developer-tools.md>), [digital-twins](<https://devfeed.tech/tags/digital-twins.md>), [disaggregated-memory](<https://devfeed.tech/tags/disaggregated-memory.md>), [energy](<https://devfeed.tech/tags/energy.md>), [energy-efficiency](<https://devfeed.tech/tags/energy-efficiency.md>), [exascale-computing](<https://devfeed.tech/tags/exascale-computing.md>), [gemma-allen](<https://devfeed.tech/tags/gemma-allen.md>), [gpus](<https://devfeed.tech/tags/gpus.md>), [heterogeneous-computing](<https://devfeed.tech/tags/heterogeneous-computing.md>), [high-performance-computing](<https://devfeed.tech/tags/high-performance-computing.md>), [high-performance-storage](<https://devfeed.tech/tags/high-performance-storage.md>), [high-speed-networking](<https://devfeed.tech/tags/high-speed-networking.md>), [hpc](<https://devfeed.tech/tags/hpc.md>), [hpc-infrastructure](<https://devfeed.tech/tags/hpc-infrastructure.md>), [hpc-unites](<https://devfeed.tech/tags/hpc-unites.md>), [john-furrier](<https://devfeed.tech/tags/john-furrier.md>), [memory-pooling](<https://devfeed.tech/tags/memory-pooling.md>), [national-laboratories](<https://devfeed.tech/tags/national-laboratories.md>), [news](<https://devfeed.tech/tags/news.md>), [parallel-file-systems](<https://devfeed.tech/tags/parallel-file-systems.md>), [processors](<https://devfeed.tech/tags/processors.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-error-correction](<https://devfeed.tech/tags/quantum-error-correction.md>), [quantum-hpc-integration](<https://devfeed.tech/tags/quantum-hpc-integration.md>), [sc26](<https://devfeed.tech/tags/sc26.md>), [supercomputing](<https://devfeed.tech/tags/supercomputing.md>), [thecube](<https://devfeed.tech/tags/thecube.md>)

### AI overview

Quantinuum CEO Rajeeb Hazra says quantum error correction has sharply improved: the company reports up to a million operations with five errors, compared with 1,000 operations with one error two years earlier. Its 100-qubit Helios system reportedly reached logical fidelity equivalent to five errors per million operations. Quantinuum presents quantum computing as a tool AI could program for accurate simulations, including in pharma, energy, chemicals and finance, rather than as an AI rival. The company builds hardware and developer tools, has deals with two cloud providers, and describes personalized medicine as a possible longer-term application. These claims come from a sponsored interview; the excerpt does not establish broader independent validation or deployment timelines.

### Source excerpt

Quantum computing is shedding its reputation as speculative as gains in quantum error correction turn fragile machines into reliable ones. For the supercomputing community, which now measures data centers in gigawatts of power, the more pressing question is how quantum fits beside the processors already on the floor. For years, the field faced a trade-off [...] The post Quantum computing drops its decade-away tag as error rates fall 200-fold in two years appeared first on SiliconANGLE.

## 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 ...

## IBM Quantum Co-Design Platform With Fermilab and NVIDIA Targets Modular Systems, Plus a 79x Accuracy Gain on Fe4S4

DevFeed: [IBM Quantum Co-Design Platform With Fermilab and NVIDIA Targets Modular Systems, Plus a 79x Accuracy Gain on Fe4S4](<https://devfeed.tech/articles/ibm-quantum-co-design-platform-with-fermilab-and-nvidia-targets-modular-systems-plus-a-79x-accuracy-gain-on-fe4s4-138027.md>)

Original publisher: [Read original article](<https://www.storagereview.com/news/ibm-fermilab-nvidia-quantum-co-design-platform-slurm-qrmi-fe4s4-79x>)

Author: Harold Fritts

Published: 2026-11-17T15:30:58Z

Content type: news

Language: en

Sources: [StorageReview.com](<https://devfeed.tech/sources/storagereview-com.md>)

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

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [amd](<https://devfeed.tech/tags/amd.md>), [co-design](<https://devfeed.tech/tags/co-design.md>), [dgx](<https://devfeed.tech/tags/dgx.md>), [enterprise](<https://devfeed.tech/tags/enterprise.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [fermilab](<https://devfeed.tech/tags/fermilab.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [ibm-quantum](<https://devfeed.tech/tags/ibm-quantum.md>), [modular](<https://devfeed.tech/tags/modular.md>), [modular-quantum-computing](<https://devfeed.tech/tags/modular-quantum-computing.md>), [nighthawk](<https://devfeed.tech/tags/nighthawk.md>), [nvidia](<https://devfeed.tech/tags/nvidia.md>), [nvidia-dgx](<https://devfeed.tech/tags/nvidia-dgx.md>), [oak-ridge](<https://devfeed.tech/tags/oak-ridge.md>), [oak-ridge-national-laboratory](<https://devfeed.tech/tags/oak-ridge-national-laboratory.md>), [platform](<https://devfeed.tech/tags/platform.md>), [processor](<https://devfeed.tech/tags/processor.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>), [systems](<https://devfeed.tech/tags/systems.md>)

### AI overview

IBM, Fermilab, and NVIDIA plan a co-design platform pairing NVIDIA DGX B200 systems with IBM quantum computers to test multi-processor workflows and scale classical computing alongside quantum resources. Fermilab's SQMS Center contributes superconducting hardware and prospective interconnect and memory components. No site, system count, launch date, or Nighthawk revision is specified. Separately, IBM, NVIDIA, and Pasqal developed the vendor-agnostic QRMI interface for Slurm HRES, enabling QPU allocation, reservation, and accounting within existing HPC scheduling policies; NVIDIA says support arrives in Slurm 26.11, while IBM names no release. In a distinct IBM-RIKEN-NVIDIA Fe4S4 simulation, researchers combined quantum sampling with GPU classical computing. IBM reports 79-fold higher accuracy than its earlier runs and a result within 4.3 millihartree of DMRG, based on 5 million samples and circuits up to 4,000 two-qubit operations on 72 qubits. These are vendor-reported results; the quantum processor was not named and the work was not independently audited.

### Source excerpt

IBM, Fermilab, and NVIDIA plan to build a modular quantum computing co-design platform that puts NVIDIA DGX B200 systems alongside IBM quantum computers, including systems running the IBM Quantum Nighthawk processor. It follows the error correction platform IBM set up with Oak Ridge National Laboratory and AMD, and this one is aimed at the modular The post IBM Quantum Co-Design Platform With Fermilab and NVIDIA Targets Modular Systems, Plus a 79x Accuracy Gain on Fe4S4 appeared first on StorageReview.com.

## 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.

## No Convergence in Learned Eavesdropping-Detection Dynamics for BB84 Quantum Key Distribution

DevFeed: [No Convergence in Learned Eavesdropping-Detection Dynamics for BB84 Quantum Key Distribution](<https://devfeed.tech/articles/no-convergence-in-learned-eavesdropping-detection-dynamics-for-bb84-quantum-key-distribution-138743.md>)

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

Author: Ramon Jose C. Bagunu

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

Content type: news

Language: en

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

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

Tags: [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [detection](<https://devfeed.tech/tags/detection.md>), [eavesdropping](<https://devfeed.tech/tags/eavesdropping.md>), [game](<https://devfeed.tech/tags/game.md>), [information](<https://devfeed.tech/tags/information.md>), [learning](<https://devfeed.tech/tags/learning.md>), [noise](<https://devfeed.tech/tags/noise.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-key-distribution](<https://devfeed.tech/tags/quantum-key-distribution.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [response](<https://devfeed.tech/tags/response.md>), [window](<https://devfeed.tech/tags/window.md>)

### AI overview

The study finds that adaptive learning does not close the BB84 eavesdropping stealth window through stable convergence: across Q-Learning, SARSA, and Double Q-Learning, exploitability keeps fluctuating over 20 rounds, with swings matching best-response variance in control runs. Outcomes depend on channel noise: the window remains open at low noise, the detector contains the attacker on average at intermediate noise without settling, and high noise suppresses attacks through the channel itself. The authors examine last-mover information asymmetry as a possible mechanism and conclude that a detector cannot be certified from a single round; closing the window may require changing the information structure rather than merely out-adapting the attacker.

### Source excerpt

arXiv:2611.16372v1 Announce Type: cross Abstract: In prior work we showed that a reinforcement-learning eavesdropper can intercept BB84 quantum key distribution while holding the quantum bit error rate below the abort threshold and keeping a usable distillable key. In this paper we ask whether an equally adaptive learning detector can close this stealth window. We cast the interaction as an alternating best-response game between a tabular eavesdropper and a tabular threshold-adapting detector. We measure exploitability, which is the detection rate and distillable key fraction achieved by a fresh attacker best-responding to the final detector. Across three learning rules (Q-Learning, SARSA, Double Q-Learning), three channel-noise levels, and a uniform false-alarm discipline, the dynamics do not settle out to twenty rounds. The exploitability does not approach a fixed point, and its round-to-round swings do not decay. Two controls, one retraining the attacker against a frozen defender and one retraining the defender against a frozen attacker, show that the swings on each side match the variance of the best-response procedure itself. The dynamics fluctuate at the scale of best-response variance rather than converging, with neither player settling to a fixed response. The behavior is noise-dependent, and the stealth window stays open at the low noise where practical QKD operates. The defender contains the attacker on average at intermediate noise without the contest settling, and at high noise the channel rather than the learned policy suppresses the attack. As a candidate mechanism we examine a last-mover information asymmetry, supported by significant anti-persistence at intermediate noise and consistent with best-response noise at low noise. The results suggest that a learned detector cannot be certified from any single round, and that closing the window calls for breaking the information structure rather than out-adapting the attacker.

## Securing SIM-Assisted Wireless Networks via Quantum Reinforcement Learning

DevFeed: [Securing SIM-Assisted Wireless Networks via Quantum Reinforcement Learning](<https://devfeed.tech/articles/securing-sim-assisted-wireless-networks-via-quantum-reinforcement-learning-137012.md>)

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

Author: Le-Hung Hoang, Quang-Trung Luu, Dinh Thai Hoang, Diep N. Nguyen, Van-Dinh Nguyen

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

Content type: article

Language: en

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

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [communications](<https://devfeed.tech/topics/communications.md>), [network security](<https://devfeed.tech/topics/network-security.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>)

Tags: [circuit](<https://devfeed.tech/tags/circuit.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [ppo](<https://devfeed.tech/tags/ppo.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [reinforcement-learning](<https://devfeed.tech/tags/reinforcement-learning.md>), [security](<https://devfeed.tech/tags/security.md>), [sim](<https://devfeed.tech/tags/sim.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [wireless](<https://devfeed.tech/tags/wireless.md>)

### AI overview

The proposed hybrid quantum proximal policy optimization (QPPO) method jointly optimizes transmit power and stacked intelligent metasurface (SIM) phase shifts to maximize average secrecy rate subject to power and quality-of-service constraints. It embeds a parameterized quantum circuit in the actor network to improve policy representation and exploration in a high-dimensional continuous action space. The abstract reports simulations with imperfect eavesdropper channel information in which QPPO achieved about 15% higher secrecy rates and 30% faster convergence than deep reinforcement learning baselines. These are reported simulation results; the excerpt does not establish performance beyond the evaluated settings.

### Source excerpt

arXiv:2602.13238v3 Announce Type: replace Abstract: Stacked intelligent metasurfaces (SIMs) have recently emerged as a powerful wave-domain technology that enables multi-stage manipulation of electromagnetic signals through multilayer programmable architectures. While SIMs offer unprecedented degrees of freedom for enhancing physical-layer security, their extremely large number of meta-atoms leads to a high-dimensional and strongly coupled optimization space, making conventional design approaches inefficient and difficult to scale. Moreover, existing deep reinforcement learning (DRL) techniques suffer from slow convergence and performance degradation in dynamic wireless environments with imperfect knowledge of passive eavesdroppers. To address these challenges, we propose a hybrid quantum proximal policy optimization (QPPO) framework for SIM-assisted secure communications that jointly optimizes transmit power allocation and SIM phase shifts to maximize the average secrecy rate under power and quality-of-service constraints. Specifically, a parameterized quantum circuit is embedded into the actor network, forming a hybrid classical-quantum policy architecture that enhances policy representation capability and exploration efficiency in high-dimensional continuous action spaces. Extensive simulations demonstrate that the proposed Q-PPO scheme consistently outperforms DRL baselines, achieving approximately 15% higher secrecy rates and 30% faster convergence under imperfect eavesdropper channel state information. These results establish Q-PPO as a powerful optimization paradigm for SIM-enabled secure wireless networks.

## Quantum Computing-Based Wasserstein Generative Adversarial Networks for Airfoil Parameterization

DevFeed: [Quantum Computing-Based Wasserstein Generative Adversarial Networks for Airfoil Parameterization](<https://devfeed.tech/articles/quantum-computing-based-wasserstein-generative-adversarial-networks-for-airfoil-parameterization-139072.md>)

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

Author: Abdur Rahman Ovy, Xiaosong Du

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

Content type: article

Language: en

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

Topics: [Generative Adversarial Network](<https://devfeed.tech/topics/generative-adversarial-network.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>)

Tags: [adversarial](<https://devfeed.tech/tags/adversarial.md>), [airfoil](<https://devfeed.tech/tags/airfoil.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [design](<https://devfeed.tech/tags/design.md>), [distribution](<https://devfeed.tech/tags/distribution.md>), [generator](<https://devfeed.tech/tags/generator.md>), [quantum-circuits](<https://devfeed.tech/tags/quantum-circuits.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>)

### AI overview

The proposed Q-WGAN uses parameterized quantum circuits for its generator and a classical discriminator to parameterize airfoils represented by free-form deformation control points. On optimal airfoils from 992 aerodynamic design optimizations, it reports 92.1% mean fitting accuracy for control points and 99.2% for airfoil coordinates, close to classical WGAN results of 92.28% and 99.26%, respectively. Q-WGAN also has lower Jensen-Shannon divergence, Fréchet distance, and Wasserstein distance than the classical model, suggesting closer agreement with the reference airfoil distribution. The supplied abstract reports these results but does not provide further methodological details.

### Source excerpt

arXiv:2611.20602v1 Announce Type: new Abstract: Airfoil geometry parameterization is essential in aerodynamic design optimization. Optimization search in the large space suffers from low efficiency and modest feasible region, which could further incur failures to convergence. Generative adversarial networks (GAN), aiming to learn the statistical distribution of existing data, pave a new avenue for shape generation and airfoil parameterization. GAN manages to implicitly reduce design space by generating only smooth, realistic airfoils. Meanwhile, quantum computing has been emergingly exhibiting great potential for achieving superior performance in specific types of engineering problems but has not been introduced to airfoil parameterization. To fill this gap, this work develops quantum computing-based Wasserstein GAN (Q-WGAN) and investigates the performance for airfoil parameterization. The Q-WGAN adopts parameterized quantum circuits as the generator to promote the generative performance, while the discriminator remains classical. The developed Q-WGAN is demonstrated on a dataset of optimal airfoils parameterized by free-form deformation (FFD) control points, resulting from 992 airfoil aerodynamic design optimizations. Results show that Q-WGAN achieves 92.1% mean fitting accuracy on the optimal FFD control points and 99.2% accuracy on airfoil coordinates, comparable with the classical WGAN performance of 92.28% on FFD control points and 99.26% on airfoil coordinates. Q-WGAN achieves lower Jensen-Shannon divergence, Fr\'echet distance, and Wasserstein distance than the classical WGAN, indicating an improved agreement with the reference airfoil distribution. Therefore, this work presents a convincing evidence that Q-WGAN makes a viable option for parameterizing airfoils and possesses a great potential for other relevant engineering applications.

## Metamorphic Testing of Quantum Software based on Stabilizer States

DevFeed: [Metamorphic Testing of Quantum Software based on Stabilizer States](<https://devfeed.tech/articles/metamorphic-testing-of-quantum-software-based-on-stabilizer-states-137971.md>)

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

Author: Adri\\'an Mar\\'in Boyero, Fynn Otto, Albert Rico, Otfried G\\"uhne, Malte Lochau

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 Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Test automation](<https://devfeed.tech/topics/test-automation.md>)

Tags: [bug](<https://devfeed.tech/tags/bug.md>), [circuit](<https://devfeed.tech/tags/circuit.md>), [circuits](<https://devfeed.tech/tags/circuits.md>), [compiler](<https://devfeed.tech/tags/compiler.md>), [computing](<https://devfeed.tech/tags/computing.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [framework](<https://devfeed.tech/tags/framework.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [metamorphic-testing](<https://devfeed.tech/tags/metamorphic-testing.md>), [program](<https://devfeed.tech/tags/program.md>), [qiskit](<https://devfeed.tech/tags/qiskit.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-error-correction](<https://devfeed.tech/tags/quantum-error-correction.md>), [quantum-software](<https://devfeed.tech/tags/quantum-software.md>), [software](<https://devfeed.tech/tags/software.md>), [test-case](<https://devfeed.tech/tags/test-case.md>), [testing](<https://devfeed.tech/tags/testing.md>)

### AI overview

The paper proposes quantum metamorphic testing (QMT) to address the difficulty of checking quantum programs when states cannot be directly inspected. Its framework builds measurement procedures into metamorphic relations, using structural properties of stabilizer states to derive measurement circuits for new test cases from existing ones. Implemented in Qiskit for testing stabilizer-state preparation, it reportedly runs an order of magnitude faster than testing with randomly generated input states. The authors also report detecting synthetic faults introduced by circuit mutations and a real Qiskit compiler bug.

### Source excerpt

arXiv:2611.18838v1 Announce Type: cross Abstract: A major challenge in quantum computing is to systematically check if a quantum program implements its desired functionality. For classical programs, testing is widely used; each test case comprises a pair of sample input and expected output to be compared with the actual output. To increase the number of test cases, however, one has to solve the test-oracle problem: for each additional test input one has to know the correct output. Metamorphic testing tackles this problem by utilizing metamorphic relations between input and output domains to automatically derive new test cases from existing ones. However, adapting metamorphic testing to the quantum realm is not straightforward, since quantum states cannot be directly inspected. We propose a framework of quantum metamorphic testing (QMT) in which the metamorphic relations incorporate the measurement procedures required to assess quantum outputs. We apply our QMT framework to testing the preparation of stabilizer states, which are central to protocols like measurement-based quantum computing or quantum error correction. We utilize structural properties of stabilizer states to systematically derive measurement circuits for new test cases from existing ones. We implement this framework in Qiskit, and demonstrate that it reduces by an order of magnitude the testing run time compared to testing with randomly generated input states. We further show effectiveness by revealing synthetic program faults injected by circuit mutations, as well as a real bug in the Qiskit compiler.

## IBM's quantum bet: Run on classical what you can, on quantum what you must

DevFeed: [IBM's quantum bet: Run on classical what you can, on quantum what you must](<https://devfeed.tech/articles/ibm-s-quantum-bet-run-on-classical-what-you-can-on-quantum-what-you-must-136601.md>)

Original publisher: [Read original article](<https://www.networkworld.com/article/4249444/ibms-quantum-bet-run-on-classical-what-you-can-on-quantum-what-you-must.html>)

Author: Taryn Plumb

Published: 2026-11-17T03:19:35Z

Content type: news

Language: en

Sources: [Network World](<https://devfeed.tech/sources/network-world.md>)

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

Tags: [build](<https://devfeed.tech/tags/build.md>), [chip-interconnects](<https://devfeed.tech/tags/chip-interconnects.md>), [colocation](<https://devfeed.tech/tags/colocation.md>), [complex](<https://devfeed.tech/tags/complex.md>), [cpus-and-processors](<https://devfeed.tech/tags/cpus-and-processors.md>), [cpus-and-processors-data-center-high-performance-computing](<https://devfeed.tech/tags/cpus-and-processors-data-center-high-performance-computing.md>), [data-center](<https://devfeed.tech/tags/data-center.md>), [edition-us](<https://devfeed.tech/tags/edition-us.md>), [high-performance-computing](<https://devfeed.tech/tags/high-performance-computing.md>), [hybrid](<https://devfeed.tech/tags/hybrid.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [ibm-quantum](<https://devfeed.tech/tags/ibm-quantum.md>), [important](<https://devfeed.tech/tags/important.md>), [interconnects](<https://devfeed.tech/tags/interconnects.md>), [introduced](<https://devfeed.tech/tags/introduced.md>), [language-en](<https://devfeed.tech/tags/language-en.md>), [leave](<https://devfeed.tech/tags/leave.md>), [link](<https://devfeed.tech/tags/link.md>), [more](<https://devfeed.tech/tags/more.md>), [nighthawk](<https://devfeed.tech/tags/nighthawk.md>), [operations](<https://devfeed.tech/tags/operations.md>), [performance](<https://devfeed.tech/tags/performance.md>), [power](<https://devfeed.tech/tags/power.md>), [problems](<https://devfeed.tech/tags/problems.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [run](<https://devfeed.tech/tags/run.md>), [storytype-news](<https://devfeed.tech/tags/storytype-news.md>)

### AI overview

IBM's Nighthawk r3 is designed to scale quantum computing while improving speed: IBM says it supports 10,000 operations across 520 programmable qubits, is four times larger than r2, and has delivered workload-dependent speedups of 9x to 19x in early partner results. IBM plans to connect two r3 processors into a system exceeding 1,000 qubits by 2027. The strategy is hybrid: classical computers handle conventional work, while quantum processors run selected parts that may benefit from them. IBM's Quantum Platform brings both into a managed environment with error correction, mitigation, noise learning, and post-processing. Quantum remains error-prone and sensitive to disturbances; optimization workloads do not yet show consistent advantage, and some algorithms remain out of reach. IBM describes r3 as a step toward practical applications, while acknowledging substantial work remains through 2029.

### Source excerpt

More qubits can expand what a quantum computer attempts, but they do not, by themselves, make it useful. IBM's new Nighthawk r3 processor is intended to address that gap by increasing scale without giving up the speed and quality of its current generation. Nighthawk r3 is 4x larger than Nighthawk r2, speeds up processes up to 19x, and can execute 10,000 quantum operations across 520 qubits, IBM said. This allows it to tackle larger, more complex problems. But while it's building a bigger quantum processor, IBM isn't moving entire workloads onto it. Its strategy is hybrid: Leave conventional tasks to classical computers and isolate the work that calls for quantum. "This colocation of quantum and classical, and giving the right part of the problem to each one, is one of the most exciting and important research areas that we have right now, and in the near-term years to come," said Oliver Dial, VP for Quantum Systems at IBM. Nighthawk r3 a 'meaningful step' "The power of a quantum processor is related to its scale, the number of qubits, its quality, how many operations it can run, and its speed," Dial said. Scale, size, and quality support more complex computations, but speed determines whether they can be completed within reasonable timeframes at reasonable costs. IBM Quantum Nighthawk r2, which was introduced in September, represented what Dial called a "huge step forward in speed." Its qubit reset technology reduces the time between circuit executions, allowing applications to more efficiently collect the millions or billions of samples needed for complex computations. Nighthawk r3 will build on r2's performance, Dial said. It is designed to support 10,000 quantum operations on 520 programmable qubits, with 2034 physical qubits, and introduces 10 chip-to-chip interconnects, called l-couplers, designed to connect processors into larger systems. By 2027, IBM plans to link two Nighthawk r3's together into a single system with more than 1,000 qubits. The exact speedup u

## IBM, RIKEN, and NVIDIA Improve Iron-Sulfur Cluster Quantum-Calculation Accuracy 79-Fold: The Key Was the Starting Point, Not the Quantum Circuit

DevFeed: [IBM, RIKEN, and NVIDIA Improve Iron-Sulfur Cluster Quantum-Calculation Accuracy 79-Fold: The Key Was the Starting Point, Not the Quantum Circuit](<https://devfeed.tech/articles/ibm-riken-and-nvidia-improve-iron-sulfur-cluster-quantum-calculation-accuracy-79-fold-the-key-was-the-starting-point-not-the-quantum-circuit-136399.md>)

Original publisher: [Read original article](<https://joho-todai.com/en/ibm-riken-nvidia-quantum-accuracy-iron-sulfur-cluster/>)

Author: Toru Misaki

Published: 2026-11-17T01:53:07Z

Content type: article

Language: en

Sources: [Joho no Todai](<https://devfeed.tech/sources/joho-no-todai.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [High-Performance Computing](<https://devfeed.tech/topics/high-performance-computing.md>), [ibm](<https://devfeed.tech/topics/ibm.md>), [Nvidia](<https://devfeed.tech/topics/nvidia.md>)

Tags: [circuit](<https://devfeed.tech/tags/circuit.md>), [cluster](<https://devfeed.tech/tags/cluster.md>), [computing](<https://devfeed.tech/tags/computing.md>), [conference](<https://devfeed.tech/tags/conference.md>), [configuration](<https://devfeed.tech/tags/configuration.md>), [correlation](<https://devfeed.tech/tags/correlation.md>), [diagonalization](<https://devfeed.tech/tags/diagonalization.md>), [dimension](<https://devfeed.tech/tags/dimension.md>), [effectiveness](<https://devfeed.tech/tags/effectiveness.md>), [electron](<https://devfeed.tech/tags/electron.md>), [energy](<https://devfeed.tech/tags/energy.md>), [gap](<https://devfeed.tech/tags/gap.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [improvement](<https://devfeed.tech/tags/improvement.md>), [nvidia](<https://devfeed.tech/tags/nvidia.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-classical](<https://devfeed.tech/tags/quantum-classical.md>), [research](<https://devfeed.tech/tags/research.md>), [team](<https://devfeed.tech/tags/team.md>)

### AI overview

Changing SQD's classical reference state from restricted Hartree-Fock (RHF), which cannot represent the iron atoms' opposing spins, to broken-symmetry unrestricted Hartree-Fock (BS-UHF) with a Noodleman initial guess improved the reference energy by about 534 mHa. With that starting point, IBM's 88-qubit ibm_kingston processor collected 5 million samples; RIKEN's ROQUO GPU system handled configuration recovery. The direct SQD result was about 4.3 mHa from DMRG at bond dimension 4000. An extrapolation put their difference within the combined uncertainty. IBM's "79x closer" describes the reduced energy gap versus an earlier SQD result, not a speed gain. The workflow is quantum-classical and does not demonstrate quantum advantage; the excerpt also reports a smaller Fe₂S₂ demonstration on 40 qubits.

### Source excerpt

An IBM, RIKEN, and NVIDIA research team used quantum-classical computing to reduce the gap from the high-accuracy classical DMRG method to one-79th of the previous result for an iron-sulfur cluster. The largest improvement came from changing the classical calculation's starting point.

## IBM and AMD Open-Source Pelagos GPU Evaluation Platform for Quantum Error-Correction Decoders

DevFeed: [IBM and AMD Open-Source Pelagos GPU Evaluation Platform for Quantum Error-Correction Decoders](<https://devfeed.tech/articles/ibm-and-amd-open-source-pelagos-gpu-evaluation-platform-for-quantum-error-correction-decoders-136398.md>)

Original publisher: [Read original article](<https://joho-todai.com/en/ibm-amd-pelagos-quantum-error-correction-gpu/>)

Author: Toru Misaki

Published: 2026-11-17T01:21:57Z

Content type: news

Language: en

Sources: [Joho no Todai](<https://devfeed.tech/sources/joho-no-todai.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [rocm](<https://devfeed.tech/topics/rocm.md>), [ibm](<https://devfeed.tech/topics/ibm.md>), [Open Source](<https://devfeed.tech/topics/open-source.md>)

Tags: [accelerate](<https://devfeed.tech/tags/accelerate.md>), [accelerators](<https://devfeed.tech/tags/accelerators.md>), [amd](<https://devfeed.tech/tags/amd.md>), [amd-instinct-mi355x](<https://devfeed.tech/tags/amd-instinct-mi355x.md>), [computing](<https://devfeed.tech/tags/computing.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [framework](<https://devfeed.tech/tags/framework.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [platform](<https://devfeed.tech/tags/platform.md>), [power](<https://devfeed.tech/tags/power.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-error-correction](<https://devfeed.tech/tags/quantum-error-correction.md>), [qubits](<https://devfeed.tech/tags/qubits.md>), [research](<https://devfeed.tech/tags/research.md>), [throughput](<https://devfeed.tech/tags/throughput.md>)

### AI overview

Pelagos, an IBM and AMD open-source framework, uses GPUs to speed up validation of quantum error-correction decoders by simulating error patterns. It is implemented in Triton and supports NVIDIA (CUDA), AMD (ROCm/HIP), and Intel (SPIR-V) GPUs. Its Relay-BP-S decoder targets quantum LDPC codes. Reported results vary by workload and metric: eight MI355X GPUs reached 6.23x single-GPU speedup end to end for a one-gross circuit, while the decoding stage alone scaled 7.45x for a two-gross circuit; MI300X results were 5.68x and 7.58x, respectively. The earlier claim of up to 97x compares one GPU with a single CPU core and is not directly comparable. Pelagos requires a GPU; a separate Rust relay-bp implementation is available for CPUs.

### Source excerpt

Practical quantum computing requires not only capable qubits but also classical computing power to detect and correct errors. Pelagos, an open-source framework from IBM and AMD, targets that classical-computing bottleneck and achieved up to 97x the throughput of a single CPU core in earlier research.

## NVIDIA SC26: Rubin HPC GPU With 50,000 CUDA Cores Due in 2028, 192-CPU Vera Racks in Early 2027, and a 13,000x Quantum Decoder

DevFeed: [NVIDIA SC26: Rubin HPC GPU With 50,000 CUDA Cores Due in 2028, 192-CPU Vera Racks in Early 2027, and a 13,000x Quantum Decoder](<https://devfeed.tech/articles/nvidia-sc26-rubin-hpc-gpu-with-50-000-cuda-cores-due-in-2028-192-cpu-vera-racks-in-early-2027-and-a-13-000x-quantum-decoder-136081.md>)

Original publisher: [Read original article](<https://www.storagereview.com/news/nvidia-sc26-rubin-hpc-gpu-vera-cpu-hpc-rack-nemotron-for-science-quantum>)

Author: Brian Beeler

Published: 2026-11-16T16:49:16Z

Content type: news

Language: en

Sources: [StorageReview.com](<https://devfeed.tech/sources/storagereview-com.md>)

Topics: [High-Performance Computing](<https://devfeed.tech/topics/high-performance-computing.md>), [NVIDIA Vera](<https://devfeed.tech/topics/nvidia-vera.md>), [CUDA](<https://devfeed.tech/topics/cuda.md>), [CUDA-X](<https://devfeed.tech/topics/cuda-x.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [NVIDIA Vera Rubin](<https://devfeed.tech/topics/nvidia-vera-rubin.md>)

Tags: [ai](<https://devfeed.tech/tags/ai.md>), [computing](<https://devfeed.tech/tags/computing.md>), [cpu](<https://devfeed.tech/tags/cpu.md>), [cuda](<https://devfeed.tech/tags/cuda.md>), [decoder](<https://devfeed.tech/tags/decoder.md>), [enterprise](<https://devfeed.tech/tags/enterprise.md>), [gpu](<https://devfeed.tech/tags/gpu.md>), [hpc](<https://devfeed.tech/tags/hpc.md>), [nvidia](<https://devfeed.tech/tags/nvidia.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [rubin](<https://devfeed.tech/tags/rubin.md>), [rubin-hpc](<https://devfeed.tech/tags/rubin-hpc.md>), [sc26](<https://devfeed.tech/tags/sc26.md>), [vera](<https://devfeed.tech/tags/vera.md>)

### AI overview

NVIDIA's SC26 announcements span scientific computing, quantum systems, and AI networking. Rubin HPC, due in 2028, has more than 50,000 CUDA cores, sparse-data acceleration, and seventh-generation NVLink; NVIDIA has not disclosed its memory capacity, FP64 throughput, power, configurations, or comparisons with its current Rubin GPU. Vera HPC racks, expected from Dell, HPE, Lenovo, and Supermicro in early 2027, combine 192 CPUs with about 300TB of memory, 1PB of storage, and more than 200TB/s of peak aggregate memory bandwidth. NVIDIA reports performance and efficiency gains over unnamed x86 systems, but these vendor tests were not independently audited in the excerpt. Other announcements include the Nemotron for Science model package and CUDA-X libraries; a quantum codesign effort with IBM and Fermilab, alongside NVIDIA's claim that its TCBP-JOBS decoder is up to 13,000 times faster than existing algorithms; and Lambda's deployment of co-packaged optics switches across more than 10,000 GPUs. NVIDIA reports lower latency and temperature versus pluggable optics, with similar throughput.

### Source excerpt

NVIDIA has announced a new GPU for scientific computing at SC26. Rubin HPC is a member of the Vera Rubin platform that puts more than 50,000 CUDA cores on a single GPU, and NVIDIA expects it to be available in 2028. The rest of the company's SC26 slate covers a 192-CPU Vera rack for simulation The post NVIDIA SC26: Rubin HPC GPU With 50,000 CUDA Cores Due in 2028, 192-CPU Vera Racks in Early 2027, and a 13,000x Quantum Decoder appeared first on StorageReview.com.

## NVIDIA Expands Slurm to Bring Quantum Computing Into Supercomputing

DevFeed: [NVIDIA Expands Slurm to Bring Quantum Computing Into Supercomputing](<https://devfeed.tech/articles/nvidia-expands-slurm-to-bring-quantum-computing-into-supercomputing-136626.md>)

Original publisher: [Read original article](<https://blogs.nvidia.com/blog/slurm-quantum-computing-supercomputing/>)

Author: Sam Stanwyck

Published: 2026-11-16T16:00:47Z

Content type: release

Language: en

Sources: [NVIDIA](<https://devfeed.tech/sources/nvidia-blog.md>)

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Supercomputing](<https://devfeed.tech/topics/supercomputing.md>), [scheduling](<https://devfeed.tech/topics/scheduling.md>), [GPU](<https://devfeed.tech/topics/gpu.md>)

Tags: [ai-infrastructure](<https://devfeed.tech/tags/ai-infrastructure.md>), [computing](<https://devfeed.tech/tags/computing.md>), [deployments](<https://devfeed.tech/tags/deployments.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [nvidia](<https://devfeed.tech/tags/nvidia.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [slurm](<https://devfeed.tech/tags/slurm.md>), [software](<https://devfeed.tech/tags/software.md>), [supercomputing](<https://devfeed.tech/tags/supercomputing.md>)

### AI overview

Slurm's expansion is intended to reduce the bespoke work required to connect quantum processors (QPUs) to supercomputing centers. QPU builders can configure a single hardware interface in a file and reuse integrations across deployments; centers can add processors to existing scheduling and resource-management workflows. The expansion supports QRMI and QDMI, is being adopted by Alice & Bob, IBM, IQM, Pasqal, Quantinuum and MQSC, and is planned for Slurm 26.11. The excerpt also describes CUDA-Q platform updates, including quantum error-correction prototyping, fault-tolerant primitives, reusable application components and pulse-shaping tools. These are presented as parts of NVIDIA's open quantum-GPU platform; the excerpt does not establish comparative performance across providers or tools.

### Source excerpt

Quantum processor deployments at supercomputing centers have grown nearly sevenfold over the past five years, with nearly 30 supercomputing centers around the world now in the process of deploying over 50 quantum processors. Many of these centers use Slurm to run scientific supercomputing workloads, so expanding its support for quantum processors builds on familiar workflows [...]

## SC26: IBM shows progress in bringing quantum & HPC together

DevFeed: [SC26: IBM shows progress in bringing quantum & HPC together](<https://devfeed.tech/articles/sc26-ibm-shows-progress-in-bringing-quantum-hpc-together-136374.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/sc26>)

Author: Rafi Letzter

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

Content type: news

Language: en

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

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [High-Performance Computing](<https://devfeed.tech/topics/high-performance-computing.md>), [Supercomputing](<https://devfeed.tech/topics/supercomputing.md>), [scheduling](<https://devfeed.tech/topics/scheduling.md>), [Tool](<https://devfeed.tech/topics/tool.md>), [ibm](<https://devfeed.tech/topics/ibm.md>)

Tags: [2026](<https://devfeed.tech/tags/2026.md>), [accelerators](<https://devfeed.tech/tags/accelerators.md>), [amd](<https://devfeed.tech/tags/amd.md>), [co-design](<https://devfeed.tech/tags/co-design.md>), [conference](<https://devfeed.tech/tags/conference.md>), [decoder](<https://devfeed.tech/tags/decoder.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [hpc](<https://devfeed.tech/tags/hpc.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [news](<https://devfeed.tech/tags/news.md>), [partners](<https://devfeed.tech/tags/partners.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-error-correction-mitigation](<https://devfeed.tech/tags/quantum-error-correction-mitigation.md>), [quantum-systems](<https://devfeed.tech/tags/quantum-systems.md>), [sc26](<https://devfeed.tech/tags/sc26.md>), [tools](<https://devfeed.tech/tags/tools.md>), [workflows](<https://devfeed.tech/tags/workflows.md>)

### AI overview

IBM and partners are integrating quantum processors into established HPC workflows through scheduler tools, hybrid computing platforms, and reusable managed workflows. QRMI lets Slurm jobs request a QPU alongside CPUs and GPUs, while IBM and NVIDIA are integrating it with Slurm HRES. In research, an SQD calculation of an iron-sulfur cluster on RIKEN's ROQUO supercomputer came within 4.3 millihartree of DMRG, 79x closer than the team's earlier result; a separate quantum-HPC workflow simulated protein-ligand complexes up to 12,635 atoms. For error-correction research, IBM and AMD's open-source Pelagos uses Triton on AMD and NVIDIA GPUs to simulate decoder tests, running up to 97x faster than a single CPU core and scaling across multiple GPUs. IBM also describes managed quantum-classical workflows and options ranging from a free Open Plan to paid credits, Flex Plan access, or dedicated on-premises systems. The excerpt reports a planned IBM-NVIDIA-Fermilab co-design platform and does not provide its launch date.

### Source excerpt

At SC26 in Chicago, IBM and partners show how quantum computers are integrating into workflows and tools that the supercomputing workforce already runs.

## IBM, AMD advance quantum error correction decoding at scale

DevFeed: [IBM, AMD advance quantum error correction decoding at scale](<https://devfeed.tech/articles/ibm-amd-advance-quantum-error-correction-decoding-at-scale-136373.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/pelagos>)

Author: Blake Johnson; Robert Davis

Published: 2026-11-16T15:59:00Z

Content type: news

Language: en

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

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

Tags: [acceleration](<https://devfeed.tech/tags/acceleration.md>), [accelerators](<https://devfeed.tech/tags/accelerators.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [amd](<https://devfeed.tech/tags/amd.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-error-correction](<https://devfeed.tech/tags/quantum-error-correction.md>), [quantum-research](<https://devfeed.tech/tags/quantum-research.md>), [quantum-software](<https://devfeed.tech/tags/quantum-software.md>), [release](<https://devfeed.tech/tags/release.md>), [scale](<https://devfeed.tech/tags/scale.md>)

### AI overview

IBM and AMD released Pelagos, an open-source framework for evaluating quantum error-correction decoders at scale. Built with Triton, it supports AMD and NVIDIA GPUs and combines GPU acceleration with a reusable software architecture. Multi-GPU work uses process-level orchestration, parallel host-side operations and shared memory to reduce coordination overhead. Tests on AMD Instinct MI300X and MI355X showed up to roughly 7.5x speedup in the GPU decoding stage across eight GPUs versus one; the team also deployed Pelagos on ORNL's Lux HPC system. The excerpt says earlier studies found up to 97x higher throughput than a single CPU core. An accompanying survey reviews decoding methods and platforms including CPUs, GPUs, FPGAs and specialized accelerators, and argues that classical infrastructure and hardware-software co-design are key parts of building fault-tolerant quantum systems.

### Source excerpt

New open-source tool from IBM and AMD helps researchers evaluate quantum error-correction decoders at scale for future fault-tolerant quantum systems.

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