Quantum cryptographic property testing of multi-output Boolean functions
DOI10.1007/s11128-019-2299-1zbMath1504.94251OpenAlexW2943890952WikidataQ127911871 ScholiaQ127911871MaRDI QIDQ2100834
Publication date: 25 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-019-2299-1
Walsh spectrumquantum computationproperty testingmulti-output Boolean functionamplitude estimationgeneralized Deutsch-Jozsa algorithm
Fault detection; testing in circuits and networks (94C12) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Quantum algorithms and complexity in the theory of computing (68Q12) Boolean functions (94D10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Application of Grover's algorithm to check non-resiliency of a Boolean function
- Boolean functions and their applications in cryptography
- A quantum algorithm for testing and learning resiliency of a Boolean function
- Enhanced quantum searching via entanglement and partial diffusion
- Self-testing/correcting with applications to numerical problems
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Generalization and demonstration of an entanglement-based Deutsch-jozsa-like algorithm using a 5-qubit quantum computer
- Efficient quantum algorithms related to autocorrelation spectrum
- A different Deutsch-Jozsa
- A quantum algorithm for approximating the influences of Boolean functions and its applications
- Quantum algorithms for learning and testing juntas
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- New Results on Quantum Property Testing
- Quantum Computation and Quantum Information
- Extending the Promise of the Deutsch–Jozsa–Høyer Algorithm for Finite Groups
- Rapid solution of problems by quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Power of Quantum Computation
- Quantum Complexity Theory
- Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
- Quantum Algorithms for Testing Properties of Distributions
- THE DEUTSCH–JOZSA ALGORITHM REVISITED IN THE DOMAIN OF CRYPTOGRAPHICALLY SIGNIFICANT BOOLEAN FUNCTIONS
This page was built for publication: Quantum cryptographic property testing of multi-output Boolean functions
