Computing Boolean Functions via Quantum Hashing (Q2944885)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Computing Boolean Functions via Quantum Hashing	scientific article

Statements

scholarly article

0 references

Computing Boolean Functions via Quantum Hashing (English)

0 references

Alexander V. Vasiliev

0 references

Farid M. Ablayev

0 references

Computing with New Resources

0 references

publication date

8 September 2015

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-13350-8_11

0 references

Computing Boolean Functions via Quantum Hashing

0 references

0 references

On the computational power of probabilistic and quantum branching program

0 references

Quantum computer with atomic logical qubits encoded on macroscopic three-level systems in common quantum electrodynamic cavity

0 references

Numerical computation of characteristic polynomials of Boolean functions and its applications

0 references

Quantum computational networks

0 references

Probabilistic verification of Boolean functions

0 references

0 references

Constructing Small Sets that are Uniform in Arithmetic Progressions

0 references

Quantum branching programs and space-bounded nonuniform quantum complexity

0 references

Branching Programs and Binary Decision Diagrams

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-13350-8_11

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

conf/birthday/AblayevV14

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2944885

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2944885&oldid=37896594"