Nearly optimal circuit size for sparse quantum state preparation

DOI10.4230/LIPICS.ICALP.2025.113MaRDI QIDQ7363201zbMATH OpenFDO

Authors Lvzhou Li, Jingquan Luo

Publication date 29 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.113

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A quantum-inspired classical algorithm for recommendation systems
• Asymptotically optimal synthesis of reversible circuits
• Double sparse quantum state preparation
• Fast black-box quantum state preparation based on linear combination of unitaries
• How to build the thermofield double state
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2163011 (Why is no real title available?)
• scientific article; zbMATH DE number 7559394 (Why is no real title available?)
• On asymptotic gate complexity and depth of reversible circuits without additional memory
• Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
• Optimal synthesis of linear reversible circuits
• Parallel quantum computation and quantum codes
• Quantum recommendation systems
• Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
• Simulating physics with computers
• Synthesis and optimization of reversible circuits -- a survey
• The theory of groups
• Toward the first quantum simulation with quantum speedup
• Upper bounds for reversible circuits based on Young subgroups

This page was built for publication: Nearly optimal circuit size for sparse quantum state preparation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363201)