Efficient LCU block encodings through Dicke states preparation
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911115891441664 |
|---|---|
| author | Della Chiara, Filippo Nibbi, Martina Shen, Yizhi Van Beeumen, Roel |
| author_facet | Della Chiara, Filippo Nibbi, Martina Shen, Yizhi Van Beeumen, Roel |
| contents | With the Quantum Singular Value Transformation (QSVT) emerging as a unifying framework for diverse quantum speedups, the efficient construction of block encodings -- their fundamental input model -- has become increasingly crucial. However, devising explicit block encoding circuits remains a significant challenge. A widely adopted strategy is the Linear Combination of Unitaries (LCU) method. While general, its practical utility is often limited by substantial gate overhead. To address this, we introduce the Fast One-Qubit-Controlled Select LCU (FOQCS-LCU), a compact LCU formulation that requires only a linear number of ancilla qubits and is explicitly decomposed into one- and two-qubit gates. By exploiting the underlying Hamiltonian structure, we design a parametrized family of efficient Dicke state preparation routines, enabling systematic realization of the state preparation oracle at substantially reduced gate cost. The check matrix formalism further yields a constant-depth SELECT oracle, implemented as two fully parallelizable layers of singly controlled Pauli gates. We construct explicit block encoding circuits for representative spin models such as the Heisenberg and spin glass Hamiltonians and provide detailed, non-asymptotic gate counts. Our numerical benchmarks confirm the efficiency of the FOQCS-LCU approach, illustrating over an order-of-magnitude reduction in CNOT count compared to conventional LCU. This framework opens a pathway toward practical, low-depth block encodings for a broad class of structured matrices beyond those considered here. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_20887 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient LCU block encodings through Dicke states preparation Della Chiara, Filippo Nibbi, Martina Shen, Yizhi Van Beeumen, Roel Quantum Physics With the Quantum Singular Value Transformation (QSVT) emerging as a unifying framework for diverse quantum speedups, the efficient construction of block encodings -- their fundamental input model -- has become increasingly crucial. However, devising explicit block encoding circuits remains a significant challenge. A widely adopted strategy is the Linear Combination of Unitaries (LCU) method. While general, its practical utility is often limited by substantial gate overhead. To address this, we introduce the Fast One-Qubit-Controlled Select LCU (FOQCS-LCU), a compact LCU formulation that requires only a linear number of ancilla qubits and is explicitly decomposed into one- and two-qubit gates. By exploiting the underlying Hamiltonian structure, we design a parametrized family of efficient Dicke state preparation routines, enabling systematic realization of the state preparation oracle at substantially reduced gate cost. The check matrix formalism further yields a constant-depth SELECT oracle, implemented as two fully parallelizable layers of singly controlled Pauli gates. We construct explicit block encoding circuits for representative spin models such as the Heisenberg and spin glass Hamiltonians and provide detailed, non-asymptotic gate counts. Our numerical benchmarks confirm the efficiency of the FOQCS-LCU approach, illustrating over an order-of-magnitude reduction in CNOT count compared to conventional LCU. This framework opens a pathway toward practical, low-depth block encodings for a broad class of structured matrices beyond those considered here. |
| title | Efficient LCU block encodings through Dicke states preparation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2507.20887 |