DeepAI AI Chat

Circuit pedantry

10/14/2019

∙

by Andreas Blass, et al.

∙

∙

Boolean and quantum circuits have commonalities and differences. To formalize the syntactical commonality we introduce syntactic circuits where the gates are black boxes. Syntactic circuits support various semantics. One semantics is provided by Boolean circuits, another by quantum circuits. Quantum semantics is a generalization of Boolean but, because of entanglement, the generalization is not straightforward. We consider only unitary quantum circuits here.

Andreas Blass
12 publications
Yuri Gurevich
19 publications

page 1

page 2

page 3

page 4

∙ 11/21/2021

Simple circuit simulations of classical and quantum Turing machines

We construct reversible Boolean circuits efficiently simulating reversib...

0 Yuri Gurevich, et al. ∙

∙ 07/17/2021

Quantum circuits with classical channels and the principle of deferred measurements

We define syntax and semantics of quantum circuits, allowing measurement...

0 Yuri Gurevich, et al. ∙

∙ 10/12/2018

Investigating the Power of Circuits with MOD_6 Gates

We consider the power of Boolean circuits with MOD_6 gates. First, we in...

0 Daniel J. Saunders, et al. ∙

∙ 02/28/2023

Q-Map: Quantum Circuit Implementation of Boolean Functions

Quantum computing has gained attention in recent years due to the signif...

0 Hassan Hajjdiab, et al. ∙

∙ 06/16/2020

Circuits: An abstract viewpoint

Our primary purpose is to isolate the abstract, mathematical properties ...

0 Andreas Blass, et al. ∙

∙ 07/18/2011

Evolutionary Quantum Logic Synthesis of Boolean Reversible Logic Circuits Embedded in Ternary Quantum Space using Heuristics

It has been experimentally proven that realizing universal quantum gates...

0 Maarti nLukac, et al. ∙

∙ 09/06/2019

Mapping finite state machines to zk-SNARKS Using Category Theory

We provide a categorical procedure to turn graphs corresponding to state...

0 Fabrizio Genovese, et al. ∙