Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Integration

Hardware-validated reversible geometric greedy routing architecture using Hamming-distance evaluation on IBM quantum hardware

Naga Raju Bathula, Palepu Ashok

Published Nov 11, 2026• 0 citations
Publisher
DOI
10.1016/j.vlsi.2026.102929

Related papers

Near-optimal circuit mapping with reduced search paths on IBM quantum architectures

Lalengmawia Chhangte, Alok Chakrabarty

Microprocessors and Microsystems•Aug 23, 2022•4 citations

Hardware-validated parity-preserving reversible Vedic multiplier: Clifford+T resource analysis and IBM quantum evaluation

Naga Raju Bathula, Neeraj Kumar Misra

Arithmetic units constitute fundamental components of reversible-computing architectures, where circuit complexity, resource utilization, and hardware realizability are critical design considerations. This work presents a parity-preserving reversible 2 × 2 Vedic multiplier architecture constructed using existing N1, RF, A, and N3 reversible logic blocks and hierarchically extended to realize a 4 × 4 multiplier through a parity-preserving 4-bit ripple-carry adder structure. Comparative evaluation demonstrates competitive performance relative to representative reversible multiplier architectures. To evaluate implementation-oriented characteristics, the proposed architecture was mapped to the Clifford+T gate set and analyzed using hardware-aware resource metrics. The resulting realization exhibits a T-count of 35, a T-depth of 19, and a transpiled circuit depth of 55 without requiring SWAP operations. The proposed 2 × 2 multiplier core was experimentally validated on the IBM Quantum ibm_kingston superconducting processor based on the Heron r2 architecture through complete truth-table verification across all sixteen input combinations using 1024 measurement shots per experiment. The dominant measured output matched the expected multiplication result in every case, yielding an average success probability of 70.12% and an average Bhattacharyya fidelity of 0.7012. Calibration-based fidelity estimation using backend-reported gate fidelities yielded an estimated circuit fidelity of 0.7485, which is consistent with the experimentally observed average success probability of 70.12%. Hardware-aware circuit characterization, noise-model evaluation, and fidelity analysis were performed to assess implementation behavior under practical execution conditions. In addition, application-level arithmetic demonstrations involving Low-bit-width image-processing arithmetic examples were used solely as application-level demonstrations of multiplier functionality and do not constitute a complete quantum image-processing framework. The obtained results confirm the functional correctness, hardware compatibility, and resource efficiency of the proposed architecture and provide practical insights for future reversible arithmetic and quantum-computing applications.

e-Prime – Nexus of Electrical Electronic and Intelligent Engineering•Jul 27, 2026•0 citations

Hardware-validated quantum positive–negative neuron architecture for multi-channel EEG analysis

James Appenzeller

Hardware validation on IBM’s 133-qubit Heron processor demonstrates that a quantum neural architecture can reliably distinguish neural configurations with 99.3% discrimination quality. The A-Gate circuit encodes excitatory-inhibitory dynamics from EEG signals using paired qubits, achieving O(M) gate complexity for M-channel correlation encoding versus $$O(M^2)$$ classical computation on the symmetric positive definite (SPD) manifold. Transpilation to native CZ gates follows the predicted linear law over the implemented range ( $$14.1M - 17.5$$ , $$R^2 > 0.99$$ for $$M \le 8$$ ); extending to $$M = 32$$ reveals super-linear growth from topology-induced routing overhead, which we report as a hardware limitation distinct from the architecture’s O(M) logical complexity. Evaluation on the CHB-MIT Scalp EEG Database using leave-one-subject-out (LOSO) cross-validation across 22 subjects reveals a critical encoding bottleneck: the quantum fidelity classifier achieves 53.4% AUC compared to 62.5% for an 8-channel classical baseline. Notably, per-subject AUC ranges from 0.183 to 1.000, with sub-chance performance in some cases suggesting what we term manifold polarity, a hypothesized patient-specific geometric orientation that may cause cross-subject template mismatch. The gap between quantum and classical performance indicates that mapping EEG features to circuit parameters, not the A-Gate architecture itself, limits classification. We provide complexity analysis with corrections to common quantum-advantage overclaims, and we are explicit that the present results establish hardware feasibility and the location of the performance bottleneck rather than clinical utility.

Discover Quantum Science•Jul 31, 2026•1 citation

Quantum network routing algorithm based on Trusted Center

Shaosheng Jiang, Xiaojun Wen, Xincan Fan

•Apr 1, 2018•0 citations

Quantum-Enhanced LLM Cascade Routing: A QAOA Approach to Cost-Optimal Model Selection in Multi-Agent Systems

Amit Patole

The rapid proliferation of large language model (LLM) powered multi-agent systems creates a non-trivial combinatorial optimization problem: routing heterogeneous tasks to the most cost-effective model tier while maintaining quality guarantees. Current production systems rely on static lookup tables, which over-provision expensive models and waste computational budget. We formalize the LLM Cascade Routing Problem (LCRP) as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solve it using the Quantum Approximate Optimization Algorithm (QAOA). We benchmark QAOA against greedy heuristics and simulated annealing using both Google Cirq simulation and real IBM Quantum hardware (156-qubit Heron processors). Experiments across three IBM backends (ibm_fez, ibm_kingston, ibm_marrakesh) on problem instances from 6 to 18 qubits reveal three key findings: (i) shallow QAOA circuits (p=1, depth 52) achieve 15.4% valid assignment rate on real hardware versus 0.8% for deeper circuits (p=2, depth 101), demonstrating that NISQ noise favors shallow ansatze; (ii) hardware constraint satisfaction degrades steeply with problem size, dropping from 37-43% at 6 qubits to 0.2-0.3% at 18 qubits; and (iii) results are reproducible across all three backends with consistent valid rates within plus or minus 1.5%. To our knowledge, this is the first quantum computing formulation of the LLM model routing problem. We provide an open-source implementation and discuss the projected quantum advantage horizon.

