21 citations · 45 across the 6 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph1997★ 3 cited
Programming Complex Systems
Philip Maymin
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called t…
quant-ph1997★ 21 cited
The lambda-q calculus can efficiently simulate quantum computers
Philip Maymin
We show that the lambda-q calculus can efficiently simulate quantum Turing machines by showing how the lambda-q calculus can efficiently simulate a class of quantum cellular automa…
quant-ph1997★ 18 cited
Extending the Lambda Calculus to Express Randomized and Quantumized Algorithms
Philip Maymin
This paper introduces a formal metalanguage called the lambda-q calculus for the specification of quantum programming languages. This metalanguage is an extension of the lambda cal…