Coherent quantum inference achieves O(1/ε) sample complexity for d-dimensional quantum purity amplification, exponentially better than the Ω(d/ε) required by any incoherent measurement-mediated protocol.
PRX Quantum , volume =
10 Pith papers cite this work, alongside 36 external citations. Polarity classification is still indexing.
10
Pith papers citing it
36
external citations · OpenAlex
citation-role summary
method 1
citation-polarity summary
verdicts
UNVERDICTED 10roles
method 1polarities
use method 1representative citing papers
Fixed upload circuits approximate tunable ones to error ε with depth O_σ[(log(1/ε))^σ] for any σ>1 (improving prior polynomial bounds) and matching Ω(log(1/ε)) lower bounds for mismatch-class targets via auxiliary extensions and Turán-Nazarov analysis.
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.
Quantum algorithms achieve polylog(N) complexity for high-dimensional linear SDEs by amplitude-encoding the solution and noise via Dyson series or Euler-Maruyama approximations plus quantum linear systems solvers.
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.
A hybrid quantum-classical variational method using polynomial approximations to the energy functional enables finite element analysis of a 1D Neo-Hookean hyperelastic model on near-term quantum hardware.
ROQAM formulates Green's function estimation via orthogonal polynomials to preserve Hessenberg structure under finite precision, enabling lower precision with depth and outperforming QSVD by orders of magnitude in resource estimates for a quantum impurity model.
TARE block-encodes sums of Pauli strings with reduced T-gate count and improved circuit depth versus standard LCU by leveraging mutually anti-commuting Pauli sets and transformations.
QSAF is a new component-based framework that organizes quantum circuit primitives into seven categories and links them through a multi-level abstraction hierarchy to support design of hybrid quantum-classical systems.
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.
citing papers explorer
-
An Exponential Sample-Complexity Advantage for Coherent Quantum Inference
Coherent quantum inference achieves O(1/ε) sample complexity for d-dimensional quantum purity amplification, exponentially better than the Ω(d/ε) required by any incoherent measurement-mediated protocol.
-
The Cost of Removing Tunability in Quantum Data Re-Uploading
Fixed upload circuits approximate tunable ones to error ε with depth O_σ[(log(1/ε))^σ] for any σ>1 (improving prior polynomial bounds) and matching Ω(log(1/ε)) lower bounds for mismatch-class targets via auxiliary extensions and Turán-Nazarov analysis.
-
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.
-
Quantum algorithm for solving high-dimensional linear stochastic differential equations via amplitude encoding of the noise term
Quantum algorithms achieve polylog(N) complexity for high-dimensional linear SDEs by amplitude-encoding the solution and noise via Dyson series or Euler-Maruyama approximations plus quantum linear systems solvers.
-
Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Cobble is a domain-specific language for quantum block encodings that compiles high-level matrix expressions to optimized circuits using analyses and quantum singular value transformation, achieving 2.6x-25.4x speedups over unoptimized baselines on benchmarks.
-
A Variational Quantum Algorithm for Nonlinear Finite Element Analysis of Hyperelastic Materials
A hybrid quantum-classical variational method using polynomial approximations to the energy functional enables finite element analysis of a 1D Neo-Hookean hyperelastic model on near-term quantum hardware.
-
Estimating Green's functions with a robust quantum Arnoldi method
ROQAM formulates Green's function estimation via orthogonal polynomials to preserve Hessenberg structure under finite precision, enabling lower precision with depth and outperforming QSVD by orders of magnitude in resource estimates for a quantum impurity model.
-
TARE: Block Encoding Linear Combinations of Pauli Strings Without Ancilla State Preparation
TARE block-encodes sums of Pauli strings with reduced T-gate count and improved circuit depth versus standard LCU by leveraging mutually anti-commuting Pauli sets and transformations.
-
Quantum Software Architecture Framework (QSAF): A Component-Based Framework for Designing Hybrid Quantum-Classical Systems
QSAF is a new component-based framework that organizes quantum circuit primitives into seven categories and links them through a multi-level abstraction hierarchy to support design of hybrid quantum-classical systems.
-
Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors
Quantum simulation methods for Thirring and Gross-Neveu fermionic models with arbitrary flavors, including gate complexity bounds and ground-state preparation up to 20 qubits.