Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn compression of non-classically correlated bit strings
381
0
0.0
(
0
)
Added by
Dagomir Kaszlikowski Dr
Publication date
2013
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this short note we present a new approach to non-classical correlations that is based on the compression rates for bit strings generated by Alice and Bob. We use normalised compression distance introduced by Cilibrasi and Vitanyi to derive information-theoretic inequalities that must be obeyed by classically correlated bit strings and that are violated by PR-boxes. We speculate about a violation of our inequalities by quantum mechanical correlations.
rate research
Read More
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1} 0^{m_1} ... 1^{n_r} 0^{m_r}$, we generalize classical problems from the theory of Catalan structures. In particular, it is very difficult to find useful explicit formulas for the enumeration function $phi(n_1, m_1, ..., n_r, m_r)$, which counts the number of pairings as a function of the underlying bitstring. We determine explicit formulas for $phi$, and also prove general upper bounds in terms of Fuss-Catalan numbers by relating non-crossing pairings to other generalized Catalan structures (that are in some sense more natural). This enumeration problem arises in the theory of random matrices and free probability.
Quantum bit commitment has been known to be impossible by the independent proofs of Mayers, and Lo and Chau, under the assumption that the whole quantum states right before the unveiling phase are static to users. We here provide an unconditionally secure non-static quantum bit commitment protocol with a trusted third party, which is not directly involved in any communications between users and can be limited not to get any information of commitment without being detected by users. We also prove that our quantum bit commitment protocol is not secure without the help of the trusted third party. The proof is basically different from the Mayers-Lo-Chaus no-go theorem, because we do not assume the staticity of the finally shared quantum states between users.
Central cryptographic functionalities such as encryption, authentication, or secure two-party computation cannot be realized in an information-theoretically secure way from scratch. This serves as a motivation to study what (possibly weak) primitives they can be based on. We consider as such starting points general two-party input-output systems that do not allow for message transmission, and show that they can be used for realizing unconditionally secure bit commitment as soon as they are non-trivial, i.e., cannot be securely realized from distributed randomness only.
Hybrid Quantum-Classical (HQC) Architectures are used in near-term NISQ Quantum Computers for solving Quantum Machine Learning problems. The quantum advantage comes into picture due to the exponential speedup offered over classical computing. One of the major challenges in implementing such algorithms is the choice of quantum embeddings and the use of a functionally correct quantum variational circuit. In this paper, we present an application of QSVM (Quantum Support Vector Machines) to predict if a person will require mental health treatment in the tech world in the future using the dataset from OSMI Mental Health Tech Surveys. We achieve this with non-classically simulable feature maps and prove that NISQ HQC Architectures for Quantum Machine Learning can be used alternatively to create good performance models in near-term real-world applications.
The language competition model of Viviane de Oliveira et al is modified by associating with each language a string of 32 bits. Whenever a language changes in this Viviane model, also one randomly selected bit is flipped. If then only languages with different bit-strings are counted as different, the resulting size distribution of languages agrees with the empirically observed slightly asymmetric log-normal distribution. Several other modifications were also tried but either had more free parameters or agreed less well with reality.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
