Related papers: Learning stabilizer states by Bell sampling
A solid state device to discriminate all the four Bell states is proposed. The device is composed of controlled absorption crystals, rotators, and retarders. The controlled absorption, where the state of one photon affects the absorption of…
Cluster states and graph states in general offer a useful model of the stabilizer formalism and a path toward the development of measurement-based quantum computation. Their defining structure - the stabilizer group - encodes all possible…
In the standard homodyne configuration, an unknown optical state is combined with a local oscillator (LO) on a beam splitter (BS). Good quadrature measurements require a high-amplitude LO and two high-efficiency photodiodes whose signals…
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…
In this work, we explore a new approach to designing both algorithms and error detection codes for preparing approximate ground states of molecules. We propose a classical algorithm to find the optimal stabilizer state by using excitations…
We show how to explicitly construct an $O(nd)$ size and constant quantum depth circuit which encodes any given $n$-qubit stabilizer code with $d$ generators. Our construction is derived using the graphic description for stabilizer codes and…
The goal of self-testing is to characterize an a priori unknown quantum system based solely on measurement statistics, i.e. using an uncharacterized measurement device. Here we develop self-testing methods for quantum prepare-and-measure…
Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli…
Efficiently characterizing large quantum states and processes is a central yet notoriously challenging task in quantum information science, as conventional tomography methods typically require resources that grow exponentially with system…
Experimental determination of an unknown quantum state usually requires several incompatible measurements. However, it is also possible to determine the full quantum state from a single, repeated measurement. For this purpose, the quantum…
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends…
In the present work, a simple algorithm for stabilizing an unknown linear time-invariant system is proposed, assuming only that this system is stabilizable. The suggested algorithm is based on first performing a partial identification of…
The Bell's basis is composed of four maximally entangled states of two qubits, named Bell states. They are usual tools in many theoretical studies and experiments. The aim of this paper is to find out the symmetries that determine a Bell…
We consider the task of deciding whether an unknown qubit state falls in a prescribed neighborhood of a reference state. We assume that several copies of the unknown state are given and apply a unitary operation pairwise on them combined…
Measuring an entangled state of two particles is crucial to many quantum communication protocols. Yet Bell state distinguishability using a finite apparatus obeying linear evolution and local measurement is theoretically limited. We extend…
Measurements with randomly chosen settings determine many important properties of quantum states without the need for a shared reference frame or calibration. They naturally emerge in the context of quantum communication and quantum…
We introduce a quantum strategy from nonlocal games to improve the stabilizer approximation we proposed previously. The resulting approach turns out to be a qubit-by-qubit gauging procedure for standard stabilizers, which could involve…
We analyze the information that one can learn about the state of a quantum two-level system, i.e. a qubit, when probed weakly by a nearby detector. In particular, we focus on the case when the qubit Hamiltonian and the qubit's operator…
Non-stabilizerness, or magic, is a resource for universal quantum computation in most fault-tolerant architectures; access to states with non-stabilizerness allows for non-classically simulable quantum computation to be performed.…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…