A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.
Canonical reference
Feedback connections in quan- tum reservoir computing with mid-circuit measurements
Canonical reference. 78% of citing Pith papers cite this work as background.
28
Pith papers citing it
Background
78% of classified citations
citation-role summary
background 8
other 1
citation-polarity summary
years
2026 28representative 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 quantum reservoir network using GHZ-state preparation achieves an order-of-magnitude RMSE improvement over prior QRN designs on latent-space prediction of the Kuramoto-Sivashinsky equation.
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.
QCPIKAN is a quantum-classical physics-informed KAN that claims exponential high-frequency error convergence and superior accuracy over prior QCPINNs on single-phase, transport, and two-phase seepage PDEs.
Implicit ZNE parameter choices flip significance in ~12% of tested configurations and hardware drift changes apparent effect size up to 3.4×, so QEM benchmarks need stricter statistical reporting.
Exact T-count minimization via precomputed optimal libraries up to 7 variables and Clifford canonicalization yields up to 14.3% T reduction on EPFL benchmarks and 40% on cryptographic modules.
Noise from quantum hardware simulators significantly alters mutant detection distances, making equivalent mutants harder to separate from faults, with output-distribution metrics reaching 73.03% accuracy and 74.89% F1-score under device-specific thresholds.
Introduces tunable partial-SWAP for controllable memory capacity in quantum reservoir networks, modeled as controlled amplitude-damping and validated via STMC and NARMA-5 benchmarks on simulators and IBM QPUs.
Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.
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.
A teleportation-based parallelization architecture for neutral-atom quantum error correction delivers up to 3x speedup over extractor methods at fixed space cost and enables simulated quantum advantage at 11,495 atoms and 15-hour runtime.
PQC software implementation is a socio-technological problem whose challenges span interdependent Human, Organisation and Technology factors; the PQC-HOT model organises them for analysis and planning.
Introduces bounded old-state modulation via tanh gate to stabilize self-modulating QFWPs, with evaluations showing reduced divergence and improved robustness on quantum dynamics and SMS tasks.
Performance evaluation of iPIC3D, PLUTO, and OpenGadget3 on RISC-V shows 3-9x slowdowns versus x86 and ARM due to bandwidth, cache, vector width, and compiler issues.
FPQC-SAC adds a bounded parameterized quantum circuit to SAC to constrain representations in low-SNR financial environments, reporting 66.89% higher cumulative returns than standard SAC on real portfolio tasks.
QADR decomposes n-qubit VQCs into local sub-circuits to reduce memory from O(2^n) to O(n * 2^{2d+1}) and mitigate barren plateaus, scaling to 2000 features on MNIST and wind turbine diagnostics while matching classical models.
Introduces a toolbox for studying energy gaps, eigenstate structure, and optimization dynamics in quantum annealing formulations of database problems.
A threshold-pruned distributed inverse QFT reduces per-node entanglement to a constant and global communication from O(P²) to O(P) while claiming to preserve correctness.
DQR enables efficient scheduling and failover for cut quantum circuit fragments across local QPUs and remote simulators on real HPC hardware with low coordination overhead.
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.
A first-principles wave-optical model for quantum MIMO channels in turbulent FSO links that accounts for intermodal crosstalk and reduces to a correlated n-qubit erasure channel.
Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.
The paper introduces Recursive QLSTM via metacore recursion, numerically tests variants on sequence lengths, and offers theoretical arguments for better temporal propagation.
citing papers explorer
-
Logical Compilation for Multi-Qubit Iceberg Patches
A new heuristic compiler for multi-qubit iceberg patches reduces circuit depth by 34 percent, cuts gate counts, and improves fidelity metrics on 71 benchmarks compared with naive mapping.
-
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.
-
Leveraging Metrologically Useful States in Quantum Reservoir Networks
A quantum reservoir network using GHZ-state preparation achieves an order-of-magnitude RMSE improvement over prior QRN designs on latent-space prediction of the Kuramoto-Sivashinsky equation.
-
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.
-
Quantum-classical physics-informed Kolmogorov-Arnold networks for PDEs
QCPIKAN is a quantum-classical physics-informed KAN that claims exponential high-frequency error convergence and superior accuracy over prior QCPINNs on single-phase, transport, and two-phase seepage PDEs.
-
Claim against Measurement: Statistical Artefacts in Quantum Error Mitigation Benchmarks
Implicit ZNE parameter choices flip significance in ~12% of tested configurations and hardware drift changes apparent effect size up to 3.4×, so QEM benchmarks need stricter statistical reporting.
-
Quantum Circuit Synthesis Using an Exact T Library
Exact T-count minimization via precomputed optimal libraries up to 7 variables and Clifford canonicalization yields up to 14.3% T reduction on EPFL benchmarks and 40% on cryptographic modules.
-
Robust Mutation Analysis of Quantum Programs Under Noise
Noise from quantum hardware simulators significantly alters mutant detection distances, making equivalent mutants harder to separate from faults, with output-distribution metrics reaching 73.03% accuracy and 74.89% F1-score under device-specific thresholds.
-
Controllable Quantum Memory Capacity in Quantum Reservoir Networks with Tunable partial-SWAPs
Introduces tunable partial-SWAP for controllable memory capacity in quantum reservoir networks, modeled as controlled amplitude-damping and validated via STMC and NARMA-5 benchmarks on simulators and IBM QPUs.
-
Mid-Circuit Measurements for Clifford Noise Reduction in Hamiltonian Simulations
Mid-circuit stabilizer verification in six-qubit GSE-encoded Clifford Trotter steps reduces logical error rates by up to 54% on Barium ion hardware, with the gain vanishing if checks are deferred to circuit end.
-
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.
-
Architecting Early Fault Tolerant Neutral Atoms Systems with Quantum Advantage
A teleportation-based parallelization architecture for neutral-atom quantum error correction delivers up to 3x speedup over extractor methods at fixed space cost and enables simulated quantum advantage at 11,495 atoms and 15-hour runtime.
-
SoK: Post-Quantum Cryptography Implementation in Software: Approaches, Challenges and the PQC-HOT Framework
PQC software implementation is a socio-technological problem whose challenges span interdependent Human, Organisation and Technology factors; the PQC-HOT model organises them for analysis and planning.
-
Stable Self-Modulating Quantum Fast-Weight Programmers with Bounded Memory Gates
Introduces bounded old-state modulation via tanh gate to stabilize self-modulating QFWPs, with evaluations showing reduced divergence and improved robustness on quantum dynamics and SMS tasks.
-
Is RISC-V Ready for Massively Parallel Astrophysical Codes?
Performance evaluation of iPIC3D, PLUTO, and OpenGadget3 on RISC-V shows 3-9x slowdowns versus x86 and ARM due to bandwidth, cache, vector width, and compiler issues.
-
Mitigating Bias in Low-SNR Financial Reinforcement Learning via Quantum Representations
FPQC-SAC adds a bounded parameterized quantum circuit to SAC to constrain representations in low-SNR financial environments, reporting 66.89% higher cumulative returns than standard SAC on real portfolio tasks.
-
Quantum Algorithm for Distributed Reduction of Entanglements (QADR): A Trainable and Simulation-Efficient QML Framework
QADR decomposes n-qubit VQCs into local sub-circuits to reduce memory from O(2^n) to O(n * 2^{2d+1}) and mitigate barren plateaus, scaling to 2000 features on MNIST and wind turbine diagnostics while matching classical models.
-
A Toolbox to Understand the Physics of Quantum Data Management
Introduces a toolbox for studying energy gaps, eigenstate structure, and optimization dynamics in quantum annealing formulations of database problems.
-
Communication-Efficient Distributed Inverse Quantum Fourier Transform
A threshold-pruned distributed inverse QFT reduces per-node entanglement to a constant and global communication from O(P²) to O(P) while claiming to preserve correctness.
-
Wave-Based Dispatch for Circuit Cutting in Hybrid HPC--Quantum Systems
DQR enables efficient scheduling and failover for cut quantum circuit fragments across local QPUs and remote simulators on real HPC hardware with low coordination overhead.
-
Arqon: A suite of control applications enabling a reliable quantum network
Arqon delivers reliable quantum network service via admission control and scheduling that satisfies defined reliability requirements for accepted demands in static topologies, with O(k^3) and O(N^3) complexity.
-
Quantum MIMO Channel Modeling in Turbulent Free-Space Optical Links
A first-principles wave-optical model for quantum MIMO channels in turbulent FSO links that accounts for intermodal crosstalk and reduces to a correlated n-qubit erasure channel.
-
End-to-end performance of quantum-accelerated large-scale linear algebra workflows
Hybrid quantum-classical graph partitioning inside LS-DYNA reduces amortized wall-clock time for large FEA simulations by 5.9-14.6 percent on meshes up to 35 million elements.
-
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.
-
A Hybrid Classical-Quantum Annealing Algorithm for the TSP
Graph contraction reduces TSP instances to smaller sub-problems solvable by quantum annealers, shown via Path Integral Monte Carlo simulation and D-Wave hardware.
-
A Distributed Switching Protocol for Quantum Networks
A distributed switching protocol for unbuffered quantum networks uses cooperative BSA selection and bi-path reservations to achieve high link success rates under load in simulations.
-
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.
-
Review of Superconducting Qubit Devices and Their Large-Scale Integration
A review summarizing superconducting qubit types, DiVincenzo criteria implementations, coherence limits from defects, and large-scale integration strategies for quantum computing.