Quick Navigation
Topics
Quantum Optimization
A polynomial quantum computing algorithm for solving the dualization problem
arXiv
Authors: Mauro Mezzini, Fernando Cuartero Gomez, Fernando Pelayo, Jose Javier Paulet Gonzales, Hernan Indibil de la Cruz Calvo, Vicente Pascual
Year
2023
Paper ID
55399
Status
Preprint
Abstract Read
~2 min
Abstract Words
97
Citations
N/A
Abstract
Given two prime monotone boolean functions f:\{0,1\}n → \{0,1\} and g:\{0,1\}n → \{0,1\} the dualization problem consists in determining if g is the dual of f, that is if f\(x1, dots, xn\)= overline{g}\(overline{x1}, dots overline{xn}\) for all \(x1, dots xn\) in \{0,1\}n. Associated to the dualization problem there is the corresponding decision problem: given two monotone prime boolean functions f and g is g the dual of f? In this paper we present a quantum computing algorithm that solves the decision version of the dualization problem in polynomial time.
Why This Paper Matters
- This paper contributes to the Quantum Optimization research area in the Quantum Articles archive.
- It adds a 2023 reference point for readers tracking recent quantum research.
- Given two prime monotone boolean functions f:0,1^n -> 0,1 and g:0,1^n -> 0,1 the dualization problem consists in determining if g is the dual of f, that is if f(x1, dots, xn)=...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.