Editing
Quantum Ml
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Remembering</span> == * '''Quantum computing''' β Computing that exploits quantum mechanical phenomena (superposition, entanglement) to process information differently from classical computers. * '''Qubit''' β The quantum analog of a classical bit; can exist in superposition of 0 and 1 states simultaneously. * '''Superposition''' β A quantum state that is a linear combination of multiple classical states simultaneously. * '''Entanglement''' β A quantum correlation between qubits where the state of one cannot be described independently of others. * '''Quantum gate''' β An operation on qubits analogous to a classical logic gate; reversible and unitary. * '''NISQ (Noisy Intermediate-Scale Quantum)''' β The current era of quantum computers: 50β1000 qubits, with significant noise and limited coherence time. * '''Quantum supremacy / advantage''' β When a quantum computer solves a problem faster than any classical computer can. * '''Variational Quantum Eigensolver (VQE)''' β A hybrid quantum-classical algorithm for finding ground state energies; relevant for quantum chemistry and materials. * '''Quantum Approximate Optimization Algorithm (QAOA)''' β A variational algorithm for combinatorial optimization problems. * '''Parametric quantum circuit''' β A quantum circuit with tunable parameters, analogous to a neural network's weights; trained by gradient descent. * '''Quantum kernel''' β A kernel function computed by a quantum circuit, measuring similarity in a high-dimensional quantum feature space. * '''HHL algorithm''' β A quantum algorithm for solving linear systems exponentially faster than classical methods under certain conditions. * '''Quantum annealing''' β A metaheuristic for optimization using quantum tunneling; implemented by D-Wave systems. * '''Barren plateau''' β A trainability problem in parameterized quantum circuits where gradients vanish exponentially with circuit width, analogous to vanishing gradients. </div> <div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information