Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEfficient Hamiltonian programming in qubit arrays with nearest-neighbour couplings
91
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider the problem of selectively controlling couplings in a practical quantum processor with always-on interactions that are diagonal in the computational basis, using sequences of local NOT gates. This methodology is well-known in NMR implementations, but previous approaches do not scale efficiently for the general fully-connected Hamiltonian, where the complexity of finding time-optimal solutions makes them only practical up to a few tens of qubits. Given the rapid growth in the number of qubits in cutting-edge quantum processors, it is of interest to investigate the applicability of this control scheme to much larger scale systems with realistic restrictions on connectivity. Here we present an efficient scheme to find near time-optimal solutions that can be applied to engineered qubit arrays with local connectivity for any number of qubits, indicating the potential for practical quantum computing in such systems.
rate research
Read More
We consider translationally invariant states of an infinite one dimensional chain of qubits or spin-1/2 particles. We maximize the entanglement shared by nearest neighbours via a variational approach based on finitely correlated states. We find an upper bound of nearest neighbour concurrence equal to C=0.434095 which is 0.09% away from the bound C_W=0.434467 obtained by a completely different procedure. The obtained state maximizing nearest neighbour entanglement seems to approximate the maximally entangled mixed states (MEMS). Further we investigate in detail several other properties of the so obtained optimal state.
We study Ising ferrimagnets on square lattices with antiferromagnetic exchange couplings between spins of values S=1/2 and S=1 on neighbouring sites, couplings between S=1 spins at next--nearest neighbour sites of the lattice, and a single--site anisotropy term for the S=1 spins. Using mainly ground state considerations and extensive Monte Carlo simulations, we investigate various aspects of the phase diagram, including compensation points, critical properties, and temperature dependent anomalies. In contrast to previous belief, the next--nearest neighbour couplings, when being of antiferromagnetic type, may lead to compensation points.
We implement Grovers quantum search algorithm on a nuclear spin chain quantum computer, taking into Ising type interactions between nearest and second nearest neighbours into account. The performance of the realisation of the algorithm is studied by numerical simulations with four spins. We determine the temporal behaviour of the fidelity during the algorithm, and we compute the final fidelity as a function of the Rabi frequency. For the latter, we obtained pronounced maxima at frequencies which fulfil the condition of the (2pi k)-method with respect to the second nearest neighbour interactions.
The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals rely on nearest-neighbour communication, which requires excess gate operations. For a qubit stripe with a width of L+1 physical qubits implementing L levels of concatenation, we find that the error threshold of 2.1x10^-5 without any communication burden is reduced to 1.2x10^-7 when gate errors are the dominant source of error. This ~175X penalty in error threshold translates to an ~13X penalty in the amplitude and timing of gate operation control pulses.
We investigate corner states in a photonic two-dimensional (2D) Su-Schrieffer-Heeger (SSH) model on a square lattice with zero gauge flux. By considering intracelluar next-nearest-neighbor (NNN) hoppings, we discover a broad class of corner states in the 2D SSH model, and show that they are robust against certain fabrication disorders. Moreover, these corner states are located around the corners, but not at the corner points, so we refer to them as general corner states. We analytically identify that the general corner states are induced by the intracelluar NNN hoppings (long-range interactions) and split off from the edge-state bands. Our work show a simple way to induce unique corner states by the long-range interactions, and offers opportunities for designing novel photonic devices.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