•Apr 7, 2026•0 citations

Quantum vs. Classical Routing: A Hardware-Aware Study of QAOA and Dijkstra with Constrained Shortest Path and Constraint-Preserving Mixers

Quang Bui

•Jan 1, 2026•0 citations
Arithmetic units constitute fundamental components of reversible-computing architectures, where circuit complexity, resource utilization, and hardware realizability are critical design considerations. This work presents a parity-preserving reversible 2 × 2 Vedic multiplier architecture constructed using existing N1, RF, A, and N3 reversible logic blocks and hierarchically extended to realize a 4 × 4 multiplier through a parity-preserving 4-bit ripple-carry adder structure. Comparative evaluation demonstrates competitive performance relative to representative reversible multiplier architectures. To evaluate implementation-oriented characteristics, the proposed architecture was mapped to the Clifford+T gate set and analyzed using hardware-aware resource metrics. The resulting realization exhibits a T-count of 35, a T-depth of 19, and a transpiled circuit depth of 55 without requiring SWAP operations. The proposed 2 × 2 multiplier core was experimentally validated on the IBM Quantum ibm_kingston superconducting processor based on the Heron r2 architecture through complete truth-table verification across all sixteen input combinations using 1024 measurement shots per experiment. The dominant measured output matched the expected multiplication result in every case, yielding an average success probability of 70.12% and an average Bhattacharyya fidelity of 0.7012. Calibration-based fidelity estimation using backend-reported gate fidelities yielded an estimated circuit fidelity of 0.7485, which is consistent with the experimentally observed average success probability of 70.12%. Hardware-aware circuit characterization, noise-model evaluation, and fidelity analysis were performed to assess implementation behavior under practical execution conditions. In addition, application-level arithmetic demonstrations involving Low-bit-width image-processing arithmetic examples were used solely as application-level demonstrations of multiplier functionality and do not constitute a complete quantum image-processing framework. The obtained results confirm the functional correctness, hardware compatibility, and resource efficiency of the proposed architecture and provide practical insights for future reversible arithmetic and quantum-computing applications.
Hardware validation on IBM’s 133-qubit Heron processor demonstrates that a quantum neural architecture can reliably distinguish neural configurations with 99.3% discrimination quality. The A-Gate circuit encodes excitatory-inhibitory dynamics from EEG signals using paired qubits, achieving O(M) gate complexity for M-channel correlation encoding versus O(M2)O(M^2)O(M2) classical computation on the symmetric positive definite (SPD) manifold. Transpilation to native CZ gates follows the predicted linear law over the implemented range ( 14.1M−17.514.1M - 17.514.1M−17.5 , R2>0.99R^2 > 0.99R2>0.99 for M≤8M \le 8M≤8 ); extending to M=32M = 32M=32 reveals super-linear growth from topology-induced routing overhead, which we report as a hardware limitation distinct from the architecture’s O(M) logical complexity. Evaluation on the CHB-MIT Scalp EEG Database using leave-one-subject-out (LOSO) cross-validation across 22 subjects reveals a critical encoding bottleneck: the quantum fidelity classifier achieves 53.4% AUC compared to 62.5% for an 8-channel classical baseline. Notably, per-subject AUC ranges from 0.183 to 1.000, with sub-chance performance in some cases suggesting what we term manifold polarity, a hypothesized patient-specific geometric orientation that may cause cross-subject template mismatch. The gap between quantum and classical performance indicates that mapping EEG features to circuit parameters, not the A-Gate architecture itself, limits classification. We provide complexity analysis with corrections to common quantum-advantage overclaims, and we are explicit that the present results establish hardware feasibility and the location of the performance bottleneck rather than clinical utility.
The rapid proliferation of large language model (LLM) powered multi-agent systems creates a non-trivial combinatorial optimization problem: routing heterogeneous tasks to the most cost-effective model tier while maintaining quality guarantees. Current production systems rely on static lookup tables, which over-provision expensive models and waste computational budget. We formalize the LLM Cascade Routing Problem (LCRP) as a Quadratic Unconstrained Binary Optimization (QUBO) problem and solve it using the Quantum Approximate Optimization Algorithm (QAOA). We benchmark QAOA against greedy heuristics and simulated annealing using both Google Cirq simulation and real IBM Quantum hardware (156-qubit Heron processors). Experiments across three IBM backends (ibm_fez, ibm_kingston, ibm_marrakesh) on problem instances from 6 to 18 qubits reveal three key findings: (i) shallow QAOA circuits (p=1, depth 52) achieve 15.4% valid assignment rate on real hardware versus 0.8% for deeper circuits (p=2, depth 101), demonstrating that NISQ noise favors shallow ansatze; (ii) hardware constraint satisfaction degrades steeply with problem size, dropping from 37-43% at 6 qubits to 0.2-0.3% at 18 qubits; and (iii) results are reproducible across all three backends with consistent valid rates within plus or minus 1.5%. To our knowledge, this is the first quantum computing formulation of the LLM model routing problem. We provide an open-source implementation and discuss the projected quantum advantage horizon.