193 citations · 318 across the 8 of their papers we have counts for
12 papers
Exploiting Quantum Teleportation in Quantum Circuit Mapping
Stefan Hillmich, Alwin Zulehner, Robert Wille
Quantum computers are constantly growing in their number of qubits, but continue to suffer from restrictions such as the limited pairs of qubits that may interact with each other.…
Approximation of Quantum States Using Decision Diagrams
Alwin Zulehner, Stefan Hillmich, Igor L. Markov +1
The computational power of quantum computers poses major challenges to new design tools since representing pure quantum states typically requires exponentially large memory. As sho…
How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing
Alwin Zulehner, Stefan Hillmich, Robert Wille
Quantum computing promises substantial speedups by exploiting quantum mechanical phenomena such as superposition and entanglement. Corresponding design methods require efficient me…
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
Robert Wille, Lukas Burgholzer, Alwin Zulehner
The recent progress in the physical realization of quantum computers (the first publicly available ones--IBM's QX architectures--have been launched in 2017) has motivated research…
One Additional Qubit is Enough: Encoded Embeddings for Boolean Components in Quantum Circuits
Alwin Zulehner, Philipp Niemann, Rolf Drechsler +1
Research on quantum computing has recently gained significant momentum since first physical devices became available. Many quantum algorithms make use of so-called oracles that imp…
Design Automation for Adiabatic Circuits
Alwin Zulehner, Michael P. Frank, Robert Wille
Adiabatic circuits are heavily investigated since they allow for computations with an asymptotically close to zero energy dissipation per operation - serving as an alternative tech…
Compiling SU(4) Quantum Circuits to IBM QX Architectures
Alwin Zulehner, Robert Wille
The Noisy Intermediate-Scale Quantum (NISQ) technology is currently investigated by major players in the field to build the first practically useful quantum computer. IBM QX archit…
NISQ circuit compilation is the travelling salesman problem on a torus
Alexandru Paler, Alwin Zulehner, Robert Wille
Noisy, intermediate-scale quantum (NISQ) computers are expected to execute quantum circuits of up to a few hundred qubits. The circuits have to conform to NISQ architectural constr…
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
Alwin Zulehner, Alexandru Paler, Robert Wille
In the past years, quantum computers more and more have evolved from an academic idea to an upcoming reality. IBM's project IBM Q can be seen as evidence of this progress. Launched…
Advanced Simulation of Quantum Computations
Alwin Zulehner, Robert Wille
Quantum computation is a promising emerging technology which, compared to conventional computation, allows for substantial speed-ups e.g. for integer factorization or database sear…
On the Difficulty of Inserting Trojans in Reversible Computing Architectures
Xiaotong Cui, Samah Saeed, Alwin Zulehner +4
Fabrication-less design houses outsource their designs to 3rd party foundries to lower fabrication cost. However, this creates opportunities for a rogue in the foundry to introduce…
Towards Reverse Engineering Reversible Logic
Samah Mohamed Saeed, Xiaotong Cui, Robert Wille +4
Reversible logic has two main properties. First, the number of inputs is equal to the number of outputs. Second, it implements a one-to-one mapping; i.e., one can reconstruct the i…