اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSpacetime as the optimal generative network of quantum states: a roadmap to QM=GR?
52
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The idea that spacetime geometry is built from quantum entanglement has been widely accepted in the last years. But how exactly the geometry is related with quantum states is still unclear. In this note, based on the idea of deep learning, we propose a mechanism for Susskinds QM=GR hypothesis, spacetime geometry as the optimal generative network of quantum states. We speculate that the space geometry stems as a geodesic tensor network which defines the quantum state complexity of a fundamental quantum state under a given metric. Spacetime corresponds to an evolving tensor network that generates an evolutional fundamental quantum system. This mechanism provides (a) a constructive correspondence between quantum states and spacetime geometry; (b)a spacetime structure emerging from a highly constrained geodesic so that the QEC-like structure shown in AdS/CFT can be naturally realized and (c) a mechanism to derive the gravity equation from the concept of quantum state complexity. With this mechanism, spacetime can have a quantum mechanical description. We hope this may lead to another view direction to understand the basic rules of our world.
قيم البحث
اقرأ أيضاً
Tremendous progress has been witnessed in artificial intelligence, where neural network backed deep learning systems have been used, with applications in almost every domain. As a representative deep learning framework, Generative Adversarial Network
(GAN) has been widely used for generating artificial images, text-to-image or image augmentation across areas of science, arts and video games. However, GANs are computationally expensive, sometimes computationally prohibitive. Furthermore, training GANs may suffer from convergence failure and modal collapse. Aiming at the acceleration of use cases for practical quantum computers, we propose QuGAN, a quantum GAN architecture that provides stable convergence, quantum-states based gradients and significantly reduced parameter sets. The QuGANarchitecture runs both the discriminator and the generator purely on quantum state fidelity and utilizes the swap test on qubits to calculate the values of quantum-based loss functions. Built on quantum layers, QuGAN achieves similar performance with a 94.98% reduction on the parameter set when compared to classical GANs. With the same number of parameters, addition-ally, QuGAN outperforms state-of-the-art quantum based GANsin the literature providing a 48.33% improvement in system performance compared to others attaining less than 0.5% in terms of similarity between generated distributions and original data sets.
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian generator of CTQW
s, which are the complex phases along the loops of the underlying graph, was acknowledged for its interest in optimizing or suppressing transport on specific topologies. We argue that the quantum-classical distance, a figure of merit which was introduced to capture the difference in dynamics between a CTQW and its classical, stochastic counterpart, guides the optimization of parameters of the Hamiltonian to achieve better quantum transport on cycle graphs and spatial search to the quantum speed limit without an oracle on complete graphs, the latter also implying fast uniform mixing. We compare the variations of this quantity with the 1-norm of coherence and the Inverse Participation Ratio, showing that the quantum-classical distance is linked to both, but in a topology-dependent relation, which is key to spot the most interesting quantum evolution in each case.
Within the last two decades, Quantum Technologies (QT) have made tremendous progress, moving from Noble Prize award-winning experiments on quantum physics into a cross-disciplinary field of applied research. Technologies are being developed now that
explicitly address individual quantum states and make use of the strange quantum properties, such as superposition and entanglement. The field comprises four domains: Quantum Communication, Quantum Simulation, Quantum Computation, and Quantum Sensing and Metrology. One success factor for the rapid advancement of QT is a well-aligned global research community with a common understanding of the challenges and goals. In Europe, this community has profited from several coordination projects, which have orchestrated the creation of a 150-page QT Roadmap. This article presents an updated summary of this roadmap. Besides sections on the four domains of QT, we have included sections on Quantum Theory and Software, and on Quantum Control, as both are important areas of research that cut across all four domains. Each section, after a short introduction to the domain, gives an overview on its current status and main challenges and then describes the advances in science and technology foreseen for the next ten years and beyond.
Let two coordinate systems, in possession of Alice and Bob, be related to each other by an unknown rotation $Rin SO(3)$. Alice is to send identical states $|psi_0ra$ to Bob who will make measurements on the received state and will determine the rotat
ion $R$. The task of Bob is to estimate these parameters of the rotation $R$ by the best possible measurements. Based on the Quantum Fisher Information, we show that Greenberger-Horne-Zeilinger (GHZ) states are near optimal states for this task. Compared to the optimal states proposed before, the advantage of $GHZ$ states are that they can be more easily prepared experimentally, and more importantly, we show concrete measurements which will allow Bob to determine the rotation $R$. We also study the robustness of these states in keeping their encoded information, against common sources of noises.
Generative adversarial networks are an emerging technique with wide applications in machine learning, which have achieved dramatic success in a number of challenging tasks including image and video generation. When equipped with quantum processors, t
heir quantum counterparts--called quantum generative adversarial networks (QGANs)--may even exhibit exponential advantages in certain machine learning applications. Here, we report an experimental implementation of a QGAN using a programmable superconducting processor, in which both the generator and the discriminator are parameterized via layers of single- and multi-qubit quantum gates. The programmed QGAN runs automatically several rounds of adversarial learning with quantum gradients to achieve a Nash equilibrium point, where the generator can replicate data samples that mimic the ones from the training set. Our implementation is promising to scale up to noisy intermediate-scale quantum devices, thus paving the way for experimental explorations of quantum advantages in practical applications with near-term quantum technologies.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
