Preparing Arbitrary Continuous Functions in Quantum Registers With Logarithmic Complexity

• URL: http://arxiv.org/abs/2205.00519v1
• Date: Sun, 1 May 2022 17:29:12 GMT
• Title: Preparing Arbitrary Continuous Functions in Quantum Registers With Logarithmic Complexity
• Authors: Arthur G. Rattew, B\'alint Koczor
• Abstract summary: Key applications can only achieve their potential speedup if their inputs are prepared efficiently. We effectively solve the problem of efficiently preparing quantum states following arbitrary continuous functions with logarithmic complexity in the desired resolution. Our work has significant implications in a wide range of applications, for instance in financial forecasting, and in quantum simulation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers will be able solve important problems with significant polynomial and exponential speedups over their classical counterparts, for instance in option pricing in finance, and in real-space molecular chemistry simulations. However, key applications can only achieve their potential speedup if their inputs are prepared efficiently. We effectively solve the important problem of efficiently preparing quantum states following arbitrary continuous (as well as more general) functions with complexity logarithmic in the desired resolution, and with rigorous error bounds. This is enabled by the development of a fundamental subroutine based off of the simulation of rank-1 projectors. Combined with diverse techniques from quantum information processing, this subroutine enables us to present a broad set of tools for solving practical tasks, such as state preparation, numerical integration of Lipschitz continuous functions, and superior sampling from probability density functions. As a result, our work has significant implications in a wide range of applications, for instance in financial forecasting, and in quantum simulation.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• Quantum Computing for Solid Mechanics and Structural Engineering -- a Demonstration with Variational Quantum Eigensolver [3.8061090528695534]
  Variational quantum algorithms exploit the features of superposition and entanglement to optimize a cost function efficiently. We implement and demonstrate the numerical processes on the 5-qubit and 7-qubit quantum processors on the IBM Qiskit platform.
  arXiv  Detail & Related papers  (2023-08-28T17:52:47Z)
• Exponential Quantum Speedup for Simulation-Based Optimization Applications [4.302408747749262]
  We focus on the LinQuSO subclass of QuSO, which is characterized by the linearity of the simulation problem. We prove that a large subgroup of LinQuSO problems can be solved with up to exponential quantum speedups with regards to their simulation component.
  arXiv  Detail & Related papers  (2023-05-15T09:32:51Z)
• Scalable Quantum Computation of Highly Excited Eigenstates with Spectral Transforms [0.76146285961466]
  We use the HHL algorithm to prepare excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is enabled by the efficient computation of the expectation values of inverse Hamiltonians on quantum computers. We detail implementations of this scheme for both fault-tolerant and near-term quantum computers.
  arXiv  Detail & Related papers  (2023-02-13T19:01:02Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Resource-frugal Hamiltonian eigenstate preparation via repeated quantum phase estimation measurements [0.0]
  Preparation of Hamiltonian eigenstates is essential for many applications in quantum computing. We adopt ideas from variants of this method to implement a resource-frugal iterative scheme. We characterise an extension involving a modification of the target Hamiltonian to increase overall efficiency.
  arXiv  Detail & Related papers  (2022-12-01T20:07:36Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Adiabatic Quantum Computing for Solving the Weapon-Target Assignment Problem [0.0]
  Recent technological advancements suggest that the adiabatic quantum computing ansatz may soon see practical applications. In this work, we adopt this computation paradigm to develop a quantum computation based solver of the well-known weapon target assignment problem.
  arXiv  Detail & Related papers  (2021-05-05T12:16:03Z)
• Probing quantum information propagation with out-of-time-ordered correlators [41.12790913835594]
  Small-scale quantum information processors hold the promise to efficiently emulate many-body quantum systems. Here, we demonstrate the measurement of out-of-time-ordered correlators (OTOCs) A central requirement for our experiments is the ability to coherently reverse time evolution.
  arXiv  Detail & Related papers  (2021-02-23T15:29:08Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.