24 citations · 73 across the 5 of their papers we have counts for
5 papers
Cooling algorithms based on the 3-bit majority
Phillip Kaye
Algorithmic cooling is a potentially important technique for making scalable NMR quantum computation feasible in practice. Given the constraints imposed by this approach to quantum…
Reversible addition circuit using one ancillary bit with application to quantum computing
Phillip Kaye
Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02], [DKR04]). These quantum networ…
Quantum Networks for Generating Arbitrary Quantum States
Phillip Kaye, Michele Mosca
Quantum protocols often require the generation of specific quantum states. We describe a quantum algorithm for generating any prescribed quantum state. For an important subclass of…
Optimized quantum implementation of elliptic curve arithmetic over binary fields
Phillip Kaye, Christof Zalka
Shor's quantum algorithm for discrete logarithms applied to elliptic curve groups forms the basis of a "quantum attack" of elliptic curve cryptosystems. To implement this algorithm…
Quantum Networks for Concentrating Entanglement
Phillip Kaye, Michele Mosca
If two parties, Alice and Bob, share some number, n, of partially entangled pairs of qubits, then it is possible for them to concentrate these pairs into some smaller number of max…