529 citations · 1.5k across the 38 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.PL2014★ 9 cited
Quipper: Concrete Resource Estimation in Quantum Algorithms
Jonathan M. Smith, Neil J. Ross, Peter Selinger +1
Despite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is…
quant-ph2014
Quantum Oracles in Constant Depth with Measurement-Based Quantum Computation
Benoît Valiron
This paper shows that, in measurement-based quantum computation, it is possible to write any quantum oracle implementing a classical function in constant depth. The result is shown…
cs.LO2014★ 5 cited
Finite Vector Spaces as Model of Simply-Typed Lambda-Calculi
Benoît Valiron, Steve Zdancewic
In this paper we use finite vector spaces (finite dimension, over finite fields) as a non-standard computational model of linear logic. We first define a simple, finite PCF-like la…