اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدState transfer with separable optical beams and variational quantum algorithms with classical light
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Classical electromagnetic fields and quantum mechanics -- both obey the principle of superposition alike. This opens up many avenues for simulation of a large variety of phenomena and algorithms, which have hitherto been considered quantum mechanical. In this paper, we propose two such applications. In the first, we introduce a new class of beams, called equivalent optical beams, in parallel with equivalent states introduced in [Bharath & Ravishankar, href{https://doi.org/10.1103/PhysRevA.89.062110}{Phys. Rev. A 89, 062110}]. These beams have the same information content for all practical purposes. Employing them, we show how to transfer information from one degree of freedom of classical light to another, without any need for classically entangled beams. Next, we show that quantum machine learning can be performed with OAM beams through the implementation of a quantum classifier circuit. We provide explicit protocols and experimental setups for both the applicaions.
قيم البحث
اقرأ أيضاً
Hybrid entangled states, having entanglement between different degrees-of-freedom (DoF) of a particle pair, are of great interest for quantum information science and communication protocols. Among different DoFs, the hybrid entangled states encoded w
ith polarization and orbital angular momentum (OAM) allow the generation of qubit-qudit entangled states, macroscopic entanglement with very high quanta of OAM and improvement in angular resolution in remote sensing. Till date, such hybrid entangled states are generated by using a high-fidelity polarization entangled state and subsequent imprinting of chosen amount of OAM using suitable mode converters such as spatial light modulator in complicated experimental schemes. Given that the entangled sources have feeble number of photons, loss of photons during imprinting of OAM using diffractive optical elements limits the use of such hybrid state for practical applications. Here we report, on a simple experimental scheme to generate hybrid entangled state in polarization and OAM through direct transfer of classical non-separable state of the pump beam in parametric down conversion process. As a proof of principle, using local non-separable pump state of OAM mode l=3, we have produced quantum hybrid entangled state with entanglement witness parameter of W-1.25 violating by 8 standard deviation. The generic scheme can be used to produce hybrid entangled state between two photons differing by any quantum number through proper choice of non-separable state of the pump beam.
Many quantum algorithms have daunting resource requirements when compared to what is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as the quantum variational eigensolver was developed with the phil
osophy that even minimal quantum resources could be made useful when used in conjunction with classical routines. In this work we extend the general theory of this algorithm and suggest algorithmic improvements for practical implementations. Specifically, we develop a variational adiabatic ansatz and explore unitary coupled cluster where we establish a connection from second order unitary coupled cluster to universal gate sets through relaxation of exponential splitting. We introduce the concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device. Additionally, we analyze truncation and correlated sampling in Hamiltonian averaging as ways to reduce the cost of this procedure. Finally, we show how the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.
Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages over classical methods. Nevertheless, modern VQAs suffer from cumbersome computational overhead, hampered by the
tradition of employing a solitary quantum processor to handle large-volume data. As such, to better exert the superiority of VQAs, it is of great significance to improve their runtime efficiency. Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue. Specifically, in QUDIO, a classical central server partitions the learning problem into multiple subproblems and allocate them to multiple local nodes where each of them consists of a quantum processor and a classical optimizer. During the training procedure, all local nodes proceed parallel optimization and the classical server synchronizes optimization information among local nodes timely. In doing so, we prove a sublinear convergence rate of QUDIO in terms of the number of global iteration under the ideal scenario, while the system imperfection may incur divergent optimization. Numerical results on standard benchmarks demonstrate that QUDIO can surprisingly achieve a superlinear runtime speedup with respect to the number of local nodes. Our proposal can be readily mixed with other advanced VQAs-based techniques to narrow the gap between the state of the art and applications with quantum advantage.
In order to support near-term applications of quantum computing, a new compute paradigm has emerged--the quantum-classical cloud--in which quantum computers (QPUs) work in tandem with classical computers (CPUs) via a shared cloud infrastructure. In t
his work, we enumerate the architectural requirements of a quantum-classical cloud platform, and present a framework for benchmarking its runtime performance. In addition, we walk through two platform-level enhancements, parametric compilation and active qubit reset, that specifically optimize a quantum-classical architecture to support variational hybrid algorithms (VHAs), the most promising applications of near-term quantum hardware. Finally, we show that integrating these two features into the Rigetti Quantum Cloud Services (QCS) platform results in considerable improvements to the latencies that govern algorithm runtime.
Applications such as simulating large quantum systems or solving large-scale linear algebra problems are immensely challenging for classical computers due their extremely high computational cost. Quantum computers promise to unlock these applications
, although fault-tolerant quantum computers will likely not be available for several years. Currently available quantum devices have serious constraints, including limited qubit numbers and noise processes that limit circuit depth. Variational Quantum Algorithms (VQAs), which employ a classical optimizer to train a parametrized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisioned for quantum computers, and they appear to the best hope for obtaining quantum advantage. Nevertheless, challenges remain including the trainability, accuracy, and efficiency of VQAs. In this review article we present an overview of the field of VQAs. Furthermore, we discuss strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
