Polyhedral Classical Simulators for Quantum Computation
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915542080684032 |
|---|---|
| author | Okay, Cihan |
| author_facet | Okay, Cihan |
| contents | Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of efficient classical simulability is a central challenge and motivates the development of new simulation paradigms. In this paper, we introduce polyhedral classical simulators, a framework for classical simulation grounded in polyhedral geometry. This framework encompasses well-known methods such as the Gottesman-Knill algorithm, while also extending naturally to more recent models of quantum computation, including those based on magic states and measurement-based quantum computation. We show how this framework unifies and extends existing simulation methods while at the same time providing a geometric roadmap for pushing the boundary of efficient classical simulation further. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_07540 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Polyhedral Classical Simulators for Quantum Computation Okay, Cihan Quantum Physics Combinatorics Quantum advantage in computation refers to the existence of computational tasks that can be performed efficiently on a quantum computer but cannot be efficiently simulated on any classical computer. Identifying the precise boundary of efficient classical simulability is a central challenge and motivates the development of new simulation paradigms. In this paper, we introduce polyhedral classical simulators, a framework for classical simulation grounded in polyhedral geometry. This framework encompasses well-known methods such as the Gottesman-Knill algorithm, while also extending naturally to more recent models of quantum computation, including those based on magic states and measurement-based quantum computation. We show how this framework unifies and extends existing simulation methods while at the same time providing a geometric roadmap for pushing the boundary of efficient classical simulation further. |
| title | Polyhedral Classical Simulators for Quantum Computation |
| topic | Quantum Physics Combinatorics |
| url | https://arxiv.org/abs/2510.07540 |