Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Phase transitions in random circuit sampling
Undesired coupling to the surrounding environment destroys long-range correlations in
quantum processors and hinders coherent evolution in the nominally available …
quantum processors and hinders coherent evolution in the nominally available …
Quantum random number generation
Quantum physics can be exploited to generate true random numbers, which have important
roles in many applications, especially in cryptography. Genuine randomness from the …
roles in many applications, especially in cryptography. Genuine randomness from the …
Fully device independent quantum key distribution
Quantum cryptography promises levels of security that are impossible to attain in a classical
world. Can this security be guaranteed to classical users of a quantum protocol, who may …
world. Can this security be guaranteed to classical users of a quantum protocol, who may …
Pseudorandomness
This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …
random" despite being constructed using little or no randomness. This theory has …
Information-theoretically secret key generation for fading wireless channels
The multipath-rich wireless environment associated with typical wireless usage scenarios is
characterized by a fading channel response that is time-varying, location-sensitive, and …
characterized by a fading channel response that is time-varying, location-sensitive, and …
A survey on secret key generation mechanisms on the physical layer in wireless networks
YEH Shehadeh, D Hogrefe - Security and Communication …, 2015 - Wiley Online Library
Traditional security mechanisms are mainly based on the distribution of shared secret keys.
Yet, this task is nontrivial in large wireless networks, because of mobility and scalability …
Yet, this task is nontrivial in large wireless networks, because of mobility and scalability …
Derandomizing polynomial identity tests means proving circuit lower bounds
We show that derandomizing Polynomial Identity Testing is, essentially, equivalent to
proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in …
proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in …
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
The main contribution is a new type of graph product, which we call the zig-zag product.
Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its …
Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its …
Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction
Quantum random-number generators (QRNGs) can offer a means to generate information-
theoretically provable random numbers, in principle. In practice, unfortunately, the quantum …
theoretically provable random numbers, in principle. In practice, unfortunately, the quantum …
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
We give an improved explicit construction of highly unbalanced bipartite expander graphs
with expansion arbitrarily close to the degree (which is polylogarithmic in the number of …
with expansion arbitrarily close to the degree (which is polylogarithmic in the number of …