2020/10/31 by Timjan Kalajdzievski, Nicolás Quesada
Computer Science · Engineering · Physics and Astronomy · #Boolean function #Cover (algebra) #Decomposition #Decomposition method (queueing theory) #Exact solutions in general relativity #Logic gate #Low-power high-performance VLSI design #Numerical Methods and Algorithms #Quantum Computing Algorithms and Architecture #Quantum computer #quant-ph
paper · pdf · doi:10.22331/q-2021-02-08-394
published as Quantum 5, 394 (2021)
arxiv created 2021/02/05 · openalex publication_date 2021/02/08 · arxiv updated 2021/02/10 · openalex created_date 2021/02/15 · openalex updated_date 2026/08/05
We gather and examine in detail gate decomposition techniques for continuous-variable quantum computers and also introduce some new techniques which expand on these methods. Both exact and approximate decomposition methods are studied and gate counts are compared for some common operations. While each having distinct advantages, we find that exact decompositions have lower gate counts whereas approximate techniques can cover decompositions for all continuous-variable operations but require significant circuit depth for a modest precision.