Combinatorial Amplitude Patterns via Nested Quantum Affine Transformations

• URL: http://arxiv.org/abs/2412.09714v1
• Date: Thu, 12 Dec 2024 20:35:56 GMT
• Title: Combinatorial Amplitude Patterns via Nested Quantum Affine Transformations
• Authors: Anish Giri, David Hyde, Kalman Varga,
• Abstract summary: This paper introduces a robust and scalable framework for implementing nested affine transformations in quantum circuits. The proposed method systematically applies sequential affine transformations while preserving state normalization. The utility of the framework is exemplified through two key applications: financial risk assessment, and discrete signal processing.
• Score: 0.24578723416255746
• License:
• Abstract: This paper introduces a robust and scalable framework for implementing nested affine transformations in quantum circuits. Utilizing Hadamard-supported conditional initialization and block encoding, the proposed method systematically applies sequential affine transformations while preserving state normalization. This approach provides an effective method for generating combinatorial amplitude patterns within quantum states with demonstrated applications in combinatorics and signal processing. The utility of the framework is exemplified through two key applications: financial risk assessment, where it efficiently computes portfolio returns using combinatorial sum of amplitudes, and discrete signal processing, where it enables precise manipulation of Fourier coefficients for enhanced signal reconstruction.

Related papers

• High order schemes for solving partial differential equations on a quantum computer [0.0]
  We show that higher-order methods can reduce the number of qubits necessary for discretization, similar to the classical case. This result has important consequences for the practical application of quantum algorithms based on Hamiltonian evolution.
  arXiv  Detail & Related papers  (2024-12-26T14:21:59Z)
• Unified framework for efficiently computable quantum circuits [0.0]
  Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure that allows these circuits can be efficiently simulatable.
  arXiv  Detail & Related papers  (2024-01-16T08:04:28Z)
• Gradient Coding with Iterative Block Leverage Score Sampling [42.21200677508463]
  We generalize the leverage score sampling sketch for $ell$-subspace embeddings, to accommodate sampling subsets of the transformed data. This is then used to derive an approximate coded computing approach for first-order methods.
  arXiv  Detail & Related papers  (2023-08-06T12:22:12Z)
• Hybrid discrete-continuous compilation of trapped-ion quantum circuits with deep reinforcement learning [1.7087507417780985]
  We show that we can significantly reduce the size of relevant quantum circuits for trapped-ion computing. Our framework can also be applied to an experimental setup whose goal is to reproduce an unknown unitary process.
  arXiv  Detail & Related papers  (2023-07-12T14:55:28Z)
• 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)
• Quantum state preparation without coherent arithmetic [5.478764356647437]
  We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function.magnitude existing approaches. We use a template quantum eigenvalue transformation circuit to convert a low cost block encoding of the sine function into the desired function.
  arXiv  Detail & Related papers  (2022-10-26T17:48:31Z)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• Learned transform compression with optimized entropy encoding [72.20409648915398]
  We consider the problem of learned transform compression where we learn both, the transform and the probability distribution over the discrete codes. We employ a soft relaxation of the quantization operation to allow for back-propagation of gradients and employ vector (rather than scalar) quantization of the latent codes.
  arXiv  Detail & Related papers  (2021-04-07T17:58:01Z)
• Optimization of Graph Total Variation via Active-Set-based Combinatorial Reconditioning [48.42916680063503]
  We propose a novel adaptive preconditioning strategy for proximal algorithms on this problem class. We show that nested-forest decomposition of the inactive edges yields a guaranteed local linear convergence rate. Our results suggest that local convergence analysis can serve as a guideline for selecting variable metrics in proximal algorithms.
  arXiv  Detail & Related papers  (2020-02-27T16:33:09Z)

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.