Quantum implementation of non-unitary operations with biorthogonal representations

• URL: http://arxiv.org/abs/2410.22505v2
• Date: Thu, 31 Oct 2024 09:53:17 GMT
• Title: Quantum implementation of non-unitary operations with biorthogonal representations
• Authors: Efstratios Koukoutsis, Panagiotis Papagiannis, Kyriakos Hizanidis, Abhay K. Ram, George Vahala, Oscar Amaro, Lucas I Inigo Gamiz, Dimosthenis Vallis,
• Abstract summary: We propose a new dilation method based on the biorthogonal representation of the non-unitary operator. The proposed method excels in implementing non-unitary operators whose eigenvalues have absolute values exceeding one.
• Score: 0.0
• License:
• Abstract: Motivated by the contemporary advances in quantum implementation of non-unitary operations, we propose a new dilation method based on the biorthogonal representation of the non-unitary operator, mapping it to an isomorphic unitary matrix in the orthonormal computational basis. The proposed method excels in implementing non-unitary operators whose eigenvalues have absolute values exceeding one, when compared to other dilation and decomposition techniques. Unlike the Linear Combination of Unitaries (LCU) method, which becomes less efficient as the number of unitary summands grows, the proposed technique is optimal for small-dimensional non-unitary operators regardless of the number of unitary summands. Thus, it can complement the LCU method for implementing general non-unitary operators arising in positive only open quantum systems and pseudo-Hermitian systems.

Related papers

• Sample-efficient Bayesian Optimisation Using Known Invariances [56.34916328814857]
  We show that vanilla and constrained BO algorithms are inefficient when optimising invariant objectives. We derive a bound on the maximum information gain of these invariant kernels. We use our method to design a current drive system for a nuclear fusion reactor, finding a high-performance solution.
  arXiv  Detail & Related papers  (2024-10-22T12:51:46Z)
• Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
  Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• 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)
• 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)
• Supersymmetric Quantum Mechanics of Hypergeometric-like Differential Operators [0.0]
  Systematic iterative algorithms of supersymmetric quantum mechanics (SUSYQM) type for solving the eigenequation of principal hypergeometric-like differential operator (HLDO) These algorithms provide a simple SUSYQM answer to the question regarding why there exist simultaneously a series of principal as well as associated eigenfunctions for the same HLDO. Due to their relatively high efficiency, algebraic elementariness and logical independence, the iterative SUSYQM algorithms developed in this paper could become the hopefuls for supplanting some traditional methods for solving the eigenvalue problems of principal HLDOs and their associated cousins.
  arXiv  Detail & Related papers  (2023-07-29T09:59:54Z)
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators [0.0]
  We present a dilation based algorithm to simulate non-unitary operations on unitary quantum devices. We use this algorithm to prepare random sub-normalized two-level states on a quantum device with high fidelity. We also present the accurate non-unitary dynamics of two-level open quantum systems in a dephasing channel and an amplitude damping channel computed on a quantum device.
  arXiv  Detail & Related papers  (2022-05-05T17:56:41Z)
• Reinforcement Learning from Partial Observation: Linear Function Approximation with Provable Sample Efficiency [111.83670279016599]
  We study reinforcement learning for partially observed decision processes (POMDPs) with infinite observation and state spaces. We make the first attempt at partial observability and function approximation for a class of POMDPs with a linear structure.
  arXiv  Detail & Related papers  (2022-04-20T21:15:38Z)
• Compressing Many-Body Fermion Operators Under Unitary Constraints [0.6445605125467573]
  We introduce a numerical algorithm for performing factorization that has an complexity no worse than single particle basis transformations of the two-body operators. As an application of this numerical procedure, we demonstrate that our protocol can be used to approximate generic unitary coupled cluster operators.
  arXiv  Detail & Related papers  (2021-09-10T17:42:18Z)
• Adversarially-Trained Nonnegative Matrix Factorization [77.34726150561087]
  We consider an adversarially-trained version of the nonnegative matrix factorization. In our formulation, an attacker adds an arbitrary matrix of bounded norm to the given data matrix. We design efficient algorithms inspired by adversarial training to optimize for dictionary and coefficient matrices.
  arXiv  Detail & Related papers  (2021-04-10T13:13:17Z)
• Understanding Implicit Regularization in Over-Parameterized Single Index Model [55.41685740015095]
  We design regularization-free algorithms for the high-dimensional single index model. We provide theoretical guarantees for the induced implicit regularization phenomenon.
  arXiv  Detail & Related papers  (2020-07-16T13:27:47Z)
• Invariant Feature Coding using Tensor Product Representation [75.62232699377877]
  We prove that the group-invariant feature vector contains sufficient discriminative information when learning a linear classifier. A novel feature model that explicitly consider group action is proposed for principal component analysis and k-means clustering.
  arXiv  Detail & Related papers  (2019-06-05T07:15:17Z)

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.