ترغب بنشر مسار تعليمي؟ اضغط هنا

Discrete Quantum Theories

155   0   0.0 ( 0 )
 نشر من قبل Gerardo Ortiz
 تاريخ النشر 2013
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We explore finite-field frameworks for quantum theory and quantum computation. The simplest theory, defined over unrestricted finite fields, is unnaturally strong. A second framework employs only finite fields with no solution to x^2+1=0, and thus permits an elegant complex representation of the extended field by adjoining i=sqrt{-1}. Quantum theories over these fields recover much of the structure of conventional quantum theory except for the condition that vanishing inner products arise only from null states; unnaturally strong computational power may still occur. Finally, we are led to consider one more framework, with further restrictions on the finite fields, that recovers a local transitive order and a locally-consistent notion of inner product with a new notion of cardinal probability. In this framework, conventional quantum mechanics and quantum computation emerge locally (though not globally) as the size of the underlying field increases. Interestingly, the framework allows one to choose separate finite fields for system description and for measurement: the size of the first field quantifies the resources needed to describe the system and the size of the second quantifies the resources used by the observer. This resource-based perspective potentially provides insights into quantitative measures for actual computational power, the complexity of quantum system definition and evolution, and the independent question of the cost of the measurement process.



قيم البحث

اقرأ أيضاً

71 - Lior Eldar , Peter Shor 2017
In this work, we introduce a definition of the Discrete Fourier Transform (DFT) on Euclidean lattices in $R^n$, that generalizes the $n$-th fold DFT of the integer lattice $Z^n$ to arbitrary lattices. This definition is not applicable for every latti ce, but can be defined on lattices known as Systematic Normal Form (SysNF) introduced in cite{ES16}. Systematic Normal Form lattices are sets of integer vectors that satisfy a single homogeneous modular equation, which itself satisfies a certain number-theoretic property. Such lattices form a dense set in the space of $n$-dimensional lattices, and can be used to approximate efficiently any lattice. This implies that for every lattice $L$ a DFT can be computed efficiently on a lattice near $L$. Our proof of the statement above uses arguments from quantum computing, and as an application of our definition we show a quantum algorithm for sampling from discrete distributions on lattices, that extends our ability to sample efficiently from the discrete Gaussian distribution cite{GPV08} to any distribution that is sufficiently smooth. We conjecture that studying the eigenvectors of the newly-defined lattice DFT may provide new insights into the structure of lattices, especially regarding hard computational problems, like the shortest vector problem.
We present a brief review of discrete structures in a finite Hilbert space, relevant for the theory of quantum information. Unitary operator bases, mutually unbiased bases, Clifford group and stabilizer states, discrete Wigner function, symmetric inf ormationally complete measurements, projective and unitary t--designs are discussed. Some recent results in the field are covered and several important open questions are formulated. We advocate a geometric approach to the subject and emphasize numerous links to various mathematical problems.
We study a lattice gauge theory in Wilsons Hamiltonian formalism. In view of the realization of a quantum simulator for QED in one dimension, we introduce an Abelian model with a discrete gauge symmetry $mathbb{Z}_n$, approximating the $U(1)$ theory for large $n$. We analyze the role of the finiteness of the gauge fields and the properties of physical states, that satisfy a generalized Gausss law. We finally discuss a possible implementation strategy, that involves an effective dynamics in physical space.
In this note we lay some groundwork for the resource theory of thermodynamics in general probabilistic theories (GPTs). We consider theories satisfying a purely convex abstraction of the spectral decomposition of density matrices: that every state ha s a decomposition, with unique probabilities, into perfectly distinguishable pure states. The spectral entropy, and analogues using other Schur-concave functions, can be defined as the entropy of these probabilities. We describe additional conditions under which the outcome probabilities of a fine-grained measurement are majorized by those for a spectral measurement, and therefore the spectral entropy is the measurement entropy (and therefore concave). These conditions are (1) projectivity, which abstracts aspects of the Lueders-von Neumann projection postulate in quantum theory, in particular that every face of the state space is the positive part of the image of a certain kind of projection operator called a filter; and (2) symmetry of transition probabilities. The conjunction of these, as shown earlier by Araki, is equivalent to a strong geometric property of the unnormalized state cone known as perfection: that there is an inner product according to which every face of the cone, including the cone itself, is self-dual. Using some assumptions about the thermodynamic cost of certain processes that are partially motivated by our postulates, especially projectivity, we extend von Neumanns argument that the thermodynamic entropy of a quantum system is its spectral entropy to generalized probabilistic systems satisfying spectrality.
Resource theories provide a general framework for the characterization of properties of physical systems in quantum mechanics and beyond. Here, we introduce methods for the quantification of resources in general probabilistic theories (GPTs), focusin g in particular on the technical issues associated with infinite-dimensional state spaces. We define a universal resource quantifier based on the robustness measure, and show it to admit a direct operational meaning: in any GPT, it quantifies the advantage that a given resource state enables in channel discrimination tasks over all resourceless states. We show that the robustness acts as a faithful and strongly monotonic measure in any resource theory described by a convex and closed set of free states, and can be computed through a convex conic optimization problem. Specializing to continuous-variable quantum mechanics, we obtain additional bounds and relations, allowing an efficient computation of the measure and comparison with other monotones. We demonstrate applications of the robustness to several resources of physical relevance: optical nonclassicality, entanglement, genuine non-Gaussianity, and coherence. In particular, we establish exact expressions for various classes of states, including Fock states and squeezed states in the resource theory of nonclassicality and general pure states in the resource theory of entanglement, as well as tight bounds applicable in general cases.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا