Dissipative Encoding of Quantum Information
- URL: http://arxiv.org/abs/2102.04531v1
- Date: Mon, 8 Feb 2021 21:07:08 GMT
- Title: Dissipative Encoding of Quantum Information
- Authors: Giacomo Baggio, Francesco Ticozzi, Peter D. Johnson, Lorenza Viola
- Abstract summary: We explore the advantages of using Markovian evolution to prepare a quantum code in the desired logical space.
We show that for stabilizer quantum codes on qubits, a finite-time dissipative encoder may always be constructed.
- Score: 0.45880283710344055
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We formalize the problem of dissipative quantum encoding, and explore the
advantages of using Markovian evolution to prepare a quantum code in the
desired logical space, with emphasis on discrete-time dynamics and the
possibility of exact finite-time convergence. In particular, we investigate
robustness of the encoding dynamics and their ability to tolerate
initialization errors, thanks to the existence of non-trivial basins of
attraction. As a key application, we show that for stabilizer quantum codes on
qubits, a finite-time dissipative encoder may always be constructed, by using
at most a number of quantum maps determined by the number of stabilizer
generators. We find that even in situations where the target code lacks gauge
degrees of freedom in its subsystem form, dissipative encoders afford
nontrivial robustness against initialization errors, thus overcoming a
limitation of purely unitary encoding procedures. Our general results are
illustrated in a number of relevant examples, including Kitaev's toric code.
Related papers
- Degenerate quantum erasure decoding [7.6119527195998025]
We show how to achieve near-capacity performance with explicit codes and efficient decoders.
We furthermore explore the potential of our decoders to handle other error models, such as mixed erasure and depolarizing errors.
arXiv Detail & Related papers (2024-11-20T18:02:05Z) - Advantage of Quantum Neural Networks as Quantum Information Decoders [1.1842028647407803]
We study the problem of decoding quantum information encoded in the groundspaces of topological stabilizer Hamiltonians.
We first prove that the standard stabilizer-based error correction and decoding schemes work adequately perturbed well in such quantum codes.
We then prove that Quantum Neural Network (QNN) decoders provide an almost quadratic improvement on the readout error.
arXiv Detail & Related papers (2024-01-11T23:56:29Z) - The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
We introduce a data efficient neural decoder that exploits the symmetries of the problem.
We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
arXiv Detail & Related papers (2023-04-14T19:46:39Z) - Modular decoding: parallelizable real-time decoding for quantum
computers [55.41644538483948]
Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware.
We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy.
We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
arXiv Detail & Related papers (2023-03-08T19:26:10Z) - 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) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Optimizing quantum codes with an application to the loss channel with
partial erasure information [1.90365714903665]
We investigate the loss channel, which plays a key role in quantum communication, and in particular in quantum key distribution over long distances.
We develop a numerical set of tools that allows to optimize an encoding specifically for recovering lost particles both deterministically and probabilistically.
This allows us to arrive at new codes ideal for the distribution of entangled states in this particular setting, and also to investigate if encoding in qudits or allowing for non-deterministic correction proves advantageous compared to known QECCs.
arXiv Detail & Related papers (2021-05-27T15:24:57Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Non-Markovian Sensing of a Quantum Reservoir [4.08251546408275]
We propose a nonunitary-encoding optical sensing scheme to measure the spectral density of a quantum reservoir.
Our result shows that it is due to the formation of a sensor-reservoir bound state.
arXiv Detail & Related papers (2020-05-18T09:42:11Z)
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.