2000 character limit reached
A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation (2403.03990v1)
Published 6 Mar 2024 in cs.DS
Abstract: The binary indexed tree, or Fenwick tree, is a data structure that can efficiently update values and calculate prefix sums in an array. It allows both of these operations to be performed in $O(\log_2 N)$ time. Here we present a novel data structure resembling the Sierpinski triangle, which accomplishes these operations with the same memory usage in $O(\log_3 N)$ time instead. We show this order to be optimal by making use of a connection to quantum computing.
- Peter M. Fenwick. A new data structure for cumulative frequency tables. Software: Practice and Experience, 24(3):327–336, March 1994.
- Peter M. Fenwick. A New Data Structure for Cumulative Probability Tables: An Improved Frequency-to-Symbol Algorithm. Software: Practice and Experience, 26(4):489–490, April 1996.
- Operator locality in the quantum simulation of fermionic models. Physical Review A, 95(3):032332, March 2017.
- Fermionic Quantum Computation. Annals of Physics, 298(1):210–226, May 2002.
- Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning. Quantum, 4:276, June 2020.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.