Finite-Function-Encoding Quantum States
We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions, i.e., multivariate functions over the ring of integers modulo $d$, and investigate some of their structural properties. We also point out some differences between polynomial and non-polynomial funct...
Main Authors: | Paul Appel, Alexander J. Heilman, Ezekiel W. Wertz, David W. Lyons, Marcus Huber, Matej Pivoluska, Giuseppe Vitagliano |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2022-05-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2022-05-09-708/pdf/ |
Similar Items
-
Implementation of quantum compression on IBM quantum computers
by: Matej Pivoluska, et al.
Published: (2022-04-01) -
Quantum key distribution rates from semidefinite programming
by: Mateus Araújo, et al.
Published: (2023-05-01) -
Loss of information in quantum guessing game
by: Martin Plesch, et al.
Published: (2018-01-01) -
The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry
by: Ivana Miháliková, et al.
Published: (2022-01-01) -
Efficient quantum amplitude encoding of polynomial functions
by: Javier Gonzalez-Conde, et al.
Published: (2024-03-01)