Tu guía para la computación cuántica.
0%
Menú
¿Qué es la cuántica? La tecnología Las diferentes computadoras cuánticas Cambiando el mundo La historia de la seguridad El panorama inversor Aprender (plan de estudios) Empresas Aplicaciones Glosario Línea de tiempo Evaluación de afirmaciones Cursos Quantum, But Friendly Inside a Quantum Computer Quantum in the Real World Quantum Computing Foundations Quantum Circuits, Algorithms, and Industry Fault-Tolerant Quantum Computing and Technical Strategy Mi progreso Noticias FAQ Recursos adicionales Pregunta a Quantum Agentes de IA ★ Guardado
Acerca de Quiénes somos Metodología Contacto Aviso legal
Mi progreso
0%

Curioso cuántico

Ver progreso completo
GUARDA TU PROGRESO

Tu progreso vive en este navegador y se pierde si cierras sesión o lo borras, a menos que lo guardes con tu correo electrónico. El mismo correo en cualquier dispositivo = el mismo progreso.

Modo oscuro

Vista guiada
¿Todo esto es nuevo para ti? Añadimos pistas adicionales en lenguaje sencillo y recordatorios mientras aprendes. Las mismas lecciones, con la ayuda incluida.

Vista experta
Solo quieres las lecciones: limpias, rápidas y compactas, sin recordatorios adicionales. Esta es la vista predeterminada.

Idioma de la interfaz

Quantum Circuits, Algorithms, and Industry · Módulo 5/8: Canonical Quantum Algorithms

Objetivos de aprendizaje
  • Explain the core ideas in canonical quantum algorithms.
  • Apply the concepts to a small circuit or business/technical evaluation.
  • Identify limitations and appropriate benchmarks.
Toca Siguiente (o usa las teclas de flecha) para avanzar idea por idea. Al final te espera una verificación fija de tres preguntas: el punto de control del curso, con las mismas preguntas en cada intento. La ← en la parte superior te permite salir cuando quieras; el progreso se guarda.

Grover amplitude amplification

Grover's algorithm searches an unstructured space of N candidates in O(√N) oracle calls. It prepares a superposition, marks target states by phase, and repeatedly reflects amplitudes to amplify the target.

Grover provides a quadratic (not exponential) speedup and assumes an efficient oracle.

Quantum phase estimation

Phase estimation extracts an eigenphase of a unitary when supplied an eigenstate. It underlies order finding, energy estimation, and many fault-tolerant algorithms. Its precision requirements drive circuit depth and qubit resources.

Phase estimation is a central bridge between quantum dynamics and useful numerical answers.

Shor and cryptography

Shor's algorithm reduces factoring and discrete logarithms to period finding and phase-estimation-like procedures. It threatens RSA and elliptic-curve cryptography on sufficiently large fault-tolerant hardware.

The algorithm is known; the remaining uncertainty is the engineering scale and timing of a cryptographically relevant machine.

Applied activity

Complete a simulator or analysis exercise: reproduce the lesson's central example, record assumptions and outputs, and explain one source of error or limitation.

Verificación del módulo: Canonical Quantum Algorithms

3 preguntas: generadas de nuevo desde el banco en cada intento. Nota mínima 60%. Intentos ilimitados.

Leer el texto completo de la lección

1. Grover amplitude amplification

Grover's algorithm searches an unstructured space of N candidates in O(√N) oracle calls. It prepares a superposition, marks target states by phase, and repeatedly reflects amplitudes to amplify the target.

Grover provides a quadratic (not exponential) speedup and assumes an efficient oracle.

2. Quantum phase estimation

Phase estimation extracts an eigenphase of a unitary when supplied an eigenstate. It underlies order finding, energy estimation, and many fault-tolerant algorithms. Its precision requirements drive circuit depth and qubit resources.

Phase estimation is a central bridge between quantum dynamics and useful numerical answers.

3. Shor and cryptography

Shor's algorithm reduces factoring and discrete logarithms to period finding and phase-estimation-like procedures. It threatens RSA and elliptic-curve cryptography on sufficiently large fault-tolerant hardware.

The algorithm is known; the remaining uncertainty is the engineering scale and timing of a cryptographically relevant machine.

4. Applied activity

Complete a simulator or analysis exercise: reproduce the lesson's central example, record assumptions and outputs, and explain one source of error or limitation.

Quantum, But Friendly

How Small Is Small?The Spinning CoinBit vs QubitSpooky Friends Prueba final

Inside a Quantum Computer

The Golden ChandelierHow It ThinksGood At, Bad At Prueba final

Quantum in the Real World

Quantum You Already OwnThe Great Quantum RaceFollowing the Quantum Money Prueba final

La Academia

Quantum Computing FoundationsQuantum Circuits, Algorithms, and IndustryFault-Tolerant Quantum Computing and Technical Strategy El currículo completo

Respuestas rápidas

GlosarioFAQ Recursos adicionalesPregunta a Quantum Noticias cuánticas