Related papers: Quantum Sequence States
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…
The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS). The proposed QSS scheme utilizes Grover's three-particle quantum state. In this scheme, the dealer prepares an encoded state by encoding the…
Quantum entanglement plays an important role in quantum information processes, such as quantum computation and quantum communication. Experiments in laboratories are unquestionably crucial to increase our understanding of quantum systems…
Recently a scheme has been proposed for constructing quantum error-correcting codes that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. One of the…
Quantum computation has attracted much attention since it was shown by Shor and Grover the possibility to implement quantum algorithms able to realize, respectively, factoring and searching in a faster way than any other known classical…
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
Search-base algorithms have widespread applications in different scenarios. Grover's quantum search algorithms and its generalization, amplitude amplification, provide a quadratic speedup over classical search algorithms for unstructured…
It is well known that Grover's algorithm asymptotically transforms an equal superposition state into an eigenstate (of a given basis). Here, we demonstrate a verification algorithm based on weak measurement which can achieve the same…
Quantum states with nonlinear squeezing are a necessary resource for deterministic implementation of high-order quadrature phase gates that are, in turn, sufficient for advanced quantum information processing. We demonstrate that this class…
State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorithm. In this paper, we analyse the performance of this…
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…
Cluster states, a special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot…
First, we show how the quantum circuits for generating and measuring multi-party entanglement of qubits can be translated to continuous quantum variables. We derive sufficient inseparability criteria for $N$-party continuous-variable states…
Generating a long-distance quantum state with genuine quantum correlation (GQC) is one of the most essential functions of quantum networks to support quantum communication. Here, we provide a deterministic scheme for generating multimode…
We establish a relation between topological and quantum entanglement for a multi-qubit state by considering the unitary representations of the Artin braid group. We construct topological operators that can entangle multi-qubit state. In…
The entanglement of a quantum system can be valuated using Mermin polynomials. This gives us a means to study entanglement evolution during the execution of quantum algorithms. We first consider Grover's quantum search algorithm, noticing…
The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of…
The canonical Schmidt decomposition of quantum states is discussed and its implementation to the Quantum Computation Simulator is outlined. In particular, the semiorder relation in the space of quantum states induced by the lexicographic…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
The cluster state model for quantum computation [Phys. Rev. Lett. 86, 5188] outlines a scheme that allows one to use measurement on a large set of entangled quantum systems in what is known as a cluster state to undertake quantum…