Citation notice #4936 · 2026-07-11 03:19:08.722131+00:00
IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX
Correction
Crossref
Open
cites SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python, which carries a correction notice dated 2020-03-04. One-hop deterministic notice: the citation edge exists in the Pith bibliography graph; no model judged whether the citation was load-bearing.
Citing paper Event page Original DOI Notice DOI File a formal challenge All reference changes
01Evidence
Raw extraction · bibliography line · bibliography index 35
Pauli Virtanen, Ralf Gommers, Travis E. Oliphant, Matt Haberland, Tyler Reddy, David Cournapeau, Evgeni Burovski, Pearu Peterson, Warren Weckesser, Jonathan Bright, Stéfan J. van der Walt, Matthew Brett, Joshua Wilson, K. Jarrod Millman, Nikolay Mayorov, Andrew R. J. Nelson, Eric Jones, Robert Kern, Eric Larson, C J Carey, İlhan Polat, Yu Feng, Eric W. Moore, Jake VanderPlas, Denis Laxalde, Josef Perktold, Robert Cimrman,IanHenriksen,E.A.Quintero,CharlesR.Harris,AnneM.Archibald,Antônio H. Ribeiro, Fabian Pedregosa, Paul van Mulbregt, and SciPy 1.0 Contributors. “SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python”. In:Nature Methods 17 (2020), pp. 261–272.doi: 10.1038/s41592-019-0686-2 (page 7). A Runtime analysis for the sparse implementation The SciPy package implements the SMPP algorithm for fast matrix multiplication found in [3]. For the matrix multiplicationM · N, where M is of dimensionm × k and N of dimension k × n this algorithm has runtime complexity O(m[max (nnzrow(M),nnzcol(N))2 + max(m, n)) (39) where nnzrow(M) and nnzcol(N) are the maximum number of non-zero entries in any row of M and column ofN. Using this, we can now consider each of the matrix mul
02Event
- Type
- Correction
- Source
- Crossref
- Original DOI
- 10.1038/s41592-019-0686-2
- Notice DOI
- 10.1038/s41592-020-0772-5
- Date
- 2020-03-04
- Title
- Author Correction: SciPy 1.0: fundamental algorithms for scientific computing in Python
- Reasons
- ['Correction']
- Work
- SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python (2020) Nature Methods
03Dispute this notice
If this citation does not depend on the flagged claim, or the event is wrong, say so. Disputes are public. For a signed challenge against the paper itself, use the formal challenge form.