Searcharxiv⌕ Search

arXiv subjects

Marcin Markiewicz

Publications and source records attributed to Marcin Markiewicz.

58 records · Page 4Linked to original sources

Static Quantum Games Revisited

The so called \emph{quantum game theory} has recently been proclaimed as one of the new branches in the development of both quantum information theory and game theory. However, the notion of a quantum game itself has never been strictly defined, which has led to a lot of conceptual confusion among different authors. In this paper we introduce a new conceptual framework of a \emph{scenario} and an \emph{implementation} of a game. It is shown that the procedures of "quantization" of games proposed in the literature lead in fact to several different games which can be defined within the same scenario, but apart from this they may have nothing in common with the original game. Within the framework we put forward, a lot of conceptual misunderstandings that have arisen around "quantum games" can be stated clearly and resolved uniquely. In particular, the proclaimed essential role of entanglement in several static "quantum games", and their connection with Bell inequalities, is disproved.

quant-ph↗

Finding Traps in Non-linear Spin Arrays

Precise knowledge of the Hamiltonian of a system is a key to many of its applications. Tasks such state transfer or quantum computation have been well studied with a linear chain, but hardly with systems, which do not possess a linear structure. While this difference does not disturb the end-to-end dynamics of a single excitation, the evolution is significantly changed in other subspaces. Here we quantify the difference between a linear chain and a pseudo-chain, which have more than one spin at some site (block). We show how to estimate a number of all spins in the system and the intra-block coupling constants. We also suggest how it is possible to eliminate excitations trapped in such blocks, which may disturb the state transfer. Importantly, one uses only at-ends data and needs to be able to put the system to either the maximally magnetized or the maximally mixed state. This can obtained by controlling a global decoherence parameter, such as temperature.

quant-ph↗

One-Qubit and Two-Qubit Codes in Noisy State Transfer

Quantum state transfer is a procedure, which allows to exchange quantum information between stationary qubit systems. It is anticipated that the transfer will find applications in solid-state quantum computing. In this contribution, we discuss the effects of various, physically relevant models of decoherence on a toy model of six qubit linearly coupled by the exchange interaction. In many cases we observe the advantage of the two-qubit encoding, which can be associated with the fact that this encoding does not require the state initialization.

quant-ph↗

What Can be Observed Locally? Round-based Models for Quantum Distributed Computing

Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed computation is extended so as to apply quantum processing. This has been achieved in one of two distinct ways: (1) by initializing the system in a quantum entangled state, and/or (2) by applying quantum communication channels. In this paper, we explain why some of these prior claims are misleading, in the sense that they rely on changes to the model unrelated to quantum processing. On the positive side, we consider the aforementioned quantum extensions when applied to Linial's well-established LOCAL model of distributed computing. For both types of extensions, we put forward valid proof-of-concept examples of distributed problems whose round complexity is in fact reduced through genuinely quantum effects, in contexts which do not depend on the anonymity of nodes. Finally, we show that even the quantum variants of the LOCAL model have non-trivial limitations, captured by a very simple (purely probabilistic) notion which we call "physical locality" (PLOCAL). While this is strictly weaker than the "computational locality" of the classical LOCAL model, it nevertheless implies that for many distributed combinatorial optimization problems, such as Maximal Independent Set, the best currently known lower time bounds cannot be broken by applying quantum processing, in any conceivable way.

quant-ph↗