Theoretical guarantees for permutation-equivariant quantum neural networks
Despite the great promise of quantum machine learning models, there are several
challenges one must overcome before unlocking their full potential. For instance, models …
challenges one must overcome before unlocking their full potential. For instance, models …
Building spatial symmetries into parameterized quantum circuits for faster training
Practical success of quantum learning models hinges on having a suitable structure for the
parameterized quantum circuit. Such structure is defined both by the types of gates …
parameterized quantum circuit. Such structure is defined both by the types of gates …
Solving boolean satisfiability problems with the quantum approximate optimization algorithm
S Boulebnane, A Montanaro - arXiv preprint arXiv:2208.06909, 2022 - arxiv.org
The quantum approximate optimization algorithm (QAOA) is one of the most prominent
proposed applications for near-term quantum computing. Here we study the ability of QAOA …
proposed applications for near-term quantum computing. Here we study the ability of QAOA …
Convergence of digitized-counterdiabatic qaoa: circuit depth versus free parameters
M Vizzuso, G Passarelli, G Cantele… - New Journal of …, 2024 - iopscience.iop.org
Abstract Recently, digitized-counterdiabatic (CD) quantum approximate optimization
algorithm (QAOA) has been proposed to make QAOA converge to the solution of an …
algorithm (QAOA) has been proposed to make QAOA converge to the solution of an …
High-Round QAOA for MAX -SAT on Trapped Ion NISQ Devices
The Quantum Alternating Operator Ansatz (QAOA) is a hybrid classical-quantum algorithm
that aims to sample the optimal solution (s) of discrete combinatorial optimization problems …
that aims to sample the optimal solution (s) of discrete combinatorial optimization problems …
Solution of SAT problems with the adaptive-bias quantum approximate optimization algorithm
The quantum approximate optimization algorithm (QAOA) is a promising method for solving
certain classical combinatorial optimization problems on near-term quantum devices. When …
certain classical combinatorial optimization problems on near-term quantum devices. When …
HyQSAT: A hybrid approach for 3-SAT problems by integrating quantum annealer with CDCL
Propositional satisfiability problem (SAT) is represented in a conjunctive normal form with
multiple clauses, which is an important non-deterministic polynomial-time (NP) complete …
multiple clauses, which is an important non-deterministic polynomial-time (NP) complete …
Amplitude amplification-inspired QAOA: Improving the success probability for solving 3SAT
A Mandl, J Barzen, M Bechtold… - Quantum Science and …, 2024 - iopscience.iop.org
The Boolean satisfiability problem (SAT), in particular 3SAT with its bounded clause size, is
a well-studied problem since a wide range of decision problems can be reduced to it. The …
a well-studied problem since a wide range of decision problems can be reduced to it. The …
Predicting RNA Secondary Structure on Universal Quantum Computer
J Jiang, Q Yan, Y Li, M Lu, Z Cui, M Dou… - arXiv preprint arXiv …, 2023 - arxiv.org
It is the first step for understanding how RNA structure folds from base sequences that to
know how its secondary structure is formed. Traditional energy-based algorithms are short of …
know how its secondary structure is formed. Traditional energy-based algorithms are short of …
Multilevel Leapfrogging Initialization Strategy for Quantum Approximate Optimization Algorithm
XH Ni, BB Cai, HL Liu, SJ Qin, F Gao… - Advanced Quantum …, 2024 - Wiley Online Library
Recently, Zhou et al. have proposed an Interpolation‐based (INTERP) strategy to generate
the initial parameters for Quantum Approximate Optimization Algorithm (QAOA). INTERP …
the initial parameters for Quantum Approximate Optimization Algorithm (QAOA). INTERP …