اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAll states are universal catalysts in quantum thermodynamics
54
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum catalysis is a fascinating concept which demonstrates that certain transformations can only become possible when given access to a specific resource that has to be returned unaffected. It was first discovered in the context of entanglement theory and since then applied in a number of resource-theoretic frameworks, including quantum thermodynamics. Although in that case the necessary (and sometimes also sufficient) conditions on the existence of a catalyst are known, almost nothing is known about the precise form of the catalyst state required by the transformation. In particular, it is not clear whether it has to have some special properties or be finely tuned to the desired transformation. In this work we describe a surprising property of multi-copy states: we show that in resource theories governed by majorization all resourceful states are catalysts for all allowed transformations. In quantum thermodynamics this means that the so-called second laws of thermodynamics do not require a fine-tuned catalyst but rather any state, given sufficiently many copies, can serve as a useful catalyst. These analytic results are accompanied by several numerical investigations that indicate that neither a multi-copy form nor a very large dimension catalyst are required to activate most allowed transformations catalytically.
قيم البحث
اقرأ أيضاً
Understanding the relation between the different forms of inseparability in quantum mechanics is a longstanding problem in the foundations of quantum theory and has implications for quantum information processing. Here we make progress in this direct
ion by establishing a direct link between quantum teleportation and Bell nonlocality. In particular, we show that all entangled states which are useful for teleportation are nonlocal resources, i.e. lead to deterministic violation of Bells inequality. Our result exploits the phenomenon of super-activation of quantum nonlocality, recently proved by Palazuelos, and suggests that the latter might in fact be generic.
The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spectral adversary (Barnum, Saks, and Szegedy, 2003), weighted adversary (Ambainis, 2
003), strong weighted adversary (Zhang, 2005), and the Kolmogorov complexity adversary (Laplante and Magniez, 2004). We also pa few new equivalent formulations of the method. This shows that there is essentially _one_ quantum adversary method. From our approach, all known limitations of the
We propose a protocol for quantum adiabatic optimization, whereby an intermediary Hamiltonian that is diagonal in the computational basis is turned on and off during the interpolation. This `diagonal catalyst serves to bias the energy landscape towar
ds a given spin configuration, and we show how this can remove the first-order phase transition present in the standard protocol for the ferromagnetic $p$-spin and the Weak-Strong Cluster problems. The success of the protocol also makes clear how it can fail: biasing the energy landscape towards a state only helps in finding the ground state if the Hamming distance from the ground state and the energy of the biased state are correlated. We present examples where biasing towards low energy states that are nonetheless very far in Hamming distance from the ground state can severely worsen the efficiency of the algorithm compared to the standard protocol. Our results for the diagonal catalyst protocol are analogous to results exhibited by adiabatic reverse annealing, so our conclusions should apply to that protocol as well.
Magic states were introduced in the context of Clifford circuits as a resource that elevates classically simulatable computations to quantum universal capability, while maintaining the same gate set. Here we study magic states in the context of match
gate (MG) circuits, where the notion becomes more subtle, as MGs are subject to locality constraints and also the SWAP gate is not available. Nevertheless a similar picture of gate-gadget constructions applies, and we show that every pure fermionic state which is non-Gaussian, i.e. which cannot be generated by MGs from a computational basis state, is a magic state for MG computations. This result has significance for prospective quantum computing implementation in view of the fact that MG circuit evolutions coincide with the quantum physical evolution of non-interacting fermions.
Entangling an unknown qubit with one type of reference state is generally impossible. However, entangling an unknown qubit with two types of reference states is possible. To achieve this, we introduce a new class of states called zero sum amplitude (
ZSA) multipartite, pure entangled states for qubits and study their salient features. Using shared-ZSA state, local operation and classical communication we give a protocol for creating multipartite entangled states of an unknown quantum state with two types of reference states at remote places. This provides a way of encoding an unknown pure qubit state into a multiqubit entangled state. We quantify the amount of classical and quantum resources required to create universal entangled states. This is possibly a strongest form of quantum bit hiding with multiparties.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
