The Quantum Fourier Transform in Algorithms
How the quantum Fourier transform is used in algorithms such as Shor’s and phase estimation, how it is built from gates and how it compares with the FFT.
BasicsAlgorithmsHardwareError CorrectionCryptographyMachine LearningInformation TheoryPhysics & SimulationApplicationsIndustry & Careers
Tagged: Superposition
333 articles
The Kochen-Specker Theorem and Contextuality
The Kochen-Specker theorem shows that quantum outcomes cannot all be fixed in advance independent of context. Proofs, experiments and meaning.
Quantum Gates and Circuits: Building a Computation
How quantum gates combine into circuits: basic gates, universal gate sets, entangling gates, circuit design, optimization and simulation.
Quantum Interference: The Engine of Every Speedup
Quantum interference lets amplitudes add or cancel. Why it drives every quantum speedup, with examples from experiments and algorithms.
Distinguishing Quantum States: Bounds and Methods
Methods and bounds for distinguishing quantum states, why non-orthogonal states cannot be told apart perfectly, and uses in quantum technology.
Quantum Walk Search Algorithms and Their Speedups
Search algorithms based on quantum walks: continuous and discrete time walks on graphs, their relation to Grover’s algorithm and their limits.
Atomic Quantum Computing: Ions, Atoms and Traps
Atomic quantum computing with trapped ions and neutral atoms: how atoms serve as qubits, their advantages and the challenges of scaling up.
Quantum Process Calculi for Concurrent Protocols
Quantum process calculi describe concurrent quantum programs and protocols formally. Key concepts, behavioral analysis and applications.
Quantum Optical Computing: Photons as Carriers
Quantum optical computing uses photons as qubits. Principles of quantum optics, optical gates, algorithms, challenges and error correction.
Quantum Dephasing Models and Noise Spectra
Models of dephasing describe how noise destroys quantum phase. Noise spectra, decoherence mechanisms, experiments and mitigation strategies.
Quantum Signal Processing: Polynomials From Rotations
Quantum signal processing builds polynomial transformations from sequences of qubit rotations. How it underlies modern quantum algorithms.
Quantum Coherent Computing and Coherence Budgets
Quantum coherent computing relies on keeping qubits coherent long enough to finish a computation. How coherence limits algorithms and applications.
