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

Quantum moment problem

Alexei Daletskii

Published Jan 1, 1985• 0 citations
OpenAlex

Related papers

A quantum mechanical moment problem

Francis J. Narcowich

Lecture notes in physics•Jan 1, 1987•2 citations

The quantum problem of moments I

Stanisław Lech Woronowicz

Reports on Mathematical Physics•Oct 1, 1970•25 citations

The quantum problem of moments II

Stanisław Lech Woronowicz

Reports on Mathematical Physics•Jan 1, 1971•29 citations

The problem of moments in the phase-space formulation of quantum mechanics

Francis J. Narcowich

Long ago, Moyal [Proc. Cambridge Philos. Soc. 45, 99 (1949)] formulated a moment problem in the context of the Wigner–Weyl phase-space formulation of quantum mechanics. The problem amounts to giving necessary and sufficient conditions for a sequence of numbers to be moments of a Wigner function. In this paper, that problem is solved, and so is a truncated version of it.

Journal of Mathematical Physics•Dec 1, 1987•15 citations

NMR Pulse Design using Moment Dynamical Systems

Xin Ning, André Luiz P. de Lima, Jr-Shin Li

We investigate pulse design problems arising in diverse applications in quantum science and technology. In modern approaches, pulse design is cast as an ensemble control problem involving the control of a continuum of nuclear spin systems, which, however, is typically challenging to solve. In this paper, we present a new pulse design paradigm by introducing moment representations of the spin ensemble system and transforming the ensemble control problem associated to pulse design to a moment control problem. We show that feasible and optimal pulses can be effectively designed using the moment system with performance guarantees across the entire ensemble. We also illustrate the versatility and robustness of our moment-based approach by designing uniform and selective pulses essential to enable prominent applications in magnetic resonance.

IEEE Conference on Decision and Control (CDC)•Dec 6, 2022•5 citations

Higher-Order Portfolio Optimization with Quantum Approximate Optimization Algorithm

Valter Uotila, Julia Ripatti, Bo Zhao

Portfolio optimization is one of the most studied optimization problems at the intersection of quantum computing and finance. In this work, we develop the first quantum formulation for a portfolio optimization problem with higherorder moments, skewness and kurtosis. Including higher-order moments leads to more detailed modeling of portfolio return distributions. Portfolio optimization with higher-order moments has been studied in classical portfolio optimization approaches but with limited exploration within quantum formulations. In the context of quantum optimization, higher-order moments generate higher-order terms in the cost Hamiltonian. Thus, instead of obtaining a quadratic unconstrained binary optimization problem, we obtain a higher-order unconstrained binary optimization (HUBO) problem, which has a natural formulation as a parametrized circuit. Additionally, we employ realistic integer variable encoding and a capital-based budget constraint. We consider the classical continuous variable solution with integer programming-based discretization to be the computationally efficient classical baseline for the problem. Our extensive experimental evaluation of$\mathbf{1 0 0}$portfolio optimization problems shows that the solutions to the HUBO formulation often correspond to better portfolio allocations than the classical baseline. This is a promising result for those who want to perform computationally challenging portfolio optimization on quantum hardware, as portfolio optimization with higher moments is classically complex. Moreover, the experimental evaluation studies QAOA's performance with higher-order terms in this practically relevant problem.

arXiv:2509.01496•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 citations
We investigate pulse design problems arising in diverse applications in quantum science and technology. In modern approaches, pulse design is cast as an ensemble control problem involving the control of a continuum of nuclear spin systems, which, however, is typically challenging to solve. In this paper, we present a new pulse design paradigm by introducing moment representations of the spin ensemble system and transforming the ensemble control problem associated to pulse design to a moment control problem. We show that feasible and optimal pulses can be effectively designed using the moment system with performance guarantees across the entire ensemble. We also illustrate the versatility and robustness of our moment-based approach by designing uniform and selective pulses essential to enable prominent applications in magnetic resonance.
Portfolio optimization is one of the most studied optimization problems at the intersection of quantum computing and finance. In this work, we develop the first quantum formulation for a portfolio optimization problem with higherorder moments, skewness and kurtosis. Including higher-order moments leads to more detailed modeling of portfolio return distributions. Portfolio optimization with higher-order moments has been studied in classical portfolio optimization approaches but with limited exploration within quantum formulations. In the context of quantum optimization, higher-order moments generate higher-order terms in the cost Hamiltonian. Thus, instead of obtaining a quadratic unconstrained binary optimization problem, we obtain a higher-order unconstrained binary optimization (HUBO) problem, which has a natural formulation as a parametrized circuit. Additionally, we employ realistic integer variable encoding and a capital-based budget constraint. We consider the classical continuous variable solution with integer programming-based discretization to be the computationally efficient classical baseline for the problem. Our extensive experimental evaluation of100\mathbf{1 0 0}100portfolio optimization problems shows that the solutions to the HUBO formulation often correspond to better portfolio allocations than the classical baseline. This is a promising result for those who want to perform computationally challenging portfolio optimization on quantum hardware, as portfolio optimization with higher moments is classically complex. Moreover, the experimental evaluation studies QAOA's performance with higher-order terms in this practically relevant problem.