اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدScaling advantage in quantum simulation of geometrically frustrated magnets
84
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter systems. One important task is the simulation of geometrically frustrated magnets in which topological phenomena can emerge from competition between quantum and thermal fluctuations. Here we report on experimental observations of relaxation in such simulations, measured on up to 1440 qubits with microsecond resolution. By initializing the system in a state with topological obstruction, we observe quantum annealing (QA) relaxation timescales in excess of one microsecond. Measurements indicate a dynamical advantage in the quantum simulation over the classical approach of path-integral Monte Carlo (PIMC) fixed-Hamiltonian relaxation with multiqubit cluster updates. The advantage increases with both system size and inverse temperature, exceeding a million-fold speedup over a CPU. This is an important piece of experimental evidence that in general, PIMC does not mimic QA dynamics for stoquastic Hamiltonians. The observed scaling advantage, for simulation of frustrated magnetism in quantum condensed matter, demonstrates that near-term quantum devices can be used to accelerate computational tasks of practical relevance.
قيم البحث
اقرأ أيضاً
Drawing independent samples from high-dimensional probability distributions represents the major computational bottleneck for modern algorithms, including powerful machine learning frameworks such as deep learning. The quest for discovering larger fa
milies of distributions for which sampling can be efficiently realized has inspired an exploration beyond established computing methods and turning to novel physical devices that leverage the principles of quantum computation. Quantum annealing embodies a promising computational paradigm that is intimately related to the complexity of energy landscapes in Gibbs distributions, which relate the probabilities of system states to the energies of these states. Here, we study the sampling properties of physical realizations of quantum annealers which are implemented through programmable lattices of superconducting flux qubits. Comprehensive statistical analysis of the data produced by these quantum machines shows that quantum annealers behave as samplers that generate independent configurations from low-temperature noisy Gibbs distributions. We show that the structure of the output distribution probes the intrinsic physical properties of the quantum device such as effective temperature of individual qubits and magnitude of local qubit noise, which result in a non-linear response function and spurious interactions that are absent in the hardware implementation. We anticipate that our methodology will find widespread use in characterization of future generations of quantum annealers and other emerging analog computing devices.
Analog quantum simulators (AQS) will likely be the first nontrivial application of quantum technology for predictive simulation. However, there remain questions regarding the degree of confidence that can be placed in the results of AQS since they do
not naturally incorporate error correction. Specifically, how do we know whether an analog simulation of a quantum model will produce predictions that agree with the ideal model in the presence of inevitable imperfections? At the same time, there is a widely held expectation that certain quantum simulation questions will be robust to errors and perturbations in the underlying hardware. Resolving these two points of view is a critical step in making the most of this promising technology. In this work we formalize the notion of AQS reliability by determining sensitivity of AQS outputs to underlying parameters, and formulate conditions for robust simulation. Our approach naturally reveals the importance of model symmetries in dictating the robust properties. To demonstrate the approach, we characterize the robust features of a variety of quantum many-body models.
We analyze ground-state behaviors of fidelity susceptibility (FS) and show that the FS has its own distinct dimension instead of real systems dimension in general quantum phases. The scaling relation of the FS in quantum phase transitions (QPTs) is t
hen established on more general grounds. Depending on whether the FSs dimensions of two neighboring quantum phases are the same or not, we are able to classify QPTs into two distinct types. For the latter type, the change in the FSs dimension is a characteristic that separates two phases. As a non-trivial application to the Kitaev honeycomb model, we find that the FS is proportional to $L^2ln L$ in the gapless phase, while $L^2$ in the gapped phase. Therefore, the extra dimension of $ln L$ can be used as a characteristic of the gapless phase.
We theoretically explore the driven-dissipative physics of geometrically frustrated lattices of cavity resonators with relatively weak nonlinearities, i.e. a photon-photon interaction smaller than the loss rate. In such systems, photon modes with zer
o probability at dark sites are present at the single-particle level due to interference effects. In particular, we study the behavior of a cell with three coupled resonators as well as extended Lieb lattices in 1D and 2D. By considering a partial pumping scheme, with the driving field not applied to the dark sites, we predict that even in presence of relatively weak photon-photon interactions the nominally dark sites achieve a finite photonic population with strong correlations. We show that this is a consequence of biphoton and multiphoton states that in the absence of frustration would not be visible in the observables.
Simulation of a quantum many-body system at finite temperatures is crucially important but quite challenging. Here we present an experimentally feasible quantum algorithm assisted with continuous-variable for simulating quantum systems at finite temp
eratures. Our algorithm has a time complexity scaling polynomially with the inverse temperature and the desired accuracy. We demonstrate the quantum algorithm by simulating finite temperature phase diagram of the Kitaev model. It is found that the important crossover phase diagram of the Kitaev ring can be accurately simulated by a quantum computer with only a few qubits and thus the algorithm may be readily implemented on current quantum processors. We further propose a protocol implementable with superconducting or trapped ion quantum computers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
