相关论文: Synthesizing NMR analogues of Einstein-Podolsky-Ro…

The Einstein Podolsky Rosen (EPR) entangled quantum state is of special importance not only for fundamental research in quantum mechanics, but also for information processing in the field of quantum information. Previous EPR entangled state…

We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form $E |w >< w|$ where…

Grover's algorithm is a well-known contribution to quantum computing. It searches one value within an unordered sequence faster than any classical algorithm. A fundamental part of this algorithm is the so-called oracle, a quantum circuit…

The numerical generation of random quantum states (RQS) is an important procedure for investigations in quantum information science. Here we review some methods that may be used for performing that task. We start by presenting a simple…

Generalized Intelligent States (coherent and squeezed states) are derived for an arbitrary quantum system by using the minimization of the so-called Robertson-Schr\"odinger uncertainty relation. The Fock-Bargmann representation is also…

We show that a quantum state can be perfectly cloned up to global mirroring with a unitary transformation that depends on one single parameter. We then show that this is equivalent to "perfect" cloning for quantum associative memories…

Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…

We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…

Continuous variable entangled radiation, known as Einstein-Podolsky-Rosen (EPR) states, are spatially separated quantum states with applications ranging from quantum teleportation and communication to quantum sensing. The ability to…

Squeezed states are one of the most useful quantum optical models having various applications in different areas, especially in quantum information processing. Generalized squeezed states are even more interesting since, sometimes, they…

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…

Einstein-Podolsky-Rosen (EPR) paradox highlights the absence of a local realistic explanation for quantum mechanics, and shows the incompatibility of the local-hidden-state models with quantum theory. For $N$-qubit states, or more…

The landmark Grover algorithm for amplitude amplification serves as an essential subroutine in various type of quantum algorithms, with guaranteed quantum speedup in query complexity. However, there have been no proposal to realize the…

We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…

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…

Problems in realization of silicon-based solid-state NMR quantum computer with ensemble addressing to qubits are considered. It is presented the extension of Kane's scheme to ensemble approach version with strip gates. For the…

It is exponentially hard to simulate quantum systems by classical algorithms, while quantum computer could in principle solve this problem polynomially. We demonstrate such an quantum-simulation algorithm on our NMR system to simulate an…

By allowing measurements of observables other than the state of the qubits in a quantum computer, one can find eigenvectors very quickly. If a unitary operation U is implemented as a time-independent Hamiltonian, for instance, one can…

In a standard bipartite Einstein-Podolsky-Rosen (EPR) scenario, Alice and Bob share a system prepared in an entangled state and Alice performs local measurements. One possible generalisation of this set-up is to allow Bob to also locally…

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as…