اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEfficient optimization of state preparation in quantum networks using quantum trajectories
83
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The wave-function Monte-Carlo method, also referred to as the use of quantum-jump trajectories, allows efficient simulation of open systems by independently tracking the evolution of many pure-state trajectories. This method is ideally suited to simulation by modern, highly parallel computers. Here we show that Krotovs method of numerical optimal control, unlike others, can be modified in a simple way, so that it becomes fully parallel in the pure states without losing its effectiveness. This provides a highly efficient method for finding optimal control protocols for open quantum systems and networks. We apply this method to the problem of generating entangled states in a network consisting of systems coupled in a unidirectional chain. We show that due to the existence of a dark-state subspace in the network, nearly-optimal control protocols can be found for this problem by using only a single pure-state trajectory in the optimization, further increasing the efficiency.
قيم البحث
اقرأ أيضاً
Indistinguishable photons are imperative for advanced quantum communication networks. Indistinguishability is difficult to obtain because of environment-induced photon transformations and loss imparted by communication channels, especially in noisy s
cenarios. Strategies to mitigate these transformations often require hardware or software overhead that is restrictive (e.g. adding noise), infeasible (e.g. on a satellite), or time-consuming for deployed networks. Here we propose and develop resource-efficient Bayesian optimization techniques to rapidly and adaptively calibrate the indistinguishability of individual photons for quantum networks using only information derived from their measurement. To experimentally validate our approach, we demonstrate the optimization of Hong-Ou-Mandel interference between two photons -- a central task in quantum networking -- finding rapid, efficient, and reliable convergence towards maximal photon indistinguishability in the presence of high loss and shot noise. We expect our resource-optimized and experimentally friendly methodology will allow fast and reliable calibration of indistinguishable quanta, a necessary task in distributed quantum computing, communications, and sensing, as well as for fundamental investigations.
We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grovers quantum search algorithm acting on trapped ions.
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is intractably diff
icult to construct an arbitrary quantum state to high precision. Many quantum algorithms rely instead upon initializing the machine in a simple state, and evolving the state through an efficient (i.e. at most polynomial-depth) quantum algorithm. In this work, we show that there exist families of quantum states that can be prepared to high precision with circuits of linear size and depth. We focus on real-valued, smooth, differentiable functions with bounded derivatives on a domain of interest, exemplified by commonly used probability distributions. We further develop an algorithm that requires only linear classical computation time to generate accurate linear-depth circuits to prepare these states, and apply this to well-known and heavily-utilized functions including Gaussian and lognormal distributions. Our procedure rests upon the quantum state representation tool known as the matrix product state (MPS). By efficiently and scalably encoding an explicit amplitude function into an MPS, a high fidelity, linear-depth circuit can directly be generated. These results enable the execution of many quantum algorithms that, aside from initialization, are otherwise depth-efficient.
We present an approach to single-shot high-fidelity preparation of an $n$-qubit state based on neighboring optimal control theory. This represents a new application of the neighboring optimal control formalism which was originally developed to produc
e single-shot high-fidelity quantum gates. To illustrate the approach, and to provide a proof-of-principle, we use it to prepare the two qubit Bell state $|beta_{01}rangle = (1/sqrt{2})left[, |01rangle + |10rangle,right]$ with an error probability $epsilonsim 10^{-6}$ ($10^{-5}$) for ideal (non-ideal) control. Using standard methods in the literature, these high-fidelity Bell states can be leveraged to fault-tolerantly prepare the logical state $|overline{beta}_{01}rangle$.
We demonstrate an experimental realization of remote state preparation via the quantum teleportation algorithm, using an entangled photon pair in the polarization degree of freedom as the quantum resource. The input state is encoded on the path of on
e of the photons from the pair. The improved experimental scheme allows us to control the preparation and teleportation of a state over the entire Bloch sphere with a resolution of the degree of mixture given by the coherence length of the photon pair. Both the preparation of the input state and the implementation of the quantum gates are performed in a pair of chained displaced Sagnac interferometers, which contribute to the overall robustness of the setup. An average fidelity above 0.9 is obtained for the remote state preparation process. This scheme allows for a prepared state to be transmitted on every repetition of the experiment, thus giving an intrinsic success probability of 1.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
