Representation of the Fermionic Boundary Operator

Abstract

The boundary operator is a linear operator that acts on a collection of high-dimensional binary points (simplices) and maps them to their boundaries. This boundary map is one of the key components in numerous applications, including differential equations, machine learning, computational geometry, machine vision and control systems. We consider the problem of representing the full boundary operator on a quantum computer. We first prove that the boundary operator has a special structure in the form of a complete sum of fermionic creation and annihilation operators. We then use the fact that these operators pairwise anticommute to produce an $O(n)$-depth circuit that exactly implements the boundary operator without any Trotterization or Taylor series approximation errors. Having fewer errors reduces the number of shots required to obtain desired accuracies.

arXiv comment16 pages

References in corpus (13)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• Supervised learning with quantum enhanced feature spaces
• Quantum machine learning in feature Hilbert spaces
• An introduction to quantum machine learning
• Fermionic quantum computation
• Toward the first quantum simulation with quantum speedup
• A rigorous and robust quantum speed-up in supervised machine learning
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• High-order quantum algorithm for solving linear differential equations
• Quantum algorithms and the finite element method
• Measurement reduction in variational quantum algorithms
• Implementation of Measurement Reduction for the Variational Quantum Eigensolver

Cited by in corpus (4)

• Topological data analysis and machine learning
• Clique Homology is QMA1-hard
• Topological Signal Processing on Quantum Computers for Higher-Order Network Analysis
• Quantum HodgeRank: Topology-Based Rank Aggregation on Quantum Computers