Related papers: Layer by layer generation of cluster states
Due to the exponential complexity of the resources required by quantum state tomography (QST), people are interested in approaches towards identifying quantum states which require less effort and time. In this paper, we provide a tailored…
Quantum state tomography, a process that reconstructs a quantum state from measurements on an ensemble of identically prepared copies, plays a crucial role in benchmarking quantum devices. However, brute-force approaches to quantum state…
Verification and characterisation of quantum states are crucial for the implementation of quantum information processing, especially for many-body systems such as cluster states in optical lattices. In theory, it is simple to estimate the…
In this work we consider a novel heuristic decomposition algorithm for $n$-qubit gates that implement specified amplitude permutations on sparse states with $m$ non-zero amplitudes. These gates can be useful as an algorithmic primitive for…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
A class of architectures is advanced for cluster state quantum computation using quantum dots. These architectures include using single and multiple dots as logical qubits. Special attention is given to the supercoherent qubits introduced…
Mutually unbiased bases (MUBs) play a crucial role in numerous applications within quantum information science, such as quantum state tomography, error correction, entanglement detection, and quantum cryptography. Utilizing \(2^n + 1\) MUB…
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static…
A quantum eigensolver is designed under a multi-layer cluster mean-field (CMF) algorithm by partitioning a quantum system into spatially-separated clusters. For each cluster, a reduced Hamiltonian is obtained after a partial average over…
Quantum entanglement plays an irreplaceable role in various remote quantum information processing tasks. Here we present protocols for generating deterministic and heralded $N$-qubit entangled states across multiple network nodes. By…
Measurement-based quantum computation with continuous variables in an optical setup shows the great promise towards implementation of large-scale quantum computation, where the time-domain multiplexing approach enables us to generate the…
We consider a method of remote mixed state creation of a one-qubit subsystem (receiver) in a spin-1/2 chain governed by the nearest-neighbor $XY$-Hamiltonian. Owing to the evolution of the chain along with the variable local unitary…
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…
The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled…
We provide various schemes for the splitting up of Quantum information into parts using the four and five partite cluster states. Explicit protocols for the Quantum information splitting (QIS) of single and two qubit states are illustrated.…
A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is…
We experimentally demonstrate a simple scheme for generating a four-photon entangled cluster state with fidelity over 0.860 $\pm$ 0.015. We show that the fidelity is high enough to guarantee that the produced state is distinguished from…
We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold we present a…
Fault-tolerant measurement-based quantum computing (MBQC) provides a compelling framework for fault-tolerant quantum computation, in which quantum information is processed through single-qubit measurements on a three-dimensional entangled…
In this paper, we estimate the errors of Gaussian transformations implemented using one-way quantum computations on cluster states of various configurations. From all possible cluster state configurations, we choose those that give the…