On quantum realisation of Boolean functions by the fingerprinting technique
From MaRDI portal
Publication:3225895
DOI10.1515/DMA.2009.037zbMath1237.81046WikidataQ62045239 ScholiaQ62045239MaRDI QIDQ3225895
Alexander V. Vasiliev, Farid M. 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
Related Items
Quantum algorithm for dynamic programming approach for DAGs and applications, Deterministic construction of QFAs based on the quantum fingerprinting technique, Quantum online algorithms with respect to space and advice complexity, Quantum online streaming algorithms with logarithmic memory
Cites Work
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Quantum automata and quantum grammars
- Quantum branching programs and space-bounded nonuniform quantum complexity
- On the computational power of probabilistic and quantum branching program
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Improved Constructions of Quantum Automata