Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation
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_ | 1866908556347834368 |
|---|---|
| author | Kaldenbach, Thierry N. Smith, Isaac D. Nautrup, Hendrik Poulsen Heller, Matthias Briegel, Hans J. |
| author_facet | Kaldenbach, Thierry N. Smith, Isaac D. Nautrup, Hendrik Poulsen Heller, Matthias Briegel, Hans J. |
| contents | The direct compilation of algorithm-specific graph states in measurement-based quantum computation (MBQC) can lead to resource reductions in terms of circuit depth, entangling gates, and even the number of physical qubits. In this work, we extend previous studies on algorithm-tailored graph states to periodic sequences of generalized Pauli rotations, which commonly appear in, e.g., Trotterized Hamiltonian simulation. We first implement an enhanced simulated-annealing-based algorithm to find optimal periodic graph states within local-Clifford equivalent MBQC resources. In addition, we derive a novel scheme for the preparation of resource states based on a graph state and a ladder of CNOT gates, which we term anticommutation-based MBQC, since it uncovers a direct relationship between the graph state and the anticommutation matrix for the set of Hamiltonians generating the computation. We also deploy our two approaches to derive universal resource states from minimal universal sets of generating Hamiltonians. Finally, we demonstrate and compare both of our methods based on various examples from condensed matter physics and universal quantum computation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_05404 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation Kaldenbach, Thierry N. Smith, Isaac D. Nautrup, Hendrik Poulsen Heller, Matthias Briegel, Hans J. Quantum Physics The direct compilation of algorithm-specific graph states in measurement-based quantum computation (MBQC) can lead to resource reductions in terms of circuit depth, entangling gates, and even the number of physical qubits. In this work, we extend previous studies on algorithm-tailored graph states to periodic sequences of generalized Pauli rotations, which commonly appear in, e.g., Trotterized Hamiltonian simulation. We first implement an enhanced simulated-annealing-based algorithm to find optimal periodic graph states within local-Clifford equivalent MBQC resources. In addition, we derive a novel scheme for the preparation of resource states based on a graph state and a ladder of CNOT gates, which we term anticommutation-based MBQC, since it uncovers a direct relationship between the graph state and the anticommutation matrix for the set of Hamiltonians generating the computation. We also deploy our two approaches to derive universal resource states from minimal universal sets of generating Hamiltonians. Finally, we demonstrate and compare both of our methods based on various examples from condensed matter physics and universal quantum computation. |
| title | Efficient Preparation of Resource States for Hamiltonian Simulation and Universal Quantum Computation |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2509.05404 |