Related papers: Efficient eigenvalue determination for arbitrary P…

Spin qubits are contenders for scalable quantum computation because of their long coherence times demonstrated in a variety of materials, but individual control by frequency-selective addressing using pulsed spin resonance creates severe…

We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources by splitting the workload between classical and quantum processors.…

We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is…

Single electron spins in semiconductor quantum dots (QDs) are a versatile platform for quantum information processing, however controlling decoherence remains a considerable challenge. Recently, hole spins have emerged as a promising…

Spin qubits in silicon and germanium quantum dots are promising platforms for quantum computing, but entangling spin qubits over micrometer distances remains a critical challenge. Current prototypical architectures maximize transversal…

The development and improvement of analytical methods for evaluating nonclassical correlations is one of the most important tasks in quantum information science. In this paper, we investigate a mixed spin-$(1/2,S)$ system with an arbitrary…

Due to their long coherence times, nuclear spins have gained considerable attention as physical qubits. Two-qubit gates between nuclear spins of distinct resonance frequencies can be mediated by electron spins, usually employing a sequence…

Quantum processors use the native interactions between effective spins to simulate Hamiltonians or execute quantum gates. In most processors, the native interactions are pairwise, limiting the efficiency of controlling entanglement between…

It is suggested to map the qubits into solid state NMR spin system collective states instead of the states of the individual spin. Such an approach introduces the stable computational basis without any additional actions and allows to…

Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state…

Two level quantum mechanical systems like spin 1/2 particles lend themselves as a natural qubit implementation. However, encoding a single qubit in several spins reduces the resources necessary for qubit control and can protect from…

Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…

Quantum logic gates can perform calculations much more efficiently than their classical counterparts. However, the level of control needed to obtain a reliable quantum operation is correspondingly higher. In order to evaluate the…

We study the low energy states of finite spin chains with isotropic (Heisenberg) and anisotropic (XY and Ising-like) exchange interaction with uniform and non-uniform coupling constants. We show that for an odd number of sites a spin…

Dipolar coupled homonuclear spins present challenging, yet useful systems for quantum information processing. In such systems, eigenbasis of the system Hamiltonian is the appropriate computational basis and coherent control can be achieved…

Hybrid quantum registers, such as electron-nuclear spin systems, have emerged as promising hardware for implementing quantum information and computing protocols in scalable systems. Nevertheless, the coherent control of such systems still…

Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal…

We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…

We examine the detailed scenario for implementing n-control-qubit Toffoli gates and select gates on ion-trap quantum computers, especially those that shuttle ions into interaction zones. We determine expected performance of these gates with…

We propose to use the spin-orbit interaction as a means to control electron spins in quantum dots, enabling both single qubit and two qubit operations. Very fast single qubit operations may be achieved by temporarily displacing the…