Image de couverture de livre

Anticoncentrated $n$-bit distribution from $\log(n)$ qubits

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Bingzhi, Zhuang, Quntao
Format:	Preprint
Publié:	2025
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Energy-dependent barren plateau in bosonic variational quantum circuits
par: Zhang, Bingzhi, et autres
Publié: (2023)

On the exact quantum query complexity of $\text{MOD}_m^n$ and $\text{EXACT}_{k,l}^n$
par: Yao, Penghui, et autres
Publié: (2023)

Hamiltonians whose low-energy states require $Ω(n)$ T gates
par: Coble, Nolan J., et autres
Publié: (2023)

DQC1-completeness of normalized trace estimation for functions of log-local Hamiltonians
par: Ji, Zhengfeng, et autres
Publié: (2026)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
par: Iyer, Vishnu, et autres
Publié: (2026)

Quantum-enhanced learning with a controllable bosonic variational sensor network
par: Liao, Pengcheng, et autres
Publié: (2024)

Local Quantum Search Algorithm for Random $k$-SAT with $Ω(n^{1+ε})$ Clauses
par: Wu, Mingyou
Publié: (2024)

Quantum Advantages in (n,d)->1 Random Access Codes
par: Ambainis, Andris, et autres
Publié: (2015)

Mixed-State Quantum Denoising Diffusion Probabilistic Model
par: Kwun, Gino, et autres
Publié: (2024)

Learning junta distributions, quantum junta states, and QAC$^0$ circuits
par: Bao, Jinge, et autres
Publié: (2024)

Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
par: Allcock, Jonathan, et autres
Publié: (2023)

Reducing the Complexity of Matrix Multiplication to $O(N^2log_2N)$ by an Asymptotically Optimal Quantum Algorithm
par: Yao, Jiaqi, et autres
Publié: (2026)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
par: Zhang, Yifan, et autres
Publié: (2024)

Complexity and hardness of random peaked circuits
par: Zhang, Yuxuan
Publié: (2025)

Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
par: Yang, Guangxu, et autres
Publié: (2025)

Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
par: Yang, Guangxu, et autres
Publié: (2026)

The Power of Lorentz Quantum Computer
par: Zhang, Qi, et autres
Publié: (2024)

Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
par: Wang, Qisheng, et autres
Publié: (2024)

An Analytic Theory of Quantum Imaginary Time Evolution
par: Chen, Min, et autres
Publié: (2025)

Quantum-data-driven dynamical transition in quantum learning
par: Zhang, Bingzhi, et autres
Publié: (2024)

Generative quantum machine learning via denoising diffusion probabilistic models
par: Zhang, Bingzhi, et autres
Publié: (2023)

Succinct Perfect Zero-knowledge for MIP*
par: Fu, Honghao, et autres
Publié: (2025)

Local Test for Unitarily Invariant Properties of Bipartite Quantum States
par: Chen, Kean, et autres
Publié: (2024)

3-Local Hamiltonian Problem and Constant Relative Error Quantum Partition Function Approximation: $O(2^{\frac{n}{2}})$ Algorithm Is Nearly Optimal under QSETH
par: Chia, Nai-Hui, et autres
Publié: (2025)

Derandomised tensor product gap amplification for quantum Hamiltonians
par: Bergamaschi, Thiago, et autres
Publié: (2025)

Quantum Lovász Local Lemma: Shearer's Bound is Tight
par: He, Kun, et autres
Publié: (2018)

New Quantum Algorithms for Computing Quantum Entropies and Distances
par: Wang, Qisheng, et autres
Publié: (2022)

Dimension Independent Disentanglers from Unentanglement and Applications
par: Jeronimo, Fernando G., et autres
Publié: (2024)

On the average-case complexity of learning output distributions of quantum circuits
par: Nietner, Alexander, et autres
Publié: (2023)

Circuit-to-Hamiltonian from tensor networks and fault tolerance
par: Anshu, Anurag, et autres
Publié: (2023)

Efficient approximate unitary designs from random Pauli rotations
par: Haah, Jeongwan, et autres
Publié: (2024)

Toward Separating QMA from QCMA with a Classical Oracle
par: Zhandry, Mark
Publié: (2024)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
par: Grier, Daniel, et autres
Publié: (2025)

Quantum advantage from random geometrically-two-local Hamiltonian dynamics
par: Quek, Yihui
Publié: (2025)

More-efficient Quantum Multivariate Mean Value Estimator from Generalized Grover Operator
par: Tang, Letian
Publié: (2025)

Unconditionally separating noisy $\mathsf{QNC}^0$ from bounded polynomial threshold circuits of constant depth
par: Hsieh, Min-Hsiu, et autres
Publié: (2024)

Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication
par: Riazanov, Artur, et autres
Publié: (2025)

PCF Learned Sort: a Learning Augmented Sort Algorithm with $O(n \log\log n)$ Expected Complexity
par: Sato, Atsuki, et autres
Publié: (2024)

Bell sampling from quantum circuits
par: Hangleiter, Dominik, et autres
Publié: (2023)

A nearly-$4\log n$ depth lower bound for formulas with restriction on top
par: Wu, Hao
Publié: (2024)