{"id":"W4416385146","doi":"10.48550/arxiv.2510.08403","title":"A Quantum Time-Space Tradeoff for Directed $st$-Connectivity","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"European Commission; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Quantum; Quantum algorithm; Space (punctuation); Path (computing); Quantum complexity theory; Quantum computer; Computational complexity theory; Directed graph; Rest (music); Time complexity","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002496905,0.0008393507,0.001077758,0.0008833653,0.001845093,0.003432322,0.002749634,0.002947462,0.01148411],"category_scores_gemma":[0.01587942,0.0005643597,0.001050806,0.001969851,0.003191479,0.01049624,0.003453402,0.003396414,0.001283542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003310942,"about_ca_system_score_gemma":0.003014866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00190752,"about_ca_topic_score_gemma":0.004097621,"domain_scores_codex":[0.9967744,0.0008814484,0.0001360167,0.0007780142,0.0008980722,0.0005319702],"domain_scores_gemma":[0.9852434,0.01052954,0.000541563,0.002427106,0.0006468149,0.000611519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009499937,0.0002728993,0.001417534,0.0005397954,0.0001008299,0.0001707112,0.0002961723,0.1498605,0.01484519,0.7109045,0.01855858,0.1020833],"study_design_scores_gemma":[0.00008205016,0.0001514165,0.0003814666,0.00005154005,0.00005550087,0.0002149424,0.0001180529,0.4313216,0.005680314,0.5546871,0.007219495,0.00003656111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2309047,0.003285521,0.6840996,0.01349752,0.0005875015,0.0002115975,0.001104204,0.002156056,0.06415328],"genre_scores_gemma":[0.7971745,0.001535784,0.1888172,0.001122751,0.0002931806,0.0002501968,0.0006942612,0.0004878644,0.009624345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01148411,"threshold_uncertainty_score":0.03841817,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02411391248533923,"score_gpt":0.2621677354666748,"score_spread":0.2380538229813356,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}