Remarks on controlled measurement and quantum algorithm for calculating Hermitian conjugate

• URL: http://arxiv.org/abs/2501.16028v1
• Date: Mon, 27 Jan 2025 13:11:47 GMT
• Title: Remarks on controlled measurement and quantum algorithm for calculating Hermitian conjugate
• Authors: Edward B. Fel'dman, Alexander I. Zenchuk, Wentao Qi, Junde Wu,
• Abstract summary: We present two new aspects for the recently proposed algorithms for matrix manipulating. First aspect is the controlled measurement which allows to avoid the problem of small access probability to the required ancilla state. Second aspect is the algorithm for calculating the Hermitian conjugate of an arbitrary matrix.
• Score: 46.13392585104221
• License:
• Abstract: We present two new aspects for the recently proposed algorithms for matrix manipulating based on the special encoding the matrix elements into the superposition state of a quantum system. First aspect is the controlled measurement which allows to avoid the problem of small access probability to the required ancilla state at the final step of algorithms needed to remove the garbage of the states. Application of controlled measurement to the earlier developed algorithm is demonstrated. The second aspect is the algorithm for calculating the Hermitian conjugate of an arbitrary matrix, which supplements the algorithms proposed earlier. The appropriate circuits are presented.

Related papers

• The Algorithm for Solving Quantum Linear Systems of Equations With Coherent Superposition and Its Extended Applications [8.8400072344375]
  We propose two quantum algorithms for solving quantum linear systems of equations with coherent superposition. The two quantum algorithms can both compute the rank and general solution by one measurement. Our analysis indicates that the proposed algorithms are mainly suitable for conducting attacks against lightweight symmetric ciphers.
  arXiv  Detail & Related papers  (2024-05-11T03:03:14Z)
• Spectral Entry-wise Matrix Estimation for Low-Rank Reinforcement Learning [53.445068584013896]
  We study matrix estimation problems arising in reinforcement learning (RL) with low-rank structure. In low-rank bandits, the matrix to be recovered specifies the expected arm rewards, and for low-rank Markov Decision Processes (MDPs), it may for example characterize the transition kernel of the MDP. We show that simple spectral-based matrix estimation approaches efficiently recover the singular subspaces of the matrix and exhibit nearly-minimal entry-wise error.
  arXiv  Detail & Related papers  (2023-10-10T17:06:41Z)
• Learning the Positions in CountSketch [49.57951567374372]
  We consider sketching algorithms which first compress data by multiplication with a random sketch matrix, and then apply the sketch to quickly solve an optimization problem. In this work, we propose the first learning-based algorithms that also optimize the locations of the non-zero entries.
  arXiv  Detail & Related papers  (2023-06-11T07:28:35Z)
• Feasibility Analysis of Grover-meets-Simon Algorithm [4.826899218632946]
  Recombining classical quantum algorithms is one of the current ideas to construct quantum algorithms. This paper reanalyzes the existing combined algorithm Grover-meets-Simon algorithm in terms of the principle of deferred measurement. According to the maximum probability of success and query times, we get that the Grover-meets-Simon algorithm is not an effective attack algorithm.
  arXiv  Detail & Related papers  (2023-01-17T05:13:36Z)
• Classical and Quantum Iterative Optimization Algorithms Based on Matrix Legendre-Bregman Projections [1.5736899098702972]
  We consider Legendre-Bregman projections defined on the Hermitian matrix space and design iterative optimization algorithms based on them. We study both exact and approximate Bregman projection algorithms. In particular, our approximate iterative algorithm gives rise to the non-commutative versions of the generalized iterative scaling (GIS) algorithm for maximum entropy inference.
  arXiv  Detail & Related papers  (2022-09-28T15:59:08Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Black-Box Quantum State Preparation with Inverse Coefficients [17.63187488168065]
  Black-box quantum state preparation is a fundamental building block for many higher-level quantum algorithms. We present a new algorithm for performing black-box state preparation with inverse coefficients based on the technique of inequality test.
  arXiv  Detail & Related papers  (2021-12-11T09:22:25Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Algorithmic Primitives for Quantum-Assisted Quantum Control [1.52292571922932]
  We discuss two primitive algorithms to evaluate overlaps and transition matrix time series. They are used to construct a variety of quantum-assisted quantum control algorithms implementable on NISQ devices.
  arXiv  Detail & Related papers  (2020-11-27T15:20:29Z)
• Accelerated Message Passing for Entropy-Regularized MAP Inference [89.15658822319928]
  Maximum a posteriori (MAP) inference in discrete-valued random fields is a fundamental problem in machine learning. Due to the difficulty of this problem, linear programming (LP) relaxations are commonly used to derive specialized message passing algorithms. We present randomized methods for accelerating these algorithms by leveraging techniques that underlie classical accelerated gradient.
  arXiv  Detail & Related papers  (2020-07-01T18:43:32Z)

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.