Simulating quantum computations with Tutte polynomials
Abstract We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic matroids. The algorithm evaluates the Tutte polynomial rec...
Guardado en:
Autor principal: | Ryan L. Mann |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Nature Portfolio
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/ecb6f1c26e1647fd959ce18e1493a380 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Optimizing a polynomial function on a quantum processor
por: Keren Li, et al.
Publicado: (2021) -
Parallel quantum simulation of large systems on small NISQ computers
por: F. Barratt, et al.
Publicado: (2021) -
Practical verification protocols for analog quantum simulators
por: Ryan Shaffer, et al.
Publicado: (2021) -
Private quantum computation: an introduction to blind quantum computing and related protocols
por: Joseph F. Fitzsimons
Publicado: (2017) -
Low rank representations for quantum simulation of electronic structure
por: Mario Motta, et al.
Publicado: (2021)