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

Springer eBooks

Three-Dimensional Problems

Jerry Goodisman

Published Jan 1, 1977• 0 citations
Publisher
DOI
10.1007/978-1-4684-2268-9_5

Related papers

Two and Three Versus One-Dimensional Problems

Harry A. Mavromatis

Springer eBooks•Jan 1, 1987•1 citation

Two-, Three-, and N-, Versus One-Dimensional Problems

Harry A. Mavromatis

Reidel texts in the mathematical sciences•Jan 1, 1992•0 citations

Application of Quantum Approximate Optimization Algorithm in Three- Dimensional Matching Problem

Jinyuan Dong, yao zhao, Zhiqiang Li +3 more

Abstract The three-dimensional matching problem is a classic NP-complete problem in combinatorial optimization, with wide applications in resource allocation, task scheduling, and many other practical scenarios. Traditional algorithms for solving the three-dimensional matching problem face the challenge of high time complexity, making it difficult to solve large-scale problems within a reasonable time frame. To improve the solution efficiency, a quantum circuit solution based on the Quantum Approximate Optimization Algorithm (QAOA) is proposed. By constructing a mathematical model of the three-dimensional matching problem, the corresponding Hamiltonian expression is derived. A QAOA-based quantum circuit is designed and the parameters of the parameterized quantum gates are optimized using the classical optimization algorithm COBYLA. Simulation experiments are performed using IBM's quantum development framework Qiskit. The experimental results show that the solution to the three-dimensional matching problem can be obtained with 84% probability in polynomial time, verifying the feasibility and effectiveness of solving the three-dimensional matching problem based on the Quantum Approximate Optimization Algorithm.

•May 26, 2025•0 citations

One-Dimensional Problems

Springer eBooks•Sep 17, 2007•0 citations

One-Dimensional Problems

Zoltán Lajos Papp

Springer eBooks•Jan 1, 2026•0 citations

On continuous spectrum eigenfunctions asymptotics of three three-dimensional unlike-charged quantum particles scattering problem

Alexander Mikhajlovich Budylin, Ya. Yu. Koptelov, S. B. Levin

Developing the diffraction approach, we study the most interesting and also most complicated case of scattering problem of three three-dimensional unlike-charged quantum particles.

Days on Diffraction•Jun 1, 2016•1 citation
Abstract The three-dimensional matching problem is a classic NP-complete problem in combinatorial optimization, with wide applications in resource allocation, task scheduling, and many other practical scenarios. Traditional algorithms for solving the three-dimensional matching problem face the challenge of high time complexity, making it difficult to solve large-scale problems within a reasonable time frame. To improve the solution efficiency, a quantum circuit solution based on the Quantum Approximate Optimization Algorithm (QAOA) is proposed. By constructing a mathematical model of the three-dimensional matching problem, the corresponding Hamiltonian expression is derived. A QAOA-based quantum circuit is designed and the parameters of the parameterized quantum gates are optimized using the classical optimization algorithm COBYLA. Simulation experiments are performed using IBM's quantum development framework Qiskit. The experimental results show that the solution to the three-dimensional matching problem can be obtained with 84% probability in polynomial time, verifying the feasibility and effectiveness of solving the three-dimensional matching problem based on the Quantum Approximate Optimization Algorithm.