Higher-order quantum processes respecting closed labs in classical spacetime are exactly those realizable as quantum circuits with quantum control of causal order.
Canonical reference
Title resolution pending
Canonical reference. 100% of citing Pith papers cite this work as background.
23
Pith papers citing it
Background
100% of classified citations
citation-role summary
background 7
citation-polarity summary
roles
background 7polarities
background 7representative citing papers
A one-to-one correspondence maps maximal LDP channels under the Blackwell order to vertices of a finite-dimensional polytope, making optimal privacy-utility trade-offs computable via linear programming or vertex enumeration for general problems.
Derives the incidence-multiplicity lower bound ℓ(n-1) - (r-1)(q^ℓ-1)/(q-1) on repair bandwidth and I/O for MDS array codes with r≥2 and shows it is attained by field reductions of normal rational curves for specified parameters.
Asymptotically good Fock-state codes are built from random classical codes in the discrete simplex to correct linearly many photon losses under amplitude-damping noise, with bounded per-mode occupancy.
Introduces a TAP-motivated framework and constructs explicit parameter-free spectral algorithms that achieve strong detection and weak recovery thresholds in three canonical correlated two-view models with matching lower bounds.
Enumerative realization of RLIM codes achieves exponential-to-polynomial storage reduction while maintaining code properties and enabling better bit-error-rate performance in larger dimensions for molecular communication.
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
Jensen-Shannon regularized analogues of KL-based direct-correlation measures are introduced, taking values in [0,1] and accompanied by alphabet-size-dependent upper bounds under the observed marginal p(x,z).
A projective counting lower bound on linear exact repair costs for MDS array codes is attained for r=2 using Desarguesian spreads.
A universal construction adjoins infinite tensor products to FinStoch to produce a category of locally constant Markov kernels on finite sets union the Cantor space, enabling algebraic reasoning about continuous probability measures on the reals and lifting prior axiomatizations.
Pre-trained LLMs learn to predict HMM-generated sequences via in-context learning, approaching theoretical optimum on synthetic HMMs and matching expert models on real animal decision data.
Explicit descriptions of Weierstrass semigroups and gaps at totally ramified places on Kummer extensions, plus symmetry conditions and minimal generators, with applications to GGS and BM curves.
Lottery BP adds randomness to belief propagation decoding and uses syndrome voting to achieve far higher accuracy on topological quantum codes while reducing reliance on expensive global decoders.
A multi-agent extension of empowerment produces emergent group organizations in tendon-coupled agent pairs and controllable Vicsek flocks.
Ditto quantizes Code LLMs with K-Means codebooks and compiles inference via LLVM-BLAS replacement to deliver up to 10.5x faster, 6.4x smaller, and 10.5x lower-energy execution on commodity hardware while losing only 0.27% pass@1 accuracy.
PSCLF decoding with dynamic flip metrics and multiple flips per trial reduces SCLF complexity by up to 77% while gaining up to 0.1 dB in error performance for polar codes.
Simulations show information overload decreases source localization effectiveness in networks, with Erdős-Rényi graphs more resilient than Barabási-Albert ones and a reversal where less dense networks perform better under strong overload.
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.
Two methods using peak channel impulse response measurements localize a molecular source via least-squares triangulation (near CRB) and gradient descent optimization in diffusion-based molecular communication.
Hybrid quantum interior point methods for linear programming have no practical runtime advantage over classical solvers like HiGHS on realistic instances because their quantum lower bounds already exceed classical performance under optimistic assumptions.
citing papers explorer
-
Higher-order quantum processes respecting closed labs in a spacetime have quantum controlled causal order
Higher-order quantum processes respecting closed labs in classical spacetime are exactly those realizable as quantum circuits with quantum control of causal order.
-
Optimal Privacy-Utility Trade-Offs in LDP: Functional and Geometric Perspectives
A one-to-one correspondence maps maximal LDP channels under the Blackwell order to vertices of a finite-dimensional polytope, making optimal privacy-utility trade-offs computable via linear programming or vertex enumeration for general problems.
-
The Incidence-Multiplicity Bound for Linear Exact Repair in MDS Array Codes
Derives the incidence-multiplicity lower bound ℓ(n-1) - (r-1)(q^ℓ-1)/(q-1) on repair bandwidth and I/O for MDS array codes with r≥2 and shows it is attained by field reductions of normal rational curves for specified parameters.
-
Asymptotically good bosonic Fock state codes
Asymptotically good Fock-state codes are built from random classical codes in the discrete simplex to correct linearly many photon losses under amplitude-damping noise, with bounded per-mode occupancy.
-
Optimal Spectral Algorithms for Correlated Two-view Models in High Dimensions
Introduces a TAP-motivated framework and constructs explicit parameter-free spectral algorithms that achieve strong detection and weak recovery thresholds in three canonical correlated two-view models with matching lower bounds.
-
Low-Complexity Run-Length-Limited ISI-Mitigation (RLIM) Codes for Molecular Communication
Enumerative realization of RLIM codes achieves exponential-to-polynomial storage reduction while maintaining code properties and enabling better bit-error-rate performance in larger dimensions for molecular communication.
-
Rigorous Security Proofs for Practical Quantum Key Distribution
Rigorous security proofs for variable-length QKD, phase-error bounding with imperfect detectors, marginal-constrained entropy accumulation, and authentication reductions place practical QKD on firmer mathematical ground.
-
How to quantify direct correlations between variables
Jensen-Shannon regularized analogues of KL-based direct-correlation measures are introduced, taking values in [0,1] and accompanied by alphabet-size-dependent upper bounds under the observed marginal p(x,z).
-
Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
A projective counting lower bound on linear exact repair costs for MDS array codes is attained for r=2 using Desarguesian spreads.
-
Approaching the Continuous from the Discrete: an Infinite Tensor Product Construction
A universal construction adjoins infinite tensor products to FinStoch to produce a category of locally constant Markov kernels on finite sets union the Cantor space, enabling algebraic reasoning about continuous probability measures on the reals and lifting prior axiomatizations.
-
Pre-trained Large Language Models Learn Hidden Markov Models In-context
Pre-trained LLMs learn to predict HMM-generated sequences via in-context learning, approaching theoretical optimum on synthetic HMMs and matching expert models on real animal decision data.
-
Weierstrass semigroups at totally ramified places of degree one on Kummer extensions
Explicit descriptions of Weierstrass semigroups and gaps at totally ramified places on Kummer extensions, plus symmetry conditions and minimal generators, with applications to GGS and BM curves.
-
Lottery BP: Unlocking Quantum Error Decoding at Scale
Lottery BP adds randomness to belief propagation decoding and uses syndrome voting to achieve far higher accuracy on topological quantum codes while reducing reliance on expensive global decoders.
-
Multi-Agent Empowerment and Emergence of Complex Behavior in Groups
A multi-agent extension of empowerment produces emergent group organizations in tendon-coupled agent pairs and controllable Vicsek flocks.
-
Compiling Code LLMs into Lightweight Executables
Ditto quantizes Code LLMs with K-Means codebooks and compiles inference via LLVM-BLAS replacement to deliver up to 10.5x faster, 6.4x smaller, and 10.5x lower-energy execution on commodity hardware while losing only 0.27% pass@1 accuracy.
-
On Reducing Decoding Complexity of Successive-Cancellation List Flip Decoding of Polar Codes
PSCLF decoding with dynamic flip metrics and multiple flips per trial reduces SCLF complexity by up to 77% while gaining up to 0.1 dB in error performance for polar codes.
-
Nonlinear dynamics of information overload: Impact on source localization in complex networks
Simulations show information overload decreases source localization effectiveness in networks, with Erdős-Rényi graphs more resilient than Barabási-Albert ones and a reversal where less dense networks perform better under strong overload.
-
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.
-
Channel Impulse Response-based Source Localization in a Diffusion-based Molecular Communication System
Two methods using peak channel impulse response measurements localize a molecular source via least-squares triangulation (near CRB) and gradient descent optimization in diffusion-based molecular communication.
-
Practical lower bounds for hybrid quantum interior point methods in linear programming
Hybrid quantum interior point methods for linear programming have no practical runtime advantage over classical solvers like HiGHS on realistic instances because their quantum lower bounds already exceed classical performance under optimistic assumptions.
- Ternary Decision Trees with Locally-Adaptive Uncertainty Zones
- NOVA: Fundamental Limits of Knowledge Discovery Through AI
- Reward Score Matching: Unifying Reward-based Fine-tuning for Flow and Diffusion Models