◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Joshi

5 papers hereh-index 210 citations8 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • last author4

Across the 5 of 5 papers where every author was matched, so the position is known.

fields
  • quant-ph5
same name
  • M. Joshi — 17 papers, h 27
  • M. Joshi — 8 papers, h 15
  • M. Joshi — 7 papers
  • M. Joshi — 6 papers, h 12
  • M. Joshi — 4 papers, h 43
  • M. Joshi — 3 papers

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

collaborators

5 papers

quant-ph2026

Shor's algorithm requires Fanout

Lucas Gretta, Malvika Raj Joshi

Shor's algorithm is a canonical quantum supremacy target whose core operation relies on the Quantum Fourier Transform (QFT). In this note, we resolve an open question of Fang, Fenn…

quant-ph2026

Polylogarithmic-Weight Dicke States in QAC0 and Arbitrary Symmetric States in QACf0​

Lucas Gretta, Meghal Gupta, Malvika Raj Joshi

An n-qubit Dicke state of weight k, is the uniform superposition over all n-bit strings of Hamming weight k. Dicke states are central to quantum algorithms exhibiting speed…

quant-ph2026

Parity ∈/ QAC0 ⟺ QAC0 is Fourier-Concentrated

Lucas Gretta, Meghal Gupta, Malvika Raj Joshi

A major open problem in understanding shallow quantum circuits (QAC0) is whether they can compute Parity. We show that this question is solely about the Fourier spectrum of QAC$…

quant-ph2026

Constant-Depth Unitary Preparation of Dicke States

Malvika Raj Joshi, Francisca Vasconcelos

Dicke states serve as a critical resource in quantum metrology, communication, and computation. However, unitary preparation of Dicke states is limited to logarithmic depth in stan…

quant-ph2025

Improved Lower Bounds for QAC0

Malvika Raj Joshi, Avishay Tal, Francisca Vasconcelos +1

In this work, we prove the strongest known lower bounds for QAC0, allowing polynomially many gates and ancillae. Our main results show that: (1) Depth-3 QAC0 circuits cannot…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.