Qubit semantics and quantum trees
M. L. Dalla Chiara, R. Giuntini, R. Leporini, A. Leporati
Abstract
In the qubit semantics the meaning of any sentence α is represented by a quregister: a unit vector of the n--fold tensor product n 2, where n depends on the number of occurrences of atomic sentences in α. The logic characterized by this semantics, called quantum computational logic (QCL), is unsharp, because the non-contradiction principle is violated. We show that QCL does not admit any logical truth. In this framework, any sentence α gives rise to a quantum tree, consisting of a sequence of unitary operators. The quantum tree of α can be regarded as a quantum circuit that transforms the quregister associated to the atomic subformulas of α into the quregster associated to α.
Create a lesson
Related papers
Comment on "Supervised Learning with Quantum Hamiltonian Embeddings" (arXiv:2610.26833)
Alexander G. Abanov, Luca Candelori, Kharen Musaelian
Data informed Ansatz Selection for Variational Quantum Circuits
Manav Seksaria, Advith Desu, Anil Prabhakar
Operational Thresholds for Long-Range Entanglement in Quantum Networks
Arn Caesar, Xinqi Hu, Kim Christensen
QECert: Formal Foundations for Quantum Error-Correction Theory in Lean
Keming He, Jiahan Chen, Enji Xiong et al.
Reopening the one clean qubit case of a semi-grand challenge
Christopher W. Mansell
Recoverability of Gravitational Entanglement under Decoherence
Yi-Xuan Wang, Julen S. Pedernales, Martin B. Plenio