A programming language characterizing quantum polynomial time

12/13/2022
by   Emmanuel Hainry, et al.
0

We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of terminating programs with bounded width, that provides a first programming language-based characterization of the quantum complexity class FBQP. Finally, we present a tractable semantics-preserving algorithm compiling a PFOQ program to a quantum circuit of size polynomial in the number of input qubits.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2020

Quantum Markov Chain Semantics for Quip-E Programs

In this work we present a mapping from a fragment of the quantum program...
research
02/23/2021

A tier-based typed programming language characterizing Feasible Functionals

The class of Basic Feasible Functionals BFF_2 is the type-2 counterpart ...
research
06/02/2023

Type-based Qubit Allocation for a First-Order Quantum Programming Language

Qubit allocation is a process to assign physical qubits to logical qubit...
research
08/07/2020

Cons-free Programs and Complexity Classes between LOGSPACE and PTIME

Programming language concepts are used to give some new perspectives on ...
research
05/24/2022

Modeling Asymptotic Complexity Using ACL2

The theory of asymptotic complexity provides an approach to characterizi...
research
11/30/2020

The ℵ Calculus

Motivated by a need for a model of reversible computation appropriate fo...
research
05/17/2023

RuLa: A Programming Language for RuleSet-based Quantum Repeaters

Quantum Repeaters are one critical technology for scalable quantum netwo...

Please sign up or login with your details

Forgot password? Click here to reset