• Corpus ID: 30530803

Advanced Simulation of Quantum Computations: Compact Representation Rather than Hardware Power

  title={Advanced Simulation of Quantum Computations: Compact Representation Rather than Hardware Power},
  author={Alwin Zulehner and Robert Wille},
Quantum computation is a promising emerging technology which, compared to classical computation, allows for substantial speed-ups e.g. for integer factorization or database search. However, since physical realizations of quantum computers are in their infancy, a significant amount of research in this domain still relies on simulations of quantum computations on classical machines. This causes a significant complexity which current state of the art simulators tackle by applying massive hardware… 

Figures and Tables from this paper

SurfBraid: A concept tool for preparing and resource estimating quantum circuits protected by the surface code
SurfBraid is arguably the first flexible (modular structure, extensible through user provided scripts) and interactive (automatically updating the results based on user interaction, browser based) tool for the automatic design of surface code protected quantum circuits.


QX: A high-performance quantum computer simulation platform
A universal quantum computer simulator, called QX, that takes as input a specially designed quantum assembly language and provides, through agressive optimisations, high simulation speeds and large number of qubits, achieves significant simulation speedup over similar state-of-the-art simulation environment.
Experimental comparison of two quantum computing architectures
It is shown that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits, and suggested that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.
Improving Gate-Level Simulation of Quantum Circuits
The results demonstrate that QuIDDs asymptotically outperform all other known simulation techniques and show that well-known worst-case instances of classical searching can be circumvented in many specific cases by data compression techniques.
High Performance Emulation of Quantum Circuits
The concept of a quantum computer emulator is introduced as a component of a software framework for quantum computing, enabling a significant performance advantage over simulators by emulating quantum algorithms at a high level rather than simulating individual gate operations.
Logic Synthesis for Quantum State Generation
A generic method is proposed which automatically synthesizes a quantum circuit generating any desired quantum state from an initially given basis state, and allows for both, a theoretical determination of upper bounds as well as an experimental evaluation of the number of quantum gates needed for this important design step.
QMDDs: Efficient Quantum Function Representation and Manipulation
A refined definition of QMDDs is presented and significantly improved computational methods for their use and manipulation are provided and it is shown that the resulting representation satisfies important criteria for a decision diagram, i.e., compactness and canonicity.
Realization of a scalable Shor algorithm
The realization of a scalable Shor algorithm, as proposed by Kitaev, is presented, which has been realized scalably within an ion-trap quantum computer and returns the correct factors with a confidence level exceeding 99%.
Quipper: a scalable quantum programming language
Quipper, a scalable, expressive, functional, higher-order quantum programming language, which is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware.
Demonstration of a small programmable quantum computer with atomic qubits
A five-qubit trapped-ion quantum computer that can be programmed in software to implement arbitrary quantum algorithms by executing any sequence of universal quantum logic gates, which provides the flexibility to implement a variety of algorithms without altering the hardware.
Efficient synthesis of quantum circuits implementing clifford group operations
An automatic synthesis approach for quantum circuits that implement Clifford Group operations that exploits specific properties of the unitary transformation matrices that are associated to quantum operations is proposed.