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...
Saved in:
| Main Author: | Ryan L. Mann |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2021
|
| Subjects: | |
| Online Access: | https://doaj.org/article/ecb6f1c26e1647fd959ce18e1493a380 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimizing a polynomial function on a quantum processor
by: Keren Li, et al.
Published: (2021) -
Parallel quantum simulation of large systems on small NISQ computers
by: F. Barratt, et al.
Published: (2021) -
Practical verification protocols for analog quantum simulators
by: Ryan Shaffer, et al.
Published: (2021) -
Private quantum computation: an introduction to blind quantum computing and related protocols
by: Joseph F. Fitzsimons
Published: (2017) -
Low rank representations for quantum simulation of electronic structure
by: Mario Motta, et al.
Published: (2021)