Error of an arbitrary single-mode Gaussian transformation on a weighted cluster state using a cubic phase gate

• URL: http://arxiv.org/abs/2207.09548v2
• Date: Mon, 10 Oct 2022 10:10:02 GMT
• Title: Error of an arbitrary single-mode Gaussian transformation on a weighted cluster state using a cubic phase gate
• Authors: E. R. Zinatullin, S. B. Korolev, A. D. Manukhova and T. Yu. Golubeva
• Abstract summary: We show that it is possible to minimize the error of the arbitrary single-mode Gaussian transformation by a proper choice of the weight coefficients of the cluster state. We modify the scheme by adding a non-Gaussian state obtained using a cubic phase gate as one of the nodes of the cluster.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we propose two strategies for decreasing the error of arbitrary single-mode Gaussian transformations implemented using one-way quantum computation on a four-node linear cluster state. We show that it is possible to minimize the error of the arbitrary single-mode Gaussian transformation by a proper choice of the weight coefficients of the cluster state. We modify the computation scheme by adding a non-Gaussian state obtained using a cubic phase gate as one of the nodes of the cluster. This further decreases the computation error. We evaluate the efficiencies of the proposed optimization schemes comparing the probabilities of the error correction of the quantum computations with and without optimizations. We have shown that for some transformations, the error probability can be reduced by up to 900 times.

Related papers

• Quantum simulation of dissipation for Maxwell equations in dispersive media [0.0]
  dissipation appears in the Schr"odinger representation of classical Maxwell equations as a sparse diagonal operator occupying an $r$-dimensional subspace. The unitary operators can be implemented through qubit lattice algorithm (QLA) on $n$ qubits. The non-unitary-dissipative part poses a challenge on how it should be implemented on a quantum computer.
  arXiv  Detail & Related papers  (2023-07-31T18:22:40Z)
• Noisy Tensor Ring approximation for computing gradients of Variational Quantum Eigensolver for Combinatorial Optimization [33.12181620473604]
  Variational Quantum algorithms have established their potential to provide computational advantage in the realm of optimization. These algorithms suffer from classically intractable gradients limiting the scalability. This work proposes a classical gradient method which utilizes the parameter shift rule but computes the expected values from the circuits using a tensor ring approximation.
  arXiv  Detail & Related papers  (2023-07-08T03:14:28Z)
• Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods [75.34939761152587]
  Efficient computation of the optimal transport distance between two distributions serves as an algorithm that empowers various applications. This paper develops a scalable first-order optimization-based method that computes optimal transport to within $varepsilon$ additive accuracy.
  arXiv  Detail & Related papers  (2023-01-30T15:46:39Z)
• Alternatives to a nonhomogeneous partial differential equation quantum algorithm [52.77024349608834]
  We propose a quantum algorithm for solving nonhomogeneous linear partial differential equations of the form $Apsi(textbfr)=f(textbfr)$. These achievements enable easier experimental implementation of the quantum algorithm based on nowadays technology.
  arXiv  Detail & Related papers  (2022-05-11T14:29:39Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• Error correction of the continuous-variable quantum hybrid computation on two-node cluster states: limit of squeezing [0.0]
  In this paper, we investigate the error correction of universal Gaussian transformations obtained in continuous-variable quantum computations. We have considered a hybrid scheme to implement the universal Gaussian transformations.
  arXiv  Detail & Related papers  (2022-01-19T12:14:32Z)
• Beyond Neighbourhood-Preserving Transformations for Quantization-Based Unsupervised Hashing [0.0]
  An effective unsupervised hashing algorithm leads to compact binary codes preserving the neighborhood structure of data as much as possible. Although employing rigid transformations is effective, we may not reduce quantization loss to the ultimate limits. Motivated by these shortcomings, we propose to employ both rigid and non-rigid transformations to reduce quantization error and dimensionality simultaneously.
  arXiv  Detail & Related papers  (2021-10-01T05:13:01Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Local optimization on pure Gaussian state manifolds [63.76263875368856]
  We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm. The method is based on notions of descent gradient attuned to the local geometry. We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
  arXiv  Detail & Related papers  (2020-09-24T18:00:36Z)
• Finding the optimal cluster state configuration. Minimization of one-way quantum computation errors [0.0]
  From all possible cluster state configurations, we choose those that give the smallest error. We find the optimal strategy for the implementation of universal Gaussian computations with minimal errors.
  arXiv  Detail & Related papers  (2020-03-20T10:58:14Z)
• Gaussianization Flows [113.79542218282282]
  We propose a new type of normalizing flow model that enables both efficient iteration of likelihoods and efficient inversion for sample generation. Because of this guaranteed expressivity, they can capture multimodal target distributions without compromising the efficiency of sample generation.
  arXiv  Detail & Related papers  (2020-03-04T08:15:06Z)

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.