Quantum Boltzmann Machines and Their Training
Quantum Boltzmann machines extend Boltzmann machines with quantum terms. How they are trained, possible uses and current challenges.
Every explainer on QuantumExplainer.com, newest first. Use the pillars above to jump straight to a topic.
739 articlesQuantum Boltzmann machines extend Boltzmann machines with quantum terms. How they are trained, possible uses and current challenges.
Quantum Gibbs states describe quantum systems in thermal equilibrium. How hard they are to prepare and study, and their uses.
Full quantum state tomography needs a number of measurements that grows exponentially with qubits. The cost, the methods and the alternatives.
How distinguishable two quantum states are is measured by the trace distance and fidelity. Why it matters for measurement, protocols and codes.
BB84, proposed by Bennett and Brassard in 1984, was the first QKD protocol. How it encodes bits in photons and detects eavesdropping.
Oracle query complexity counts the queries a quantum algorithm needs. Bounds, amplitude amplification, speedups and practical limitations.
Quantum algorithms for computational geometry problems such as convex hulls and point location, and where speedups are possible.
For which groups the hidden subgroup problem can be solved efficiently on a quantum computer, and why the non-abelian cases remain hard.
How quantum algorithms approach polynomial equations and polynomial optimization, and what speedups are plausible.
Quantum simulation uses qubits to model other quantum systems. The basic approach and its uses in materials science and chemistry.
Where quantum speedups come from: superposition, interference and entanglement, illustrated with Shor’s and Grover’s algorithms.
Where quantum and classical complexity classes are known or believed to differ, from oracle separations to the complexity zoo.