Related papers: Quantum Networks for Generating Arbitrary Quantum …
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…
We discuss a novel method of efficiently producing multi-photon states using repeated spontaneous parametric downconversion. Specifically, by attempting downconversion several times, we can pseudo-deterministically add photons to a mode,…
Shared entanglement between spatially separated systems is an essential resource for quantum information processing including long-distance quantum cryptography and teleportation. While purification protocols for mixed distributed entangled…
Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory…
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…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
Quantum optical cluster states have been increasingly explored, in the light of their importance for measurement-based quantum computing. Here we set forth a new method for generating quantum controlled cluster states: pumping an optical…
Semi-quantum cryptography involves at least one user who is semi-quantum or "classical" in nature. Such a user can only interact with the quantum channel in a very restricted way. Many semi-quantum key distribution protocols have been…
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state…
We present a method for quantum state tomography that enables the efficient estimation, with fixed precision, of any of the matrix elements of the density matrix of a state, provided that the states from the basis in which the matrix is…
We propose and analyse a scheme for single-rail-encoded arbitrary multi-qubit quantum-state generation to provide a versatile tool for quantum optics and quantum information applications. Our scheme can be realized, for small numbers of…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most…
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…
A viable approach for building large-scale quantum computers is to interlink small-scale quantum computers with a quantum network to create a larger distributed quantum computer. When designing quantum algorithms for such a distributed…
Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…
In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing…
The quantum computer is supposed to process information by applying unitary transformations to the complex amplitudes defining the state of N qubits. A useful machine needing N=1000 or more, the number of continuous parameters describing…
We explicitly construct a quantum circuit which exactly generates random three-qubit states. The optimal circuit consists of three CNOT gates and fifteen single qubit elementary rotations, parametrized by fourteen independent angles. The…
Numerical optimization methods such as hillclimbing and simulated annealing have been applied to search for highly entangled multi-qubit states. Here the genetic algorithm is applied to this optimization problem -- to search not only for…
So far proposed quantum computers use fragile and environmentally sensitive natural quantum systems. Here we explore the notion that synthetic quantum systems suitable for quantum computation may be fabricated from smart nanostructures…