This paper proposes an elementary description of a black-box function, and proposes an heuristic optimization for this description which minimizes implementation complexity using a clique cover technique, and proves the hardness of finding such an optimal solution under the optimization framework.
An algebraic approach to the Syndrome Decoding Problem is investigated, based on a reformulation of the Hamming weight constraint and its integration with the Information Set Decoding paradigm, and insights into the practical behavior of Grobner basis techniques within an ISD-like decoding framework are provided.
R. La Scala, Marco Marchesin, S. Tiwari· 0 citations
The choice of a given encoding scheme for the problem variables, represented by a set of input qubits of a quantum circuit, substantially influences its design, as well as the quantity and nature of quantum resources (qubits and gates) employed by it. Quantum programmers have access to a variety of encoding strategies,...
D. Alonso, Pedro Sánchez, Bárbara Álvarez et al.· Quantum Information Processi...· 0 citations
A simpler algebraic decomposition is proposed to separate the preparation of the real part of the desired state from the complex one, resulting in a reduction in terms of circuit depth, total gates, and CNOT count when 𝑚 ancillary qubits are available.
A key challenge in quantum cryptography is to build quantum one-wayness and pseudorandomness without the use of (quantum computable) one-way functions. So far, this has turned out to be a difficult task, with only a few proposed candidates that are not directly built from one-way functions. Even within these few propos...
Significant efforts are currently being directed toward the implementation of large-scale quantum information processors, but realizing useful quantum advantage also requires the development of efficient quantum algorithms. While for many practical problems the dominant resource costs are associated with a small set of...
An-Di Gu, Alek H. Kemeny, S. Yelin et al.· 1 citation
In this paper, we prove that the Mean-Field Approximate Optimization Algorithm (MF-AOA), a quantum-inspired classical algorithm of the Quantum Approximate Optimization Algorithm (QAOA), is unable to give arbitrary near optimal solution for problems exhibiting the Overlap Gap Property (OGP). We show this by relating the...
M. Goh, Thorge Müller· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
