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

Proceedings of the Japan Academy Series A Mathematical Sciences

A mathematical theory of randomized computation, I

Shinichi Yamada

Published Jan 1, 1988• 2 citations
Publisher
DOI
10.3792/pjaa.64.115

Related papers

A mathematical theory of randomized computation and its mathematical foundations

眞市 山田

•Jan 1, 1988•1 citation

Classical, Quantum and Biological Randomness as Relative Unpredictability

Cristian S. Calude, Giuseppe O. Longo

In this chapter, the authors propose the thesis that randomness is unpredictability with respect to an intended theory and measurement. From this point of view, they briefly discuss various forms of randomness that physics, mathematics and computer science have proposed. The authors also discuss biological randomness its peculiar nature and role in ontogenesis and in evolutionary dynamics (phylogenesis). Classical systems are deterministic, yet they may be unpredictable, in the sense that randomness is not in the world nor it is just in the eyes of the beholder, but it pops out at the interface between us and the world by theory and measurement. Quantum randomness is hailed to be more than “epistemic”, that is, “intrinsic”. The authors use sequences to discuss some subtle differences in the quality of randomness.

Wiley eBooks•Apr 23, 2021•6 citations

Theory of Computation

Salvador Elías Venegas-Andraca

Synthesis lectures on quantum computing•Jan 1, 2008•0 citations

Elements of Classical Computation

Springer eBooks•Feb 2, 2007•0 citations

Three Cases of Complex Eigenvalue/Vector Distributions of Symmetric Order-Three Random Tensors

Swastik Majumder, Naoki Sasakura

Abstract Random tensor models have applications in a variety of fields, such as quantum gravity, quantum information theory, mathematics of modern technologies, etc., and studying their statistical properties, e.g. tensor eigenvalue/vector distributions, is interesting and useful. Recently some tensor eigenvalue/vector distributions have been computed by expressing them as partition functions of 0D quantum field theories. In this paper, using this method, we compute three cases of complex eigenvalue/vector distributions of symmetric order-three random tensors, where the three cases can be characterized by the Lie-group invariances, $O(N,\mathbb {R})$, $O(N,\mathbb {C})$, and $U(N,\mathbb {C})$, respectively. Exact closed-form expressions of the distributions are obtained by computing partition functions of four-fermi theories, where the last case is of the “signed” distribution, which counts the distribution with a sign factor coming from a Hessian matrix. As an application, we compute the injective norm of the complex symmetric order-three random tensor in the large-N limit by computing the edge of the last signed distribution, obtaining agreement with an earlier numerical result in the literature.

arXiv:2408.01030•Progress of Theoretical and Experimental Physics•Aug 31, 2024•3 citations

Revisiting the Page curve and its moments. A combinatorial approach

Gero von Gersdorff

We revisit the calculation of the von Neumann (or "entanglement") entropy of a subsystem of a pure quantum state, under the assumption that the latter is drawn at random from a uniform distribution on the full Hilbert space. We derive simple and closed expressions for all power moments, from which the moments of the entropy can be computed by simple differentiation. Our approach (different from the usual one based on random matrix theory and Laguerre polynomials) makes use of Schur-Weyl duality and the character theory of the symmetric group $S_N$ . The paper is self-contained, providing all the necessary mathematical background.

quant-pharXiv:2606.30941•Jul 1, 2026•0 citations
In this chapter, the authors propose the thesis that randomness is unpredictability with respect to an intended theory and measurement. From this point of view, they briefly discuss various forms of randomness that physics, mathematics and computer science have proposed. The authors also discuss biological randomness its peculiar nature and role in ontogenesis and in evolutionary dynamics (phylogenesis). Classical systems are deterministic, yet they may be unpredictable, in the sense that randomness is not in the world nor it is just in the eyes of the beholder, but it pops out at the interface between us and the world by theory and measurement. Quantum randomness is hailed to be more than “epistemic”, that is, “intrinsic”. The authors use sequences to discuss some subtle differences in the quality of randomness.
Abstract Random tensor models have applications in a variety of fields, such as quantum gravity, quantum information theory, mathematics of modern technologies, etc., and studying their statistical properties, e.g. tensor eigenvalue/vector distributions, is interesting and useful. Recently some tensor eigenvalue/vector distributions have been computed by expressing them as partition functions of 0D quantum field theories. In this paper, using this method, we compute three cases of complex eigenvalue/vector distributions of symmetric order-three random tensors, where the three cases can be characterized by the Lie-group invariances, O(N,R)O(N,\mathbb {R})O(N,R), O(N,C)O(N,\mathbb {C})O(N,C), and U(N,C)U(N,\mathbb {C})U(N,C), respectively. Exact closed-form expressions of the distributions are obtained by computing partition functions of four-fermi theories, where the last case is of the “signed” distribution, which counts the distribution with a sign factor coming from a Hessian matrix. As an application, we compute the injective norm of the complex symmetric order-three random tensor in the large-N limit by computing the edge of the last signed distribution, obtaining agreement with an earlier numerical result in the literature.
We revisit the calculation of the von Neumann (or "entanglement") entropy of a subsystem of a pure quantum state, under the assumption that the latter is drawn at random from a uniform distribution on the full Hilbert space. We derive simple and closed expressions for all power moments, from which the moments of the entropy can be computed by simple differentiation. Our approach (different from the usual one based on random matrix theory and Laguerre polynomials) makes use of Schur-Weyl duality and the character theory of the symmetric group SNS_NSN​ . The paper is self-contained, providing all the necessary mathematical background.