scientific article
From MaRDI portal
Publication:3385623
zbMath1483.81038arXiv1805.06908MaRDI QIDQ3385623
Publication date: 20 December 2021
Full work available at URL: https://arxiv.org/abs/1805.06908
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quantum computation (81P68) Feynman integrals and graphs; applications of algebraic topology and algebraic geometry (81Q30) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10) Classical hypergeometric functions, ({}_2F_1) (33C05) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)
Related Items (6)
\textsf{symQV}: automated symbolic verification of quantum programs ⋮ Complete Equational Theories for the Sum-Over-Paths with Unbalanced Amplitudes ⋮ Unnamed Item ⋮ The structure of sum-over-paths, its consequences, and completeness for Clifford ⋮ An automated deductive verification framework for circuit-building quantum programs ⋮ Classical simulation of quantum circuits by half Gauss sums
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- Verified compilation of space-efficient reversible circuits
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Quantum circuits and low-degree polynomials over ${{\mathbb{F}}_\mathsf{2}}$
- Towards Quantum Programs Verification: From Quipper Circuits to QPMC
- Rewriting modulo symmetric monoidal structure
- Analysis of Boolean Functions
- T-Count Optimization and Reed–Muller Codes
- Formal certification of a compiler back-end or
- QWIRE: a core language for quantum circuits
This page was built for publication:
