Beyond z=0. The Deutsch-Jozsa decided monochromatic languages

by   Eraldo Pereira Marinho, et al.

The present work points out that the Deutsch-Jozsa algorithm was the first formal description of a quantum decider. In particular, it is studied here the class of languages whose indicator functions allow the Deutsch-Jozsa algorithm to output a monochromatic result, beyond the trivial case z = 0 for constant indicator functions. To illustrate examples of randomly balanced languages and some monochromatic cases, it was performed classical computational simulations of the Deutsch-Jozsa quantum algorithm for the specific cases of 4 and 6 qubits, respectively. The general case of the Deutsch-Jozsa decided languages are named balanced languages, and their outcomes from the simulation suggest that such languages are equivalent to the quantum superposition of the monochromatic cases.



page 1

page 2

page 3

page 4


A Quantum Query Complexity Trichotomy for Regular Languages

We present a trichotomy theorem for the quantum query complexity of regu...

On Dynamic Lifting and Effect Typing in Circuit Description Languages (Extended Version)

In the realm of quantum computing, circuit description languages represe...

ReQWIRE: Reasoning about Reversible Quantum Circuits

Common quantum algorithms make heavy use of ancillae: scratch qubits tha...

Verification Logics for Quantum Programs

We survey the landscape of Hoare logics for quantum programs. We review ...

A Deductive Verification Framework for Circuit-building Quantum Programs

While recent progress in quantum hardware open the door for significant ...

Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language

We study the quantum query complexity of two problems. First, we consi...

CaMEL: Case Marker Extraction without Labels

We introduce CaMEL (Case Marker Extraction without Labels), a novel and ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.