Related papers: Efficient Graph State Construction Under the Barre…
We propose a protocol for generating multi-particle entangled states using coherent manipulation of atoms trapped in an optical cavity. We show how entanglement can be adiabatically produced with two control beams and by exploiting…
A novel scheme is presented for generation of a multipartite W state for arbitrary number of qubits. Based on a recent proposal of entanglement without touching, it serves to demonstrate the potential of particle indistinguishability as a…
Experimental procedures are presented for the rapid detection of entanglement of unknown arbitrary quantum states. The methods are based on the entanglement criterion using accessible correlations and the principle of correlation…
Towards realising larger scale quantum algorithms, the ability to prepare sizeable multi-qubit entangled states with full qubit control is used as a benchmark for quantum technologies. We investigate the extent to which entanglement is…
In this work, we compare two schemes for generating arbitrary qudit graph states using spin qudits in silicon. The first scheme proposes the creation of qudit linear graph states from a single emitter - a silicon spin qudit. By employing…
We investigate entanglement production in a class of quantum baker's maps. The dynamics of these maps is constructed using strings of qubits, providing a natural tensor-product structure for application of various entanglement measures. We…
We give a new upper bound on the quantum query complexity of deciding $st$-connectivity on certain classes of planar graphs, and show the bound is sometimes exponentially better than previous results. We then show Boolean formula evaluation…
A novel two-qubit entangling gate for trapped-ion quantum processors is proposed theoretically and demonstrated experimentally. During the gate, double-dressed quantum states are created by applying a phase-modulated continuous driving…
Entangled states are a crucial resource for quantum-based technologies such as quantum computers and quantum communication systems (1,2). Exploring new methods for entanglement generation is important for diversifying and eventually…
The quantum approximate optimisation ansatz (QAOA) is one of the flagship algorithms used to tackle combinatorial optimisation on graphs problems using a quantum computer, and is considered a strong candidate for early fault-tolerant…
The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of…
Bach et al. [1] recently presented an algorithm for constructing confluent drawings, by leveraging power graph decomposition to generate an auxiliary routing graph. We identify two issues with their method which we call the node split and…
Entanglement is a key resource in quantum communication, but bipartite schemes are often insufficient for advanced protocols like quantum secret sharing or distributed computing. Graph states offer a flexible way to represent and manage…
The quantum chaos conjecture associates the spectral statistics of a quantum system with abstract notions of quantum ergodicity. Such associations are taken to be of fundamental and sometimes defining importance for quantum chaos, but their…
Braid theories are applied to quantum computation processes, where to each crossing in the Braid diagram a unitary Yang-Baxter operator R is associated, representing either a Braiding matrix or a universal quantum gate. By operating with…
Multi-qubit entangled photonic graph states are an important ingredient for all-photonic quantum computing, repeaters and networking. Preparing them using probabilistic stitching of single photons using linear optics presents a formidable…
Graph states play an important role in quantum information theory through their connection to measurement-based computing and error correction. Prior work has revealed elegant connections between the graph structure of these states and…
The Quantum Approximate Optimization Algorithm can naturally be applied to combinatorial search problems on graphs. The quantum circuit has p applications of a unitary operator that respects the locality of the graph. On a graph with…
We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a…
The entangled graph states have emerged as an elegant and powerful quantum resource, indeed almost all multiparty protocols can be written in terms of graph states including measurement based quantum computation (MBQC), error correction and…