اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum-Assisted Telescope Arrays
59
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum networks provide a platform for astronomical interferometers capable of imaging faint stellar objects. In a recent work [arXiv:1809.01659], we presented a protocol that circumvents transmission losses with efficient use of quantum resources and modest quantum memories. Here we analyze a number of extensions to that scheme. We show that it can be operated as a truly broadband interferometer and generalized to multiple sites in the array. We also analyze how imaging based on the quantum Fourier transform provides improved signal-to-noise ratio compared to classical processing. Finally, we discuss physical realizations including photon-detection-based quantum state transfer.
قيم البحث
اقرأ أيضاً
Quantum simulation can help us study poorly understood topics such as high-temperature superconductivity and drug design. However, existing quantum simulation algorithms for current quantum computers often have drawbacks that impede their application
. Here, we provide a novel hybrid quantum-classical algorithm for simulating the dynamics of quantum systems. Our approach takes the Ansatz wavefunction as a linear combination of quantum states. The quantum states are fixed, and the combination parameters are variationally adjusted. Unlike existing variational quantum simulation algorithms, our algorithm does not require any classical-quantum feedback loop and by construction bypasses the barren plateau problem. Moreover, our algorithm does not require any complicated measurements such as the Hadamard test. The entire framework is compatible with existing experimental capabilities and thus can be implemented immediately.
Transport phenomena at the nanoscale are of interest due to the presence of both quantum and classical behavior. In this work, we demonstrate that quantum transport efficiency can be enhanced by a dynamical interplay of the system Hamiltonian with pu
re dephasing induced by a fluctuating environment. This is in contrast to fully coherent hopping that leads to localization in disordered systems, and to highly incoherent transfer that is eventually suppressed by the quantum Zeno effect. We study these phenomena in the Fenna-Matthews-Olson protein complex as a prototype for larger photosynthetic energy transfer systems. We also show that disordered binary tree structures exhibit enhanced transport in the presence of dephasing.
Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders fail to compress and recover high-rank mixed states. In this work, we discuss the fundamental properties and limita
tions of the standard quantum autoencoder model in more depth, and provide an information-theoretic solution to its recovering fidelity. Based on this understanding, we present a noise-assisted quantum autoencoder algorithm to go beyond the limitations, our model can achieve high recovering fidelity for general input states. Appropriate noise channels are used to make the input mixedness and output mixedness consistent, the noise setup is determined by measurement results of the trash system. Compared with the original quantum autoencoder model, the measurement information is fully used in our algorithm. In addition to the circuit model, we design a (noise-assisted) adiabatic model of quantum autoencoder that can be implemented on quantum annealers. We verified the validity of our methods through compressing the thermal states of transverse field Ising model and Werner states. For pure state ensemble compression, we also introduce a projected quantum autoencoder algorithm.
We provide a bucket of noisy intermediate-scale quantum era algorithms for simulating the dynamics of open quantum systems, generalized time evolution, non-linear differential equations and Gibbs state preparation. Our algorithms do not require any c
lassical-quantum feedback loop, bypass the barren plateau problem and do not necessitate any complicated measurements such as the Hadamard test. To simplify and bolster our algorithms, we introduce the notion of the hybrid density matrix. The aforementioned concept enables us to disentangle the different steps of our algorithm and facilitate delegation of the classically demanding tasks to the quantum computer. Our algorithms proceed in three disjoint steps. The first step entails the selection of the Ansatz. The second step corresponds to the measuring overlap matrices on a quantum computer. The final step involves classical post-processing based on the data from the second step. Due to the absence of the quantum-classical feedback loop, the quantum part of our algorithms can be parallelized easily. Our algorithms have potential applications in solving the Navier-Stokes equation, plasma hydrodynamics, quantum Boltzmann training, quantum signal processing and linear systems, among many. The entire framework is compatible with the current experimental faculty and hence can be implemented immediately.
The task of estimating the ground state of Hamiltonians is an important problem in physics with numerous applications ranging from solid-state physics to combinatorial optimization. We provide a hybrid quantum-classical algorithm for approximating th
e ground state of a Hamiltonian that builds on the powerful Krylov subspace method in a way that is suitable for current quantum computers. Our algorithm systematically constructs the Ansatz using any given choice of the initial state and the unitaries describing the Hamiltonian. The only task of the quantum computer is to measure overlaps and no feedback loops are required. The measurements can be performed efficiently on current quantum hardware without requiring any complicated measurements such as the Hadamard test. Finally, a classical computer solves a well characterized quadratically constrained optimization program. Our algorithm can reuse previous measurements to calculate the ground state of a wide range of Hamiltonians without requiring additional quantum resources. Further, we demonstrate our algorithm for solving problems consisting of thousands of qubits. The algorithm works for almost every random choice of the initial state and circumvents the barren plateau problem.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
