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

Numerical Problem

K. Chadan, Pierre C. Sabatier, Roger G. Newton

Published Jan 1, 1989• 0 citations
Publisher
DOI
10.1007/978-3-642-83317-5_19

Related papers

Numerical Solution

‎Louis Marchildon

Springer eBooks•Jan 1, 2002•0 citations

Quantum algorithms for the Sylvester denumerant and the numerical semigroup membership problem

Joaquín Ossorio-Castillo, José M. Tornero

Two quantum algorithms are presented, which tackle well--known problems in the context of numerical semigroups: the numerical semigroup membership problem (NSMP) and the Sylvester denumerant problem (SDP).

arXiv:2402.05524•Feb 8, 2024•0 citations

Numerical solution of the three-anyon problem

M. Sporre, J. J. M. Verbaarschot, Ismail Zahed A

Using the Faddeev equations in configuration space, we solve numerically the problem of three anyons interacting via harmonic forces. The relevance of our results to the many-anyon problem is discussed.

Physical Review Letters•Sep 30, 1991•81 citations

Numerical Simulations

Melinda Hagedorn

BesMasters•Jan 1, 2024•3 citations

Research problems on numerical ranges in quantum computing

David W. Kribs, Aron Pasieka, Martin Laforest +2 more

We describe some instances in quantum information processing where numerical range techniques arise. We focus on two basic settings: higher-rank numerical ranges and their relevance in theoretical quantum error correction, and the classical numerical range and its use for comparing quantum information processing operations. We present the basic theory, discuss examples and formulate open problems.

Linear and Multilinear Algebra•Jun 22, 2009•27 citations

In search of exact solutions

M. Héritier

arXiv:cond-mat/0111101•Nature•Nov 1, 2001•10 citations