0000000000386597

AUTHOR

Madars Virza

showing 9 related works from this author

Worst Case Analysis of Non-local Games

2013

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 referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input x i to the i th player who then responds by sending an answer a i to the referee. The players win if the answers a i satisfy a condition that may depend on the inputs x i .

Computer Science::Computer Science and Game TheoryComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERAL0102 computer and information sciencesNon local01 natural sciences010201 computation theory & mathematicsQuantum stateSimple (abstract algebra)0103 physical sciencesQuantum worldQuantum information010306 general physicsMathematical economicsCase analysisMathematics
researchProduct

Advantage of Quantum Strategies in Random Symmetric XOR Games

2013

Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players.

Computer Science::Computer Science and Game TheoryTheoretical computer scienceSequential gameQuantum pseudo-telepathySimple (abstract algebra)Symmetric gameComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryRepeated gameTheoryofComputation_GENERALScreening gameQuantumMathematics
researchProduct

Dažu kvantu spēļu analīze

2011

Viens no veidiem, kā pamatot kvantu pasaules atšķirību no klasiskās ir kvantu spēles, kurās spēlētāju uzvaras varbūtība ir lielāka, ja tie lieto kopīgus kvantu stāvokļus. Darba mērķis ir atrast jaunus kvantu spēļu piemērus un metodes to analīzei. Šajā darbā ir veikta divu konkrētu spēļu analīze, kā arī pētīta nejaušo simetrisko spēļu klase. Tiek dots pilnīga Ardehali spēles klasiskā gadījuma analīze jebkuram spēlētāju skaitam. EQUAL-EQUAL spēle tiek analizēta novitārā ``worst-case'' modelī un pierādīts, ka tai ne ``worst-case'', ne ``average-case'' varbūtību sadalījumiem nav kvantu priekšrocības, bet tāda parādās nesimetriskiem sadalījumiem. Tiek pierādīti arī kvantu un klasiskie novērtējum…

Datorzinātne
researchProduct

Quantum Strategies Are Better Than Classical in Almost Any XOR Game

2012

We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1−o(1) fraction of all 2-player XOR games.

Discrete mathematicsQuantum pseudo-telepathy010102 general mathematics0103 physical sciencesFraction (mathematics)0101 mathematics010306 general physics01 natural sciencesValue (mathematics)QuantumMathematics
researchProduct

On symmetric nonlocal games

2013

Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.

Discrete mathematicsComputer Science::Computer Science and Game TheoryGeneral Computer ScienceQuantum pseudo-telepathyGeneralizationSymmetric gameComputingMilieux_PERSONALCOMPUTINGCombinatorial game theoryTheoryofComputation_GENERALSymmetric probability distributionTheoretical Computer ScienceSimple (abstract algebra)Quantum worldMathematical economicsQuantumMathematicsTheoretical Computer Science
researchProduct

Galuā lauku realizācija, izmantojot vispārējās programmēšanas paradigmu

2009

Darbs ``Galuā lauku realizācija, izmantojot vispārējās programmēšanas paradigmu'' apraksta bibliotēkas, kas ļauj darboties ar patvaļīgiem galīgajiem laukiem $GF(p^n)$, izstrādi. Tiek atbalstītas visas aritmētiskās operācijas ar lauka elementiem, kā arī kvadrātsaknes vilkšana un lauka parametru ģenerēšana. Bibliotēka dota C++ izejas tekstu veidā, ir strukturēta un savietojama ar vairākiem kompilatoriem vairākās arhitektūrās. Atslēgvārdi: Galuā lauki, galīgie lauki, galīga lauka ģenerēšana, C++

Datorzinātne
researchProduct

Sensitivity versus block sensitivity of Boolean functions

2010

Determining the maximal separation between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1/2 s(f)^2 + 1/2 s(f). The best known separation previously was bs(f) = 1/2 s(f)^2 due to Rubinstein. We also report results of computer search for functions with at most 12 variables.

FOS: Computer and information sciencesSequenceComputational complexity theoryBlock (permutation group theory)Computational Complexity (cs.CC)Computer Science ApplicationsTheoretical Computer ScienceCombinatoricsComputer Science - Computational ComplexitySignal ProcessingTheory of computationSensitivity (control systems)Boolean functionAlgorithmComputer searchInformation SystemsMathematics
researchProduct

Worst case analysis of non-local games

2011

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 referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input $x_i$ to the $i^{th}$ player who then responds by sending an answer $a_i$ to the referee. The players win if the answers $a_i$ satisfy a condition that may depend on the inputs $x_i$. Typically, non-local games are studied in a framework where the referee picks the inputs from a known probability distribution. We initiate the study …

Computer Science::Computer Science and Game TheoryQuantum PhysicsComputingMilieux_PERSONALCOMPUTINGFOS: Physical sciencesQuantum Physics (quant-ph)
researchProduct

Quantum strategies are better than classical in almost any XOR game

2011

We initiate a study of random instances of nonlocal games. We show that quantum strategies are better than classical for almost any 2-player XOR game. More precisely, for large n, the entangled value of a random 2-player XOR game with n questions to every player is at least 1.21... times the classical value, for 1-o(1) fraction of all 2-player XOR games.

FOS: Computer and information sciencesQuantum PhysicsComputer Science - Computer Science and Game TheoryFOS: Physical sciencesQuantum Physics (quant-ph)Computer Science and Game Theory (cs.GT)
researchProduct