On quantum realisation of Boolean functions by the fingerprinting technique

DOI10.1515/DMA.2009.037MaRDI QIDQ3225895zbMATH OpenOpenAlexWikidataFDO

Authors Alexander V. Vasiliev, F. Ablayev

Publication date 23 March 2012

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2009.037

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Algorithms for quantum branching programs based on fingerprinting
• On the power of quantum fingerprinting
• Computing Boolean functions via quantum hashing
• Boolean functions identification via quantum computing methods
• SOFSEM 2005: Theory and Practice of Computer Science

Cites work

• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Improved Constructions of Quantum Automata
• On the computational power of probabilistic and quantum branching program
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum automata and quantum grammars
• Quantum branching programs and space-bounded nonuniform quantum complexity

Cited in

(6)

• Quantum online streaming algorithms with logarithmic memory
• Algorithms for quantum branching programs based on fingerprinting
• Quantum algorithm for dynamic programming approach for DAGs and applications
• Computing Boolean functions via quantum hashing
• Quantum online algorithms with respect to space and advice complexity
• Deterministic construction of QFAs based on the quantum fingerprinting technique

This page was built for publication: On quantum realisation of Boolean functions by the fingerprinting technique

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