Related papers: Efficient post-selection in light-cone correlation…
The measurement of dynamic correlation functions of quantum systems is complicated by measurement backaction. To facilitate such measurements we introduce a protocol, based on weak ancilla--system couplings, that is applicable to arbitrary…
The coordinate-exchange algorithm is commonly used to construct optimal experimental designs. Every execution of the coordinate-exchange algorithm produces a new, seemingly random, order of the selected design points. In this short…
Period finding and phase estimation are fundamental in quantum computing. Prior work has established lower bounds on their success probabilities. Such quantum algorithms measure a state $|\hat\ell\rangle$ in an $n$-qubit computational…
We present a hybrid model of the unitary-evolution-based quantum computation model and the measurement-based quantum computation model. In the hybrid model part of a quantum circuit is simulated by unitary evolution and the rest by…
The fundamental gates of linear optics quantum computation are realized by using single photons sources, linear optics and photon counters. Success of these gates is conditioned on the pattern of photons detected without using feedback.…
Changepoint detection methods are used in many areas of science and engineering, e.g., in the analysis of copy number variation data, to detect abnormalities in copy numbers along the genome. Despite the broad array of available tools,…
We report an alternative scheme for implementing generalized quantum measurements that does not require the usage of auxiliary system. Our method utilizes solely: (a) classical randomness and post-processing, (b) projective measurements on…
Quantum correlations are contextual yet, in general, nothing prevents the existence of even more contextual correlations. We identify and test a noncontextuality inequality in which the quantum violation cannot be improved by any…
Variational quantum circuits build the foundation for various classes of quantum algorithms. In a nutshell, the weights of a parametrized quantum circuit are varied until the empirical sampling distribution of the circuit is sufficiently…
Quantum paradoxes show that the outcomes of different quantum measurements cannot be described by a single measurement-independent reality. Any theoretical description of a quantum measurement implies the selection of a specific measurement…
The current generation of quantum computing technologies call for quantum algorithms that require a limited number of qubits and quantum gates, and which are robust against errors. A suitable design approach are variational circuits where…
We address how one can empirically infer properties of quantum states generated by dynamics involving measurements. Our focus is on many-body settings where the number of measurements is extensive, making brute-force approaches based on…
Weak measurement is a novel quantum measurement scheme, which is usually characterized by the weak value formalism. To guarantee the validity of the weak value formalism, the fidelity between the pre-selection and the post-selection should…
We present analytic solutions to the evolution in generalized tight-binding models, which consider complex first-neighbor couplings with equal amplitude and arbitrary phases. Our findings provide a powerful tool for efficiently calculating…
Semiconductor quantum dot molecules are considered as promising candidates for quantum technological applications due to their wide tunability of optical properties and coverage of different energy scales associated with charge and spin…
We describe the conditional and unconditional dynamics of two coupled quantum dots when one dot is subjected to a measurement of its occupation number using a single electron transistor (SET). The measurement is made when the bare tunneling…
We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular quantum circuit one wishes to process. Once a linked-state has…
Few-shot algorithms aim at learning new tasks provided only a handful of training examples. In this work we investigate few-shot learning in the setting where the data points are sequences of tokens and propose an efficient learning…
The simplicity of a question such as wondering if correlations characterize or not a certain system collides with the experimental difficulty of accessing such information. Here we present a low demanding experimental approach which refers…
We quantify the disturbance of a quantum state undergoing a sequence of observations, and particularly focus on a weak measurement followed by post-selection and compare these results to the projective counterpart. Taking into account the…