Trading Memory for Depth: Tight Bounds for LCU Block-Encodings
quant-ph
Submitted: 2026-11-11
Updated: 2026-11-11
Terminology
Sources
- Low-Overhead Parallelisation of LCU via Commuting Operators
- Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition
- Efficient LCU block encodings through Dicke states preparation
- Methods for Reducing Ancilla-Overhead in Block Encodings
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements