Related papers: Repeat-Until-Success Generation of Symmetric State…
We propose a physical model for generating multipartite entangled states of spin-$s$ particles that have important applications in distributed quantum information processing. Our protocol is based on a process where mobile spins induce the…
For reliable and consistent quantum information processing carried out on a quantum network, the network structure must be fully known and a desired initial state must be accurately prepared on it. In this paper, for a class of spin…
Reasonable requirements of (a) physical invariance under particle permutation and (b) physical completeness of state descriptions, enable us to deduce a Symmetric Permutation Rule(SPR): that by taking care with our state descriptions, it is…
A scheme for generating the cluster states via atomic ensembles is proposed. The scheme has inherent fault tolerance function and is robust to realistic noise and imperfections. All the facilities used in our scheme are well within the…
We study the design of one-to-one matching mechanisms that are strategy-proof for both sides and as stable as possible. Motivated by the impossibility result of Roth (1982), we formulate the mechanism design problem as a linear program that…
Standard one-way quantum computers (1WQC) combine time symmetric unitary evolution, with asymmetric treatment of boundaries: state preparation allows to enforce a chosen initial state, however, for the final state measurement chooses a…
This paper presents a new robust data-driven predictive control scheme for unknown linear time-invariant systems by using input-state-output or input-output data based on whether the state is measurable. To remove the need for the…
Evidently, physical experiments are practically reproducible even though the fully identical preparation of initial state wave functions is often far beyond experimental possibilities. It is thus natural to explore if and in which sense…
We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure in the study of implementations of quantum…
Quantum resetting protocols allow a quantum system to be sent to a state in the past by making it interact with quantum probes when neither the free evolution of the system nor the interaction is controlled. We experimentally verify the…
We show how group symmetries can be used to reconstruct quantum states. In our scheme for SU(1,1) states, the input field passes through a non-degenerate parametric amplifier and one measures the probability of finding the output state with…
Symmetric ensembles of neutral atoms interacting via the Rydberg blockade are well-described by the Jaynes-Cummings Hamiltonian. We use this framework to study the problem of generating arbitrary superpositions of Dicke states of hyperfine…
The reliable generation of multi-qubit entanglement is a prerequisite for large-scale quantum information technologies. In particular, W states are a valuable resource owing to their resilience under local loss or measurement. Nevertheless,…
A standard approach to generate random pure quantum states relies on sampling from the Haar measure. However, the entanglement properties of such states present a fundamental challenge for their general applicability. Here, we introduce the…
We investigate the optimal quantum state reconstruction from cloud to many spatially separated users by measure-broadcast-prepare scheme without the availability of quantum channel. The quantum state equally distributed from cloud to…
This paper presents an algorithm to apply nonlinear control design approaches in the case of stochastic systems with partial state observation. Deterministic nonlinear control approaches are formulated under the assumption of full state…
This paper proposes an iterative distributionally robust model predictive control (MPC) scheme to solve a risk-constrained infinite-horizon optimal control problem. In each iteration, the algorithm generates a trajectory from the starting…
State resetting is a fundamental but often overlooked capability of simulators. It supports sample-based planning by allowing resets to previously encountered simulation states, and enables calibration of simulators using real data by…
With the assistance of weak cross-Kerr nonlinearities, we introduce an optical scheme to fuse two small-size polarization entangled W states into a large-scale W state without qubit loss, i.e.,$\mathrm{W}_{n+m}$ state can be generated from…
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated…