Quantum Computational Logics. A Survey
M. L. Dalla Chiara, R. Giuntini, R. Leporini
Abstract
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a possible pure state of a compound quantum system. The generalization to mixed states, which might be useful to analyse entanglement-phenomena, is due to Gudder. Quantum computational logics represent non standard examples of unsharp quantum logic, where the non-contradiction principle is violated, while conjunctions and disjunctions are strongly non-idempotent. In this framework, any sentence of the language gives rise to a quantum tree: a kind of quantum circuit that transforms the quregister associated to the atomic subformulas of the sentence into the quregister associated to the sentence.
Create a lesson
Related papers
Discovering state-of-the-art quantum circuits with large language models
Andi Gu, Alek H. Kemeny, Susanne F. Yelin et al.
Stability of Quantum LDPC States under Local Pauli Noise
Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay et al.
Magic in quantum trajectory unravelings of noisy random quantum circuits
Sara Santos, Alessio Paviglianiti, Vincenzo Savona
Magna: simulating magic state factories as cheaply as Clifford circuits
Yifei Wang, Yingfei Gu
Classical Capacity of Single-Mode Bosonic Gaussian Channels
Gerardo Adesso, Ludovico Lami, Vittorio Giovannetti
SynDebug: A Framework to Debug Logic Bugs in Fault-Tolerant Quantum Computing Programs
Nicholas S. DiBrita, Jack Lange, Tirthak Patel