اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA New Quantum Operator for Distance
44
0
0.0
(
0
)
تأليف
Daniel Katz
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a new semi-relativistic quantum operator for the length of the worldline a particle traces out as it moves. In this article the operator is constructed in a heuristic way and some of its elementary properties are explored. The operator ends up depending in a very complicated way on the potential of the system it is to act on so as a proof of concept we use it to analyze the expected distance traveled by a free Gaussian wavepacket with some initial momentum. It is shown in this case that the distance such a particle travels becomes light-like as its mass vanishes and agrees with the classical result for macroscopic masses. This preliminary result has minor implications for the Weak Equivalence Principle (WEP) in quantum mechanics. In particular it shows that the logical relationship between two formulations of the WEP in classical mechanics extends to quantum mechanics. That our result is qualitatively consistent with the work of others emboldens us to start the task of evaluating the new operator in non-zero potentials. However, we readily acknowledge that the looseness in the definition of our operator means that all of our so-called results are highly speculative. Plans for future work with the new operator are discussed in the last section.
قيم البحث
اقرأ أيضاً
The present paper studies an operator norm that captures the distinguishability of quantum strategies in the same sense that the trace norm captures the distinguishability of quantum states or the diamond norm captures the distinguishability of quant
um channels. Characterizations of its unit ball and dual norm are established via strong duality of a semidefinite optimization problem. A full, formal proof of strong duality is presented for the semidefinite optimization problem in question. This norm and its properties are employed to generalize a state discrimination result of Ref. [GW05]. The generalized result states that for any two convex sets S,T of strategies there exists a fixed interactive measurement scheme that successfully distinguishes any choice of s in S from any choice of t in T with bias proportional to the minimal distance between the sets S and T as measured by this norm. A similar discrimination result for channels then follows as a special case.
In this paper we introduce a universal operator theoretic framework for quantum fault tolerance. This incorporates a top-down approach that implements a system-level criterion based on specification of the full system dynamics, applied at every level
of error correction concatenation. This leads to more accurate determinations of error thresholds than could previously be obtained. This is demonstrated both formally and with an explicit numerical example. The basis for our approach is the Quantum Computer Condition (QCC), an inequality governing the evolution of a quantum computer. We show that all known coding schemes are actually special cases of the QCC. We demonstrate this by introducing a new, operator theoretic form of entanglement assisted quantum error correction, which incorporates as special cases all known error correcting protocols, and is itself a special case of the QCC.
We study the conditions under which a subsystem code is correctable in the presence of noise that results from continuous dynamics. We consider the case of Markovian dynamics as well as the general case of Hamiltonian dynamics of the system and the e
nvironment, and derive necessary and sufficient conditions on the Lindbladian and system-environment Hamiltonian, respectively. For the case when the encoded information is correctable during an entire time interval, the conditions we obtain can be thought of as generalizations of the previously derived conditions for decoherence-free subsystems to the case where the subsystem is time dependent. As a special case, we consider conditions for unitary correctability. In the case of Hamiltonian evolution, the conditions for unitary correctability concern only the effect of the Hamiltonian on the system, whereas the conditions for general correctability concern the entire system-environment Hamiltonian. We also derive conditions on the Hamiltonian which depend on the initial state of the environment, as well as conditions for correctability at only a particular moment of time. We discuss possible implications of our results for approximate quantum error correction.
We develop a framework for analyzing layered quantum algorithms such as quantum alternating operator ansatze. Our framework relates quantum cost gradient operators, derived from the cost and mixing Hamiltonians, to classical cost difference functions
that reflect cost function neighborhood structure. By considering QAOA circuits from the Heisenberg picture, we derive exact general expressions for expectation values as series expansions in the algorithm parameters, cost gradient operators, and cost difference functions. This enables novel interpretability and insight into QAOA behavior in various parameter regimes. For single- level QAOA1 we show the leading-order changes in the output probabilities and cost expectation value explicitly in terms of classical cost differences, for arbitrary cost functions. This demonstrates that, for sufficiently small positive parameters, probability flows from lower to higher cost states on average. By selecting signs of the parameters, we can control the direction of flow. We use these results to derive a classical random algorithm emulating QAOA1 in the small-parameter regime, i.e., that produces bitstring samples with the same probabilities as QAOA1 up to small error. For deeper QAOAp circuits we apply our framework to derive analogous and additional results in several settings. In particular we show QAOA always beats random guessing. We describe how our framework incorporates cost Hamiltonian locality for specific problem classes, including causal cone approaches, and applies to QAOA performance analysis with arbitrary parameters. We illuminate our results with a number of examples including applications to QUBO problems, MaxCut, and variants of MaxSat. We illustrate the application to QAOA circuits using mixing unitaries beyond the transverse-field mixer through two examples of constrained optimization, Max Independent Set and Graph Coloring.
Fidelity plays an important role in quantum information theory. In this letter, we introduce new metric of quantum states induced by fidelity, and connect it with the well-known trace metric, Sine metric and Bures metric for the qubit case. The metri
c character is also presented for the qudit (i.e., $d$-dimensional system) case. The CPT contractive property and joint convex property of the metric are also studied.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
