Cover Image

Following Forrelation -- Quantum Algorithms in Exploring Boolean Functions' Spectra

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dutta, Suman, Maitra, Subhamoy, Mukherjee, Chandra Sekhar
Format:	Preprint
Published:	2021
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Extending Forrelation: Quantum Algorithms Related to Generalized Fourier-Correlation
by: Dutta, Suman, et al.
Published: (2025)

Forrelation is Extremally Hard
by: Girish, Uma, et al.
Published: (2025)

IQP circuits for 2-Forrelation
by: Buzet, Quentin, et al.
Published: (2026)

On the Rational Degree of Boolean Functions and Applications
by: Iyer, Vishnu, et al.
Published: (2023)

Optimal T depth quantum circuits for implementing arbitrary Boolean functions
by: Dutta, Suman, et al.
Published: (2025)

On the Approximate Non-Deterministic Degree of Total Boolean Functions
by: Pednekar, Samruddhi, et al.
Published: (2026)

Basic Quantum Algorithms
by: Portugal, Renato
Published: (2022)

An Efficient Quantum Factoring Algorithm
by: Regev, Oded
Published: (2023)

Pseudo-deterministic Quantum Algorithms
by: Aaronson, Hugo, et al.
Published: (2026)

Efficient Algorithms for Quantum Hashing
by: Zinnatullin, Ilnar, et al.
Published: (2025)

New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)

Quantum Algorithms in a Superposition of Spacetimes
by: Shmueli, Omri
Published: (2024)

Fourier Spectrum of Noisy Quantum Algorithms
by: Girish, Uma
Published: (2025)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
by: Lykov, Danylo, et al.
Published: (2022)

Quantum Algorithms for Approximate Graph Isomorphism Testing
by: Kulkarni, Prateek P.
Published: (2026)

Exponential Separation Criteria for Quantum Iterative Power Algorithms
by: Czégel, András, et al.
Published: (2025)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
by: Yamakami, Tomoyuki
Published: (2023)

Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
by: Do, Phuc Hao, et al.
Published: (2025)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
by: Guan, Ziyi, et al.
Published: (2023)

Local Quantum Search Algorithm for Random $k$-SAT with $Ω(n^{1+ε})$ Clauses
by: Wu, Mingyou
Published: (2024)

A Perfectly Distributable Quantum-Classical Algorithm for Estimating Triangular Balance in a Signed Edge Stream
by: Kordonowy, Steven, et al.
Published: (2026)

On the Algorithmic Information Between Probabilities
by: Epstein, Samuel
Published: (2023)

Constant-depth circuits for Boolean functions and quantum memory devices using multi-qubit gates
by: Allcock, Jonathan, et al.
Published: (2023)

Quantum-Computable One-Way Functions without One-Way Functions
by: Kretschmer, William, et al.
Published: (2024)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
by: Gharibian, Sevag, et al.
Published: (2021)

Quantum Advantage from One-Way Functions
by: Morimae, Tomoyuki, et al.
Published: (2023)

Dequantizing Short-Path Quantum Algorithms
by: Gall, François Le, et al.
Published: (2026)

Quantum Threshold is Powerful
by: Grier, Daniel, et al.
Published: (2024)

Uncloneable Quantum Advice
by: Broadbent, Anne, et al.
Published: (2023)

Virtual Qudits for Simon's Problem: Dimension-Lifted Algorithms on Qubit Hardware
by: Semre, Abed, et al.
Published: (2025)

Quantum Search With Generalized Wildcards
by: Cornelissen, Arjan, et al.
Published: (2025)

Quantum Interactive Oracle Proofs
by: Sun, Baocheng, et al.
Published: (2026)

The Power of Lorentz Quantum Computer
by: Zhang, Qi, et al.
Published: (2024)

Efficient Quantum Hermite Transform
by: Jain, Siddhartha, et al.
Published: (2025)

On the Complexity of Decoded Quantum Interferometry
by: Marwaha, Kunal, et al.
Published: (2025)

Quantum Communication Advantage in TFNP
by: Göös, Mika, et al.
Published: (2024)

On the Need for Large Quantum Depth
by: Chia, Nai-Hui, et al.
Published: (2019)

Formal Framework for Quantum Advantage
by: Buhrman, Harry, et al.
Published: (2025)

Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)

Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval
by: Ma, Guangsheng, et al.
Published: (2024)