scholarly journals Distributed Compression of Correlated Classical-Quantum Sources or: The Price of Ignorance

2020 ◽  
Vol 66 (9) ◽  
pp. 5620-5633
Author(s):  
Zahra Baghali Khanian ◽  
Andreas Winter
Author(s):  
Sandip Tiwari

Information is physical, so its manipulation through devices is subject to its own mechanics: the science and engineering of behavioral description, which is intermingled with classical, quantum and statistical mechanics principles. This chapter is a unification of these principles and physical laws with their implications for nanoscale. Ideas of state machines, Church-Turing thesis and its embodiment in various state machines, probabilities, Bayesian principles and entropy in its various forms (Shannon, Boltzmann, von Neumann, algorithmic) with an eye on the principle of maximum entropy as an information manipulation tool. Notions of conservation and non-conservation are applied to example circuit forms folding in adiabatic, isothermal, reversible and irreversible processes. This brings out implications of fluctuation and transitions, the interplay of errors and stability and the energy cost of determinism. It concludes discussing networks as tools to understand information flow and decision making and with an introduction to entanglement in quantum computing.


2020 ◽  
Vol 75 (11) ◽  
pp. 937-962
Author(s):  
Heinz-Jürgen Schmidt

AbstractWe consider the solution of the equation of motion of a classical/quantum spin subject to a monochromatical, elliptically polarized external field. The classical Rabi problem can be reduced to third-order differential equations with polynomial coefficients and hence solved in terms of power series in close analogy to the confluent Heun equation occurring for linear polarization. Application of Floquet theory yields physically interesting quantities like the quasienergy as a function of the problem’s parameters and expressions for the Bloch–Siegert shift of resonance frequencies. Various limit cases are thoroughly investigated.


Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 971
Author(s):  
Oded Shor ◽  
Felix Benninger ◽  
Andrei Khrennikov

This paper is devoted to the foundational problems of dendrogramic holographic theory (DH theory). We used the ontic–epistemic (implicate–explicate order) methodology. The epistemic counterpart is based on the representation of data by dendrograms constructed with hierarchic clustering algorithms. The ontic universe is described as a p-adic tree; it is zero-dimensional, totally disconnected, disordered, and bounded (in p-adic ultrametric spaces). Classical–quantum interrelations lose their sharpness; generally, simple dendrograms are “more quantum” than complex ones. We used the CHSH inequality as a measure of quantum-likeness. We demonstrate that it can be violated by classical experimental data represented by dendrograms. The seed of this violation is neither nonlocality nor a rejection of realism, but the nonergodicity of dendrogramic time series. Generally, the violation of ergodicity is one of the basic features of DH theory. The dendrogramic representation leads to the local realistic model that violates the CHSH inequality. We also considered DH theory for Minkowski geometry and monitored the dependence of CHSH violation and nonergodicity on geometry, as well as a Lorentz transformation of data.


2013 ◽  
Vol 59 (2) ◽  
pp. 1175-1187 ◽  
Author(s):  
Mark M. Wilde ◽  
Saikat Guha

Author(s):  
Ilan Shomorony ◽  
A. Salman Avestimehr ◽  
Himanshu Asnani ◽  
Tsachy Weissman

Author(s):  
Mark M. Wilde

Because a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential measurements to determine the message of the sender. We show here that this intuition is not true, by demonstrating that a sequential decoding strategy works well even in the most general ‘one-shot’ regime, where we are given a single instance of a channel and wish to determine the maximal number of bits that can be communicated up to a small failure probability. This result follows by generalizing a non-commutative union bound to apply for a sequence of general measurements. We also demonstrate two ways in which a receiver can recover a state close to the original state after it has been decoded by a sequence of measurements that each succeed with high probability. The second of these methods will be useful in realizing an efficient decoder for fully quantum polar codes, should a method ever be found to realize an efficient decoder for classical-quantum polar codes.


Sign in / Sign up

Export Citation Format

Share Document