Efficient quantum algorithm for the parity problem of a certain function

DOI10.1007/s10773-018-3827-yzbMath1412.81104OpenAlexW2883008200WikidataQ62037275 ScholiaQ62037275MaRDI QIDQ1740738

Josep Batle, Ahmed Farouk, Tadao Nakamura, Koji Nagata

Publication date: 3 May 2019

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-018-3827-y

zbMATH Keywords

quantum algorithmsquantum computation

Mathematics Subject Classification ID

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

Related Items (2)

Necessary and sufficient condition for quantum computing ⋮ Quantum communication based on an algorithm of determining a matrix

Cites Work

• Quantum cryptography based on the Deutsch-Jozsa algorithm
• Quantum cryptography, quantum communication, and quantum computer in a noisy environment
• Quantum algorithms for algebraic problems
• Information and computation: Classical and quantum aspects
• Handbook of Natural Computing
• Rapid solution of problems by quantum computation
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms revisited
• Quantum Complexity Theory
• Quantum cryptography based on Bell’s theorem
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Introduction to Quantum Computation and Information
• Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient quantum algorithm for the parity problem of a certain function