QRisk isolates backend-specific abnormal error patterns on NISQ devices via delta debugging and mitigates them with commuting gate swaps, cutting excess noise by 24-45% on IBM backends where noise models predict no difference.
hub Canonical reference
Almudever, and Sebastian Feld
Canonical reference. 89% of citing Pith papers cite this work as background.
32
Pith papers citing it
6
external citations · external index
Background
89% of classified citations
hub tools
citation-role summary
background 8
method 1
citation-polarity summary
representative citing papers
Qurator jointly optimizes queue time and fidelity for hybrid quantum-classical workflows across providers using quantum-aware DAG scheduling and a unified logarithmic fidelity score, achieving 30-75% wait reduction at high load with bounded accuracy cost.
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
Co-optimization of flexible Iceberg error-detection gadgets with QAOA via tree search improves success probability and post-selection on Quantinuum H2-1 hardware up to 34 algorithmic qubits.
AtomTreeSearch embeds a neutral-atom quantum MWIS subroutine inside Monte Carlo Tree Search and matches or exceeds OR-Tools and simulated annealing on TSP instances up to 100 cities.
Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.
Introduces Λ-lr-QAOA and piecewise-ramp QAOA that promote penalty schedules to variational parameters and use a feasibility-driven loss on budget-constrained MWIS satellite planning instances.
Coupling-Grouped XY-QAOA enables joint anomaly-feature selection via a constraint-preserving grouped-angle QAOA variant, achieving 45.9-61.3% circuit depth reduction and larger feasible executions (64 qubits at p=2) on IBM Heron hardware compared to standard approaches.
QML-PipeGuard is a framework for runtime behavioral fingerprinting of QML pipelines that absorbs benign drift while detecting adversarial channel substitution via informationally complete measurements.
A randomized, locally-guided belief-propagation decoder breaks degeneracy deadlocks in quantum error correction, reducing logical error rate and expensive global-decoder invocations by orders of magnitude.
For (2^k-1,k) random access codes the worst-case optimal classical success probability is 1/2 + 1/(2(2^k-1)); an explicit quantum construction provably beats it.
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
Presents a tensor-parallel distributed MPS method with block-cyclic partitioning and pivoted QR that emulates Google's RCS benchmark at bond dimension 16384 on 32 nodes, claiming three orders of magnitude better accuracy than prior methods.
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
The paper formalizes a hybrid quantum-classical architectural style and demonstrates a method that identifies decision boundaries for selecting configurations based on user QoS criteria.
A taxonomy-guided RAG system with LLMs reduces hallucinations and improves migration suggestions for Qiskit code compared to unconstrained retrieval.
An integrated compilation and data-driven QED framework raises algorithmic success probability by up to 68% over SABRE on an 8-qubit VQE instance in simulations.
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
Three complementary HPC-QC scheduling strategies cut classical resource use by up to 64% or improve QPU utilization depending on quantum-classical workload balance.
A new GPU quantum simulator framework achieves 64x-146x speedups for 20-28 qubit circuits via backend selection, gate fusion, and adaptive precision while integrating with Qiskit and others.
The paper introduces Recursive QLSTM via metacore recursion, numerically tests variants on sequence lengths, and offers theoretical arguments for better temporal propagation.
Peaked random circuits can serve as a high-precision system-level fidelity benchmark for NISQ devices, comparable to quantum volume but with greater sensitivity to interference effects.
Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.
Self-Modulating QFWP adds adaptive modulation to quantum fast-weight updates and memory to improve stability and performance on sequential learning tasks.
citing papers explorer
-
Isolating Recurring Execution-Dependent Abnormal Patterns on NISQ Quantum Devices
QRisk isolates backend-specific abnormal error patterns on NISQ devices via delta debugging and mitigates them with commuting gate swaps, cutting excess noise by 24-45% on IBM backends where noise models predict no difference.
-
Qurator: Scheduling Hybrid Quantum-Classical Workflows Across Heterogeneous Cloud Providers
Qurator jointly optimizes queue time and fidelity for hybrid quantum-classical workflows across providers using quantum-aware DAG scheduling and a unified logarithmic fidelity score, achieving 30-75% wait reduction at high load with bounded accuracy cost.
-
Routing Entanglement in Complex Quantum Networks Using GHZ States
A hybrid GHZ-BSM routing strategy outperforms pure BSM routing in square grid quantum networks but requires global-information adaptations to beat BSM in complex topologies such as Waxman, scale-free, and SURFnet.
-
Iceberg Beyond the Tip: Co-Compilation of a Quantum Error Detection Code and a Quantum Algorithm
Co-optimization of flexible Iceberg error-detection gadgets with QAOA via tree search improves success probability and post-selection on Quantinuum H2-1 hardware up to 34 algorithmic qubits.
-
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems
AtomTreeSearch embeds a neutral-atom quantum MWIS subroutine inside Monte Carlo Tree Search and matches or exceeds OR-Tools and simulated annealing on TSP instances up to 100 cities.
-
Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm
Introduces a parallelizable hybrid tensor network algorithm for time-evolving matrix product states that combines classical BUG integration with quantum methods without synchronization barriers.
-
Feasibility-driven QAOA with penalty scheduling
Introduces Λ-lr-QAOA and piecewise-ramp QAOA that promote penalty schedules to variational parameters and use a feasibility-driven loss on budget-constrained MWIS satellite planning instances.
-
Coupling-Grouped XY-QAOA for Joint Anomaly-Feature Selection
Coupling-Grouped XY-QAOA enables joint anomaly-feature selection via a constraint-preserving grouped-angle QAOA variant, achieving 45.9-61.3% circuit depth reduction and larger feasible executions (64 qubits at p=2) on IBM Heron hardware compared to standard approaches.
-
QML-PipeGuard: Drift-Aware Behavioral Fingerprinting for Quantum Machine Learning Pipeline Integrity
QML-PipeGuard is a framework for runtime behavioral fingerprinting of QML pipelines that absorbs benign drift while detecting adversarial channel substitution via informationally complete measurements.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
A randomized, locally-guided belief-propagation decoder breaks degeneracy deadlocks in quantum error correction, reducing logical error rate and expensive global-decoder invocations by orders of magnitude.
-
Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps
For (2^k-1,k) random access codes the worst-case optimal classical success probability is 1/2 + 1/(2(2^k-1)); an explicit quantum construction provably beats it.
-
Learning-Optimized Qubit Mapping and Reuse to Minimize Inter-Core Communication in Modular Quantum Architectures
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
-
Tensor-Parallel Emulation of Quantum Circuits with Block-Cyclic Distributed Matrix Product States
Presents a tensor-parallel distributed MPS method with block-cyclic partitioning and pivoted QR that emulates Google's RCS benchmark at bond dimension 16384 on 32 nodes, claiming three orders of magnitude better accuracy than prior methods.
-
Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
Constructions for universal quantum computation in the [[n,n-2,2]] error-detecting code detect single-gate errors at computation end, providing weak fault tolerance with reduced overhead versus full error correction.
-
Architecting Hybrid Quantum-Classical Software Systems: Exploration of the Design Trade-off Space with Quantitative Guarantees
The paper formalizes a hybrid quantum-classical architectural style and demonstrates a method that identifies decision boundaries for selecting configurations based on user QoS criteria.
-
Qiskit Code Migration with LLMs
A taxonomy-guided RAG system with LLMs reduces hallucinations and improves migration suggestions for Qiskit code compared to unconstrained retrieval.
-
Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems
An integrated compilation and data-driven QED framework raises algorithmic success probability by up to 68% over SABRE on an 8-qubit VQE instance in simulations.
-
Resource Management in Heterogeneous Quantum Repeater Networks
Proposes a heterogeneous quantum repeater network architecture using recursive designs and RuleSets with a new bridging building block, but states that full-scale resource trade-off analysis remains future work.
-
Three ways to share a QPU: Scheduling strategies for hybrid Quantum-HPC applications
Three complementary HPC-QC scheduling strategies cut classical resource use by up to 64% or improve QPU utilization depending on quantum-classical workload balance.
-
GPU-Accelerated Quantum Simulation: Empirical Backend Selection, Gate Fusion, and Adaptive Precision
A new GPU quantum simulator framework achieves 64x-146x speedups for 20-28 qubit circuits via backend selection, gate fusion, and adaptive precision while integrating with Qiskit and others.
-
Recursive QLSTM with Dynamic Variational Quantum Circuit Adaptation
The paper introduces Recursive QLSTM via metacore recursion, numerically tests variants on sequence lengths, and offers theoretical arguments for better temporal propagation.
-
Evaluating System-Level Fidelity with Peaked Random Circuits
Peaked random circuits can serve as a high-precision system-level fidelity benchmark for NISQ devices, comparable to quantum volume but with greater sensitivity to interference effects.
-
Quantum Walks-Based Adaptive Distribution Generation with Efficient CUDA-Q Acceleration
Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.
-
Self-Modulating Quantum Fast-Weight Programmers for Efficient Adaptive Sequential Learning
Self-Modulating QFWP adds adaptive modulation to quantum fast-weight updates and memory to improve stability and performance on sequential learning tasks.
-
Maximum Likelihood Decoding of Quantum Error Correction Codes
A topical review unifying statistical mechanics, tensor network, and AI approaches to approximate maximum likelihood decoding for quantum error correction codes.
-
Quantum Integrated High-Performance Computing: Foundations, Architectural Elements and Future Directions
The authors describe a visionary layered architecture for unifying classical and quantum compute resources under a single job submission and scheduling interface.
-
A Quantum Search Approach to Magic Square Constraint Problems with Classical Benchmarking
Grover quantum search with classical Siamese pre-processing generates magic squares on small grids and confirms the expected quadratic query advantage over brute-force and backtracking.
-
Qimax: Efficient quantum simulation via GPU-accelerated extended stabilizer formalism
Qimax parallelizes the extended stabilizer formalism for GPU execution and reports faster simulation of near-Clifford circuits than Qiskit or Pennylane in selected cases.
-
Introduction to QUDO, Tensor QUDO and HOBO formulations: Qudits, Equivalences, Knapsack Problem, Traveling Salesman Problem and Combinatorial Games
The paper reviews QUDO, T-QUDO and HOBO formulations, provides explicit encodings between them, discusses limitations, and gives examples for knapsack, TSP and games including N-Queens and Peg Solitaire.
-
Quantum-inspired tensor networks in machine learning models
Tensor networks developed for quantum states are reviewed as tools for machine learning models, with assessment of their potential computational, explanatory, and privacy advantages alongside remaining challenges.
-
The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
A synthesis of expert insights from the ADAC Quantum Computing Working Group and member survey on the complementary roles of quantum and classical high-performance computing in future hybrid infrastructures.
- Assessing student learning in quantum computing: Lessons from developing a test item on phase kickback