اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRandom private quantum states
158
0
0.0
(
0
)
تأليف
Matthias Christandl
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The study of properties of randomly chosen quantum states has in recent years led to many insights into quantum entanglement. In this work, we study private quantum states from this point of view. Private quantum states are bipartite quantum states characterised by the property that carrying out simple local measurements yields a secret bit. This feature is shared by the maximally entangled pair of quantum bits, yet private quantum states are more general and can in their most extreme form be almost bound entangled. In this work, we study the entanglement properties of random private quantum states and show that they are hardly distinguishable from separable states and thus have low repeatable key, despite containing one bit of key. The technical tools we develop are centred around the concept of locally restricted measurements and include a new operator ordering, bounds on norms under tensoring with entangled states and a continuity bound for a relative entropy measure.
قيم البحث
اقرأ أيضاً
In Private Broadcasting, a single plaintext is broadcast to multiple recipients in an encrypted form, such that each recipient can decrypt locally. When the message is classical, a straightforward solution is to encrypt the plaintext with a single ke
y shared among all parties, and to send to each recipient a copy of the ciphertext. Surprisingly, the analogous method is insufficient in the case where the message is quantum (i.e. in Quantum Private Broadcasting (QPB)). In this work, we give three solutions to $t$-recipient Quantum Private Broadcasting ($t$-QPB) and compare them in terms of key lengths. The first method is the independent encryption with the quantum one-time pad, which requires a key linear in the number of recipients, $t$. We show that the key length can be decreased to be logarithmic in $t$ by using unitary $t$-designs. Our main contribution is to show that this can be improved to a key length that is logarithmic in the dimension of the symmetric subspace, using a new concept that we define of symmetric unitary $t$-designs, that may be of independent interest.
We prove a quantum information-theoretic conjecture due to Ji, Liu and Song (CRYPTO 2018) which suggested that a uniform superposition with random emph{binary} phase is statistically indistinguishable from a Haar random state. That is, any polynomial
number of copies of the aforementioned state is within exponentially small trace distance from the same number of copies of a Haar random state. As a consequence, we get a provable elementary construction of emph{pseudorandom} quantum states from post-quantum pseudorandom functions. Generating pseduorandom quantum states is desirable for physical applications as well as for computational tasks such as quantum money. We observe that replacing the pseudorandom function with a $(2t)$-wise independent function (either in our construction or in previous work), results in an explicit construction for emph{quantum state $t$-designs} for all $t$. In fact, we show that the circuit complexity (in terms of both circuit size and depth) of constructing $t$-designs is bounded by that of $(2t)$-wise independent functions. Explicitly, while in prior literature $t$-designs required linear depth (for $t > 2$), this observation shows that polylogarithmic depth suffices for all $t$. We note that our constructions yield pseudorandom states and state designs with only real-valued amplitudes, which was not previously known. Furthermore, generating these states require quantum circuit of restricted form: applying one layer of Hadamard gates, followed by a sequence of Toffoli gates. This structure may be useful for efficiency and simplicity of implementation.
We study how useful random states are for quantum metrology, i.e., surpass the classical limits imposed on precision in the canonical phase estimation scenario. First, we prove that random pure states drawn from the Hilbert space of distinguishable p
articles typically do not lead to super-classical scaling of precision even when allowing for local unitary optimization. Conversely, we show that random states from the symmetric subspace typically achieve the optimal Heisenberg scaling without the need for local unitary optimization. Surprisingly, the Heisenberg scaling is observed for states of arbitrarily low purity and preserved under finite particle losses. Moreover, we prove that for such states a standard photon-counting interferometric measurement suffices to typically achieve the Heisenberg scaling of precision for all possible values of the phase at the same time. Finally, we demonstrate that metrologically useful states can be prepared with short random optical circuits generated from three types of beam-splitters and a non-linear (Kerr-like) transformation.
It was recently pointed out that identifiability of quantum random walks and hidden Markov processes underlie the same principles. This analogy immediately raises questions on the existence of hidden states also in quantum random walks and their rela
tionship with earlier debates on hidden states in quantum mechanics. The overarching insight was that not only hidden Markov processes, but also quantum random walks are finitary processes. Since finitary processes enjoy nice asymptotic properties, this also encourages to further investigate the asymptotic properties of quantum random walks. Here, answers to all these questions are given. Quantum random walks, hidden Markov processes and finitary processes are put into a unifying model context. In this context, quantum random walks are seen to not only enjoy nice ergodic properties in general, but also intuitive quantum-style asymptotic properties. It is also pointed out how hidden states arising from our framework relate to hidden states in earlier, prominent treatments on topics such as the EPR paradoxon or Bells inequalities.
This is the documentation for generating random samples from the quantum state space in accordance with a specified distribution, associated with this webpage: http://tinyurl.com/QSampling . Ready-made samples (each with at least a million points) fr
om various distributions are available for download, or one can generate ones own samples from a chosen distribution using the provided source codes. The sampling relies on the Hamiltonian Monte Carlo algorithm as described in New J. Phys. 17, 043018 (2015). The random samples are reposited in the hope that they would be useful for a variety of tasks in quantum information and quantum computation. Constructing credible regions for tomographic data, optimizing a function over the quantum state space with a complicated landscape, testing the typicality of entanglement among states from a multipartite quantum system, or computing the average of some quantity of interest over a subset of quantum states are but some exemplary applications among many.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
