Quantum 2025 – wissenschaftliches Programm
Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
MON: Monday Contributed Sessions
MON 2: Quantum Control
MON 2.3: Vortrag
Montag, 8. September 2025, 14:45–15:00, ZHG002
Optimization of algorithm-specific resource states for trotterized quantum dynamics and universal quantum computation — •Thierry N. Kaldenbach1,2, Isaac D. Smith2, Hendrik Poulsen Nautrup2, Matthias Heller3,4, and Hans J. Briegel2 — 1Institute of Materials Research, German Aerospace Center (DLR), Cologne, Germany — 2Institute for Theoretical Physics, University of Innsbruck, Austria — 3Fraunhofer Institute for Computer Graphics Research IGD, Darmstadt, Germany — 4Interactive Graphics Systems Group, Technical University of Darmstadt, Germany
The direct compilation of algorithm-specific graph states in measurement-based quantum computation (MBQC) potentially leads to resource reductions in terms of circuit depth, entangling gates, and sometimes even the number of qubits. In this work, we extend previous studies on algorithm-tailored graph states to periodic sequences of Pauli rotations, which commonly appear in, e.g., trotterized quantum dynamics. We also use our approach to derive universal resource states from generating sets of Pauli unitaries, whose structure relates to the anticommutation pattern of the set. In addition, we implement a significantly enhanced annealing-based algorithm to find optimal resource states within local-Clifford MBQC. We demonstrate and compare both of our technique based on examples from quantum chemistry, binary optimization, and universal quantum computation. In particular, we showcase how graph states tailored for specific observables can lead to qubit reductions beyond the Z2 symmetries exploited in qubit tapering.
Keywords: measurement-based quantum computation; graph states; quantum chemistry; binary optimization; universal quantum computation