The paper formalizes backend identifiability as hypothesis testing, proves anonymity decays at the Chernoff rate under persistent i.i.d. probing, establishes a utility-anonymity trade-off, and demonstrates 87-100% backend classification on real cloud QPUs.
hub
In: Pro- ceedings 35th Annual Symposium on Foundations of Computer Science, pp
23 Pith papers cite this work, alongside 8,516 external citations. Polarity classification is still indexing.
23
Pith papers citing it
8,516
external citations · external index
hub tools
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 14 cs.DC 2 astro-ph.GA 1 cs.CR 1 cs.LG 1 cs.PL 1 math.OC 1 physics.ed-ph 1 physics.gen-ph 1roles
background 1polarities
background 1representative citing papers
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.
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
Integer hybrid path-sums plus a sound Hoare logic enable semi-automated functional verification and expected-cost analysis of hybrid quantum programs with unbounded while loops.
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
Sunlight produces polarization-entangled photons through SPDC, achieving concurrence 0.905, fidelity 0.939, and Bell violation S=2.54 exceeding the classical limit.
Presents an exact tensor-network equation and optimized algorithm for integer factorization by tensorizing a multiplication circuit and contracting it to match a target composite number.
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.
A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.
Demonstration of dual-chip InP-SiN time-bin BB84 QKD system with QBER below 4% and kbps secret key rates over 150-250 km fiber using finite-key security analysis.
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.
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.
Hydrogen tunneling makes H-abstraction reactions by C2H, OH, and CN competitive in TMC-1 despite low individual rates, affecting aromatic abundance predictions.
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.
Detailed revision of a single phase-kickback item on a quantum computing survey reveals complex student reasoning and supports triangulating multiple data types when building conceptual assessments.
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.
Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.
Examines the mismatch between algorithm-centric public key cryptography security models and real-world AI-driven attacks that exploit implementation-level observability.
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.
A literature review of authentication in quantum networks concludes that it is not an intrinsic limitation but depends on explicit resources and deployment assumptions.
Software platform for hybrid LFSR-MT PRNG generation and ML-based predictability analysis, reporting inherent limitations in classical generators versus quantum randomness.
A review surveying coupling mechanisms in superconducting qubit-mechanical resonator hybrids and their extension to optomechanical architectures for quantum sensing applications.
citing papers explorer
-
Routing Anonymity and Identifiability of Noisy Quantum Hardware
The paper formalizes backend identifiability as hypothesis testing, proves anonymity decays at the Chernoff rate under persistent i.i.d. probing, establishes a utility-anonymity trade-off, and demonstrates 87-100% backend classification on real cloud QPUs.
-
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.
-
Fast Byzantine Total Order Broadcast
Flutter achieves 2Δ + ε good-case latency for Byzantine Total Order Broadcast via a new binary consensus called Blink, under partial synchrony with 5f+1 servers.
-
An Effective Quantum Hoare Logic for Hybrid Quantum Programs with Unbounded Loops
Integer hybrid path-sums plus a sound Hoare logic enable semi-automated functional verification and expected-cost analysis of hybrid quantum programs with unbounded while loops.
-
Linear-Time T-Gate Optimization via Random Abstraction
A linear-time randomized static analysis that propagates constant-width bitstrings enables phase folding and T-count optimization matching SOTA tools on large circuits.
-
Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
-
Generating quantum entanglement from sunlight
Sunlight produces polarization-entangled photons through SPDC, achieving concurrence 0.905, fidelity 0.939, and Bell violation S=2.54 exceeding the classical limit.
-
Prime Factorization Equation from a Tensor Network Perspective
Presents an exact tensor-network equation and optimized algorithm for integer factorization by tensorizing a multiplication circuit and contracting it to match a target composite number.
-
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.
-
Tensor-Network Formulation of the Traveling Salesman Problem and Variants
A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.
-
Time-Bin BB84 QKD System Using Indium Phosphide and Silicon Nitride Photonic Integrated Circuits
Demonstration of dual-chip InP-SiN time-bin BB84 QKD system with QBER below 4% and kbps secret key rates over 150-250 km fiber using finite-key security analysis.
-
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.
-
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.
-
The impact of hydrogen atom tunneling on aromatic chemistry in TMC-1
Hydrogen tunneling makes H-abstraction reactions by C2H, OH, and CN competitive in TMC-1 despite low individual rates, affecting aromatic abundance predictions.
-
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.
-
Assessing student learning in quantum computing: The challenging case of phase kickback
Detailed revision of a single phase-kickback item on a quantum computing survey reveals complex student reasoning and supports triangulating multiple data types when building conceptual assessments.
-
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.
-
Quantum Walks-Based Adaptive Distribution Generation with Efficient CUDA-Q Acceleration
Quantum walks integrated with variational circuits and CUDA-Q acceleration generate high-fidelity adaptive probability distributions for 1D financial modeling and 2D digit patterns.
-
AI-Driven Adaptive Adversaries and the Erosion of Cryptographic Trust in Public Key Systems
Examines the mismatch between algorithm-centric public key cryptography security models and real-world AI-driven attacks that exploit implementation-level observability.
-
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.
-
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.
-
Software Platform for Hybrid Pseudo-Random Sequence Generation and Predictability Analysis Based on LFSR and Mersenne Twister
Software platform for hybrid LFSR-MT PRNG generation and ML-based predictability analysis, reporting inherent limitations in classical generators versus quantum randomness.
-
Fundamentals and Applications of Hybrid Electro- and Opto-mechanical system coupled to Superconducting Qubit: A Short Review
A review surveying coupling mechanisms in superconducting qubit-mechanical resonator hybrids and their extension to optomechanical architectures for quantum sensing applications.