Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power

Details Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power

2007-03-30

arxiv.org/abs/cs/0703152v1

Computer Science

Logic in Computer Science

25 pages

Scientific paper

We study an untyped lambda calculus with quantum data and classical control. This work stems from previous proposals by Selinger and Valiron and by Van Tonder. We focus on syntax and expressiveness, rather than (denotational) semantics. We prove subject reduction, confluence and a standardization theorem. Moreover, we prove the computational equivalence of the proposed calculus with a suitable class of quantum circuit families.

Affiliated with

Also associated with

No associations

Rating

Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Lambda Calculi with Classical Control: Syntax and Expressive Power will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650741