اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدGenuine Counterfactual Communication with a Nanophotonic Processor
73
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In standard communication information is carried by particles or waves. Counterintuitively, in counterfactual communication particles and information can travel in opposite directions. The quantum Zeno effect allows Bob to transmit a message to Alice by encoding information in particles he never interacts with. The first suggested protocol not only required thousands of ideal optical components, but also resulted in a so-called weak trace of the particles having travelled from Bob to Alice, calling the scalability and counterfactuality of previous proposals and experiments into question. Here we overcome these challenges, implementing a new protocol in a programmable nanophotonic processor, based on reconfigurable silicon-on-insulator waveguides that operate at telecom wavelengths. This, together with our telecom single-photon source and highly-efficient superconducting nanowire single-photon detectors, provides a versatile and stable platform for a high-fidelity implementation of genuinely trace-free counterfactual communication, allowing us to actively tune the number of steps in the Zeno measurement, and achieve a bit error probability below 1%, with neither post-selection nor a weak trace. Our demonstration shows how our programmable nanophotonic processor could be applied to more complex counterfactual tasks and quantum information protocols.
قيم البحث
اقرأ أيضاً
We report the preparation and verification of a genuine 12-qubit entanglement in a superconducting processor. The processor that we designed and fabricated has qubits lying on a 1D chain with relaxation times ranging from 29.6 to 54.6 $mu$s. The fide
lity of the 12-qubit entanglement was measured to be above $0.5544pm0.0025$, exceeding the genuine multipartite entanglement threshold by 21 statistical standard deviations. Our entangling circuit to generate linear cluster states is depth-invariant in the number of qubits and uses single- and double-qubit gates instead of collective interactions. Our results are a substantial step towards large-scale random circuit sampling and scalable measurement-based quantum computing.
A recent quantum protocol for counterfactual communication [Y. Aharonov and L. Vaidman, Phys. Rev. A 99, 010103(R), 2019] relies on post-selection to eliminate the weak trace in the transmission channel. We show that the post-selection in this protoc
ol also eliminates the flow of Fisher information from transmitter to receiver. However, we also show that a classical communication protocol with post-selection can be counterfactual. Hence, we argue that post-selection should not be allowed in genuine counterfactual communication. In the quantum counterfactual communication protocol, the probability of discarding an event by post-selection tends to zero with an increasing number of ideal optical components. But the counterfactual violation strength tends to infinity at a faster rate. Consequently, the quantum protocol is not counterfactual proper.
It has been conjectured that counterfactual communication is impossible, even for post-selected quantum particles. We strongly challenge this by proposing exactly such a counterfactual scheme where---unambiguously---none of Alices photons that contri
bute to the message from Bob have been to Bob. We demonstrate counterfactuality experimentally by means of weak measurements, as well as conceptually using consistent histories---thus simultaneously closing both loopholes. Importantly, the fidelity of Alice learning Bobs bit can be made arbitrarily close to unity.
In reply to Vaidmans Comment [arXiv:1304.6689], we show that his claim that our Protocol for Direct Counterfactual Quantum Communication [PRL 110, 170502 (2013), arXiv:1206.2042] is counterfactual only for one type of information bit is wrong.
Quantum computers hold the promise to solve certain problems exponentially faster than their classical counterparts. Trapped atomic ions are among the physical systems in which building such a computing device seems viable. In this work we present a
small-scale quantum information processor based on a string of $^{40}$Ca${^+}$ ions confined in a macroscopic linear Paul trap. We review our set of operations which includes non-coherent operations allowing us to realize arbitrary Markovian processes. In order to build a larger quantum information processor it is mandatory to reduce the error rate of the available operations which is only possible if the physics of the noise processes is well understood. We identify the dominant noise sources in our system and discuss their effects on different algorithms. Finally we demonstrate how our entire set of operations can be used to facilitate the implementation of algorithms by examples of the quantum Fourier transform and the quantum order finding algorithm.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
