THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS

DOI10.1142/S0219749905000980zbMath1075.81018arXivquant-ph/0410042MaRDI QIDQ5696623

No author found.

Publication date: 18 October 2005

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0410042

zbMATH Keywords

quantum algorithms; Boolean functions; query complexity; Walsh spectra

Mathematics Subject Classification ID

81P68: Quantum computation

94A60: Cryptography

Related Items

Quantum Algorithms Related to $$\textit{HN}$$ -Transforms of Boolean Functions, Application of Grover's algorithm to check non-resiliency of a Boolean function, Efficient quantum algorithms to construct arbitrary Dicke states, Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights, Quantum algorithms for learning Walsh spectra of multi-output Boolean functions, Quantum cryptographic property testing of multi-output Boolean functions, Efficient quantum algorithms related to autocorrelation spectrum, A quantum algorithm to estimate the Gowers \(U_2\) norm and linearity testing of Boolean functions

Cites Work

• The stability theory of stream ciphers
• On ``bent functions
• Relativized separation of EQP from \(\text{P}^{\text{NP}}\)
• Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
• Rapid solution of problems by quantum computation
• Quantum Complexity Theory
• Unnamed Item