Related papers: Simplest fidelity-estimation method for graph stat…
We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by…
This work introduces an error feedback approach for reducing quantization noise of distributed graph filters. It comes from error spectrum shaping techniques from state-space digital filters, and therefore establishes connections between…
Graph states (or cluster states) are the entanglement resource that enables one-way quantum computing. They can be grown by projective measurements on the component qubits. Such measurements typically carry a significant failure…
Variational algorithms may enable classically intractable simulations on near-future quantum computers. However, their potential is limited by hardware errors. It is therefore crucial to develop efficient ways to mitigate these errors.…
Based on numerically-optimized real-device gates and parameters we study the performance of the phase-flip (repetition) code on a linear array of Gallium Arsenide (GaAs) quantum dots hosting singlet-triplet qubits. We first examine the…
Decoherence of quantum states is a major hurdle towards scalable and reliable quantum computing. Lower decoherence (i.e., higher fidelity) can alleviate the error correction overhead and obviate the need for energy-intensive noise reduction…
This paper investigates the behavior of two fundamental types of multipartite entangled states, namely GHZ(3) and W(3) states under Gaussian-distributed amplitude perturbations and White noise model. The Uhlmann-Jozsa fidelity is taken to…
The four quantum noises Bit Flip, Phase Flip, Depolarization, and Amplitude Damping as well as any potential combinations of them are examined in this papers investigation of quantum teleportation using qutrit states. Among the above…
We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory,…
A significant problem for current quantum computers is noise. While there are many distinct noise channels, the depolarizing noise model often appropriately describes average noise for large circuits involving many qubits and gates. We…
Dephasing is a main noise mechanism that afflicts quantum information, it reduces visibility, and destroys coherence and entanglement. Therefore, it must be reduced, mitigated, and if possible corrected, to allow for demonstration of…
We address the experimental determination of entropic quantum discord for systems made of a pair of polarization qubits. We compare results from full and partial tomography and found that the two determinations are statistically compatible,…
We consider realistic measurement systems, where measurements are accompanied by decoherence processes. The aim of this work is the construction of methods and algorithms for precise quantum measurements with fidelity close to the…
This paper introduces an innovative error feedback framework designed to mitigate quantization noise in distributed graph filtering, where communications are constrained to quantized messages. It comes from error spectrum shaping techniques…
Graph data are ubiquitous in natural sciences and machine learning. In this paper, we consider the problem of quantizing graph structured, bandlimited data to few bits per entry while preserving its information under low-pass filtering. We…
We present a two-state practical quantum bit commitment protocol, the security of which is based on the current technological limitations, namely the nonexistence of either stable long-term quantum memories or nondemolition measurements.…
The problem of estimating an unknown phase $ \varphi $ using two-level probes in the presence of unital phase-covariant noise and using finite resources is investigated. We introduce a simple model in which the phase-imprinting operation on…
We study the quantization of real-valued bandlimited signals on graphs, focusing on low-bit representations. We propose iterative noise-shaping algorithms for quantization, including sampling approaches with and without vertex replacement.…
The storage and processing of quantum information are susceptible to external noise, resulting in computational errors that are inherently continuous A powerful method to suppress these effects is to use quantum error correction. Typically,…
We develop a family of perfect quantum error correcting codes that correct for phase errors that arise on any qubit, at any time, during a perfect state transfer experiment. These ensure that we find the optimal operating regime for…