Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
MON: Monday Contributed Sessions
MON 18: Quantum Algorithms
MON 18.1: Vortrag
Montag, 8. September 2025, 16:30–16:45, ZHG007
Simulation of IQP circuits with hypergraph states — •Matthias Heller1, Paul Haubenwallner1, and Mariami Gachechiladze2 — 1Fraunhofer Institut für Graphische Datenverarbeitung IGD, Darmstadt, Germany — 2Techniche Universität Darmstadt, Darmstadt, Germany
Instantaneous quantum polynomial (IQP) circuits have recently gained a significant amount of attention due to their special structure, which allows for fault-tolerant implementation in the near future. It has been argued that classical sampling from these circuits is computationally hard, making this task a prime candidate for demonstrating quantum advantage. In this talk, we discuss the connection between IQP circuits and hypergraph states and show how graphical rules can be used to simulate these circuits. We test our approach for hypercube IQP circuits, a fault-tolerant instance of IQPs that has been introduced recently in the literature. Finally, we identify IQP structures which are easy to simulate.
Keywords: IQP circuits; Hypergraph state; Quantum information