activity
20102020
most citedDownfolding of many-body Hamiltonians using active-space models: extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms

100 citations · 102 across the 2 of their papers we have counts for

collaborators
Showing quant-phShow all

6 papers · 1 filter

quant-ph2020

Quantum Circuits for Functionally Controlled NOT Gates

Mathias Soeken, Martin Roetteler

We generalize quantum circuits for the Toffoli gate presented by Selinger and Jones for functionally controlled NOT gates, i.e., gates controlled by arbitrary -variable Bool…

quant-ph2019

Quantum Computer Systems for Scientific Discovery

Yuri Alexeev, Dave Bacon, Kenneth R. Brown +21

The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considere…

quant-ph2019

Implementing Grover oracles for quantum key search on AES and LowMC

Samuel Jaques, Michael Naehrig, Martin Roetteler +1

Grover's search algorithm gives a quantum attack against block ciphers by searching for a key that matches a small number of plaintext-ciphertext pairs. This attack uses $O(\sqrt{N…

quant-ph2019100 cited

Downfolding of many-body Hamiltonians using active-space models: extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms

Nicholas P. Bauman, Eric J. Bylaska, Sriram Krishnamoorthy +3

In this paper we outline the extension of recently introduced the sub-system embedding sub-algebras coupled cluster (SES-CC) formalism to the unitary CC formalism. In analogy to th…

quant-ph2018

Quantum circuits for floating-point arithmetic

Thomas Häner, Mathias Soeken, Martin Roetteler +1

Quantum algorithms to solve practical problems in quantum chemistry, materials science, and matrix inversion often involve a significant amount of arithmetic operations which act o…

quant-ph20102 cited

Symmetry-assisted adversaries for quantum state generation

Andris Ambainis, Loïck Magnin, Martin Roetteler +1

We introduce a new quantum adversary method to prove lower bounds on the query complexity of the quantum state generation problem. This problem encompasses both, the computation of…