QX: A high-performance quantum computer simulation platform
The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
Quantum computing is rapidly evolving especially after the discovery of several efficient quantum algorithms solving intractable classical problems such as Shor's factoring algorithm. However the realization of a large-scale physical quantum computer is very challenging and the number of qubits that are currently under development is still very low, namely less than 15. In the absence of large size platforms, quantum computer simulation is critical for developing and testing quantum algorithms and investigating the different challenges facing the design of quantum computer hardware. What makes quantum computer simulation on classical computers particularly challenging are the memory and computational resource requirements. In this paper, we introduce a universal quantum computer simulator, called QX, that takes as input a specially designed quantum assembly language, called QASM, and provides, through agressive optimisations, high simulation speeds and large number of qubits. QX allows the simulation of up to 34 fully entangled qubits on a single node using less than 270 GB of memory. Our experiments using different quantum algorithms show that QX achieves significant simulation speedup over similar state-of-the-art simulation environment.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 1×
“For instance, the discovery of the Shors prime factorization algorithm [3] outlined the enormous potential of quantum computing, factoring prime numbers is the basis of several crypto-systems such as the widely used Rivest-Shamir-Adleman (RSA) security scheme [4].”
MethodA method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 2×
“1) Quantum Fourier Transform The Quantum Fourier Transform (QFT) is a fundamental part of many quantum algorithms, such as Shor’s factoring algorithm [3] or the quantum phase estimation algorithm.”
MethodQuantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“It has been demonstrated that a universal quantum computer can simulate any Turing machine [23] and any local quantum system [24].”
BackgroundSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“Currently this module supports the Steane code [25] and will shortly support surface code [26].”
MethodError Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586 · cited 1×
“The discovery of these algorithms boosted the development of different physical quantum computer implementation using different technologies such as the Cavity Quantum Electrodynamics (QED) [6], trapped ions [7] or solid state systems [8].”
MethodQuantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270 · cited 1×
“Nowadays, the quantum circuit model introduced by Deutsh [22] is the most common quantum computation model due to its analogy with classical circuits.”
BackgroundQuantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536 · cited 1×
“In contrast to the classical computers based on the well defined classical model of boolean logic, quantum computing can be implemented in different ways including adiabatic quantum computation [19], cluster state quantum computation [20] or topological quantum computation [21].”
MethodQuantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402 · cited 1×
“Since the early formulation of the idea of using quantum mechanical systems to store and process information [1] [2], the field of quantum computing is rapidly evolving especially after the elaboration of several efficient quantum algorithms solving intractable classical problems.”
BackgroundQuantum Error Correction with Imperfect Gates
Kitaev, A. Y. (1997) · Quantum Communication, Computing, and Measurement · doi:10.1007/978-1-4615-5923-8_19 · Cited by 214 · cited 1×
“In contrast to the classical computers based on the well defined classical model of boolean logic, quantum computing can be implemented in different ways including adiabatic quantum computation [19], cluster state quantum computation [20] or topological quantum computation [21].”
Method
Cited by
Qulacs: a fast and versatile quantum circuit simulator for research purpose
Suzuki, Y., Kawase, Y., Masumura, Y., Hiraga, Y., Nakadai, M., Chen, J., Nakanishi, K. M., Mitarai, K., Imai, R., Tamiya, S., et al. (2021) · Quantum · doi:10.22331/q-2021-10-06-559 · Cited by 295
QuEST and High Performance Simulation of Quantum Computers
Jones, T., Brown, A., Bush, I., & Benjamin, S. C. (2019) · Scientific Reports · doi:10.1038/s41598-019-47174-9 · Cited by 253
Asymptotic improvements to quantum circuits via qutrits
Gokhale, P., Baker, J. M., Duckering, C., Brown, N. C., Brown, K. R., & Chong, F. T. (2019) · Proceedings of the 46th International Symposium on Computer Architecture · doi:10.1145/3307650.3322253 · Cited by 120
Timing and Resource-Aware Mapping of Quantum Circuits to Superconducting Processors
Lao, L., van Someren, H., Ashraf, I., & Almudever, C. G. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2021.3057583 · Cited by 72
“Currently, the OpenQL compiler is capable of generating cQASM [35] that can be executed on the QX simulator [36] as well as eQASM [37], a QASM-like executable code that can target the Surface-17 processor.”
Self-citationQiBAM: approximate sub-string index search on quantum accelerators applied to DNA read alignment
Sarkar, A., Al-Ars, Z., Almudever, C. G., & Bertels, K. L. M. (2021) · Electronics · doi:10.3390/electronics10192433 · Cited by 20
“• Experimental: For algorithm development (using perfect qubits) and proof-of-concept testing, a simulator platform is preferable, such as the QX Simulator used for this research.”
InfluentialSelf-citation
Metadata
- Authors
- Khammassi, N., Ashraf, I., Fu, X., Almudever, C. G., & Bertels, K.
- Venue
- Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017
- Publisher
- IEEE
- Published
- 2017-03
- Pages
- 464-469
- OpenAlex
- W2613048740
- Cited by
- 94
- References
- 16
- FWCI
- 4.83
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.