A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
Canonical reference
Title resolution pending
Canonical reference. 100% of citing Pith papers cite this work as background.
44
Pith papers citing it
8,602
external citations · external index
Background
100% of classified citations
citation-role summary
background 5
citation-polarity summary
roles
background 5polarities
background 5representative citing papers
Presents an end-to-end constraint-aware quantum optimization pipeline using XY-mixer QAOA and Grover Adaptive Search for low-energy defect configurations in doped ZrO2, with QAOA validated against exact enumeration on a high-accuracy QUBO surrogate of MACE energies.
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
Quantum algorithm block-encodes Riccati solutions for m-particle m-hole RPA using Riesz projectors and QSVT, claiming linear system-size scaling under sparsity and polynomial cost in excitation rank m.
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.
A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.
On random unimodular lattices, full-sign Gibbs mass of e^{a/n}-edge windows vanishes for c≤1 and converges to a Poisson–Dirichlet partition for c>1; primitive fixed-γ windows have visibility threshold c=γ^{-2} in the high-temperature regime.
A rubric-guided GRPO pipeline fine-tunes a 7B LLM to synthesize quantum circuits achieving 3.31x T-gate compression with <1% hardware-constraint violations, validated on IBM and IonQ processors.
Feynman's clock maps arbitrary circuits onto Hamiltonian dynamics whose BBGKY hierarchy enables polynomial-overhead, controllable error mitigation via informed sampling.
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.
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.
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.
Randomized Grover search using random selection among constraint oracles achieves the same Θ(√(N/r)) query complexity and near-unit success probability as standard Grover without requiring a global oracle.
End-to-end QSP-based quantum circuits solve linear PDEs on IBM hardware with tunable error and handle non-homogeneous Dirichlet boundaries for a plasma Poisson problem.
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
A logarithmic HUBO encoding with a lexicographic penalty solves minimum graph coloring and related partition-count problems using exponentially fewer qubits per vertex than one-hot encoding.
Meta-learning with 24 classical complexity metrics predicts the optimal quantum encoding circuit among 9 candidates with up to 85.7% top-3 accuracy.
Fault-tolerant Iceberg code on trapped-ion hardware achieves beyond-break-even error detection for Toffoli and Bell circuits by filtering errors, yielding higher fidelity than unencoded versions.
Reordering database addresses before ESOP minimization produces smaller QROM circuits for Grover oracles, with simulated annealing yielding roughly 30% size reduction over fixed ordering for small N.
CBMD decomposes non-Hermitian evolution operators into Hermitian LCU terms via a matrix residue theorem, matching known optimal query bounds and offering a route to polynomial matrix functions.
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
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.
citing papers explorer
-
Quantum Time Lower Bounds by Permutation Invariance
A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
-
Constraint-Aware Quantum Optimization of Defect Configurations in Doped ZrO2: XY-Mixer QAOA and Grover Adaptive Search
Presents an end-to-end constraint-aware quantum optimization pipeline using XY-mixer QAOA and Grover Adaptive Search for low-energy defect configurations in doped ZrO2, with QAOA validated against exact enumeration on a high-accuracy QUBO surrogate of MACE energies.
-
Forward-Assisted Purification: A Spatiotemporal Framework Beyond Conventional Limits
Introduces forward-assisted purification via a new spatiotemporal framework that outperforms conventional static purification by up to 50x in copy efficiency and circumvents no-purification theorems for Bell states.
-
Quantum Solvers for Nonlinear Matrix Equations in Quantum Chemistry
Quantum algorithm block-encodes Riccati solutions for m-particle m-hole RPA using Riesz projectors and QSVT, claiming linear system-size scaling under sparsity and polynomial cost in excitation rank m.
-
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.
-
Quantum Search without Global Diffusion
A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.
-
Thermal Concentration and Poisson-Dirichlet Edge Statistics for Random-Lattice Gibbs Ensembles
On random unimodular lattices, full-sign Gibbs mass of e^{a/n}-edge windows vanishes for c≤1 and converges to a Poisson–Dirichlet partition for c>1; primitive fixed-γ windows have visibility threshold c=γ^{-2} in the high-temperature regime.
-
RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis
A rubric-guided GRPO pipeline fine-tunes a 7B LLM to synthesize quantum circuits achieving 3.31x T-gate compression with <1% hardware-constraint violations, validated on IBM and IonQ processors.
-
Feynman's clock and hierarchy-informed sampling for quantum error mitigation
Feynman's clock maps arbitrary circuits onto Hamiltonian dynamics whose BBGKY hierarchy enables polynomial-overhead, controllable error mitigation via informed sampling.
-
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.
-
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.
-
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.
-
Random Grover Search
Randomized Grover search using random selection among constraint oracles achieves the same Θ(√(N/r)) query complexity and near-unit success probability as standard Grover without requiring a global oracle.
-
Quantum Signal Processing for Linear PDEs: Circuit Design and Experimental Validation
End-to-end QSP-based quantum circuits solve linear PDEs on IBM hardware with tunable error and handle non-homogeneous Dirichlet boundaries for a plasma Poisson problem.
-
An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
Faster quantum algorithm outputs a state whose energy is at most the minimum energy among all depth-d circuits applied to |0>, plus an energy estimate, for k-local Hamiltonians.
-
Polymorphic Bottom-Up Weighted Relational Programming
Presents a compilation method that turns polymorphic semiringKanren programs into equivalent non-polymorphic ones via equality patterns and sufficiently large relation instances, together with a correctness proof.
-
Loop Composition in Quantum Algorithms
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
-
Qubit-efficient and gate-efficient encodings of graph partitioning problems for quantum optimization
A logarithmic HUBO encoding with a lexicographic penalty solves minimum graph coloring and related partition-count problems using exponentially fewer qubits per vertex than one-hot encoding.
-
Towards Automated Selection of Quantum Encoding Circuits via Meta-Learning
Meta-learning with 24 classical complexity metrics predicts the optimal quantum encoding circuit among 9 candidates with up to 85.7% top-3 accuracy.
-
Fault-Tolerant Error Detection Above Break-Even for Multi-Qubit Gates
Fault-tolerant Iceberg code on trapped-ion hardware achieves beyond-break-even error detection for Toffoli and Bell circuits by filtering errors, yielding higher fidelity than unencoded versions.
-
Database Reordering for Compact Grover Oracles with ESOP Minimization
Reordering database addresses before ESOP minimization produces smaller QROM circuits for Grover oracles, with simulated annealing yielding roughly 30% size reduction over fixed ordering for small N.
-
Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition
CBMD decomposes non-Hermitian evolution operators into Hermitian LCU terms via a matrix residue theorem, matching known optimal query bounds and offering a route to polynomial matrix functions.
-
Accelerating BP-based decoders for QLDPC Codes with Local Syndrome-Based Preprocessing
Local syndrome-based preprocessing accelerates BP decoders for quantum LDPC codes, delivering up to 10x speedup on the [[144,12,12]] code while maintaining or improving logical error rates.
-
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.
-
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
AutoQ 2.0 verifies quantum programs with classical control flow and successfully checks RUS algorithms instantly plus weak-measurement Grover search on 100 qubits in about 20 minutes.
-
Production of Magic States via $Z$ Bosons and Dark Photons
Magic distributions are computed for EW processes (reproducing QED at low energy, new at high energy/Z resonance) and dark-sector scatterings, reaching maximal magic at mass ratios m_f/m_χ → 0 and → 1.83929.
-
Hard-core Bosons in Action: Applications to Quantum Circuits
Hard-core boson algebra is reviewed and extended for quantum circuit simulation with reported speedups over Qiskit and a new genetic-algorithm application for circuit synthesis.
-
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.
-
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.
-
MAGIQ: A Post-Quantum Multi-Agentic AI Governance System with Provable Security
MAGIQ introduces a post-quantum governance system for multi-agent AI that supports policy budgets, session enforcement, message attribution, and UC-based security proofs while comparing overhead to SAGA.
-
Distributed Realization of Color Codes for Quantum Error Correction
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
-
GroverFigureOfMerit: An Agnostic Figure of Merit for Quantum Backend Characterization in the NISQ Era
A Grover-algorithm-based figure of merit with uniformity and leakage penalties distinguishes quantum backend performance across heterogeneous architectures under simulated noise models.
-
Towards a quantum decision tree in a laser pumped four-level system
Proposes a scalable framework for quantum decision trees in a laser-driven four-level diamond atomic system using Lie-algebraic analysis and amplitude-varied pulses with identical temporal profiles for controlled population transfer.
-
Quantum Model for CVRPTW
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
-
Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
-
A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game
QUBO formulations are derived for generalized LinkedIn Queens, Takuzu/Tango, Tents & Trees, and two new chess-piece problems to enable solution on quantum hardware.
-
Private Delegated Quantum Computing for User-Level and Industry-Level Settings
Presents a hierarchy of private delegated quantum computation protocols separating state privacy, transcript ambiguity, and output privacy under stated leakage and collusion assumptions.
-
Implementation of Finite state logic machines via the dynamics of atomic systems
A conceptual proposal to implement finite-state classical logic machines by mapping Boolean operations onto the population and coherence dynamics of a two-level atomic system analyzed via the Liouville equation.
-
Evaluating Angle and Amplitude Encoding Strategies for Variational Quantum Machine Learning: their impact on model's accuracy
Empirical comparison of angle and amplitude encoding in VQCs on Wine and Diabetes datasets shows rotational gate selection in the encoding layer changes accuracy by 10-41 percent and treats embedding as a tunable hyperparameter.
-
Accelerating Quantum Eigensolver Algorithms With Machine Learning
XGBoost models trained on ≤16-qubit data predict eigensolver hyperparameters and reduce error by 0.12% on 28-qubit systems.
-
Authentication in Quantum Networks
A literature review of authentication in quantum networks concludes that it is not an intrinsic limitation but depends on explicit resources and deployment assumptions.
-
Power Network SCADA Quantum Communications: A Comparison of BB84, B92, E91, and SGS04 Quantum Key Distribution Protocols
Simulation-based comparison of BB84, B92, E91, and SARG04 QKD protocols on power-system SCADA datasets indicates a path toward quantum-secured SCADA/PMU networks.
-
Comparing a Few Qubit Systems for Superconducting Hardware Compatibility and Circuit Design Sensitivity in Qiskit
Compares QFT, GHZ, and W circuits on 4-10 qubits between simulator and IBM hardware to assess noise impact and hardware compatibility in the NISQ era.
- Beyond Quantum Advantage: Improved Classical Algorithms for the Binary Paint Shop Problem