Related papers: Implementing quantum logic operations, pseudo-pure…
High fidelity quantum control over qubits is of crucial importance for realistic quantum computing, and it turns to be more challenging when there are inevitable interactions among qubits. By employing a bandselective shaped pulse, we…
Nuclear magnetic resonance techniques are used to realize a quantum algorithm experimentally. The algorithm allows a simple NMR quantum computer to determine global properties of an unknown function requiring fewer function ``calls'' than…
We report on the experimental investigation of an individual pseudomolecule using trapped ions with adjustable magnetically induced J-type coupling between spin states. Resonances of individual spins are well separated and are addressed…
We provide analytical composite pulse sequences that perform dynamical decoupling concurrently with arbitrary rotations for a qubit coded in the spin state of a triple quantum dot. The sequences are designed to respect realistic…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
The protection of qubit coherence is an essential task in order to build a practical quantum computer able to manipulate, store and read quantum information with a high degree of fidelity. Recently, it has been proposed to increase the…
A robust system for use of Quantum Computation using neutral atoms is presented in this communication. This scheme exploits a multilevel atomic system interacting with two lasers in such a way that it leads to formation of two Coherent…
A method of switching a controlled-NOT gate in a solid-stae NMR quantum computer is presented. Qubits of I=1/2 nuclear spins are placed periodically along a quantum spin chain (1-D antiferromagnet) having a singlet ground state with a…
Quantum computers based on cold-atom arrays offer long-lived qubits with programmable connectivity, yet their progress toward fault-tolerant operation is limited by the relatively low fidelity of site-selective local control. We introduce…
Tensor Processing Units (TPUs) were developed by Google exclusively to support large-scale machine learning tasks. TPUs can, however, also be used to accelerate and scale up other computationally demanding tasks. In this paper we repurpose…
Two-qubit gates in trapped-ion quantum computers are generated by applying spin-dependent forces that temporarily entangle the internal state of the ion with its motion. Laser pulses are carefully designed to generate a maximally entangling…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…
Many problems intractable on classical devices could be solved by algorithms explicitly based on quantum mechanical laws, i.e. exploiting quantum information processing. As a result, increasing efforts from different fields are nowadays…
Liouville space search algorithm [Bruschweiler, Phys. Rev. Lett. {\bf 85}, 4815(2000).] utilizes mixed initial states of the ensemble, and has been successfully implemented earlier in weakly coupled spins, in which a spin can be identified…
An algorithm is proposed for constructing quasi-random "peaked" quantum circuits, i.e., circuits whose final qubit state exhibits a high probability concentration on a specific computational basis state. These circuits consist of random…
For the implementation of a quantum computer it is necessary to exercise complete control over the Hamiltonian of the used physical system. For NMR quantum computing the effectively acting Hamiltonian can be manipulated via pulse sequences.…
Simulating molecules using the Variational Quantum Eigensolver method is one of the promising applications for NISQ-era quantum computers. Designing an efficient ansatz to represent the electronic wave function is crucial in such…
Fewer-qubit quantum logic gate, serving as a basic unit for constructing universal multiqubit gates, has been widely applied in quantum computing and quantum information. However, traditional constructions for fewer-qubit gates often…
$\mathcal{PT}$-symmetric systems have garnered significant attention due to their unconventional properties. Despite the growing interest, there remains an ongoing debate about whether these systems outperform their Hermitian counterparts…
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…