Related papers: Implementation of the Deutsch-Jozsa algorithm with…
A binary mapping from Fock space of bosonic state to qubits is given. Based on the binary mapping, we construte an algorithm of qubitization of bosons with complexity O(log(N)). As an example, the algorithm of qubitization of bosons in…
We present a method to find the decompositions of tripartite entangled pure states which are smaller than two successive Schmidt decompositions. The method becomes very simple when one of the subsystems is a qubit. In this particular case,…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…
We propose efficient algorithms with logarithmic step complexities for the generation of entangled $GHZ_N$ and $W_N$ states useful for quantum networks, and we demonstrate an implementation on the IBM quantum computer up to $N=16$. Improved…
We propose a way for generating $n$-qubit Greenberger-Horne-Zeilinger (GHZ) entangled states with a three-level qubit system and (n-1) four-level qubit systems in a cavity. This proposal does not require identical qubit-cavity coupling…
We propose encoding multiple qubits inside ions in existing trapped-ion quantum computers to access more qubits and to simplify circuits implementing standard algorithms. By using such `virtual' qubits, some inter-ion gates can be replaced…
We propose two protocols to encode a logical qubit into physical qubits relying on common types of qubit-qubit interactions in as simple forms as possible. We comment on its experimental implementation in several quantum computing…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…
We experimentally explore the state space of three qubits on an NMR quantum information processor. We construct a scheme to experimentally realize a canonical form for general three-qubit states up to single-qubit unitaries. This form…
We propose a theoretical protocol for quantum logic gates between two Josephson junction charge-phase qubits through the control of their coupling to a large junction. In the low excitation limit of the large junction when $E_{J}\gg E_{c}$,…
We report on an optimal single-electron charge qubit for a solid-state double quantum dot (DQD) system and analyse its dynamics under a time-dependent linear detuning, using GPU accelerated numerical solutions to the time-dependent…
Despite an apparent progress in implementing individual solid-state qubits, there have been no experimental reports so far on multi-bit gates required for building a real quantum computer. Here we report a new circuit comprising two coupled…
We present a simple scheme to implement the Deutsch-Jozsa algorithm based on two-atom interaction in a thermal cavity. The photon-number-dependent parts in the evolution operator are canceled with the strong resonant classical field added.…
There exists a large number of experimental and theoretical results supporting the picture of "macroscopic qubits" implemented, for instance, by Rydberg atoms, Josephson junctions or Bose-Einstein condensates - the systems which should…
We present a robust method, based only on measurements, to produce superconducting cluster states. The measurement of the current of a few parallel Josephson-junction qubits realizes a novel type of quantum-state selector. Using this…
We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for…
We report the realization of an elementary quantum processor based on a linear crystal of trapped ions. Each ion serves as a quantum bit (qubit) to store the quantum information in long lived electronic states. We present the realization of…
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but…