Optimising Matrix Product State Simulations of Shor's Algorithm
Keyword(s):
The One
◽
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 approaches whose space requirements depend on r, the solution to the underlying order-finding problem of Shor's algorithm, our approach depends on its factors. We performed a matrix product state simulation of a 60-qubit instance of Shor's algorithm that would otherwise be infeasible to complete without an optimised entanglement mapping.
Keyword(s):
2015 ◽
Vol 67
(9)
◽
pp. 1619-1623
◽
Keyword(s):
2012 ◽
Vol 58
(2)
◽
pp. 285-291
◽
Keyword(s):
2001 ◽
Vol 627
(7)
◽
pp. 1626-1630
◽
2011 ◽
Vol 13
(9)
◽
pp. 093041
◽