Related papers: Quantum circuits for the Ising spin networks

A transverse magnetic field is used to scan the diagonal and off-diagonal susceptibility of the uniaxial quantum magnet, $\text{LiHo}_{0.045}\text{Y}_{0.955}\text{F}_4$. Clusters of strongly-coupled spins act as the primary source for the…

We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate radio-frequency pulses. In addition to the standard…

I discuss the role played by the spin-network basis and recoupling theory (in its graphical tangle-theoretic formulation) and their use for performing explicit calculations in loop quantum gravity. In particular, I show that recoupling…

We explore the classical setting for the U(N) framework for SU(2) intertwiners for loop quantum gravity (LQG) and describe the corresponding phase space in terms of spinors with appropriate constraints. We show how its quantization leads…

We show that a wide range of spin clusters with antiferromagnetic intracluster exchange interaction allows one to define a qubit. For these spin cluster qubits, initialization, quantum gate operation, and readout are possible using the same…

Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…

Transporting quantum information is an important prerequisite for quantum computers. We study how this can be done in Heisenberg-coupled spin networks using adiabatic control over the coupling strengths. We find that qudits can be…

Efficient preparation of many-body ground states is key to harnessing the power of quantum computers in studying quantum many-body systems. In this work, we propose a simple method to design exact linear-depth parameterized quantum circuits…

Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…

We investigate the phase structure of four-dimensional quantum gravity coupled to Ising spins or Gaussian scalar fields by means of numerical simulations. The quantum gravity part is modelled by the summation over random simplicial…

A distributed quantum network would require quantum nodes capable of performing arbitrary quantum information protocols with high fidelity. So far the challenge has been in realizing such quantum nodes with features for scalable quantum…

A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum…

I describe the use of techniques based on composite rotations to combat systematic errors in controlled phase gates, which form the basis of two qubit quantum logic gates. Although developed and described within the context of Nuclear…

The classification of quantum states into distinct classes poses a significant challenge. In this study, we address this problem using quantum neural networks in combination with a problem-inspired circuit and customised as well as…

The spin states of single electrons in gate-defined quantum dots satisfy crucial requirements for a practical quantum computer. These include extremely long coherence times, high-fidelity quantum operation, and the ability to shuttle…

The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A…

A theoretical spin-based scheme for performing a variety of quantum computations is presented. It makes use of an array of multiple identical computer vectors of phosphorus-doped silicon where the nuclei serve as logical qubits and the…

Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum Networks (QNs) can help address this challenge by enabling the construction of large, robust, and more capable quantum…

A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is…

We propose a deterministic scheme of generating genuine multiparty entangled states in quantum networks of arbitrary size having various geometric structures -- we refer to it as entanglement circulation. The procedure involves optimization…