2009
DOI: 10.1117/12.817924
|View full text |Cite
|
Sign up to set email alerts
|

A space-efficient quantum computer simulator suitable for high-speed FPGA implementation

Abstract: Conventional vector-based simulators for quantum computers are quite limited in the size of the quantum circuits they can handle, due to the worst-case exponential growth of even sparse representations of the full quantum state vector as a function of the number of quantum operations applied. However, this exponential-space requirement can be avoided by using general space-time tradeoffs long known to complexity theorists, which can be appropriately optimized for this particular problem in a way that also illu… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 12 publications
0
3
0
Order By: Relevance
“…The quantum computers simulators available today can only simulate a small number of circuits, i.e., very limited offered capacity [196]. This is because the simulation of a quantum computer on a classical computer is a computationally hard problem.…”
Section: Challenges In Enabling Quantum and Qml-assisted Communicationsmentioning
confidence: 99%
“…The quantum computers simulators available today can only simulate a small number of circuits, i.e., very limited offered capacity [196]. This is because the simulation of a quantum computer on a classical computer is a computationally hard problem.…”
Section: Challenges In Enabling Quantum and Qml-assisted Communicationsmentioning
confidence: 99%
“…Problems with exponential growth of space and time complexity during simulation of larger quantum circuits were also addressed by Franka et al [13]. They designed and conducted empirical complexity measurements of a working software prototype of a quantum computer simulator avoiding excessive space requirements.…”
Section: Existing Workmentioning
confidence: 99%
“…However, the number of quantum bits and quantum gates that can be simulated are still limited. In [3], [4], a space efficient quantum computer simulator is proposed. This is based on the fact that BQP is included in PSPACE, where BQP is the class of decision problems that can be solved by quantum Turing machines in polynomial time with bounded error, and PSPACE is the class of decision problems that can be solved by classical Turing machines in polynomial space.…”
Section: Introductionmentioning
confidence: 99%