English
Related papers

Related papers: Quantum Byzantine Agreement with a Single Qutrit

200 papers

The Byzantine agreement problem requires a set of $n$ processes to agree on a value sent by a transmitter, despite a subset of $b$ processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-30 Cheng Wang , Carole Delporte-Gallet , Hugues Fauconnier , Rachid Guerraoui , Anne-Marie Kermarrec

Geometric quantum mechanics aims to express the physical properties of quantum systems in terms of geometrical features preferentially selected in the space of pure states. Geometric characterisations are given here for systems of one, two,…

Quantum Physics · Physics 2007-06-13 Dorje C. Brody , Anna C. T. Gustavsson , Lane P. Hughston

The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by epsilon*N. Classically, it needs at least O(epsilon*N) bits of communication to find the…

Quantum Physics · Physics 2007-05-23 Lov K. Grover

Solutions of quaternionic quantum mechanics (QQM) are difficult to grasp, even in simple physical situations. In this article, we provide simple and understandable free particle quaternionic solutions, that can be easily compared to complex…

Quantum Physics · Physics 2019-08-28 Sergio Giardino

We propose a new Quantum Key Distribution method in which Alice sends pairs of qubits to Bob, each in one of four possible states. Bob uses one qubit to generate a secure key and the other to generate an auxiliary key. For each pair he…

Quantum Physics · Physics 2015-05-01 Mohd Asad Siddiqui , Tabish Qureshi

One-time programs, computer programs which self-destruct after being run only once, are a powerful building block in cryptography and would allow for new forms of secure software distribution. However, ideal one-time programs have been…

Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a 50% probability, any classical algorithm (whether deterministic or probabilistic) will need to look at a…

Quantum Physics · Physics 2008-02-03 Lov K. Grover

We describe a protocol for quantum information splitting (QIS) of a restricted class of three-qubit states among three parties Alice, Bob and Charlie, using a pair of GHZ states as the quantum channel. There are two different forms of this…

Quantum Physics · Physics 2015-05-04 Kaushik Nandi , Goutam Paul

Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…

Quantum Physics · Physics 2007-05-23 Sylvain Gravier , Philippe Jorrand , Mehdi Mhalla , Charles Payan

We propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states. The protocol involves single-qutrit and…

Quantum Physics · Physics 2018-11-20 P. V. Pyshkin , A. Gábris , O. Kálmán , I. Jex , T. Kiss

Quantum Image Processing is a recent highlight in the quantum computing field. All previous methods for representing the images as quantum states were defined using qubits. One Quantum Image Representation (QIR) method using qutrits is…

Quantum Physics · Physics 2022-11-01 Ankit Khandelwal , M Girish Chandra

We provide various schemes for the splitting up of Quantum information into parts using the four and five partite cluster states. Explicit protocols for the Quantum information splitting (QIS) of single and two qubit states are illustrated.…

Quantum Physics · Physics 2009-11-13 Sreraman Muralidharan , Prasanta K. Panigrahi

Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…

Quantum Physics · Physics 2009-10-31 S. C. Benjamin

A quantum cryptographic protocol based in public key cryptography combinations and private key cryptography is presented. Unlike the BB84 protocol [1] and its many variants [2,3] two quantum channels are used. The present research does not…

Quantum Physics · Physics 2012-05-15 Eduin H. Serna

Communication scenarios between two parties can be implemented by first encoding messages into some states of a physical system which acts as the physical medium of the communication and then decoding the messages by measuring the state of…

Quantum Physics · Physics 2024-04-23 Teiko Heinosaari , Oskari Kerppo , Leevi Leppäjärvi , Martin Plávala

We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…

Quantum Physics · Physics 2007-05-23 Andrei N. Soklakov , Ruediger Schack

Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…

Quantum Physics · Physics 2009-10-06 Kay-Yut Chen , Tad Hogg , Raymond Beausoleil

The novel experimental realization of three-state optical quantum systems is presented. We use the polarization state of biphotons,propagating in single frequency- and spatial mode, to generate an arbitrary qutrits. In particular the…

Quantum Physics · Physics 2009-11-10 Yu. I. Bogdanov , M. V. Chekhova , S. P. Kulik , G. A. Maslennikov , C. H. Oh , M. K. Tey

In this paper we give a quantum mechanical algorithm that can search a database by a single query, when the number of solutions is more than a quarter. It utilizes modified Grover operator of arbitrary phase.

Quantum Physics · Physics 2007-05-23 Dong Pyo Chi , Jinsoo Kim

A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…

Quantum Physics · Physics 2015-06-26 Wenjin Mao