We investigate the computational complexity of estimating the operator norm distance T∞(ρ0, ρ1), defined via the operator norm ∥A∥∞ := σmax(A), where σmax(A) is the largest singular value of A, given poly(n)-size state-preparation circuits of n-qubit quantum states ρ0 and ρ1. We provide efficient quantum estimators for the operator norm distance whose complexity is independent of the rank (and thus the dimension) of the states: When one state is pure, we establish an optimal quantum estimator using Θ(1/ϵ) queries to the state-preparation circuits. Consequently, for constant additive error, say ϵ = 1/5, our estimator runs in poly(n) time. Since the operator norm distance T∞(|ψ〉〈ψ|, ρ) is exactly half of the trace distance T(|ψ〉〈ψ|, ρ), our result gives a rank-independent query complexity for estimating T∞(|ψ〉〈ψ|, ρ) and T(|ψ〉〈ψ|, ρ), whereas the approaches due to van Apeldoorn, Cornelissen, Gilyén, and Nannicini (SODA 2023) and Wang and Zhang (TIT 2024) have query complexity scaling at least linearly with rank(ρ), which can be exp(n) in general. In addition, our query complexity matches the optimal bound when both states are pure by Wang (TIT 2024). For general quantum states, we also provide a quantum estimator using Oe(1/ϵ3/2) queries to the state-preparation circuits, which shows that the corresponding promise problem is BQP-complete and improves the QMA upper bound sketched by Liu and Wang (ESA 2025). Together with an Ω(1/ϵ) quantum query complexity lower bound, this leaves only square-root room for improvement. The key intuition behind our estimators is that, when one state is pure, the pure state |ψ〉 has overlap at least 1/2 with the top unit eigenvector of |ψ〉〈ψ|−ρ, reflecting a structural feature specific to the operator norm distance.