This paper shows that shallow circuits cannot prepare near-optimal states for random quantum $p$-spin glasses, and proves depth lower bounds for such preparations.

The paper constructs a family of simple quantum states (pseudoentangled states) generated by constant-depth circuits that exhibit non-trivial entanglement structure, demonstrating that entanglement st…

This paper introduces normalized persistence, a version of persistent homology in topological data analysis, and proves its quantum hardness under the standard assumption that DQC1 is not in BPP.

The paper investigates which quantum encodings can be applied directly to classical data point clouds while preserving the topological invariants necessary for topological data analysis (TDA).

The paper introduces a topology-hiding connectivity assurance protocol that allows network providers to cryptographically prove the existence of a secure connection in QKD networks without revealing t…

The paper formalizes Razborov's flag algebra method for finite simple graphs and creates a compiler to transform certificate data into algebraic proofs checked by Lean.

This paper explores the constraints of achieving quantum advantage in circuit cutting while maintaining low overhead, classical hardness, and trainability, and introduces a two-block circuit family th…

This paper introduces Electric Flow Sampling (elfs) as a zero-error quantum walk primitive and uses it to derive improved quantum algorithms for various graph problems, including semi-supervised learn…

This paper introduces a quantum optimization framework using QAOA to perform Subgroup Discovery for network intrusion detection, demonstrating that quantum methods can find complex feature interaction…

This paper presents protocols for computing a linear combination over a noiseless quantum many-to-one network with more general linear transformations and lower communication cost.

This paper studies the triangle-densest-$k$-subgraph problem in an average-case model and proposes spectral and semidefinite algorithms for its recovery.

This paper simplifies the definition of qudit flow, a model of quantum computation, and improves its complexity to match qubit flows.

The paper proposes a novel three-layer metric framework to comprehensively evaluate quantum circuit integrity by combining structural, operational, and interaction-level analyses, demonstrating that n…

The paper proposes a provably secure path validation protocol for large-scale Quantum Key Distribution (QKD) networks that allows receivers to verify network compliance without revealing sensitive top…

The paper studies the resources required to batch verify Boolean functions and provides lower bounds on the witness-query tradeoff based on approximate degree.

This paper establishes a Coding Theorem in the context of symmetry groups and develops a connection between subgroups of a group and subsets of binary strings.