Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

XRDS Crossroads The ACM Magazine for Students

Using Grover's search quantum algorithm to solve Boolean satisfiability problems, part 2

Diogo Fernandes, CARLA VANESSA DA SILVA, Inês Dutra

Published Nov 25, 2019• 2 citations
Publisher

Abstract

column Share on Using Grover's search quantum algorithm to solve Boolean satisfiability problems, part 2 Authors: Diogo Fernandes School of Sciences of University of Porto, Portugal School of Sciences of University of Porto, PortugalView Profile , Carla Silva University of Porto, Portugal University of Porto, PortugalView Profile , Inês Dutra University of Porto, Portugal University of Porto, PortugalView Profile Authors Info & Claims XRDS: Crossroads, The ACM Magazine for StudentsVolume 26Issue 2Winter 2019 pp 68–71https://doi.org/10.1145/3368085Published:25 November 2019Publication History 0citation443DownloadsMetricsTotal Citations0Total Downloads443Last 12 Months63Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

DOI
10.1145/3368085

Related papers

Using Grover's search quantum algorithm to solve Boolean satisfiability problems: Part I

Diogo Fernandes, Inês Dutra

column Using Grover's search quantum algorithm to solve Boolean satisfiability problems: Part I Share on Authors: Diogo Fernandes University of Porto, Portugal University of Porto, PortugalView Profile , Inês Dutra University of Porto, Portugal University of Porto, PortugalView Profile Authors Info & Affiliations XRDS: Crossroads, The ACM Magazine for StudentsVolume 26Issue 1Fall 2019 pp 64–66https://doi.org/10.1145/3358251Published:17 September 2019 0citation289DownloadsMetricsTotal Citations0Total Downloads289Last 12 Months67Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

XRDS Crossroads The ACM Magazine for Students•Sep 17, 2019•7 citations

An introduction to quantum cryptography

Nick Papanikolaou

article Share on An introduction to quantum cryptography Author: Nick Papanikolaou View Profile Authors Info & Claims XRDS: Crossroads, The ACM Magazine for StudentsVolume 11Issue 3March 2005pp 3https://doi.org/10.1145/1144396.1144399Published:01 May 2005Publication History 25citation2,294DownloadsMetricsTotal Citations25Total Downloads2,294Last 12 Months76Last 6 weeks26 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

XRDS Crossroads The ACM Magazine for Students•May 1, 2005•33 citations

A Parallel Quantum Algorithm for the Satisfiability Problem

Liu, WenZhang, Zhang +3 more

在这篇论文我们在场为可满足性问题的一个古典平行的量算法。我们利用了发展在的量算法的古典并行[长的 G.L 和 L. 小， Phys。加快。一 69 (2004 ) 052303 ] ，以便另外的加速能被使用古典并行获得。量算法首先用数算法，然后由使用量寻找算法的量估计答案的数字，明确的答案被发现。

理论物理通讯：英文版•Jan 1, 2008•1 citation

Assessing the Viability of Quantum SAT Solvers: A Comparative Study Using Grover’s Algorithm and Quantum Hardware

Marcos Alemany Manzanaro, Higinio Mora

Lecture notes in networks and systems•Oct 28, 2025•1 citation

Simulation of a computer architecture for quantum chromodynamics calculations

Sadaf R. Alam, Roland N. Ibbett, Frédéric Mallet

article Share on Simulation of a computer architecture for quantum chromodynamics calculations Authors: Sadaf Alam View Profile , Roland Ibbett View Profile , Frederic Mallet View Profile Authors Info & Claims XRDS: Crossroads, The ACM Magazine for StudentsVolume 9Issue 3March 2003pp 16–23https://doi.org/10.1145/904073.904078Published:01 March 2003Publication History 0citation210DownloadsMetricsTotal Citations0Total Downloads210Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

XRDS Crossroads The ACM Magazine for Students•Mar 1, 2003•1 citation

Algoritmos cuánticos para la resolución del problema de satisfacibilidad booleana

María Prieto Gil

