Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation
Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.
Authors
- Bo Peng (ORCID: https://orcid.org/0000-0002-4226-7294)
- Oluwadara Ogunkoya (ORCID: https://orcid.org/0000-0002-9485-6656)
- Joonho Kim (ORCID: https://orcid.org/0000-0002-5408-3572)
- Baris Baris Ozguler
- Yuri Aleexlev
Institutions
- Argonne National Laboratory (US)
- Fermi National Accelerator Laboratory (US)
- Rigetti Computing (United States) (US)
Publication Details
- Published
- 2024-08-05
- DOI
- https://doi.org/10.2172/2426447
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- U.S. Department of Energy
- Office of Science