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

Is it impossible to find the universal density functional? Or is it just well-hidden?

Paul W. Ayers, Robert G. Parr

Published Aug 1, 2014• 1 citation
Publisher

Abstract

We review information on methods for constructing the exact density functional mathematically and computationally. While it is generally accepted that no explicit analytic form for the exact functional exists, we argue, based on what is known about the classical many-body problem, that is not necessarily the case.
DOI
10.17615/4xvr-d869

Related papers

Is it impossible to find the universal density functional? Or is it just well-hidden?

Robert G. Parr, Paul W. Ayers

We review information on methods for constructing the exact density functional mathematically and computationally. While it is generally accepted that no explicit analytic form for the exact functional exists, we argue, based on what is known about the classical many-body problem, that is not necessarily the case.

•Aug 14, 2021•2 citations

Approximations and exact properties of density functionals from the strong-interaction limit of DFT

Sara Giarrusso

•Jan 1, 2020•1 citation

Full Canonical Information from Grand-Potential Density-Functional Theory

Daniel de las Heras, Matthias Schmidt

We present a general and formally exact method to obtain the canonical one-body density distribution and the canonical free energy from direct decomposition of classical density functional results in the grand ensemble. We test the method for confined one-dimensional hard-core particles for which the exact grand potential density functional is explicitly known. The results agree to within high accuracy with those from exact methods and our Monte Carlo many-body simulations. The method is relevant for treating finite systems and for dynamical density functional theory.

Physical Review Letters•Dec 5, 2014•37 citations

Implications of the two nodal domains conjecture for ground state fermionic wave functions

Dario Bressanini

The nodes of many-body wave functions are mathematical objects important in many different fields of physics. They are at the heart of the quantum Monte Carlo methods but outside this field their properties are neither widely known nor studied. In recent years a conjecture, already proven to be true in several important cases, has been put forward related to the nodes of the fermionic ground state of a many-body system, namely that there is a single nodal hypersurface that divides configuration space into only two connected domains. While this is obviously relevant to the fixed node diffusion Monte Carlo method, its repercussions have ramifications in various fields of physics as diverse as density functional theory or Feynman and Cohen's backflow wave function formulation. To illustrate this we explicitly show that, even if we knew the exact Kohn-Sham exchange correlation functional, there are systems for which we would obtain the exact ground state energy and density but a wave function quite different from the exact one. This paradox is only apparent since the Hohenberg-Kohn theorem relates the energy directly to the density and the wave function is not guaranteed to be close to the exact one. The aim of this paper is to stimulate the investigation of the properties of the nodes of many-body wave functions in different fields of physics. Furthermore, we explicitly show that this conjecture is related to the phenomenon of avoided nodal crossing but it is not necessarily caused by electron correlation, as sometimes has been suggested in the literature. We explicitly build a many-body uncorrelated example whose nodal structure shows the same phenomenon.

Physical Review B•Sep 13, 2012•27 citations

Density Functional Approach to the Many-Body Problem: Key Concepts and Exact Functionals

Robert van Leeuwen

Advances in quantum chemistry•Jan 1, 2003•101 citations

Computational Quantum Secret Sharing

Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang +1 more

Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties in such a way that certain authorized subsets can reconstruct the secret, while unauthorized subsets obtain no information about it. Previous works on QSS for general access structures focused solely on the existence of perfectly secure schemes, and the share size of the known schemes is necessarily exponential even in cases where the access structure is computed by polynomial size monotone circuits. This stands in stark contrast to the classical setting, where polynomial-time computationally-secure secret sharing schemes have been long known for all access structures computed by polynomial-size monotone circuits under standard hardness assumptions, and one can even obtain shares which are much shorter than the secret (which is impossible with perfect security). While QSS was introduced over twenty years ago, previous works only considered information-theoretic privacy. In this work, we initiate the study of computationally-secure QSS and show that computational assumptions help significantly in building QSS schemes, just as in the classical case. We present a simple compiler and use it to obtain a large variety results: We construct polynomial-time computationally-secure QSS schemes under standard hardness assumptions for a rich class of access structures. This includes many access structures for which previous results in QSS necessarily required exponential share size. In fact, we can go even further: We construct QSS schemes for which the size of the quantum shares is significantly smaller than the size of the secret. As in the classical setting, this is impossible with perfect security. We also apply our compiler to obtain results beyond computational QSS. In the information-theoretic setting, we improve the share size of perfect QSS schemes for a large class of n-party access structures to 1.5^{n+o(n)}, improving upon best known schemes and matching the best known result for general access structures in the classical setting. Finally, among other things, we study the class of access structures which can be efficiently implemented when the quantum secret sharing scheme has access to a given number of copies of the secret, including all such functions in 𝖯 and NP.

