Classical & quantum dynamics of information
... subsystems is then examined in some detail. Chapter 3 is based on papers (A) and (B) of the list of publications. Extended Landauer-like principles are developed, based amongst others on the conservation of information of divergenceless dynamical systems. Conservation of information within the frame ...
... subsystems is then examined in some detail. Chapter 3 is based on papers (A) and (B) of the list of publications. Extended Landauer-like principles are developed, based amongst others on the conservation of information of divergenceless dynamical systems. Conservation of information within the frame ...
1. von Neumann Versus Shannon Entropy
... measurement outcome has actually been realised. If we did that we would necessarily find just one of the states, q i , to which we would then assign an entropy of zero. The density matrix (3.2.5.2) does, however, account for the reduction of the wavepacket ; the irreversible, indeterminate, -process ...
... measurement outcome has actually been realised. If we did that we would necessarily find just one of the states, q i , to which we would then assign an entropy of zero. The density matrix (3.2.5.2) does, however, account for the reduction of the wavepacket ; the irreversible, indeterminate, -process ...
- Philsci-Archive
... models for coin tosses (Keller, 1986; Strzalko et al., 2008) which may even be exploited to create biases in the outcomes of tosses (Diaconis, Holmes, and Montgomery, 2007). This then can be taken to suggest that an epistemic (ignorance) interpretation for these probabilities is more apt. Horses, on ...
... models for coin tosses (Keller, 1986; Strzalko et al., 2008) which may even be exploited to create biases in the outcomes of tosses (Diaconis, Holmes, and Montgomery, 2007). This then can be taken to suggest that an epistemic (ignorance) interpretation for these probabilities is more apt. Horses, on ...
A New and Feasible Protocol for Semi
... computational basis (and that were not discarded). If there is no noise or eavesdropping, this bit string should be the same for Alice and Bob. 9. Alice sends to Bob error correction information, and Bob corrects the errors in his bit string, so that it is the same as Alice’s. 10. Alice and Bob perf ...
... computational basis (and that were not discarded). If there is no noise or eavesdropping, this bit string should be the same for Alice and Bob. 9. Alice sends to Bob error correction information, and Bob corrects the errors in his bit string, so that it is the same as Alice’s. 10. Alice and Bob perf ...
Quantum Computer (Information) and Quantum Mechanical
... the processing of information (quantum computation) that the differentiation occurs. The ability to manipulate quantum information enables us to perform tasks that would be unachievable in a classical context, such as unconditionally secure transmission of information. Quantum information processing ...
... the processing of information (quantum computation) that the differentiation occurs. The ability to manipulate quantum information enables us to perform tasks that would be unachievable in a classical context, such as unconditionally secure transmission of information. Quantum information processing ...
Quantum Computing, Quantum Games and Geometric Algebra
... that perhaps the only way to solve complex quantum mechanical problems was by simulating them on some quantum mechanical system [Fey82], [Fey86], [RHA96]. This led to the idea by Deutsch of expanding the classical model of the Turing machine [Tur36] to a quantum Turing machine [Deu85] which could ut ...
... that perhaps the only way to solve complex quantum mechanical problems was by simulating them on some quantum mechanical system [Fey82], [Fey86], [RHA96]. This led to the idea by Deutsch of expanding the classical model of the Turing machine [Tur36] to a quantum Turing machine [Deu85] which could ut ...
Quantum quenches to the attractive one
... experimental control allows to directly probe their unitary time evolution [4–13]. A simple paradigm to study the non-equilibrium dynamics of closed many-body quantum systems is that of a quantum quench [14]: a system is prepared in an initial state (usually the ground state of some Hamiltonian H0 ) ...
... experimental control allows to directly probe their unitary time evolution [4–13]. A simple paradigm to study the non-equilibrium dynamics of closed many-body quantum systems is that of a quantum quench [14]: a system is prepared in an initial state (usually the ground state of some Hamiltonian H0 ) ...
Quantum Fingerprints that Keep Secrets
... mapping x → (s, hs (x)), where hs is chosen at random from a 2-universal family of hash functions (s identifies hs inside the family). Quantum fingerprints have been introduced by Buhrman, Cleve, Watrous and de Wolf in [BCWdW01]. An n bits to d qubits quantum fingerprinting scheme is a mapping from ...
... mapping x → (s, hs (x)), where hs is chosen at random from a 2-universal family of hash functions (s identifies hs inside the family). Quantum fingerprints have been introduced by Buhrman, Cleve, Watrous and de Wolf in [BCWdW01]. An n bits to d qubits quantum fingerprinting scheme is a mapping from ...
Discrete Approaches to Quantum Gravity in Four Dimensions
... phase structure, and the inclusion of matter, to name just a few. So far, they have not been successful in providing convincing evidence for the existence of a non-trivial four-dimensional quantum theory of gravity (neither, of course, have other methods). There are considerable technical difficulti ...
... phase structure, and the inclusion of matter, to name just a few. So far, they have not been successful in providing convincing evidence for the existence of a non-trivial four-dimensional quantum theory of gravity (neither, of course, have other methods). There are considerable technical difficulti ...
Quantum computing
Quantum computing studies theoretical computation systems (quantum computers) that make direct use of quantum-mechanical phenomena, such as superposition and entanglement, to perform operations on data. Quantum computers are different from digital computers based on transistors. Whereas digital computers require data to be encoded into binary digits (bits), each of which is always in one of two definite states (0 or 1), quantum computation uses quantum bits (qubits), which can be in superpositions of states. A quantum Turing machine is a theoretical model of such a computer, and is also known as the universal quantum computer. Quantum computers share theoretical similarities with non-deterministic and probabilistic computers. The field of quantum computing was initiated by the work of Yuri Manin in 1980, Richard Feynman in 1982, and David Deutsch in 1985. A quantum computer with spins as quantum bits was also formulated for use as a quantum space–time in 1968.As of 2015, the development of actual quantum computers is still in its infancy, but experiments have been carried out in which quantum computational operations were executed on a very small number of quantum bits. Both practical and theoretical research continues, and many national governments and military agencies are funding quantum computing research in an effort to develop quantum computers for civilian, business, trade, and national security purposes, such as cryptanalysis.Large-scale quantum computers will be able to solve certain problems much more quickly than any classical computers that use even the best currently known algorithms, like integer factorization using Shor's algorithm or the simulation of quantum many-body systems. There exist quantum algorithms, such as Simon's algorithm, that run faster than any possible probabilistic classical algorithm.Given sufficient computational resources, however, a classical computer could be made to simulate any quantum algorithm, as quantum computation does not violate the Church–Turing thesis.