Related papers: Generating scalable graph states in an atom-nanoph…
Graph states are used to represent mathematical graphs as quantum states on quantum computers. They can be formulated through stabilizer codes or directly quantum gates and quantum states. In this paper we show that a quantum graph neural…
Graph states are a family of stabilizer states which can be tailored towards various applications in photonic quantum computing and quantum communication. In this paper, we present a modular design based on quantum dot emitters coupled to a…
We present a novel way to manipulate ultra-cold atoms where four atomic levels are trapped by appropriately tuned optical lattices. When employed to perform quantum computation via global control, this unique structure dramatically reduces…
The realization of a long-distance, distributed quantum network based on quantum memory nodes that are linked by photonic channels remains an outstanding challenge. We propose a quantum network node based on neutral alkali atoms coupled to…
Quantum physics phenomena, entanglement and coherence, are crucial for quantum information protocols, but understanding these in systems with more than two parts is challenging due to increasing complexity. The W state, a multipartite…
The quantum circuit model is the default for encoding an algorithm intended for a NISQ computer or a quantum computing simulator. A simple graph and through it, a graph state - quantum state physically manifesting an abstract graph…
Many experiments in quantum information aim at creating graph states. Quantifying the purity of an experimentally achieved graph state could in principle be accomplished using full-state tomography. This method requires a number of…
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary…
To achieve scalable quantum information processing, great efforts have been devoted to the creation of large-scale entangled states in various physical systems. Ultracold atom in optical lattice is considered as one of the promising…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…
Atomic systems, ranging from trapped ions to ultracold and Rydberg atoms, offer unprecedented control over both internal and external degrees of freedom at the single-particle level. They are considered among the foremost candidates for…
Generation of arbitrary superposition of vacuum and one-photon states using quantum scissors device (QSD) is studied. The device allows the preparation of states by truncating an input coherent light. Optimum values of the intensity of the…
Quantum states featuring extensive multipartite entanglement are a resource for quantum-enhanced metrology, with sensitivity up to the Heisenberg limit. However, robust generation of these states using unitary dynamics typically requires…
We propose a new scalable architecture for trapped ion quantum computing that combines optical tweezers delivering qubit state-dependent local potentials with oscillating electric fields. Since the electric field allows for long-range…
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measurement-only quantum computation. We focus in this paper on the…
Entanglement is a crucial resource for quantum information processing, and so protocols to generate high fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate…
We present a complete architecture for scalable quantum computation with ultracold atoms in optical lattices using optical tweezers focused to the size of a lattice spacing. We discuss three different two-qubit gates based on local…
We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is…
Scalability remains a major challenge in building practical fault-tolerant quantum computers. Currently, the largest number of qubits achieved across leading quantum platforms ranges from hundreds to thousands. In atom arrays, scalability…
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…