Geometric Probabilities and Fibonacci Numbers for Maximally Random n-Qubit Quantum Information States

TL;DR

This paper explores the connection between geometric probabilities, Fibonacci sequences, and maximally random n-qubit quantum states, revealing new insights into quantum probability calculations and their relation to classical mathematical structures.

Contribution

It generalizes Fibonacci-based probability results to multi-qubit states and introduces geometric probability methods for quantum information analysis.

Findings

Probabilities for repeated states relate to Fibonacci and N-Bonacci sequences.

Quantum probabilities can be computed using geometric probability frameworks.

The Golden ratio appears in probability limits as n approaches infinity.

Abstract

The problems of Hadamard quantum coin flipping in n-trials and related generalized Fibonacci sequences of numbers were introduced in [1]. It was shown that for an arbitrary number of repeated consecutive states, probabilities are determined by Fibonacci numbers for duplicated states, Tribonacci numbers for triplicated states and N-Bonacci numbers for arbitrary N-plicated states. In the present paper we generalize these results for direct product of multiple qubit states and arbitrary position of repeated states. The calculations are based on structure of Fibonacci trees in space of qubit states, growing in the left and in the right directions, and number of branches and allowed paths on the trees. By using $n$-qubit quantum coins as random n-qubit states with maximal Shannon entropy, we show that quantum probabilities can be calculated by means of geometric probabilities. It illustrates possible application of geometric probabilities in quantum information theory. The Golden ratio of probabilities and the limit of n going to infinity are discussed.