# Quantum Enablement

Quantum Enablement is an installable software library providing quantum software prototypes, tutorials, and tooling to help practitioners work with quantum hardware and Qiskit workflows.

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

## A Quasipolynomial Quantum Algorithm for the Vector Dihedral Coset Problem with Smooth Modulus

DevFeed: [A Quasipolynomial Quantum Algorithm for the Vector Dihedral Coset Problem with Smooth Modulus](<https://devfeed.tech/articles/a-quasipolynomial-quantum-algorithm-for-the-vector-dihedral-coset-problem-with-smooth-modulus-139260.md>)

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

Author: Aparna Gupte

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

Content type: article

Language: en

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

Topics: [Quantum Enablement](<https://devfeed.tech/topics/quantum-enablement.md>), [polynomials](<https://devfeed.tech/topics/polynomials.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quasipolynomial](<https://devfeed.tech/tags/quasipolynomial.md>), [vector](<https://devfeed.tech/tags/vector.md>)

### AI overview

The paper presents a quantum algorithm that recovers the hidden vector in the vector dihedral coset problem when the modulus is B-smooth. It reduces the modulus one prime factor at a time and uses a sieving procedure to cancel nonlinear phase terms modulo each prime. The stated sample and time complexity is n^{O(B^{1+o(1)} log q)}B^{O(B^{2+o(1)} log q)}; for B=polylog(n) and q=poly(n), both are quasipolynomial. The approach also applies to EDCP, but does not give a new LWE attack: the known LWE-to-EDCP reduction supplies only polynomially many clean samples, fewer than this algorithm requires. The abstract says concurrent work gives similar guarantees for prime-power moduli.

### Source excerpt

arXiv:2611.18857v1 Announce Type: cross Abstract: We give a quantum algorithm for the vector dihedral coset problem over $\mathbb{Z}_q^n$, in which the goal is to recover $\mathbf{s} \in \mathbb{Z}_q^n$ given independent samples of the form $\frac{1}{\sqrt{2}}\bigl(|{0,\mathbf{x}}\rangle+|{1,\mathbf{x}+\mathbf{s}}\rangle\bigr)$, for $\mathbf{x}\sim \mathbb{Z}_q^n$. When the modulus $q$ is $B$-smooth, the algorithm uses $n^{O(B^{1+o(1)}\log q)}B^{O(B^{2+o(1)}\log q)}$ samples and time. For $B = \mathrm{polylog}(n)$ and $q=\mathrm{poly}(n)$, this gives a quasipolynomial time- and sample-complexity. This extends the previously known quasipolynomial-time result for power-of-two moduli (Bonnetain, Naya-Plasencia, ASIACRYPT 2018; Bai, Jangir, Kirshanova, Ngo, Youmans, CRYPTO 2025). The algorithm proceeds by reducing the modulus one prime factor $p | q$ at a time. The key ingredient is a sieving procedure that clears the non-linear terms in the phase modulo $p$ via an algorithm of Ivanyos, Santha (TCS 2017) that finds non-zero $\mathbf{u} \in \mathbb{F}_p^\ell$ such that $\sum_{i \in [\ell]} u_i^d \mathbf{a}_i = 0 \mod p$ for degrees $1 \le d \le p-1$, given vectors $\mathbf{a}_1, \ldots, \mathbf{a}_\ell \in \mathbb{F}_p^n$ as input. The algorithm also applies to the extrapolated dihedral coset problem (EDCP) introduced by Brakerski, Kirshanova, Stehl\'e, Wen (PKC 2018), which is known to be equivalent to LWE in the polynomial sample regime. However, our result does not yield a new attack on LWE in any regime, precisely because the known reduction from LWE to EDCP provides only polynomially many clean samples, whereas our algorithm requires quasipolynomially many samples. The main algorithm was obtained in a GPT-5.6 Sol conversation prompted by the author; the author is responsible for all statements, proofs, and correctness. Concurrent work of Boucher, Fouque, Shen gives an algorithm with similar guarantees for prime-power moduli.

## QuSema: Detecting Silent Bugs in Quantum Libraries via Quantum-knowledge-enhanced Agents

DevFeed: [QuSema: Detecting Silent Bugs in Quantum Libraries via Quantum-knowledge-enhanced Agents](<https://devfeed.tech/articles/qusema-detecting-silent-bugs-in-quantum-libraries-via-quantum-knowledge-enhanced-agents-137938.md>)

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

Author: Yujin Song, Kaining Zhang, Qixin Zhang, Shuai Wang, Pingchuan Ma, Yuxuan Du

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

Content type: article

Language: en

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

Topics: [Test automation](<https://devfeed.tech/topics/test-automation.md>), [AI-assisted coding](<https://devfeed.tech/topics/ai-assisted-coding.md>), [Quantum Enablement](<https://devfeed.tech/topics/quantum-enablement.md>)

Tags: [agents](<https://devfeed.tech/tags/agents.md>), [api](<https://devfeed.tech/tags/api.md>), [autonomous-testing](<https://devfeed.tech/tags/autonomous-testing.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [bugs](<https://devfeed.tech/tags/bugs.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-se](<https://devfeed.tech/tags/cs-se.md>), [documentation](<https://devfeed.tech/tags/documentation.md>), [libraries](<https://devfeed.tech/tags/libraries.md>), [qiskit](<https://devfeed.tech/tags/qiskit.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [reasoning](<https://devfeed.tech/tags/reasoning.md>), [semantic](<https://devfeed.tech/tags/semantic.md>), [semantics](<https://devfeed.tech/tags/semantics.md>), [test](<https://devfeed.tech/tags/test.md>), [testing](<https://devfeed.tech/tags/testing.md>), [tests](<https://devfeed.tech/tags/tests.md>)

### AI overview

QuSema targets silent bugs in quantum libraries, which failure-based and comparison-based testing can miss when suitable execution oracles are unavailable. It uses quantum semantics and API documentation as a source-level oracle: an agent loop inspects documentation and code, reasons about intended operation behavior, then generates executable API tests to validate suspected deviations and produce user-triggerable bug reports. Implemented for Qiskit and PennyLane, it achieved higher mean bug relocation counts than Claude Code and Codex on 20 historical silent bugs; its DeepSeek configuration cost less than Claude Code. Developers confirmed 40 previously unknown bugs, including 30 silent bugs.

### Source excerpt

arXiv:2610.10258v2 Announce Type: replace Abstract: Quantum libraries are now critical infrastructure for quantum algorithm development, yet their correctness remains difficult to test. Existing testing techniques mainly rely on failure-based or comparison-based oracles, exposing bugs only when executions fail, violate runtime checks, or disagree with another implementation. Their applicability is limited when suitable execution-based oracles are unavailable, leaving some silent bugs undetected. Such missed bugs can produce incorrect results that propagate into experimental conclusions, simulation studies, and algorithmic designs. Here we present QuSema, an autonomous testing agent for finding silent bugs in quantum libraries. QuSema uses constraints from quantum semantics and documentation as a source-level semantic oracle to assess whether implementation logic can produce invalid outputs from valid inputs. It operates through an agentic loop that repeatedly inspects library API documentation and source code, reasons about the intended behavior of quantum operations, identifies potential semantic deviations, and validates them by generating executable tests through library APIs. Guided by quantum-domain reasoning, QuSema turns high-level behavioral mismatches into concrete, user-triggerable bug reports, enabling it to uncover non-crash defects. We implement QuSema for Qiskit and PennyLane. On a benchmark of 20 historical silent bugs, QuSema achieves higher mean bug relocation counts than Claude Code and Codex, with the DeepSeek configuration costing less than Claude Code. QuSema also discovers 40 previously unknown bugs confirmed by the developers, including 30 silent bugs.

## QDC 2026: what quantum developers need to know

DevFeed: [QDC 2026: what quantum developers need to know](<https://devfeed.tech/articles/qdc-2026-what-quantum-developers-need-to-know-129810.md>)

Original publisher: [Read original article](<https://research.ibm.com/blog/dev-tools-qdc-2026>)

Author: Genya Crossman; Sanskriti Deva; Robert Davis

Published: 2026-11-11T11:59:00Z

Content type: article

Language: en

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

Topics: [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [High-Performance Computing](<https://devfeed.tech/topics/high-performance-computing.md>), [Quantum Enablement](<https://devfeed.tech/topics/quantum-enablement.md>), [Tool](<https://devfeed.tech/topics/tool.md>), [Learning](<https://devfeed.tech/topics/learning.md>)

Tags: [1-5](<https://devfeed.tech/tags/1-5.md>), [2](<https://devfeed.tech/tags/2.md>), [2026](<https://devfeed.tech/tags/2026.md>), [3](<https://devfeed.tech/tags/3.md>), [about](<https://devfeed.tech/tags/about.md>), [abstractions](<https://devfeed.tech/tags/abstractions.md>), [academic](<https://devfeed.tech/tags/academic.md>), [academic-research](<https://devfeed.tech/tags/academic-research.md>), [conference](<https://devfeed.tech/tags/conference.md>), [developer](<https://devfeed.tech/tags/developer.md>), [developers](<https://devfeed.tech/tags/developers.md>), [guide](<https://devfeed.tech/tags/guide.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [ibm](<https://devfeed.tech/tags/ibm.md>), [ibm-quantum](<https://devfeed.tech/tags/ibm-quantum.md>), [know](<https://devfeed.tech/tags/know.md>), [need](<https://devfeed.tech/tags/need.md>), [news](<https://devfeed.tech/tags/news.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-enablement](<https://devfeed.tech/tags/quantum-enablement.md>), [quantum-error-correction-mitigation](<https://devfeed.tech/tags/quantum-error-correction-mitigation.md>), [quantum-software](<https://devfeed.tech/tags/quantum-software.md>), [quantum-systems](<https://devfeed.tech/tags/quantum-systems.md>), [software](<https://devfeed.tech/tags/software.md>), [workflows](<https://devfeed.tech/tags/workflows.md>)

### AI overview

QDC 2026's main developer takeaway is that IBM is exposing more control over real hardware while adding tools to build, inspect, and scale quantum workflows. Nighthawk r2 offers 120 programmable qubits, pulse-level access, dynamic circuits and fast reset; the excerpt also describes a repetition-code experiment with one million measurement and reset rounds, though `for_loop` and the `qec_experimental` calibration are experimental, and `for_loop` is currently limited to Executor and client-side Sampler jobs. The directed execution model pairs Samplomatic with Executor for inspectable circuit transformations and execution; client-side Sampler and Estimator expose pre- and post-processing, including error mitigation, for customization. Managed quantum-classical workflows require Premium or Flex plans, while dry-run usage estimates consume no QPU time. For applications, Qiskit Fermions and Bosons defer encoding until transpilation, and `ffsim` supports classical validation before hardware runs. QRMI offers a vendor-agnostic interface for integrating supported quantum backends into HPC workflows. The excerpt also outlines expanded free access for qualifying active Open Plan users.

### Source excerpt

A developer's guide to the hardware, software, and workflows unveiled at IBM Quantum Developer Conference 2026.

## Trained, Frozen, or Absent: Identifying What a Quantum Layer Contributes to Cross-Sectional Equity Ranking

DevFeed: [Trained, Frozen, or Absent: Identifying What a Quantum Layer Contributes to Cross-Sectional Equity Ranking](<https://devfeed.tech/articles/trained-frozen-or-absent-identifying-what-a-quantum-layer-contributes-to-cross-sectional-equity-ranking-126017.md>)

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

Author: Chi-Sheng Chen, Xinyu Zhang, En-Jui Kuo, Rong Fu, Qiuzhe Xie, Fan Zhang

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

Content type: article

Language: en

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

Topics: [Quantum Enablement](<https://devfeed.tech/topics/quantum-enablement.md>), [Finance](<https://devfeed.tech/topics/finance.md>), [AI Models](<https://devfeed.tech/topics/ai-models.md>), [quantum mechanics](<https://devfeed.tech/topics/quantum-mechanics.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [backtest](<https://devfeed.tech/tags/backtest.md>), [best](<https://devfeed.tech/tags/best.md>), [bootstrap](<https://devfeed.tech/tags/bootstrap.md>), [but](<https://devfeed.tech/tags/but.md>), [circuit](<https://devfeed.tech/tags/circuit.md>), [code](<https://devfeed.tech/tags/code.md>), [components](<https://devfeed.tech/tags/components.md>), [condition](<https://devfeed.tech/tags/condition.md>), [contribution](<https://devfeed.tech/tags/contribution.md>), [control](<https://devfeed.tech/tags/control.md>), [cross](<https://devfeed.tech/tags/cross.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [daily](<https://devfeed.tech/tags/daily.md>), [days](<https://devfeed.tech/tags/days.md>), [equity](<https://devfeed.tech/tags/equity.md>), [layer](<https://devfeed.tech/tags/layer.md>), [q-fin-cp](<https://devfeed.tech/tags/q-fin-cp.md>), [quant-ph](<https://devfeed.tech/tags/quant-ph.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [ranking](<https://devfeed.tech/tags/ranking.md>)

### AI overview

In this study of daily cross-sectional ranking for 2,000 Tokyo Stock Exchange equities, the trained quantum circuit performed equivalently to a frozen circuit within 0.03 annualized Sharpe on 500 out-of-sample days (p = 0.0055). The protocol compared six configurations through one code path, using four walk-forward folds, five seeds, classical baselines, statistical controls, and a locked holdout. When the circuit was the ranking head's only input, trained and frozen versions were equivalent within 0.25; comparison with a network without a circuit resolved only a 0.50 difference. No condition was distinguishable from zero (best Deflated Sharpe Ratio: 0.17). The holdout reproduced the ablation on a profitable window, while a test on 2,000 U.S. equities reproduced it in a setting where every condition lost money.

### Source excerpt

arXiv:2611.10801v1 Announce Type: cross Abstract: Hybrid quantumclassical models are increasingly proposed for nancial prediction, but reported gains are rarely separated from the classical components around them. We study a hybrid quantum temporal convolutional network for daily cross-sectional ranking of 2000 Tokyo Stock Exchange equities under a protocol built to make the quantum contribution identiable: six conditions (circuit trained, frozen or absent, a parameter-matched classical surrogate, and the circuit alone, trained or frozen) through one code path; four walk-forward folds with ve seeds; bootstrap intervals, Deated Sharpe Ratios, backtest-overtting probabilities and family-wise error control; ve classical baselines including a gradient-boosted tree; and a locked holdout. On 500 out-of-sample days two one-sided tests place the trained-versus-frozen dierence inside 0.03 annualised Sharpe (p = 0.0055, minimum detectable eect 0.02): the circuit is equivalent to a frozen one, not merely indistinguishable from it. With the circuit as the head's only input the two are equivalent inside 0.25; against the network with no circuit the design resolves only 0.50. No condition is distinguishable from zero (best De-ated Sharpe Ratio 0.17). The holdout reproduces the ablation on a protable window, and 2000 US equities reproduce it where every condition loses money.

## Cisco quantum network controller lets apps order entanglement on demand

DevFeed: [Cisco quantum network controller lets apps order entanglement on demand](<https://devfeed.tech/articles/cisco-quantum-network-controller-lets-apps-order-entanglement-on-demand-67052.md>)

Original publisher: [Read original article](<https://www.helpnetsecurity.com/2026/10/08/cisco-quantum-network-controller-research-prototype/>)

Author: Anamarija Pogorelec

Published: 2026-10-07T22:33:09Z

Content type: news

Language: en

Sources: [Help Net Security](<https://devfeed.tech/sources/help-net-security.md>)

Topics: [Quantum Enablement](<https://devfeed.tech/topics/quantum-enablement.md>), [API](<https://devfeed.tech/topics/api.md>), [Quantum Computing](<https://devfeed.tech/topics/quantum-computing.md>), [Python](<https://devfeed.tech/topics/python.md>)

Tags: [cisco](<https://devfeed.tech/tags/cisco.md>), [computing](<https://devfeed.tech/tags/computing.md>), [device](<https://devfeed.tech/tags/device.md>), [entanglement](<https://devfeed.tech/tags/entanglement.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [network](<https://devfeed.tech/tags/network.md>), [networking](<https://devfeed.tech/tags/networking.md>), [news](<https://devfeed.tech/tags/news.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computing](<https://devfeed.tech/tags/quantum-computing.md>), [quantum-network](<https://devfeed.tech/tags/quantum-network.md>), [qubits](<https://devfeed.tech/tags/qubits.md>), [research-prototype](<https://devfeed.tech/tags/research-prototype.md>)

### AI overview

Cisco's Quantum Network Controller is a research prototype that lets applications request entanglement while software schedules its delivery across quantum network hardware. The article describes a device abstraction layer, automatic link monitoring and recovery, and a February 2026 test that distributed entanglement across 17.6 kilometers of commercial fiber with fidelity above 99 percent. A network-aware quantum compiler is its first native application.

### Source excerpt

Cisco has built a Quantum Network Controller, a research prototype that lets an application ask a quantum network for entanglement and leaves the network to work out the delivery. Entanglement, a linked quantum state shared between distant points, is the resource these networks distribute, and operators today set up the hardware that produces it device by device, link by link. Single quantum processors still hold fewer qubits than the work requires, so more capacity has ... More -> The post Cisco quantum network controller lets apps order entanglement on demand appeared first on Help Net Security.

## IonQ | Introducing Hardware Noise Model Simulation for IonQ Aria and IonQ Harmony

DevFeed: [IonQ | Introducing Hardware Noise Model Simulation for IonQ Aria and IonQ Harmony](<https://devfeed.tech/articles/ionq-introducing-hardware-noise-model-simulation-for-ionq-aria-and-ionq-harmony-83841.md>)

Original publisher: [Read original article](<https://ionq.com/blog/october-10-2022-hardware-noise-model-simulation-for-ionq-aria-and-ionq-harmony>)

Author: IonQ Staff

Published: 2026-01-15T23:19:20Z

Content type: release

Language: en

Sources: [IonQ](<https://devfeed.tech/sources/ionq.md>)

Topics: [Quantum Enablement](<https://devfeed.tech/topics/quantum-enablement.md>), [Advanced AI workflows](<https://devfeed.tech/topics/advanced-ai-workflows.md>)

Tags: [api](<https://devfeed.tech/tags/api.md>), [developer-tooling](<https://devfeed.tech/tags/developer-tooling.md>), [developer-workflows](<https://devfeed.tech/tags/developer-workflows.md>), [google-cloud](<https://devfeed.tech/tags/google-cloud.md>), [guide](<https://devfeed.tech/tags/guide.md>), [hardware](<https://devfeed.tech/tags/hardware.md>), [prototyping](<https://devfeed.tech/tags/prototyping.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-computer](<https://devfeed.tech/tags/quantum-computer.md>), [simulation](<https://devfeed.tech/tags/simulation.md>)

### AI overview

IonQ added calibrated hardware noise model simulations for Aria and Harmony to IonQ Quantum Cloud. The simulations approximate how quantum circuits may behave on those systems, helping developers account for noise while prototyping. IonQ says the models are simplified and should not be treated as precise predictions or substitutes for running certain algorithms on hardware.

### Source excerpt

Guide on specific characteristics of IonQ hardware when prototyping quantum solutions

## IonQ | IonQ Acquires Entangled Networks to Drive Further Quantum Scale

DevFeed: [IonQ | IonQ Acquires Entangled Networks to Drive Further Quantum Scale](<https://devfeed.tech/articles/ionq-ionq-acquires-entangled-networks-to-drive-further-quantum-scale-83803.md>)

Original publisher: [Read original article](<https://ionq.com/blog/ionq-acquires-entangled-networks-to-drive-further-quantum-scale>)

Author: IonQ Staff

Published: 2026-01-15T23:19:20Z

Content type: news

Language: en

Sources: [IonQ](<https://devfeed.tech/sources/ionq.md>)

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

Tags: [compiler](<https://devfeed.tech/tags/compiler.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [leadership](<https://devfeed.tech/tags/leadership.md>), [quantum](<https://devfeed.tech/tags/quantum.md>), [quantum-network](<https://devfeed.tech/tags/quantum-network.md>)

### AI overview

IonQ says it acquired Entangled Networks' assets and will bring its team into IonQ Canada to develop networking technologies for connecting quantum processors. The companies aim to distribute workloads across modular systems, and IonQ says it plans to demonstrate a network between two quantum computers later that year.

### Source excerpt

Working to build the world's best quantum computers to solve the world's most complex problems