Este Trabajo Fin de Grado tiene como objetivo el estudio de la computación cuántica y el desarrollo de un algoritmo cuántico para la resolución de una variante del problema de satisfacibilidad booleana. La computación cuántica es una rama de investigación que está actualmente en sus inicios. Basa su funcionamiento en fenómenos de la física cuántica, que permite realizar cálculos de forma paralelizable. El interés por este campo surge por la capacidad que podrían alcanzar los ordenadores cuánticos de resolver problemas computacionalmente más rápido que los ordenadores clásicos. Tras la comprensión de los principios básicos de la computación cuántica se han estudiado en detalle algunos de los algoritmos cuánticos más conocidos, centrándose en el algoritmo de Grover. Finalmente se ha podido llevar a cabo el desarrollo de un algoritmo para resolver una variante del problema de satisfacibilidad booleana, el problema ‘Exactly-1 3-SAT’, que basa su funcionamiento en el algoritmo de Grover. Se han desarrollado tres posibles implementaciones de este algoritmo y se han realizado pruebas tanto en un simulador, como en un ordenador cuántico real. El problema ‘Exactly-1 3-SAT’ es un problema perteneciente a la clase de complejidad NP-completo, cuya resolución de forma cuántica reduce el tiempo de computación notablemente con respecto a la forma clásica.

•Jun 1, 2019•0 citations
column Share on Using Grover's search quantum algorithm to solve Boolean satisfiability problems, part 2 Authors: Diogo Fernandes School of Sciences of University of Porto, Portugal School of Sciences of University of Porto, PortugalView Profile , Carla Silva University of Porto, Portugal University of Porto, PortugalView Profile , Inês Dutra University of Porto, Portugal University of Porto, PortugalView Profile Authors Info & Claims XRDS: Crossroads, The ACM Magazine for StudentsVolume 26Issue 2Winter 2019 pp 68–71https://doi.org/10.1145/3368085Published:25 November 2019Publication History 0citation443DownloadsMetricsTotal Citations0Total Downloads443Last 12 Months63Last 6 weeks7 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
column Using Grover's search quantum algorithm to solve Boolean satisfiability problems: Part I Share on Authors: Diogo Fernandes University of Porto, Portugal University of Porto, PortugalView Profile , Inês Dutra University of Porto, Portugal University of Porto, PortugalView Profile Authors Info & Affiliations XRDS: Crossroads, The ACM Magazine for StudentsVolume 26Issue 1Fall 2019 pp 64–66https://doi.org/10.1145/3358251Published:17 September 2019 0citation289DownloadsMetricsTotal Citations0Total Downloads289Last 12 Months67Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
article Share on An introduction to quantum cryptography Author: Nick Papanikolaou View Profile Authors Info & Claims XRDS: Crossroads, The ACM Magazine for StudentsVolume 11Issue 3March 2005pp 3https://doi.org/10.1145/1144396.1144399Published:01 May 2005Publication History 25citation2,294DownloadsMetricsTotal Citations25Total Downloads2,294Last 12 Months76Last 6 weeks26 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
article Share on Simulation of a computer architecture for quantum chromodynamics calculations Authors: Sadaf Alam View Profile , Roland Ibbett View Profile , Frederic Mallet View Profile Authors Info & Claims XRDS: Crossroads, The ACM Magazine for StudentsVolume 9Issue 3March 2003pp 16–23https://doi.org/10.1145/904073.904078Published:01 March 2003Publication History 0citation210DownloadsMetricsTotal Citations0Total Downloads210Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Este Trabajo Fin de Grado tiene como objetivo el estudio de la computación cuántica y el desarrollo de un algoritmo cuántico para la resolución de una variante del problema de satisfacibilidad booleana. La computación cuántica es una rama de investigación que está actualmente en sus inicios. Basa su funcionamiento en fenómenos de la física cuántica, que permite realizar cálculos de forma paralelizable. El interés por este campo surge por la capacidad que podrían alcanzar los ordenadores cuánticos de resolver problemas computacionalmente más rápido que los ordenadores clásicos. Tras la comprensión de los principios básicos de la computación cuántica se han estudiado en detalle algunos de los algoritmos cuánticos más conocidos, centrándose en el algoritmo de Grover. Finalmente se ha podido llevar a cabo el desarrollo de un algoritmo para resolver una variante del problema de satisfacibilidad booleana, el problema ‘Exactly-1 3-SAT’, que basa su funcionamiento en el algoritmo de Grover. Se han desarrollado tres posibles implementaciones de este algoritmo y se han realizado pruebas tanto en un simulador, como en un ordenador cuántico real. El problema ‘Exactly-1 3-SAT’ es un problema perteneciente a la clase de complejidad NP-completo, cuya resolución de forma cuántica reduce el tiempo de computación notablemente con respecto a la forma clásica.