Related papers: Always On Non-Nearest-Neighbor Coupling in Scalabl…
By applying complementary analytic and numerical methods, we investigate the dynamics of spin-$1/2$ XXZ models with variable-range interactions in arbitrary dimensions. The dynamics we consider is initiated from uncorrelated states that are…
This technical note compares two coding (quantization) schemes for random projections in the context of sub-linear time approximate near neighbor search. The first scheme is based on uniform quantization while the second scheme utilizes a…
Successful execution of a quantum information processing (QIP) task on a quantum processing device depends on the availability of high-quality entangling gates. Two important goals in the design and implementation of any entangling gate are…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
Challenges at the quantum-classical interface are examined with the goal of architecting a scaled-up quantum computer comprising many thousands of qubits in the solid-state. Separating the distinct sub-systems of the interface that perform…
Solid state spin qubits are promising candidates for the realization of a quantum computer due to their long coherence times and easy electrical manipulation. However, spin-spin interactions, which are needed for entangling gates, have only…
Distributing circuits across quantum processor modules will enable the execution of circuits larger than the qubit count limitations of monolithic processors. While distributed quantum computation has primarily utilized circuit cutting, it…
We apply quantum control techniques to control a large spin chain by only acting on two qubits at one of its ends, thereby implementing universal quantum computation by a combination of quantum gates on the latter and swap operations across…
The effective Heisenberg interaction of long distance is constructed in spin qubits connected to a bus of two strongly coupled chains. Universal quantum computation can be realized on the basis of the bus which always keeps frozen at the…
In this study, we propose a spin-star model for spin-(1/2) particles in order to examine the coherence dynamics of a quantum neural network (QNN) unit. Since quantum computing paradigm promises advantages over their classical counterparts,…
Nearest-neighbour clustering is a powerful set of heuristic algorithms that find natural application in the decoding of signals transmitted using the M-Quadrature Amplitude Modulation (M-QAM) protocol. Lloyd et al. proposed a quantum…
The approximation of nearest neighbor interaction (NNI) is widely used in short-time spin dynamics with dipole-dipole interactions (DDI) when the intensity of spin-spin interaction is $\sim 1/r^3$, where $r$ is a distance between those…
Quantum computers face inherent scaling challenges, a fact that necessitates investigation of distributed quantum computing systems, whereby scaling is achieved through interconnection of smaller quantum processing units. However,…
The rapid advancement of quantum computing has spurred widespread adoption, with cloud-based quantum devices gaining traction in academia and industry. This shift raises critical concerns about the privacy and security of computations on…
A significant hurdle towards realization of practical and scalable quantum computing is to protect the quantum states from inherent noises during the computation. In physical implementation of quantum circuits, a long-distance interaction…
The quantum internet is a rapidly developing technological reality, yet, it remains unclear what kind of quantum network structures might emerge. Since indirect quantum communication is already feasible and preserves absolute security of…
The inevitable existence of static internal imperfections and residual interactions in some quantum computer architectures result in internal decoherence, dissipation, and destructive unitary shifts of active algorithms. By exact numerical…
We examine a simple heuristic test of integrability for quantum chains. This test is applied to a variety of systems, including a generic isotropic spin-1 model with nearest-neighbor interactions and a multiparameter family of spin-1/2…
We study a one-dimensional chain of nuclear $1/2-$spins in an external time-dependent magnetic field. This model is considered as a possible candidate for experimental realization of quantum computation. According to the general theory of…
Quantum annealing is a heuristic optimization algorithm that exploits quantum evolution to approximately find lowest energy states. Quantum annealers have scaled up in recent years to tackle increasingly larger and more highly connected…