A reduction framework from sample complexity yields matching time lower bounds for purity estimation, high-order functionals, productness testing, and related quantum protocols.
hub Canonical reference
Nielsen and Isaac L
Canonical reference. 88% of citing Pith papers cite this work as background.
60
Pith papers citing it
5,696
external citations · Crossref
Background
88% of classified citations
hub tools
citation-role summary
background 15
method 2
citation-polarity summary
representative citing papers
Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.
A coherence law based on the readout-visible aligned coherence rate (a Rayleigh quotient of the noise generator) predicts gradient survival in noisy U(1)-equivariant QNNs, with simulations confirming R²=0.979 and a special channel test showing no loss where predicted.
Sample complexity for fidelity estimation to a rank-r reference state is O(r²/ε²) with lower bound Ω(r/ε²); O(r²/ε⁴) when unknown state also has rank ≤r.
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.
Defines the first stochastic semantics for TAPNs and implements SMC algorithms in TAPAAL, with a proof of well-behaved semantics and case-study demonstrations.
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
A resource theory for strong symmetry breaking is formulated, with the variance of the conserved quantity characterizing its asymptotic manipulation for U(1) symmetry and enabling tracking of weak-to-strong conversion in open systems.
Introduces a localization probability lambda for quantum states in subspaces that is stricter than standard overlap Tr(P rho), derived from Schur complement operator decomposition and possessing concavity and super-additivity.
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
Hermitian forms on Hilbert spaces arise from the monoid structure of complex conjugation in Z/2-equivariant real linear types within LHoTT, requiring only a negative unit term.
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
Two approaches (PTM singular vector optimization and sequential basis matching) allow BB84 and six-state QKD to achieve equivalent key rates over unital channels without a shared reference frame by absorbing frame misalignment into the channel.
QnRL is a distributional quantum RL framework that distills conditional action policies from moments of quantum generative models in Hilbert space via the QuAK algorithm, reporting higher scores and fewer parameters than baselines.
Quantum compressed sensing reformulates image classification as a single-photon projective measurement, achieving 69% accuracy with one detection event and 95% with four.
CCV-QAOA is a new complex-valued continuous-variable variant of QAOA that solves real and complex multivariate optimization problems via a variational framework.
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
New techniques for error-independent unified path variation, non-degenerate batched sampling, and flexible contraction accelerate tensor network quantum trajectory simulations by more than 10^8 times.
Lattice QED is established as a quantum error-correcting code beyond stabilizers, with explicit recovery operations constructed via quantum reference frames for gauge and fermionic sectors.
Non-density of integral points in semigroup orbits implies sparsity of multiplicative dependence in higher dimensions, generalizing Northcott-Siegel theorems and following from Vojta's conjecture.
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
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.
-
Estimating Fidelity to a Reference Quantum State
Sample complexity for fidelity estimation to a rank-r reference state is O(r²/ε²) with lower bound Ω(r/ε²); O(r²/ε⁴) when unknown state also has rank ≤r.
-
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.
-
TAPAAL SMC: Statistical Model Checking of Stochastic Timed-Arc Petri Nets
Defines the first stochastic semantics for TAPNs and implements SMC algorithms in TAPAAL, with a proof of well-behaved semantics and case-study demonstrations.
-
A Compilation Framework for Quantum Simulation of Non-unitary Dynamics
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
-
The finite-shot help-harm boundary of zero-noise extrapolation
Zero-noise extrapolation has a finite-shot help-harm boundary below which it increases local mean-squared error due to variance penalties outweighing bias reduction.
-
Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
StoqMA(2) contains NP with Õ(√n)-qubit proofs and completeness error 2^{-polylog(n)}, is contained in EXP, and satisfies StoqMA(k)=StoqMA(2) for k≥2 when completeness error is negligible.
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
-
Resource-Theoretic Quantifiers of Weak and Strong Symmetry Breaking: Strong Entanglement Asymmetry and Beyond
A resource theory for strong symmetry breaking is formulated, with the variance of the conserved quantity characterizing its asymptotic manipulation for U(1) symmetry and enabling tracking of weak-to-strong conversion in open systems.
-
Localization of quantum states within subspaces
Introduces a localization probability lambda for quantum states in subspaces that is stricter than standard overlap Tr(P rho), derived from Schur complement operator decomposition and possessing concavity and super-additivity.
-
Efficient Simulation of High-Level Quantum Gates
A gadget-based simulator directly simulates high-level quantum gates via low-rank stabilizer decompositions of magic states, improving both theoretical complexity and practical runtime over standard compilation-based methods.
-
Quantum and Reality
Hermitian forms on Hilbert spaces arise from the monoid structure of complex conjugation in Z/2-equivariant real linear types within LHoTT, requiring only a negative unit term.
-
A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
-
Quantum Key Distribution Without Shared Reference Frame Under Unital Noise
Two approaches (PTM singular vector optimization and sequential basis matching) allow BB84 and six-state QKD to achieve equivalent key rates over unital channels without a shared reference frame by absorbing frame misalignment into the channel.
-
QnRL: Quantum-Native Reinforcement Learning
QnRL is a distributional quantum RL framework that distills conditional action policies from moments of quantum generative models in Hilbert space via the QuAK algorithm, reporting higher scores and fewer parameters than baselines.
-
Quantum Compressed Sensing Enables Image Classification with a Single Photon
Quantum compressed sensing reformulates image classification as a single-photon projective measurement, achieving 69% accuracy with one detection event and 95% with four.
-
A Complex-Valued Continuous-Variable Quantum Approximation Optimization Algorithm (CCV-QAOA)
CCV-QAOA is a new complex-valued continuous-variable variant of QAOA that solves real and complex multivariate optimization problems via a variational framework.
-
Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
A necessary condition for variational quantum circuits to reach exact ground states requires matching module projection norms between input and solution, enabling classical O(n^5) exact solvers for problems like MaxCut.
-
Accelerating Quantum Tensor Network Simulations with Unified Path Variations and Non-Degenerate Batched Sampling
New techniques for error-independent unified path variation, non-degenerate batched sampling, and flexible contraction accelerate tensor network quantum trajectory simulations by more than 10^8 times.
-
Error Correction in Lattice Quantum Electrodynamics with Quantum Reference Frames
Lattice QED is established as a quantum error-correcting code beyond stabilizers, with explicit recovery operations constructed via quantum reference frames for gauge and fermionic sectors.
-
On higher dimensional integrality and multiplicative dependence in semigroup algebraic dynamics
Non-density of integral points in semigroup orbits implies sparsity of multiplicative dependence in higher dimensions, generalizing Northcott-Siegel theorems and following from Vojta's conjecture.
-
Learning Encodings by Maximizing State Distinguishability: Variational Quantum Error Correction
VarQEC uses a distinguishability loss as a machine-learning objective to variationally discover resource-efficient encoding circuits optimized for given noise models.
-
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.
-
Engineering of Anyons on M5-Probes via Flux Quantization
Flux quantization of the M5-brane tensor field in twisted Cohomotopy yields Pontrjagin homology observables that reproduce abelian Chern-Simons theory and braid actions on defect anyons.
-
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.
-
Entanglement of Sections: The pushout of entangled and parameterized quantum information
The pushout of entangled and parameterized quantum information in monoidal categories yields the external tensor product on flat K-theory bundles.
-
The limits of erasure-based postselection for quantum error mitigation
Postselection on erasure qubits fully mitigates erasure noise in QFT for erasure-check error rates below 3% and enables dual-rail systems to exceed noise floors unreachable by single-rail at kiloquop scale.
-
Algebraic structures of the Lindblad equation
Lindblad dynamics admits a universal closed algebra of Hermitian operators with model dependence isolated in a single set of coefficients.
-
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.
-
Towards Entanglement-Enhanced Atom Interferometry Using Bow-Tie Cavities
A monolithic bow-tie cavity with finesse 5.7e4 is realized for homogeneous coupling to Sr atoms at 689 nm, projected to enable up to 28 dB spin squeezing for quantum-enhanced interferometry.
-
Characterization of nested Walsh parity-check filters in a single-photon eight-mode register on a cloud photonic processor
Experimental tests of parity-check filters in a single-photon eight-mode photonic register on Quandela's Belenos processor show mean 0.6% DC leakage with 21x suppression and 94-99% syndrome channel selectivity.
-
Holographic complexity of de-Sitter black holes
In SdS black hole holography, CV and CV2.0 complexities grow linearly while CA growth vanishes due to finite action, with matching rates between static patch and dS/CFT schemes.
-
Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory
Introduces hybrid Clifford codes by extending representation-theoretic quantum error correction to hybrid classical-quantum information and projective representations using the operator algebra framework.
-
Experimental Implementation of the Quantum Volunteer's Dilemma on NISQ Hardware: Noise Analysis and Digital-Twin Validation
Experimental demonstration of multiplayer quantum volunteer's dilemma on NISQ hardware up to 9 players, with noise analysis and digital-twin comparison.
-
New quantum information perspectives in the axion--photon and neutrino systems
Axion-photon oscillations generate bipartite mode entanglement with maximal values at resonance, and quantum speed limits are derived for both axion-photon and neutrino systems.
-
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.
-
How Quantum Contextuality disappears in the Classical Limit
Depolarizing channels suppress the correlations needed to witness both state-dependent and state-independent contextuality in sequential KCBS and Peres-Mermin implementations, leading to classicalization.
-
Entanglement and circuit complexity in finite-depth random linear optical networks
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
-
Spin Correlation and Quantum Entanglement of Fermion Pairs in Transversely Polarized $e^-e^+$ Collisions
Transverse polarization in e+e- collisions generates maximally entangled fermion pairs in QED processes and boosts entanglement in electroweak and Bhabha scattering.
-
Recursive entropy in thermodynamics: expounding the statistical-physics basis of the zentropy approach
The zentropy approach receives a statistical-physics foundation via recursive entropy maximization, yielding partition functions for coarse-grained configurations and clarifying temperature-dependent states in thermodynamic systems.
-
Non-Markovian Light-Matter Dynamics in the Time Fractional Jaynes-Cummings Model with Modulated Coupling
Fractional time Schrödinger equations applied to the time-dependent Jaynes-Cummings model introduce non-Markovian memory that damps oscillations, controls entanglement, and preserves non-periodic dynamics under sinusoidal coupling.
-
Security of deterministic key distribution with higher-dimensional systems
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.
-
Efficient Quantum Oracle for Solving Bilinear Diophantine Equations on Digital Quantum Computers
Presents a concrete quantum oracle for bilinear Diophantine equations enabling factoring of n-bit biprimes with 2n-5 qubits or fewer and near-100% simulated success for numbers up to 35 bits.
-
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.
-
Solving Einstein Field Equations on a Digital Quantum Computer
A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.
-
Quantum Entanglement in the Dirac Field Quantization around Charged Black Holes
Electric charge of a Reissner-Nordström black hole enhances decoherence of Dirac entanglement inside the horizon but can temporarily boost accessible entanglement outside, while Hawking radiation transfers correlations to inaccessible regions causing apparent loss for external observers.
-
Dimeric Perylene-Bisimide Organic Molecules: Fractional-Time Control of Quantum Resources
Fractional time order modulates coherence, entanglement, and nonlocality in dimeric PBI molecules via dipole-dipole interactions.
-
Dephasing Effects on the Dynamical Evolution of Quantum Correlations and Coherence in Neutrino Oscillations
In neutrino oscillations treated as open quantum systems, coherence outlasts steering and negativity under amplitude damping, phase flip, and phase damping, showing memory-induced revivals in non-Markovian regimes.
-
Optimizing Quantum Entanglement Preservation in a Qubit Qubit System with Dzyaloshinskii Moriya Interaction under Noisy Magnetic Fields via Feedback Control
Proportional-integral feedback on DM coupling strength doubles time-averaged negativity under colored noise and yields 2.5 times better sensitivity than the shot-noise limit in quantum metrology simulations.
-
Probing the Planck scale with quantum computation
A 500-logical-qubit quantum computer could reject laboratory-confined theories by surpassing the Planck-scale operation rate of 2^491 m^{-3} s^{-1}, with a 1600-qubit machine limited by the observable universe.