Jove
Visualize
Contáctanos
JoVE
x logofacebook logolinkedin logoyoutube logo
ACERCA DE JoVE
Visión GeneralLiderazgoBlogCentro de Ayuda JoVE
AUTORES
Proceso de PublicaciónConsejo EditorialAlcance y PolíticasRevisión por ParesPreguntas FrecuentesEnviar
BIBLIOTECARIOS
TestimoniosSuscripcionesAccesoRecursosConsejo Asesor de BibliotecasPreguntas Frecuentes
INVESTIGACIÓN
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchivo
EDUCACIÓN
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualCentro de Recursos para ProfesoresSitio de Profesores
Términos y Condiciones de Uso
Política de Privacidad
Políticas

Videos de Conceptos Relacionados

Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

11.3K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
11.3K
The Quantum-Mechanical Model of an Atom02:45

The Quantum-Mechanical Model of an Atom

42.5K
Shortly after de Broglie published his ideas that the electron in a hydrogen atom could be better thought of as being a circular standing wave instead of a particle moving in quantized circular orbits, Erwin Schrödinger extended de Broglie’s work by deriving what is now known as the Schrödinger equation. When Schrödinger applied his equation to hydrogen-like atoms, he was able to reproduce Bohr’s expression for the energy and, thus, the Rydberg formula governing hydrogen spectra.
42.5K
Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

2.6K
In the Carnot engine, which achieves the maximum efficiency between two reservoirs of fixed temperatures, the total change in entropy is zero. The observation can be generalized by considering any reversible cyclic process consisting of many Carnot cycles. Thus, it can be stated that the total entropy change of any ideal reversible cycle is zero.
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
2.6K
Per-Unit Sequence Models01:26

Per-Unit Sequence Models

98
An ideal Y-Y transformer, grounded through neutral impedances, displays per-unit sequence networks akin to those of a single-phase ideal transformer when subjected to balanced positive- or negative-sequence currents. These currents do not produce neutral currents, and their associated voltage drops.
Zero-sequence currents, which are identical in magnitude and phase, generate a neutral current, resulting in voltage drops across the neutral impedance and the low-voltage winding. If the...
98
Equilibrium Conditions for a Particle01:23

Equilibrium Conditions for a Particle

1.2K
When an object is in equilibrium, it is either at rest or moving with a constant velocity. There are two types of equilibrium: static and dynamic. Static equilibrium occurs when an object is at rest, while dynamic equilibrium occurs when an object is moving with a constant velocity. In both cases, there must be a balance of forces acting on the object.
To understand the concept of equilibrium, let us first consider the forces acting on an object. When different forces act on an object, they can...
1.2K
Propagation of Uncertainty from Random Error00:59

Propagation of Uncertainty from Random Error

731
An experiment often consists of more than a single step. In this case, measurements at each step give rise to uncertainty. Because the measurements occur in successive steps, the uncertainty in one step necessarily contributes to that in the subsequent step. As we perform statistical analysis on these types of experiments, we must learn to account for the propagation of uncertainty from one step to the next. The propagation of uncertainty depends on the type of arithmetic operation performed on...
731

También podría leer

Artículos Relacionados

Artículos vinculados a este trabajo por autores compartidos, revista y gráfico de citas.

Ordenar por
Same author

Localized sample-based quantum diagonalization for strongly correlated chemistry.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same author

Matched case-control study of odontoid osteosynthesis vs hard collar immobilisation for Type II odontoid fractures in the elderly: higher risk of adverse events with no long-term functional benefits.

European spine journal : official publication of the European Spine Society, the European Spinal Deformity Society, and the European Section of the Cervical Spine Research Society·2026
Same author

Efficacy and safety of a thermosensitive poloxamer-based hydrogel as an anti-adhesive agent in full-endoscopic spine surgery: a randomized controlled trial in Thailand.

Asian spine journal·2026
Same author

Utility of the scope retractor for adhesiolysis in unilateral biportal endoscopic lumbar surgery: illustrative cases.

Journal of neurosurgery. Case lessons·2026
Same author

Development and Validation of Quantitative Greyscale Analyses for the Detection of Aspiration-related Lung Pathophysiology in an Infant Pig Model.

Dysphagia·2026
Same author

Molecular Quantum Computations on a Protein.

Journal of chemical theory and computation·2026

Video Experimental Relacionado

Updated: Jul 23, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

605

Cadenas de Markov mejoradas por el Quantum Monte Carlo

David Layden1, Guglielmo Mazzola2,3, Ryan V Mishmash4,5

  • 1IBM Quantum, Almaden Research Center, San Jose, CA, USA. david.layden@ibm.com.

Nature
|July 12, 2023
PubMed
Resumen

Este estudio introduce un algoritmo cuántico para el muestreo de cadena de Markov Monte Carlo (MCMC). Converge para corregir distribuciones más rápido que los métodos clásicos, ofreciendo potenciales aceleraciones para el aprendizaje automático y la física.

Más Videos Relacionados

Gradient Echo Quantum Memory in Warm Atomic Vapor
10:00

Gradient Echo Quantum Memory in Warm Atomic Vapor

Published on: November 11, 2013

12.9K
Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method
05:51

Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method

Published on: July 19, 2019

6.3K

Videos de Experimentos Relacionados

Last Updated: Jul 23, 2025

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

605
Gradient Echo Quantum Memory in Warm Atomic Vapor
10:00

Gradient Echo Quantum Memory in Warm Atomic Vapor

Published on: November 11, 2013

12.9K
Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method
05:51

Isotopic Effect in Double Proton Transfer Process of Porphycene Investigated by Enhanced QM/MM Method

Published on: July 19, 2019

6.3K

Área de la Ciencia:

  • La computación cuántica
  • Física computacional
  • Aprendizaje automático

Sus antecedentes:

  • Los procesadores cuánticos actuales se enfrentan a limitaciones en tamaño y tasas de error.
  • Los algoritmos cuánticos a corto plazo a menudo se centran en el muestreo de distribuciones de probabilidad complejas.
  • La cadena de Markov Monte Carlo (MCMC) es una técnica clave para el muestreo de distribuciones.

Objetivo del estudio:

  • Introducir y demostrar un algoritmo cuántico para el muestreo de las distribuciones de Boltzmann de los modelos clásicos de Ising.
  • Para abordar la necesidad de problemas de muestreo útiles que puedan resolverse con el hardware cuántico actual.
  • Proporcionar un enfoque cuántico para MCMC que sea probadamente convergente.

Principales métodos:

  • Desarrolló un algoritmo cuántico que implementa la cadena de Markov Monte Carlo (MCMC).
  • Experimentalmente demostrado el algoritmo en el hardware cuántico actual.
  • Las tasas de convergencia analizadas a través de experimentos y simulaciones clásicas.

Principales resultados:

  • El algoritmo cuántico MCMC demostró convergencia en menos iteraciones que las alternativas clásicas.
  • Los experimentos sugieren que el algoritmo cuántico es resistente al ruido.
  • Las simulaciones revelaron una aceleración del polinomio cúbico a cuártico sobre los métodos clásicos de MCMC.

Conclusiones:

  • El algoritmo cuántico MCMC desarrollado ofrece un camino viable para resolver problemas de muestreo útiles.
  • Las aceleraciones empíricas sugieren el potencial para aliviar los cuellos de botella computacionales en el aprendizaje automático, la física estadística y la optimización.
  • Este trabajo abre caminos para que las computadoras cuánticas aborden los desafíos prácticos de muestreo.