Corpus ID: 219570058

ICCAD: G: Decision Diagrams for Quantum Computing

  title={ICCAD: G: Decision Diagrams for Quantum Computing},
  author={Stefan Hillmich Advisor and Robert Wille},
In the 1970s, researchers started to utilize quantum mechanics to address questions in computer science—establishing (among others) the field of quantum computing [10]. Since then, several important and notoriously difficult problems have been tackled with the power of this new computing paradigm. Famously, Shor’s algorithm [11] promises to efficiently factorize integers on a quantum computer—allowing to break widely employed encryption schemes once quantum computers with enough qubits are… Expand

Figures and Tables from this paper


Advanced Simulation of Quantum Computations
  • Alwin Zulehner, R. Wille
  • Computer Science, Mathematics
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2019
The basics of quantum computation are revisited, how corresponding quantum states and quantum operations can be represented even more compactly, and, eventually, simulated in a more efficient fashion are investigated, leading to a new graph-based simulation approach which outperforms state-of-the-art simulators. Expand
Quantum Chemistry in the Age of Quantum Computing.
This Review provides an overview of the algorithms and results that are relevant for quantum chemistry and aims to help quantum chemists who seek to learn more about quantum computing and quantum computing researchers who would like to explore applications in quantum chemistry. Expand
How to Efficiently Handle Complex Values?: Implementing Decision Diagrams for Quantum Computing
This work proposes a solution to overcome new problems—namely how to efficiently handle complex numbers—arising in the quantum realm, and proposes a new types of decision diagrams capable of substantially reducing the complexity of representing quantum states and functionality. Expand
Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities ofExpand
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. Expand
Improved Mapping of Quantum Circuits to IBM QX Architectures
The proposed approach encompasses the selection of physical qubits, determining initial and local permutations efficiently to obtain the final circuit mapped to the given IBM QX architecture, and improvements are observed over existing methods in terms of the number of gates and circuit depth. Expand
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) . Expand
Just Like the Real Thing: Fast Weak Simulation of Quantum Computation
This work develops algorithms for weak simulation based on quantum state representation in terms of decision diagrams and shows, for the first time, that this enables mimicking of physical quantum computers of significant scale. Expand
Quantum Computing in the NISQ era and beyond
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future, and the 100-qubit quantum computer will not change the world right away, but it should be regarded as a significant step toward the more powerful quantum technologies of the future. Expand
High-performance QuIDD-based simulation of quantum circuits
An improved implementation of QuIDDs is presented which can simulate Grover's algorithm for quantum search with the asymptotic runtime complexity of an ideal quantum computer up to negligible overhead. Expand