<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>quantum dynamics &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/quantum-dynamics/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Tue, 22 Sep 2026 22:56:25 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.1</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>quantum dynamics &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>The Mathematics That Links Frozen Magnets to Black Hole Chaos</title>
		<link>https://scienmag.com/the-mathematics-that-links-frozen-magnets-to-black-hole-chaos/</link>
		
		<dc:creator><![CDATA[Katie Riggs]]></dc:creator>
		<pubDate>Tue, 22 Sep 2026 22:56:25 +0000</pubDate>
				<category><![CDATA[Chemistry]]></category>
		<category><![CDATA[black hole analogies in condensed matter]]></category>
		<category><![CDATA[black hole information scrambling]]></category>
		<category><![CDATA[black hole physics]]></category>
		<category><![CDATA[Condensed matter physics]]></category>
		<category><![CDATA[disordered spin systems]]></category>
		<category><![CDATA[frustrated quantum magnets]]></category>
		<category><![CDATA[information scrambling]]></category>
		<category><![CDATA[mathematical solutions in quantum physics]]></category>
		<category><![CDATA[Physical Review Letters]]></category>
		<category><![CDATA[quantum chaos]]></category>
		<category><![CDATA[quantum dynamics]]></category>
		<category><![CDATA[Quantum Entanglement]]></category>
		<category><![CDATA[quantum field theory]]></category>
		<category><![CDATA[quantum information theory]]></category>
		<category><![CDATA[quantum magnetism]]></category>
		<category><![CDATA[quantum technologies]]></category>
		<category><![CDATA[Sachdev-Ye-Kitaev model]]></category>
		<category><![CDATA[spin glass]]></category>
		<category><![CDATA[spin glass dynamics]]></category>
		<category><![CDATA[SYK model]]></category>
		<category><![CDATA[transition from frozen to chaotic states]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=208555</guid>

					<description><![CDATA[University at Buffalo physicists have found a mathematical solution showing how a frustrated quantum magnet can transition from ultraslow glassy behavior to the fast, highly entangled dynamics described by the Sachdev-Ye-Kitaev model used to study black hole physics.]]></description>
										<content:encoded><![CDATA[<p>Physicists at the University at Buffalo have produced a mathematical solution to one of the most striking puzzles in modern quantum physics: how matter can transform from one of the slowest, most inert states imaginable into one of the fastest, most chaotic regimes known to science. Their work, published in Physical Review Letters, shows that a frustrated quantum magnet known as a spin glass can, under the right conditions, shed its frozen character and enter a regime of rapid, highly entangled dynamics described by the Sachdev-Ye-Kitaev model, the same theoretical framework physicists use to probe the information-scrambling behavior of black holes. The result, led by assistant professor Jamir Marino, provides an explicit mathematical bridge between two corners of physics that had long seemed to belong to different universes.</p>
<p>Spin glasses occupy a peculiar place in condensed matter physics. In ordinary magnets, atomic spins tend to align in an orderly pattern, pointing in the same direction and responding to disturbances in predictable ways. In a spin glass, by contrast, the interactions between spins are frustrated: the geometry and disorder of the system make it impossible for all the spins to settle into an arrangement that satisfies every competing influence simultaneously. The result is a state in which the atomic magnets point in disordered directions and become effectively frozen in place, locked into a rigid but random configuration. Because the spins cannot reorganize themselves easily, these systems respond to disturbances extraordinarily slowly, and information that enters the system can remain trapped for very long periods.</p>
<p>That sluggishness is precisely what makes spin glasses interesting beyond fundamental physics. Their capacity to hold information in place has implications for technologies in which stored quantum information must be protected from rapid degradation, and their landscape of competing configurations resembles the rugged cost landscapes that arise in complex optimization problems, including those encountered in artificial intelligence and machine learning. Understanding how spin glasses behave under extreme conditions, particularly at very low temperatures where quantum effects become important, has therefore been a goal with both practical and conceptual significance.</p>
<p>At the opposite end of the dynamical spectrum sits the Sachdev-Ye-Kitaev model, usually abbreviated as SYK. Proposed by Subir Sachdev and Jinwu Ye and later extended by Alexei Kitaev, the model describes a collection of particles whose interactions are so strongly and randomly coupled that the particles become massively entangled with one another. In this regime, any local piece of information is rapidly spread, or scrambled, across the entire system, in much the same way that physicists believe information is scrambled behind the horizons of black holes. The SYK model has become a central tool for studying quantum chaos, fast scrambling, and the strange correspondence between quantum systems and gravitational physics, but its relationship to ordinary, sluggish condensed matter has remained obscure.</p>
<p>Marino and his collaborators, including first author Hossein Hosseinabadi, a former graduate student in Marino&#8217;s laboratory who is now an independent distinguished postdoctoral scholar at the Max Planck Institute for the Physics of Complex Systems in Germany, set out to understand what happens to a spin glass as quantum fluctuations grow stronger, especially at extremely low temperatures where the standard mathematical descriptions of these systems have struggled. Their inquiry focused on an infinite-range quantum Heisenberg spin glass, an idealized but well-defined setting in which every spin interacts with every other spin, and quantum mechanical fluctuations compete directly with the glassy tendency of the spins to freeze.</p>
<p>To attack the problem, the team employed quantum field theory techniques based on an unconventional representation of spins, a mathematical reformulation that allowed them to follow the behavior of the system as the temperature drops. Rather than treating the spins as simple arrows pointing in fixed directions, this representation exposes their quantum nature and makes it possible to track how fluctuations grow and interact with the frozen order. The approach enabled the researchers to probe regimes that conventional treatments of spin glasses could not reach reliably, and to characterize the dynamics of the system throughout the crossover.</p>
<p>What they discovered came as a surprise. Intuition suggests that lowering the temperature should make a spin glass freeze even more thoroughly, locking its spins into ever more rigid disorder. Instead, the calculations revealed that as the temperature falls and quantum fluctuations intensify, those fluctuations can disrupt and eventually dismantle the locked arrangement of spins. Rather than becoming more firmly frozen, the system passes through a crossover in which the spins become so strongly entangled that they lose their individual identities altogether, and the slow glassy dynamics gives way to the fast, collective, scrambling behavior of the SYK model. The spin glass, in effect, melts from within, not because of heat but because of quantum mechanics.</p>
<p>You normally think that lowering the temperature will freeze something even more, Marino notes, but here the quantum effects can essentially melt the spin glass and carry the system from extremely slow dynamics to extremely fast dynamics. The team&#8217;s solution does not merely assert that this transition occurs; it provides the mathematical machinery that describes how matter moves from among the slowest states in quantum dynamics to among the fastest, tracing the entire trajectory and characterizing the intermediate states that lie between the two extremes. In doing so, it supplies a controlled, solvable example of a phenomenon that touches some of the deepest questions about the flow of quantum information.</p>
<p>The broader implications extend in several directions. Because spin glasses are natural candidates for architectures in which quantum information must be stored and protected, while SYK-like dynamics represents the rapid spreading of information that quantum technologies often try to avoid or exploit deliberately, understanding the pathway between these regimes could help engineers control when information stays put and when it disperses. The work also offers a concrete laboratory-scale connection to black hole physics: the same mathematical description that governs information scrambling in gravitational systems now emerges from an ordinary, if exotic, quantum magnet, reinforcing the idea that the principles of quantum chaos transcend the specific systems in which they were first discovered.</p>
<p>The study, titled Crossover to Sachdev-Ye-Kitaev Criticality in an Infinite-Range Quantum Heisenberg Spin Glass, appeared in Physical Review Letters, a journal of the American Physical Society, on September 17, and represents a collaboration between the University at Buffalo and Harvard University, where Marino worked alongside Subir Sachdev, the Herchel Smith Professor of Physics who first proposed the SYK model with Jinwu Ye. The research was performed using computational modeling and simulation grounded in quantum field theory, and its mathematical solution demonstrates that the boundary between ultraslow glassy order and ultrafast entangled chaos is not a wall but a traversable landscape, one that physicists can now explore with quantitative precision.</p>
<p><strong>Subject of Research:</strong> A mathematical solution describing the transition of an infinite-range quantum Heisenberg spin glass from slow glassy dynamics to fast Sachdev-Ye-Kitaev quantum critical behavior.</p>
<p><strong>Article Title:</strong> Physicists crack the math connecting ultraslow quantum magnetism to ultrafast black-hole physics</p>
<p><strong>Article References:</strong> Physicists crack the math connecting ultraslow quantum magnetism to ultrafast black-hole physics. (n.d.). <a href="https://www.eurekalert.org/news-releases/1145023" rel="noopener noreferrer">Original publication</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> Not provided</p>
<p><strong>Keywords:</strong> spin glass, SYK model, quantum magnetism, black hole physics, quantum chaos, quantum entanglement, information scrambling, quantum field theory, condensed matter physics, quantum dynamics, Physical Review Letters, quantum technologies</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">208555</post-id>	</item>
		<item>
		<title>CUDA-Q Accelerates Adaptive Distribution Generation Using Quantum Walks</title>
		<link>https://scienmag.com/cuda-q-accelerates-adaptive-distribution-generation-using-quantum-walks/</link>
		
		<dc:creator><![CDATA[Katie Riggs]]></dc:creator>
		<pubDate>Wed, 26 Aug 2026 05:15:27 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[adaptive distribution generation]]></category>
		<category><![CDATA[discrete-time quantum walks]]></category>
		<category><![CDATA[GPU-accelerated CUDA-Q]]></category>
		<category><![CDATA[high-precision probability distribution]]></category>
		<category><![CDATA[quantum algorithms for data generation]]></category>
		<category><![CDATA[Quantum Computing]]></category>
		<category><![CDATA[quantum dynamics]]></category>
		<category><![CDATA[quantum generative models]]></category>
		<category><![CDATA[quantum machine intelligence]]></category>
		<category><![CDATA[quantum speedup in data processing]]></category>
		<category><![CDATA[quantum walks]]></category>
		<category><![CDATA[variational quantum circuits]]></category>
		<guid isPermaLink="false">https://scienmag.com/cuda-q-accelerates-adaptive-distribution-generation-using-quantum-walks/</guid>

					<description><![CDATA[Quantum computing is moving into a new phase of experimentation, one in which researchers are no longer asking only whether quantum systems can solve difficult problems, but whether they can generate useful data quickly enough to compete with established computational methods. A study published in Quantum Machine Intelligence introduces a framework designed around that challenge: [&#8230;]]]></description>
										<content:encoded><![CDATA[<p>Quantum computing is moving into a new phase of experimentation, one in which researchers are no longer asking only whether quantum systems can solve difficult problems, but whether they can generate useful data quickly enough to compete with established computational methods. A study published in <em>Quantum Machine Intelligence</em> introduces a framework designed around that challenge: a Quantum Walk–based Adaptive Distribution Generator, or QW-based ADG. The system combines variational quantum circuits, discrete-time quantum walks and GPU-accelerated CUDA-Q software to produce target probability distributions with high precision. In tests involving financial data and two-dimensional images, the authors report that their method achieved accuracy comparable to, and in some cases better than, a quantum generative adversarial network while running more than ten times faster for two-dimensional tasks. The result places quantum walks—often associated with fundamental studies of quantum dynamics—at the center of a practical approach to generative modeling.</p>
<p>At the heart of the method is the quantum walk, a quantum analogue of a random walk. In a classical random walk, a particle moves step by step according to probabilities determined by a coin flip or another transition rule. A quantum walker, by contrast, can occupy a superposition of positions and internal states, allowing multiple paths to evolve simultaneously. These paths interfere with one another, creating probability distributions that can spread, concentrate or develop intricate structures in ways that have no direct classical equivalent. The researchers use discrete-time quantum walks, in which each step consists of applying a “coin” operation to an internal qubit state followed by a position-dependent shift. By adjusting the coin parameters as the walk progresses, the quantum state can be guided toward a desired probability profile rather than being left to evolve under fixed rules.</p>
<p>The study focuses particularly on split-step quantum walks, or SSQWs. Instead of applying one uniform movement operation, a split-step walk divides the evolution into separate conditional shifts, each controlled by a coin transformation. This additional structure provides greater flexibility in shaping the final distribution. The coin operations can be represented by parameterized quantum gates, with rotation angles acting as trainable variables. The system therefore turns distribution generation into an optimization problem: a classical optimizer compares the probability distribution produced by the quantum circuit with a target distribution, then updates the circuit parameters to reduce the discrepancy. Repeated iterations allow the quantum walk to adapt its dynamics. Rather than preparing a complicated state directly through a long sequence of gates, the method uses the walk itself as a controllable mechanism for sculpting the state over time.</p>
<p>A further element of the framework is the use of entangled quantum walks for more complex generation tasks. In a one-dimensional problem, the walker’s position can encode a scalar variable such as an asset price, return or another financial quantity. Two-dimensional patterns require a larger state space, however, because the system must represent correlations between two coordinates. Entanglement offers a way to link the evolution of separate quantum degrees of freedom so that their measurement outcomes are not independent. In the researchers’ architecture, entangled extensions of the walk help capture relationships within structured data. This is particularly important for image-like distributions, where neighboring pixels and global patterns are connected. A generator that reproduces individual pixel frequencies but fails to reproduce those relationships would produce noise rather than recognizable structure.</p>
<p>The authors demonstrate the one-dimensional capability using financial simulation. Financial models often require the generation of samples from nontrivial probability distributions, including distributions with asymmetry, heavy tails or other features that are difficult to represent accurately with simple analytic assumptions. Quantum state preparation can encode such distributions into the amplitudes of a quantum register, but preparing arbitrary states efficiently is a major technical challenge. The QW-based ADG approaches the problem adaptively. Its variational circuit adjusts the quantum-walk dynamics until measurements approximate the desired financial distribution. The study reports experiments using equity data, including information downloaded from Yahoo Finance and data associated with NVIDIA. The purpose is not to suggest that a quantum walk predicts market movements, but to test whether it can reproduce statistical patterns that are useful for simulation and downstream computational finance applications.</p>
<p>For two-dimensional generation, the researchers use the MNIST dataset, a standard collection of handwritten digits frequently used to evaluate machine-learning systems. In this setting, the generator is trained to reproduce structured patterns corresponding to digits from zero through nine. The quantum circuit does not create a classical bitmap in the same way as a conventional image generator. Instead, amplitudes in the quantum state define a probability landscape over encoded positions. When the state is measured, samples can be interpreted as points or patterns in that landscape. Through entangled quantum-walk operations and adaptive parameter updates, the probability mass is steered toward configurations associated with the target digit. The resulting task is a compact demonstration of how quantum dynamics might represent correlations in multidimensional data, even though the current experiment remains a controlled benchmark rather than a full-scale image-generation system.</p>
<p>The reported performance advantage comes largely from the way the approach combines quantum simulation with classical hardware acceleration. The circuits are implemented with CUDA-Q, NVIDIA’s platform for integrated quantum-classical computing, and executed using GPU resources. Variational algorithms naturally involve repeated cycles of circuit construction, simulation, measurement and parameter optimization. If each iteration is handled slowly, the cost of training can overwhelm the potential benefits of the underlying quantum model. GPU acceleration allows many numerical operations associated with state-vector evolution, probability calculation and optimization to be performed in parallel. According to the study, this implementation enabled the QW-based ADG to run more than ten times faster than a standard QGAN in the two-dimensional tests, while maintaining comparable or superior accuracy. The comparison is therefore a benchmark of an end-to-end hybrid workflow, not evidence that present-day quantum hardware universally outperforms classical computers.</p>
<p>That distinction is crucial because the experiments rely on quantum-circuit simulation and are situated within the current era of hybrid quantum computing. The quantum processors available today are limited by noise, restricted qubit counts and measurement overhead, while classical simulators can require substantial memory as the number of qubits grows. A state-vector simulator represents the complex amplitude associated with every basis state, meaning the memory requirement increases exponentially with the number of qubits. CUDA-Q acceleration can make simulations considerably more practical, but it does not remove that fundamental scaling challenge. The study’s results instead highlight a different opportunity: quantum-inspired structures and quantum programming tools can be developed, tested and optimized on classical accelerators before larger, more reliable quantum devices become available. The adaptive quantum-walk architecture may ultimately be evaluated on hardware, but its present contribution is a computational framework and a performance-oriented implementation.</p>
<p>The research also illustrates why quantum walks are attracting renewed attention in quantum machine learning. Generative models depend on expressive representations, efficient training and the ability to reproduce meaningful statistical relationships. Variational quantum circuits provide tunable parameters, while quantum walks supply a physically motivated evolution rule that can distribute amplitude across a state space. Together, they create a model whose behavior can be adjusted continuously rather than determined by a fixed state-preparation recipe. The authors present this combination as a bridge between theoretical quantum algorithms and practical high-performance computing. Future work will need to test the method against larger datasets, stronger classical baselines and realistic hardware noise, while clarifying how its computational cost scales with dimension and precision. Even with those questions unresolved, the study offers a striking message: quantum generative modeling may not depend on a single headline-grabbing algorithm, but on carefully engineered combinations of quantum dynamics, machine learning and accelerated classical computation.</p>
<p><strong>Subject of Research</strong>: Quantum computing and quantum generative modeling</p>
<p><strong>Article Title</strong>: Quantum walks–based adaptive distribution generation with efficient CUDA-Q acceleration</p>
<p><strong>Article References</strong>: Chang, Y. J., Wang, W. T., Liu, C. Y., et al. “Quantum walks–based adaptive distribution generation with efficient CUDA-Q acceleration.” <em>Quantum Machine Intelligence</em>, 8, Article 42 (2026). <a href="https://doi.org/10.1007/s42484-026-00391-8">https://doi.org/10.1007/s42484-026-00391-8</a></p>
<p><strong>Image Credits</strong>: AI Generated</p>
<p><strong>DOI</strong>: 10.1007/s42484-026-00391-8</p>
<p><strong>Keywords</strong>: Quantum computing, split-step quantum walks, entangled quantum walks, adaptive distribution generation, CUDA-Q, variational quantum circuits, generative modeling, quantum state preparation</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">182064</post-id>	</item>
	</channel>
</rss>