Leibniz international proceedings in informatics•Jan 1, 2023•0 citations
We present a general and formally exact method to obtain the canonical one-body density distribution and the canonical free energy from direct decomposition of classical density functional results in the grand ensemble. We test the method for confined one-dimensional hard-core particles for which the exact grand potential density functional is explicitly known. The results agree to within high accuracy with those from exact methods and our Monte Carlo many-body simulations. The method is relevant for treating finite systems and for dynamical density functional theory.
The nodes of many-body wave functions are mathematical objects important in many different fields of physics. They are at the heart of the quantum Monte Carlo methods but outside this field their properties are neither widely known nor studied. In recent years a conjecture, already proven to be true in several important cases, has been put forward related to the nodes of the fermionic ground state of a many-body system, namely that there is a single nodal hypersurface that divides configuration space into only two connected domains. While this is obviously relevant to the fixed node diffusion Monte Carlo method, its repercussions have ramifications in various fields of physics as diverse as density functional theory or Feynman and Cohen's backflow wave function formulation. To illustrate this we explicitly show that, even if we knew the exact Kohn-Sham exchange correlation functional, there are systems for which we would obtain the exact ground state energy and density but a wave function quite different from the exact one. This paradox is only apparent since the Hohenberg-Kohn theorem relates the energy directly to the density and the wave function is not guaranteed to be close to the exact one. The aim of this paper is to stimulate the investigation of the properties of the nodes of many-body wave functions in different fields of physics. Furthermore, we explicitly show that this conjecture is related to the phenomenon of avoided nodal crossing but it is not necessarily caused by electron correlation, as sometimes has been suggested in the literature. We explicitly build a many-body uncorrelated example whose nodal structure shows the same phenomenon.
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties in such a way that certain authorized subsets can reconstruct the secret, while unauthorized subsets obtain no information about it. Previous works on QSS for general access structures focused solely on the existence of perfectly secure schemes, and the share size of the known schemes is necessarily exponential even in cases where the access structure is computed by polynomial size monotone circuits. This stands in stark contrast to the classical setting, where polynomial-time computationally-secure secret sharing schemes have been long known for all access structures computed by polynomial-size monotone circuits under standard hardness assumptions, and one can even obtain shares which are much shorter than the secret (which is impossible with perfect security). While QSS was introduced over twenty years ago, previous works only considered information-theoretic privacy. In this work, we initiate the study of computationally-secure QSS and show that computational assumptions help significantly in building QSS schemes, just as in the classical case. We present a simple compiler and use it to obtain a large variety results: We construct polynomial-time computationally-secure QSS schemes under standard hardness assumptions for a rich class of access structures. This includes many access structures for which previous results in QSS necessarily required exponential share size. In fact, we can go even further: We construct QSS schemes for which the size of the quantum shares is significantly smaller than the size of the secret. As in the classical setting, this is impossible with perfect security. We also apply our compiler to obtain results beyond computational QSS. In the information-theoretic setting, we improve the share size of perfect QSS schemes for a large class of n-party access structures to 1.5^{n+o(n)}, improving upon best known schemes and matching the best known result for general access structures in the classical setting. Finally, among other things, we study the class of access structures which can be efficiently implemented when the quantum secret sharing scheme has access to a given number of copies of the secret, including all such functions in 𝖯 and NP.