Approximate Quantum Circuit Synthesis using Block-Encodings

• URL: http://arxiv.org/abs/2007.01417v2
• Date: Fri, 23 Oct 2020 20:52:44 GMT
• Title: Approximate Quantum Circuit Synthesis using Block-Encodings
• Authors: Daan Camps, Roel Van Beeumen
• Abstract summary: One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block-encodings.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block-encodings. This approach combines smaller block-encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block-encodings, our technique is not limited to unitary operators and can also be applied for the synthesis of arbitrary operators. We show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

Related papers

• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• 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)
• An Efficient Quantum Circuit for Block Encoding a Pairing Hamiltonian [3.2073712626523765]
  We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and representing the Hamiltonian as a linear combination of unitaries. The techniques presented can be extended to encode more general second-quantized Hamiltonians.
  arXiv  Detail & Related papers  (2024-02-17T06:04:00Z)
• Modular quantum signal processing in many variables [0.0]
  We show that modular multi-input-based QSP-based superoperators can be snapped together with LEGO-like ease at the level of the functions they apply. We also provide a Python package for assembling gadgets and compiling them to circuits.
  arXiv  Detail & Related papers  (2023-09-28T17:58:51Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• FABLE: Fast Approximate Quantum Circuits for Block-Encodings [0.0]
  We propose FABLE, a method to generate approximate quantum circuits for block-encodings of matrices in a fast manner. FABLE circuits have a simple structure and are directly formulated in terms of one- and two-qubit gates. We show that FABLE circuits can be compressed and sparsified.
  arXiv  Detail & Related papers  (2022-04-29T21:06:07Z)
• Efficient quantum gate decomposition via adaptive circuit compression [0.0]
  The utilization of parametric two-qubit gates in the circuit design allows us to transform the discrete problem of circuit synthesis into an optimization problem over continuous variables. We implemented the algorithm in the SQUANDER software package and benchmarked it against several state-of-the-art quantum gate synthesis tools.
  arXiv  Detail & Related papers  (2022-03-08T22:29:31Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Interactive Proofs for Synthesizing Quantum States and Unitaries [0.15229257192293197]
  We study the complexity of inherently quantum operations such as constructing quantum states or performing unitary transformations. We define models of interactive proofs for quantum states and unitaries. We obtain analogous results in the setting with multiple entangled provers as well.
  arXiv  Detail & Related papers  (2021-08-16T15:59:33Z)

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.