ﻻ يوجد ملخص باللغة العربية
We detail techniques to optimise high-level classical simulations of Shors 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 Shors algorithm, our approach depends on its factors. We performed a matrix product state simulation of a 60-qubit instance of Shors algorithm that would otherwise be infeasible to complete without an optimised entanglement mapping.
Shors algorithm is examined critically from the standpoint of its eventual use to obtain the factors of large integers.
We show how the execution time of algorithms on quantum computers depends on the architecture of the quantum computer, the choice of algorithms (including subroutines such as arithmetic), and the ``clock speed of the quantum computer. The primary arc
We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension D of the MPS, we discuss how to minimize the computational
Shors powerful quantum algorithm for factoring represents a major challenge in quantum computation and its full realization will have a large impact on modern cryptography. Here we implement a compiled version of Shors algorithm in a photonic system
In recent years, a close connection between the description of open quantum systems, the input-output formalism of quantum optics, and continuous matrix product states in quantum field theory has been established. So far, however, this connection has