اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExchange-Free Computation on an Unknown Qubit at a Distance
115
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a way of directly manipulating an arbitrary qubit, without the exchange of any particles. This includes as an application the exchange-free preparation of an arbitrary quantum state at Alice by a remote classical Bob. As a result, we are able to propose a protocol that allows one party to directly enact, by means of a suitable program, any computation exchange-free on a remote second partys unknown qubit. Further, we show how to use this for the exchange-free control of a universal two-qubit gate, thus opening the possibility of directly enacting any desired algorithm remotely on a programmable quantum circuit.
قيم البحث
اقرأ أيضاً
Quantum teleportation circumvents the uncertainty principle using dual channels: a quantum one consisting of previously-shared entanglement, and a classical one, together allowing the disembodied transport of an unknown quantum state over distance. I
t has recently been shown that a classical bit can be counterfactually communicated between two parties in empty space, Alice and Bob. Here, by using our dual version of the chained quantum Zeno effect to achieve a counterfactual CNOT gate, we propose the first protocol for transporting an unknown qubit counterfactually, that is without any physical particles travelling between Alice and Bob - no classical channel and no previously-shared entanglement.
Undoing a unitary operation, $i.e$. reversing its action, is the task of canceling the effects of a unitary evolution on a quantum system, and it may be easily achieved when the unitary is known. Given a unitary operation without any specific descrip
tion, however, it is a hard and challenging task to realize the inverse operation. Recently, a universal quantum circuit has been proposed [Phys.Rev.Lett. 123, 210502 (2019)] to undo an arbitrary unknown $d$-dimensional unitary $U$ by implementing its inverse with a certain probability. In this letter, we report the experimental reversing of three single-qubit unitaries $(d = 2)$ by linear optical elements. The experimental results prove the feasibility of the reversing scheme, showing that the average fidelity of inverse unitaries is $F=0.9767pm0.0048$, in close agreement with the theoretical prediction.
The problem of combating de-coherence by weak measurements has already been studied for the amplitude damping channel and for specific input states. We generalize this to a large four-parameter family of qubit channels and for the average fidelity ov
er all pure states. As a by-product we classify all the qubit channels which have one invariant pure state and show that the parameter manifold of these channels is isomorphic to $S^2times S^1times S^1$ and contains many interesting subclasses of channels. The figure of merit that we use is the average input-output fidelity which we show can be increased up to $30$ percents in some cases, by tuning of the weak measurement parameter.
One of the most challenging problems for the realization of a scalable quantum computer is to design a physical device that keeps the error rate for each quantum processing operation low. These errors can originate from the accuracy of quantum manipu
lation, such as the sweeping of a gate voltage in solid state qubits or the duration of a laser pulse in optical schemes. Errors also result from decoherence, which is often regarded as more crucial in the sense that it is inherent to the quantum system, being fundamentally a consequence of the coupling to the external environment. Grouping small collections of qubits into clusters with symmetries may serve to protect parts of the calculation from decoherence. In this work, we use 4-level cores with a straightforward generalization of discrete rotational symmetry, called $omega$-rotation invariance, to encode pairs of coupled qubits and universal 2-qubit logical gates. We propose a scalable scheme for universal quantum computation where cores play the role of quantum-computational transistors, or textit{quansistors} for short. Embedding in the environment, initialization and readout are achieved by tunnel-coupling the quansistor to leads. The external leads are explicitly considered and are assumed to be the main source of decoherence. We show that quansistors can be dynamically decoupled from the leads by tuning their internal parameters, giving them the versatility required to act as controllable quantum memory units. With this dynamical decoupling, logical operations within quansistors are also symmetry-protected from unbiased noise in their parameters. We identify technologies that could implement $omega$-rotation invariance. Many of our results can be generalized to higher-level $omega$-rotation-invariant systems, or adapted to clusters with other symmetries.
After quantum computers come out, governments and rich companies will have the abilities to buy these useful quantum computers, meanwhile they are familiar with these technologies proficiently. If a client wants to perform quantum computing but she d
oes not have quantum computers with relevant quantum technologies. She can seek help from the server and pay his salary, but she does not want to leak anything to the server. Blind quantum computing (BQC) give a good method for the client to realized her quantum computing. In this article, we propose a new BQC protocol of quantum fourier transform (QFT) performed on multi-qubit states with a trusted, a client and a server, where the trusted center can generate resource states, the client can delegate her quantum computing to a server who can perform universal quantum computing without knowing anything about the clients inputs, algorithms and outputs. We first give the BQC protocols of three-qubit QFT with the equivalently quantum circuits, Greenberg-Horne-Zeilinger(GHZ) entangled states and W entangled states as examples. Further, we extend them to multi-qubit QFT on multi-qubit with the equivalently quantum circuits. At last, we give the analyses and proofs of the blindness and correctness.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
