Subsystem analysis of continuous-variable resource states
- URL: http://arxiv.org/abs/2102.10500v2
- Date: Fri, 6 Aug 2021 03:52:38 GMT
- Title: Subsystem analysis of continuous-variable resource states
- Authors: Giacomo Pantaleoni, Ben Q. Baragiola, Nicolas C. Menicucci
- Abstract summary: Continuous-variable (CV) cluster states are a universal resource for fault-tolerant quantum computation.
We generalize the recently introduced subsystem decomposition of a bosonic code to analyze CV cluster-state quantum computing.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Continuous-variable (CV) cluster states are a universal resource for
fault-tolerant quantum computation when supplemented with the
Gottesman-Kitaev-Preskill (GKP) bosonic code. We generalize the recently
introduced subsystem decomposition of a bosonic code [Phys. Rev. Lett. 125,
040501 (2020)], and we use it to analyze CV cluster-state quantum computing
with GKP states. Specifically, we decompose squeezed vacuum states and
approximate GKP states to reveal their encoded logical information, and we
decompose several gates crucial to CV cluster-state quantum computing. Then, we
use the subsystem decomposition to quantify damage to the logical information
in approximate GKP states teleported through noisy CV cluster states. Each of
these studies uses the subsystem decomposition to circumvent complications
arising from the full CV nature of the mode in order to focus on the encoded
qubit information.
Related papers
- Limitations of local update recovery in stabilizer-GKP codes: a quantum
optimal transport approach [0.5439020425818999]
Local update recovery seeks to maintain quantum information by applying local correction maps with and compensating for the action of noise.
We show that for loss rates above a threshold given explicitly as a function of the locality of the recovery maps, encoded information is lost at an exponential rate.
arXiv Detail & Related papers (2023-09-28T08:29:52Z) - Sufficient condition for universal quantum computation using bosonic
circuits [44.99833362998488]
We focus on promoting circuits that are otherwise simulatable to computational universality.
We first introduce a general framework for mapping a continuous-variable state into a qubit state.
We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
arXiv Detail & Related papers (2023-09-14T16:15:14Z) - Distribution-Flexible Subset Quantization for Post-Quantizing
Super-Resolution Networks [68.83451203841624]
This paper introduces Distribution-Flexible Subset Quantization (DFSQ), a post-training quantization method for super-resolution networks.
DFSQ conducts channel-wise normalization of the activations and applies distribution-flexible subset quantization (SQ)
It achieves comparable performance to full-precision counterparts on 6- and 8-bit quantization, and incurs only a 0.1 dB PSNR drop on 4-bit quantization.
arXiv Detail & Related papers (2023-05-10T04:19:11Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Spin squeezed GKP codes for quantum error correction in atomic ensembles [0.0]
GKP codes encode a qubit in displaced phase space of a quantum system.
We propose atomic ensemble analogues of the single-mode CV GKP code.
We find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes.
arXiv Detail & Related papers (2022-11-09T20:25:06Z) - Stabilizer subsystem decompositions for single- and multi-mode
Gottesman-Kitaev-Preskill codes [0.0]
We introduce a new subsystem decomposition for GKP codes.
A partial trace over the non-logical stabilizer subsystem is equivalent to an ideal decoding of the logical state.
We use the stabilizer subsystem decomposition to efficiently simulate noise acting on single-mode GKP codes.
arXiv Detail & Related papers (2022-10-26T18:00:00Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Tracing Information Flow from Open Quantum Systems [52.77024349608834]
We use photons in a waveguide array to implement a quantum simulation of the coupling of a qubit with a low-dimensional discrete environment.
Using the trace distance between quantum states as a measure of information, we analyze different types of information transfer.
arXiv Detail & Related papers (2021-03-22T16:38:31Z) - Hidden qubit cluster states [0.0]
Continuous-variable cluster states (CVCSs) can be supplemented with Gottesman-Kitaev-Preskill (GKP) states to form a hybrid cluster state.
We find that each of these contains a "hidden" qubit cluster state across their logical subsystems, which lies at the heart of their utility for measurement-based quantum computing.
arXiv Detail & Related papers (2021-03-22T03:13:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.