Quantum Relief algorithm
From MaRDI portal
Publication:1994722
DOI10.1007/s11128-018-2048-xzbMath1400.68178arXiv2002.00184OpenAlexW3098745869MaRDI QIDQ1994722
Wenbin Yu, Pei-Pei Gao, Ching-Nung Yang, Wen-Jie Liu, Zhi-Guo Qu
Publication date: 1 November 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.00184
Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (10)
Continuous variable quantum steganography protocol based on quantum identity ⋮ Effects of quantum noises on \(\chi\) state-based quantum steganography protocol ⋮ Quantum-based feature selection for multiclassification problem in complex systems with edge computing ⋮ Synthesis of Deutsch-Jozsa circuits and verification by IBM Q ⋮ A unitary operator construction solution based on Pauli group for maximal dense coding with a class of symmetric states ⋮ Quantum transport on large-scale sparse regular networks by using continuous-time quantum walk ⋮ Quantum forgery attacks on COPA, AES-COPA and marble authenticated encryption algorithms ⋮ Quantum privacy-preserving price E-negotiation ⋮ A relative uncertainty measure for fuzzy rough feature selection ⋮ An efficient quantum private query protocol based on oracle and Grover iteration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum adiabatic machine learning
- 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
- Equivalences and Separations Between Quantum and Classical Learnability
- Computational Methods of Feature Selection
This page was built for publication: Quantum Relief algorithm
