اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAssessing randomness with the aid of quantum state measurement
92
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Randomness is a valuable resource in science, cryptography, engineering, and information technology. Quantum-mechanical sources of randomness are attractive because of the indeterminism of individual quantum processes. Here we consider the production of random bits from polarization measurements on photons. We first present a pedagogical discussion of how the quantum randomness inherent in such measurements is connected to quantum coherence, and how it can be quantified in terms of the quantum state and an associated entropy value known as min-entropy. We then explore these concepts by performing a series of single-photon experiments that are suitable for the undergraduate laboratory. We prepare photons in different nonentangled and entangled states, and measure these states tomographically. We use the information about the quantum state to determine, in terms of the min-entropy, the minimum amount of randomness produced from a given photon state by different bit-generating measurements. This is helpful in assessing the presence of quantum randomness and in ensuring the quality and security of the random-bit source.
قيم البحث
اقرأ أيضاً
A crucial subroutine for various quantum computing and communication algorithms is to efficiently extract different classical properties of quantum states. In a notable recent theoretical work by Huang, Kueng, and Preskill~cite{huang2020predicting},
a thrifty scheme showed how to project the quantum state into classical shadows and simultaneously predict $M$ different functions of a state with only $mathcal{O}(log_2 M)$ measurements, independent of the system size and saturating the information-theoretical limit. Here, we experimentally explore the feasibility of the scheme in the realistic scenario with a finite number of measurements and noisy operations. We prepare a four-qubit GHZ state and show how to estimate expectation values of multiple observables and Hamiltonian. We compare the strategies with uniform, biased, and derandomized classical shadows to conventional ones that sequentially measures each state function exploiting either importance sampling or observable grouping. We next demonstrate the estimation of nonlinear functions using classical shadows and analyze the entanglement of the prepared quantum state. Our experiment verifies the efficacy of exploiting (derandomized) classical shadows and sheds light on efficient quantum computing with noisy intermediate-scale quantum hardware.
The advantages of quantum random number generators (QRNGs) over pseudo-random number generators (PRNGs) are normally attributed to the nature of quantum measurements. This is often seen as implying the superiority of the sequences of bits themselves
generated by QRNGs, despite the absence of empirical tests supporting this. Nonetheless, one may expect sequences of bits generated by QRNGs to have properties that pseudo-random sequences do not; indeed, pseudo-random sequences are necessarily computable, a highly nontypical property of sequences. In this paper, we discuss the differences between QRNGs and PRNGs and the challenges involved in certifying the quality of QRNGs theoretically and testing their output experimentally. While QRNGs are often tested with standard suites of statistical tests, such tests are designed for PRNGs and only verify statistical properties of a QRNG, but are insensitive to many supposed advantages of QRNGs. We discuss the ability to test the incomputability and algorithmic complexity of QRNGs. While such properties cannot be directly verified with certainty, we show how one can construct indirect tests that may provide evidence for the incomputability of QRNGs. We use these tests to compare various PRNGs to a QRNG, based on superconducting transmon qutrits and certified by the Kochen-Specker Theorem, to see whether such evidence can be found in practice. While our tests fail to observe a strong advantage of the quantum random sequences due to algorithmic properties, the results are nonetheless informative: some of the test results are ambiguous and require further study, while others highlight difficulties that can guide the development of future tests of algorithmic randomness and incomputability.
In a measurement-device-independent or quantum-refereed protocol, a referee can verify whether two parties share entanglement or Einstein-Podolsky-Rosen (EPR) steering without the need to trust either of the parties or their devices. The need for tru
sting a party is substituted by a quantum channel between the referee and that party, through which the referee encodes the measurements to be performed on that partys subsystem in a set of nonorthogonal quantum states. In this Letter, an EPR-steering inequality is adapted as a quantum-refereed EPR-steering witness, and the trust-free experimental verification of higher dimensional quantum steering is reported via preparing a class of entangled photonic qutrits. Further, with two measurement settings, we extract $1.106pm0.023$ bits of private randomness per every photon pair from our observed data, which surpasses the one-bit limit for projective measurements performed on qubit systems. Our results advance research on quantum information processing tasks beyond qubits.
Nonlocality is the most characteristic feature of quantum mechanics. John Bell, in his seminal 1964 work, proved that local-realism imposes a bound on the correlations among the measurement statistics of distant observers. Surpassing this bound rules
out local-realistic description of microscopic phenomena, establishing the presence of nonlocal correlation. To manifest nonlocality, it requires, in the simplest scenario, two measurements performed randomly by each of two distant observers. In this work, we propose a novel framework where three measurements, two on Alices side and one on Bobs side, suffice to reveal quantum nonlocality and hence does not require all-out randomness in measurement choice. Our method relies on a very naive operational task in quantum information theory, namely, the minimal error state discrimination. As a practical implication this method constitutes an economical entanglement detection scheme, which uses a less number of entangled states compared to all such existing schemes. Moreover, the method applies to class of generalized probability theories containing quantum theory as a special example.
We study the optimization of any quantum process by minimizing the randomness in the measurement result at the output of that quantum process. We conceptualize and propose a measure of such randomness and inquire whether an optimization of the quantu
m process based on that measure, can reach the point where the process operates with maximum fidelity. We consider approximate quantum cloning and teleportation processes, and find, in particular, that the optimal approximate state-dependent quantum cloning machine obtained by maximizing the fidelity is different from that obtained by minimizing the randomness.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
