Quantum K-Means Clustering and Its Speedup
Quantum versions of k-means clustering, how they compute distances between points, the claimed speedups and the data loading caveat.
BasicsAlgorithmsHardwareError CorrectionCryptographyMachine LearningInformation TheoryPhysics & SimulationApplicationsIndustry & Careers
Tagged: Quantum Hardware
58 articles
Quantum Shannon Theory: Coding for Quantum Channels
Quantum Shannon theory extends Shannon’s information theory to quantum channels: compression, capacities, coding and entanglement.
Quantum Sampling Problems and Quantum Advantage
Sampling problems such as boson sampling and random circuit sampling were used to demonstrate quantum advantage. Why they are hard classically.
Quantum Embedding Problems: Fitting Systems Together
Quantum embedding methods treat a small, important part of a system on a quantum computer and the rest classically. How they work and scale.
Quantum Linear Systems Solving: HHL and After
Quantum algorithms for linear systems, from HHL to later improvements: how they work, their caveats and applications in science and finance.
Quantum State Machines and Their Transitions
How state machine models are extended to quantum systems, how they compare with classical state machines, and possible applications.
Error Mitigation Techniques: ZNE, PEC and More
Error mitigation techniques compared, including zero-noise extrapolation, probabilistic error cancellation and dynamical decoupling.
Quantum Hardware Co-Design: Algorithms Meet Qubits
Hardware-software co-design tailors quantum algorithms to qubit connectivity and noise, and hardware to algorithms. Strategies and examples.
Quantum Annealing for Optimization: What It Solves
What quantum annealing can solve: how it works, how it compares with classical optimizers, its hardware and software, and applications.
Quantum Counting Complexity: Classes and Results
Quantum counting complexity covers classes such as #P and their quantum analogues. Algorithms, speedups, oracle results and known bounds.
QIP: Quantum Interactive Proofs and QIP = PSPACE
QIP is the class of problems with quantum interactive proofs. Its definition, protocols and the 2010 result that QIP equals PSPACE.
Rotated Surface Codes: Fewer Qubits, Same Distance
The rotated surface code achieves the same distance as the standard surface code with about half the qubits. Layout, features and experiments.
