اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFast Black-Box Quantum State Preparation Based on Linear Combination of Unitaries
123
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Black-box quantum state preparation is a fundamental primitive in quantum algorithms. Starting from Grover, a series of techniques have been devised to reduce the complexity. In this work, we propose to perform black-box state preparation using the technique of linear combination of unitaries (LCU). We provide two algorithms based on a different structure of LCU. Our algorithms improve upon the existed best results by reducing the required additional qubits and Toffoli gates to 2log(n) and n, respectively, in the bit precision n. We demonstrate the algorithms using the IBM Quantum Experience cloud services. The further reduced complexity of the present algorithms brings the black-box quantum state preparation closer to reality.
قيم البحث
اقرأ أيضاً
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state preparation alg
orithm. To discuss the gate complexity in these algorithms, we decompose the diagonal unitary operators included in the phase estimation algorithms into the basic gates. Thus, we associate the state preparation problem with the decomposition problem of the diagonal unitary operators. We analyse the fidelities in the two algorithms and discuss the success probability in the probabilistic algorithm. In this case, we explain that the efficient decomposition of the corresponding diagonal unitary operators is the sufficient condition for state preparation problems.
A highly anticipated use of quantum computers is the simulation of complex quantum systems including molecules and other many-body systems. One promising method involves directly applying a linear combination of unitaries (LCU) to approximate a Taylo
r series by truncating after some order. Here we present an adaptation of that method, optimized for Hamiltonians with terms of widely varying magnitude, as is commonly the case in electronic structure calculations. We show that it is more efficient to apply LCU using a truncation that retains larger magnitude terms as determined by an iterative procedure. We obtain bounds on the simulation error for this generalized truncated Taylor method, and for a range of molecular simulations we report these bounds as well as direct numerical emulation results. We find that our adaptive method can typically improve the simulation accuracy by an order of magnitude, for a given circuit depth.
Quantum information technologies require careful control for generating and preserving a desired target quantum state. The biggest practical obstacle is, of course, decoherence. Therefore, the reachability analysis, which in our scenario aims to esti
mate the distance between the controlled state under decoherence and the target state, is of great importance to evaluate the realistic performance of those technologies. This paper presents a lower bound of the fidelity-based distance for a general open Markovian quantum system driven by the decoherence process and several types of control including feedback. The lower bound is straightforward to calculate and can be used as a guide for choosing the target state, as demonstrated in some examples. Moreover, the lower bound is applied to derive a theoretical limit in some quantum metrology problems based on a large-size atomic ensemble under control and decoherence.
Quantum integrated photonics requires large-scale linear optical circuitry, and for many applications it is desirable to have a universally programmable circuit, able to implement an arbitrary unitary transformation on a number of modes. This has bee
n achieved using the Reck scheme, consisting of a network of Mach Zehnder interferometers containing a variable phase shifter in one path, as well as an external phase shifter after each Mach Zehnder. It subsequently became apparent that with symmetric Mach Zehnders containing a phase shift in both paths, the external phase shifts are redundant, resulting in a more compact circuit. The rectangular Clements scheme improves on the Reck scheme in terms of circuit depth, but it has been thought that an external phase-shifter was necessary after each Mach Zehnder. Here, we show that the Clements scheme can be realised using symmetric Mach Zehnders, requiring only a small number of external phase-shifters that do not contribute to the depth of the circuit. This will result in a significant saving in the length of these devices, allowing more complex circuits to fit onto a photonic chip, and reducing the propagation losses associated with these circuits. We also discuss how similar savings can be made to alternative schemes which have robustness to imbalanced beam-splitters.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
