Related papers: Scalable tests of quantum contextuality from stabi…
Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correction schemes. Arbitrary quantum states admit many stabiliser…
Quantum error-correcting codes aim to protect information in quantum systems to enable fault-tolerant quantum computations. The most prevalent method, stabilizer codes, has been well developed for many varieties of systems, however, largely…
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a…
The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy…
For a number of quantum channels of interest, phase-flip errors occur far more frequently than bit-flip errors. When transmitting across these asymmetric channels, the decoding error rate can be reduced by tailoring the code used to the…
Codeword stabilized (CWS) codes are a general class of quantum codes that includes stabilizer codes and many families of non-additive codes with good parameters. For such a non-additive code correcting all t-qubit errors, we propose an…
Decoding stabilizer codes such as the surface and toric codes involves evaluating free-energy differences in a disordered statistical mechanics model, in which the randomness comes from the observed pattern of error syndromes. We study the…
Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the…
Quantum based systems are a relatively new research area for that different modelling languages including process calculi are currently under development. Encodings are often used to compare process calculi. Quality criteria are used then…
We quantize prisoners dilemma and chicken game by our generalized quantization scheme to explore the role of quantum discord in quantum games. In order to establish this connection we use Werner-like state as an initial state of the game.…
A powerful method for analyzing quantum error-correcting codes is to map them onto classical statistical mechanics models. Such mappings have thus far mostly focused on static codes, possibly subject to repeated syndrome measurements.…
We study the extension of classical games to the quantum domain, generated by the addition of one unitary strategy to two classical strategies of each player. The conditions that need to be met by unitary operations to ensure that the…
We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect…
We establish approximate rigidity results for several well-known families of nonlocal games. In particular, we show that near-perfect quantum strategies for boolean constraint system (BCS) games are approximate representations of the…
Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum…
In its normal form prisoners' dilemma (PD) is represented by a payoff matrix showing players strategies and payoffs. To obtain distinguishing trait and strategic form of PD certain constraints are imposed on the elements of its payoff…
The quantum hashing bound guarantees that rates up to $1-H(p_I, p_X, p_Y, p_Z)$ are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve achievable rates for certain asymmetric Pauli channels is to…
Description of nonclassicality of states has hitherto been through violation of Bell inequality and non-separability, with the latter being a stronger constraint. In this paper, we show that this can be further sharpened, by introducing the…
Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of…
The last two decades have witnessed a rapid development of quantum information processing, a new paradigm which studies the power and limit of "quantum advantages" in various information processing tasks. Problems such as when quantum…