Related papers: Quantum Byzantine Agreement with a Single Qutrit
Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only…
An alternative quantum algorithm for the discrete logarithm problem is presented. The algorithm uses two quantum registers and two Fourier transforms whereas Shor's algorithm requires three registers and four Fourier transforms. A crucial…
Quantum computing as a promising technology can utilize stochastic solutions instead of deterministic approaches for complicated scenarios for which classical computing is inefficient, provided that both the concerns of the error-prone…
A quantum protocol for sharing an arbitrary two-qubit state between N parties is introduced. Any of the members, can retrieve the state, only with collaboration of the other parties. We will show that in terms of resources, i.e. the number…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
Quantum computers can solve specific complex tasks for which no reasonable-time classical algorithm is known. Quantum computers do however also offer inherent security of data, as measurements destroy quantum states. Using shared entangled…
The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a time. Here, we derive analytical solutions of the guesswork…
Recent work has shown how to use the laws of quantum mechanics to keep classical and quantum bits secret in a number of different circumstances. Among the examples are private quantum channels, quantum secret sharing and quantum data…
Quantum secret sharing is a method for sharing a secret quantum state among a number of individuals such that certain authorized subsets of participants can recover the secret shared state by collaboration and other subsets cannot. In this…
Using virtual spin formalism it is shown that a quantum particle with eight energy levels can store three qubits. The formalism allows to realize a universal set of quantum gates. Feasible formalism implementation is suggested which uses…
We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is…
Byzantine agreement, the underlying core of blockchain, aims to make every node in a decentralized network reach consensus. Classical Byzantine agreements unavoidably face two major problems. One is $1/3$ fault-tolerance bound, which means…
Molecular simulations are widely regarded as leading candidates to demonstrate quantum advantage--defined as the point at which quantum methods surpass classical approaches in either accuracy or scale. Yet the qubit counts and error rates…
Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…
We propose a scheme to realize quantum logic and entanglement for qutrit systems via state-dependent forces on trapped ions. By exploiting the laser-ion coupling in the presence of Coulomb interactions, the set of quantum gate operations…
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…
We describe a multi-scale resolution approach to analyzing problems in Quantum Mechanics using Daubechies wavelet basis. The expansion of the wavefunction of the quantum system in this basis allows a natural interpretation of each basis…
Given a set of multipartite entangled states, can we find a common state to prepare them by local operations and classical communication? Such a state, if exists, will be a common resource for the given set of states. We completely solve…
We propose the use of a quantum algorithm to deal with the problem of searching with errors in the framework of two-person games. Specifically, we present a solution to the Ulam's problem that polynomially reduces its query complexity and…
Bernstein and Varizani have given the first quantum algorithm to solve parity problem in which a strong violation of the classical imformation theoritic bound comes about. In this paper, we refine this algorithm with fewer resource and…