Initiates property testing for k-submodular functions, yielding constant-query testers in l_p distance via hypergrid junta approximation and sub-exponential testers for component properties in Hamming distance, but with a structural barrier preventing combination.
Analysis of boolean functions
6 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
verdicts
UNVERDICTED 6roles
background 2polarities
background 2representative citing papers
Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.
A generative QMLC framework tokenizes GST data, embeds it via curriculum-trained set-vision transformers into a context-aware latent space, and uses diffusion models to synthesize circuits conditioned on desired measurement distributions.
The authors prove that δ-tribes functions, monotone Boolean functions with the tribe separation property, and Boolean functions with the semi-separation property satisfy the FEI conjecture using a stopping binary tree and a key entropy-influence inequality.
IQPopt is a JAX-based software tool enabling classical optimization of IQP circuits with thousands of qubits via efficient simulation of Pauli-Z expectation values, plus a module for quantum generative model training.
citing papers explorer
-
Testing k-submodularity
Initiates property testing for k-submodular functions, yielding constant-query testers in l_p distance via hypergrid junta approximation and sub-exponential testers for component properties in Hamming distance, but with a structural barrier preventing combination.
-
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
Coherent-state propagation enables quasi-polynomial classical simulation of bosonic circuits with logarithmically many Kerr gates at exponentially small trace-distance error, with polynomial runtime in the weak-nonlinearity regime.
-
Efficient simulation of noisy IQP circuits with amplitude-damping noise
A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.
-
From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data
A generative QMLC framework tokenizes GST data, embeds it via curriculum-trained set-vision transformers into a context-aware latent space, and uses diffusion models to synthesize circuits conditioned on desired measurement distributions.
-
Further evidence towards the Fourier Entropy-Influence conjecture
The authors prove that δ-tribes functions, monotone Boolean functions with the tribe separation property, and Boolean functions with the semi-separation property satisfy the FEI conjecture using a stopping binary tree and a key entropy-influence inequality.
-
IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX
IQPopt is a JAX-based software tool enabling classical optimization of IQP circuits with thousands of qubits via efficient simulation of Pauli-Z expectation values, plus a module for quantum generative model training.