522 citations · 2.3k across the 64 of their papers we have counts for
3 papers · 1 filter
Discrete Cosine Transforms on Quantum Computers
Andreas Klappenecker, Martin Roetteler
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that t…
Simulating Hamiltonians in Quantum Networks: Efficient Schemes and Complexity Bounds
Pawel Wocjan, Martin Roetteler, Dominik Janzing +1
We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any…
Universal Simulation of Hamiltonians Using a Finite Set of Control Operations
Pawel Wocjan, Martin Roetteler, Dominik Janzing +1
Any quantum system with a non-trivial Hamiltonian is able to simulate any other Hamiltonian evolution provided that a sufficiently large group of unitary control operations is avai…