Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method

• URL: http://arxiv.org/abs/2001.00807v1
• Date: Fri, 3 Jan 2020 12:53:04 GMT
• Title: Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method
• Authors: Shengbin Wang, Zhimin Wang, Wendong Li, Lixin Fan, Guolong Cui, Zhiqiang Wei, Yongjian Gu
• Abstract summary: We present the quantum circuits for solving the logarithmic, exponential, trigonometric and inverse trigonometric functions. The qFBE method provides a unified and programmed solution for the evaluation of transcendental functions.
• Score: 23.69613801851615
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum arithmetic in the computational basis constitutes the fundamental component of many circuit-based quantum algorithms. There exist a lot of studies about reversible implementations of algebraic functions, while research on the higher-level transcendental functions is scant. We propose to evaluate the transcendental functions based on a novel methodology, which is called qFBE (quantum Function-value Binary Expansion) method. This method transforms the evaluation of transcendental functions to the computation of algebraic functions in a simple recursive way. We present the quantum circuits for solving the logarithmic, exponential, trigonometric and inverse trigonometric functions based on the qFBE method. The efficiency of the circuits is demonstrated on a quantum virtual computing system installed on the Sunway TaihuLight supercomputer. The qFBE method provides a unified and programmed solution for the evaluation of transcendental functions, and it will be an important building block for many quantum algorithms.

Related papers

• Quantum Algorithm For Testing Convexity of Function [0.0]
  An important property of a real-valued function is its convexity, which plays a very crucial role in many areas, such as thermodynamics and geometry. Motivated by recent advances in quantum computation as well as the quest for quantum advantage, we give a quantum algorithm for testing convexity of functions. We show that quantum computers can reveal the convexity property superpolynomially faster than classical computers with respect to number of variables.
  arXiv  Detail & Related papers  (2024-09-05T07:38:38Z)
• 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)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Quantum Circuit Optimization with AlphaTensor [47.9303833600197]
  We develop AlphaTensor-Quantum, a method to minimize the number of T gates that are needed to implement a given circuit. Unlike existing methods for T-count optimization, AlphaTensor-Quantum can incorporate domain-specific knowledge about quantum computation and leverage gadgets. Remarkably, it discovers an efficient algorithm akin to Karatsuba's method for multiplication in finite fields.
  arXiv  Detail & Related papers  (2024-02-22T09:20:54Z)
• 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)
• Variational Quantum Continuous Optimization: a Cornerstone of Quantum Mathematical Analysis [0.0]
  We show how universal quantum computers can handle mathematical analysis calculations for functions with continuous domains. The basic building block of our approach is a variational quantum circuit where each qubit encodes up to three continuous variables. By combining this encoding with quantum state tomography, a variational quantum circuit of $n$ qubits can optimize functions of up to $3n$ continuous variables.
  arXiv  Detail & Related papers  (2022-10-06T18:00:04Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• Fourier-based quantum signal processing [0.0]
  Implementing general functions of operators is a powerful tool in quantum computation. Quantum signal processing is the state of the art for this aim. We present an algorithm for Hermitian-operator function design from an oracle given by the unitary evolution.
  arXiv  Detail & Related papers  (2022-06-06T18:02:30Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Qudits and high-dimensional quantum computing [4.2066457491320115]
  Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods.
  arXiv  Detail & Related papers  (2020-07-30T22:17:43Z)

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.