On the entanglement and mixedness of quantum Boolean function circuits

DOI10.1007/978-3-031-81202-6_9MaRDI QIDQ6996891zbMATH OpenFDO

Authors Zornitza Prodanoff, Iliya Kulbaka, Natasha Interlichia

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-3-031-81202-6_9

zbMATH Keywords

algebraic normal form (ANF)Boolean functiondisjunctive normal form (DNF)quantum computingquantum negativityreversible computingvon Neumann entropyZhegalkin polynomial

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A closed set of normal orthogonal functions.
• A Mathematical Theory of Communication
• Encyclopedia of cryptography and security.
• Error detecting and error correcting codes
• Extracting reaction systems from function behavior
• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3103212 (Why is no real title available?)
• On the resistance of Boolean functions against fast algebraic attacks
• Quantum Complexity Theory
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Separability Criterion for Density Matrices
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Über den Aussagenkalkül in der symbolischen Logik.

This page was built for publication: On the entanglement and mixedness of quantum Boolean function circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996891)