PreprintarXiv licencearXiv
Shallow data-loading circuits for multivariable functions
Abstract
We construct shallow QROM, diagonal block-encoding, and quantum state preparation oracles for analytic functions on the D-dimensional hypercube [0, 1]D. On n qubits and with 2− Ω(n/D) error, these circuits have depths of O ( √((n log2 (n))/D) ) in the Clifford + T gate set, albeit using 2O(√(nD log2 (n))) ancilla qubits. This is a near-quadratic depth reduction compared to known linear-depth methods.
Related
- Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits
- Experimentally Testable Quantum Advantage in Shallow Circuits
- Distilling Datasets into Shallow Circuits for Quantum Machine Learning
- Classical Pre-Training of Large Shallow Parametrized Quantum Circuits through Pauli Propagation and deployment on Quantum Hardware
- Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D
BibTeX
@misc{dixit2026shallow,
title = {{Shallow data-loading circuits for multivariable functions}},
author = {Arjun Dixit and Ákos Nagy},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.02296},
eprint = {2611.02296},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.02296},
}
RIS
TY - UNPB
TI - Shallow data-loading circuits for multivariable functions
AU - Arjun Dixit
AU - Ákos Nagy
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.02296
UR - https://arxiv.org/abs/2611.02296
AB - We construct shallow QROM, diagonal block-encoding, and quantum state preparation oracles for analytic functions on the D-dimensional hypercube [0, 1]^D. On n qubits and with 2^− Ω(n/D) error, these circuits have depths of O ( √((n log_2 (n))/D) ) in the Clifford + T gate set, albeit using 2^O(√(nD log_2 (n))) ancilla qubits. This is a near-quadratic depth reduction compared to known linear-depth methods.
ER -