Optimising Matrix Product State Simulations of Shor's Algorithm
We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure of a matrix product state. Compared to previous approa...
Main Authors: | Aidan Dang, Charles D. Hill, Lloyd C. L. Hollenberg |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2019-01-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2019-01-25-116/pdf/ |
Similar Items
-
Large-Scale Simulation of Shor’s Quantum Factoring Algorithm
by: Dennis Willsch, et al.
Published: (2023-10-01) -
On Shor's r-Algorithm for Problems with Constraints
by: Vladimir Norkin, et al.
Published: (2023-09-01) -
Quantum computation and Shor's factoring algorithm
by: Ekert, A, et al.
Published: (1996) -
Shor's Factoring Algorithm and Modular Exponentiation Operators
by: Robert L. Singleton Jr
Published: (2023-09-01) -
An efficient quantum circuit implementation of Shor’s algorithm for GPU accelerated simulation
by: XinJian Tan, et al.
Published: (2024-02-01)