اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدContinuous-Variable Instantaneous Quantum Computing is hard to sample
74
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Instantaneous quantum computing is a sub-universal quantum complexity class, whose circuits have proven to be hard to simulate classically in the Discrete-Variable (DV) realm. We extend this proof to the Continuous-Variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of post-selected circuits. In order to treat post-selection in CVs we consider finitely-resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator GKP encoding of quantum information, which was previously shown to enable fault-tolerant CV quantum computation. Finally, we show that, in order to render post-selected computational classes in CVs meaningful, a logarithmic scaling of the squeezing parameter with the circuit size is necessary, translating into a polynomial scaling of the input energy.
قيم البحث
اقرأ أيضاً
We present a verifiable and blind protocol for assisted universal quantum computing on continuous-variable (CV) platforms. This protocol is highly experimentally-friendly to the client, as it only requires Gaussian-operation capabilities from the lat
ter. Moreover, the server is not required universal quantum-computational power either, its only function being to supply the client with copies of a single-mode non-Gaussian state. Universality is attained based on state-injection of the servers non-Gaussian supplies. The protocol is automatically blind because the non-Gaussian resource requested to the server is always the same, regardless of the specific computation. Verification, in turn, is possible thanks to an efficient non-Gaussian state fidelity test where we assume identical state preparation by the server. It is based on Gaussian measurements by the client on the injected states, which is potentially interesting on its own. The division of quantum hardware between client and server assumed here is in agreement with the experimental constraints expected in realistic schemes for CV cloud quantum computing.
A long-standing open question about Gaussian continuous-variable cluster states is whether they enable fault-tolerant measurement-based quantum computation. The answer is yes. Initial squeezing in the cluster above a threshold value of 20.5 dB ensure
s that errors from finite squeezing acting on encoded qubits are below the fault-tolerance threshold of known qubit-based error-correcting codes. By concatenating with one of these codes and using ancilla-based error correction, fault-tolerant measurement-based quantum computation of theoretically indefinite length is possible with finitely squeezed cluster states.
We establish the potential of continuous-variable Gaussian states of linear dynamical systems for machine learning tasks. Specifically, we consider reservoir computing, an efficient framework for online time series processing. As a reservoir we consi
der a quantum harmonic network modeling e.g. linear quantum optical systems. We prove that unlike universal quantum computing, universal reservoir computing can be achieved without non-Gaussian resources. We find that encoding the input time series into Gaussian states is both a source and a means to tune the nonlinearity of the overall input-output map. We further show that the full potential of the proposed model can be reached by encoding to quantum fluctuations, such as squeezed vacuum, instead of classical intense fields or thermal fluctuations. Our results introduce a new research paradigm for reservoir computing harnessing the dynamics of a quantum system and the engineering of Gaussian quantum states, pushing both fields into a new direction.
It has been argued [T. Rudolph and B.C. Sanders, Phys. Rev. Lett. 87, 077903 (2001)] that continuous-variable quantum teleportation at optical frequencies has not been achieved because the source used (a laser) was not `truly coherent. Here I show th
at `true coherence is always illusory, as the concept of absolute time on a scale beyond direct human experience is meaningless. A laser is as good a clock as any other, even in principle, and this objection to teleportation experiments is baseless.
Computational methods are the most effective tools we have besides scientific experiments to explore the properties of complex biological systems. Progress is slowing because digital silicon computers have reached their limits in terms of speed. Othe
r types of computation using radically different architectures, including neuromorphic and quantum, promise breakthroughs in both speed and efficiency. Quantum computing exploits the coherence and superposition properties of quantum systems to explore many possible computational paths in parallel. This provides a fundamentally more efficient route to solving some types of computational problems, including several of relevance to biological simulations. In particular, optimisation problems, both convex and non-convex, feature in many biological models, including protein folding and molecular dynamics. Early quantum computers will be small, reminiscent of the early days of digital silicon computing. Understanding how to exploit the first generation of quantum hardware is crucial for making progress in both biological simulation and the development of the next generations of quantum computers. This review outlines the current state-of-the-art and future prospects for quantum computing, and provides some indications of how and where to apply it to speed up bottlenecks in biological simulation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
