Universal construction of decoders from encoding black boxes

• URL: http://arxiv.org/abs/2110.00258v3
• Date: Wed, 16 Feb 2022 10:09:08 GMT
• Title: Universal construction of decoders from encoding black boxes
• Authors: Satoshi Yoshida, Akihito Soeda, Mio Murao
• Abstract summary: We propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. For a qubit ($d=2$) encoded in $n$ qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method.
• Score: 4.511923587827301
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. Given an encoding operation as a black box from a $d$-dimensional system to a $D$-dimensional system, we propose a universal protocol for isometry inversion that constructs a decoder from multiple calls of the encoding operation. This is a probabilistic but exact protocol whose success probability is independent of $D$. For a qubit ($d=2$) encoded in $n$ qubits, our protocol achieves an exponential improvement over any tomography-based or unitary-embedding method, which cannot avoid $D$-dependence. We present a quantum operation that converts multiple parallel calls of any given isometry operation to random parallelized unitary operations, each of dimension $d$. Applied to our setup, it universally compresses the encoded quantum information to a $D$-independent space, while keeping the initial quantum information intact. This compressing operation is combined with a unitary inversion protocol to complete the isometry inversion. We also discover a fundamental difference between our isometry inversion protocol and the known unitary inversion protocols by analyzing isometry complex conjugation and isometry transposition. General protocols including indefinite causal order are searched using semidefinite programming for any improvement in the success probability over the parallel protocols. In addition, we find a sequential "success-or-draw" protocol of universal isometry inversion for $d = 2$ and $D = 3$, thus whose success probability exponentially improves over parallel protocols in the number of calls of the input isometry operation for the said case.

Related papers

• A distributed and parallel $(k, n)$ QSS scheme with verification capability [0.0]
  This article introduces a novel Quantum Secret Sharing scheme with $( k, n )$ threshold and endowed with verification capability. The primary novelty of the new protocol lies in its ability to operate completely parallelly in a fully distributed setup.
  arXiv  Detail & Related papers  (2024-10-24T11:12:38Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• Universal adjointation of isometry operations using transformation of quantum supermaps [0.9208007322096532]
  We introduce isometry adjointation protocols that convert an input isometry operation into its adjoint operation. We show that the optimal performance of general protocols in isometry adjointation and universal error detection is not dependent on the output dimension.
  arXiv  Detail & Related papers  (2024-01-18T17:05:51Z)
• Efficient State Preparation for Metrology and Quantum Error Correction with Global Control [0.0]
  We introduce a simple, experimentally realizable protocol that can prepare any specific superposition of permutationally invariant qubit states, also known as Dicke states. We demonstrate the utility of our protocol by numerically preparing several states with theoretical infidelities $1-mathcalF10-4$. We estimate that the protocol achieves fidelities $gtrsim 95%$ in the presence of typical experimental noise levels.
  arXiv  Detail & Related papers  (2023-12-08T14:28:34Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly [0.9208007322096532]
  We consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model. In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation. We show a method to reduce the large search space representing all possible protocols.
  arXiv  Detail & Related papers  (2022-09-07T03:33:09Z)
• Universal Parity Quantum Computing [0.0]
  We show that logical controlled phase gate and $R_z$ rotations can be implemented in parity encoding with single-qubit operations. We present a method to switch between different encoding variants via partial on-the-fly encoding and decoding.
  arXiv  Detail & Related papers  (2022-05-19T12:21:23Z)
• 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)
• 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)
• Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
  We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs" We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM) As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
  arXiv  Detail & Related papers  (2020-09-29T08:41:53Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.