832 citations
- Max Planck Institute for MathematicsDE454 papers
- Capital Normal UniversityCN281 papers
- Leipzig UniversityDE139 papers
- Santa Fe InstituteUS87 papers
- Max Planck SocietyDE64 papers
- South China University of TechnologyCN43 papers
- Centre National de la Recherche ScientifiqueFR42 papers
- Technische Universität BerlinDE33 papers
- North Carolina State UniversityUS32 papers
- China University of Petroleum, East ChinaCN29 papers
- University of California, BerkeleyUS28 papers
- Institute of Mathematical SciencesIN27 papers
1,370 papers
Extremal fences with polyforms
Alexis Langlois-Rémillard, Mia N. Müßig, Érika Roldán
We present results around an isoperimetric problem built on polyforms: What is the biggest enclosed area one can build using polyforms in each of the three plane tessellations? We…
Coherence dynamics in quantum algorithm for linear systems of equations
Linlin Ye, Zhaoqi Wu, Shao-Ming Fei
Quantum coherence is a fundamental issue in quantum mechanics and quantum information processing. We explore the coherence dynamics of the evolved states in HHL quantum algorithm f…
Coherence and entanglement dynamics in Shor's algorithm
Linlin Ye, Zhaoqi Wu, Shao-Ming Fei
Shor's algorithm outperforms its classical counterpart in efficient prime factorization. We explore the coherence and entanglement dynamics of the evolved states within Shor's algo…
SynRXN: An Open Benchmark and Curated Dataset for Computational Reaction Modeling
Tieu-Long Phan, Nhu-Ngoc Nguyen Song, Peter F. Stadler
We present SynRXN, a unified benchmarking framework and open-data resource for computer-aided synthesis planning (CASP). SynRXN decomposes end-to-end synthesis planning into five t…
From the discrete to the continuous, from simplicial complexes to Riemannian manifolds. Approximating flows and cuts on manifolds by discrete versions
Marzieh Eidi, Juergen Jost, Dong Zhang
Many fundamental structures of Riemannian geometry have found discrete counterparts for graphs or combinatorial ones for simplicial complexes. These include those discussed in this…
Decoding Quantum Search Advantage: The Critical Role of State Properties in Random Walks
Si-Qi Zhou, Jin-Min Liang, Ziheng Ding +3
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remai…