{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/quantum-state-tomography","name":"Quantum State Tomography","slug":"quantum-state-tomography","description_markdown":null,"categories":[{"name":"Medical","url":"/area/medical"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":45,"papers_with_code":10,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/tomography","name":"Tomography"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":45,"of":45,"of_with_code":10,"tagged_in_all":45,"counts":{"archive_papers_tagged":45,"with_a_code_link":10,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":45,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/fast-minimization-of-expected-logarithmic","slug":"fast-minimization-of-expected-logarithmic","title":"Fast Minimization of Expected Logarithmic Loss via Stochastic Dual Averaging","date":"2023-11-05","arxiv_id":"2311.02557","repositories_listed":2,"syntology":null},{"url":"/paper/learning-quantum-states-and-unitaries-of","slug":"learning-quantum-states-and-unitaries-of","title":"Learning quantum states and unitaries of bounded gate complexity","date":"2023-10-30","arxiv_id":"2310.19882","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-quantum-states-and-unitaries-of#ran","syntology_url":"https://syntology.ai/paper/2310.19882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19882"}},"official":{"repos":["haimengzhao/bounded-gate-tomography"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/more-measurement-and-correlation-based","slug":"more-measurement-and-correlation-based","title":"MORE: Measurement and Correlation Based Variational Quantum Circuit for Multi-classification","date":"2023-07-21","arxiv_id":"2307.11875","repositories_listed":1,"syntology":null},{"url":"/paper/faster-stochastic-first-order-method-for","slug":"faster-stochastic-first-order-method-for","title":"Faster Stochastic First-Order Method for Maximum-Likelihood Quantum State Tomography","date":"2022-11-23","arxiv_id":"2211.12880","repositories_listed":1,"syntology":null},{"url":"/paper/netket-3-machine-learning-toolbox-for-many","slug":"netket-3-machine-learning-toolbox-for-many","title":"NetKet 3: Machine Learning Toolbox for Many-Body Quantum Systems","date":"2021-12-20","arxiv_id":"2112.10526","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/netket-3-machine-learning-toolbox-for-many#ran","syntology_url":"https://syntology.ai/paper/2112.10526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10526"}},"official":{"repos":["netket/netket"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/classification-and-reconstruction-of-optical","slug":"classification-and-reconstruction-of-optical","title":"Classification and reconstruction of optical quantum states with deep neural networks","date":"2020-12-03","arxiv_id":"2012.02185","repositories_listed":1,"syntology":null},{"url":"/paper/quantum-state-tomography-with-conditional","slug":"quantum-state-tomography-with-conditional","title":"Quantum State Tomography with Conditional Generative Adversarial Networks","date":"2020-08-07","arxiv_id":"2008.03240","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quantum-state-tomography-with-conditional#ran","syntology_url":"https://syntology.ai/paper/2008.03240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03240"}},"official":{"repos":["quantshah/qst-cgan"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-concordant-analysis-of-frank-wolfe","slug":"self-concordant-analysis-of-frank-wolfe","title":"Self-Concordant Analysis of Frank-Wolfe Algorithms","date":"2020-02-11","arxiv_id":"2002.04320","repositories_listed":1,"syntology":null},{"url":"/paper/self-concordant-analysis-of-frank-wolfe-1","slug":"self-concordant-analysis-of-frank-wolfe-1","title":"Self-concordant analysis of Frank-Wolfe algorithm","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/variational-quantum-circuits-for-quantum","slug":"variational-quantum-circuits-for-quantum","title":"Variational Quantum Circuits for Quantum State Tomography","date":"2019-12-16","arxiv_id":"1912.07286","repositories_listed":1,"syntology":null},{"url":null,"slug":"online-learning-of-pure-states-is-as-hard-as","title":"Online Learning of Pure States is as Hard as Mixed States","date":"2025-02-02","arxiv_id":"2502.00823","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-provable-tensor-train-format-tensor","title":"Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent","date":"2025-01-23","arxiv_id":"2501.13385","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-quantum-tomography-with-deep-neural","title":"Universal Quantum Tomography With Deep Neural Networks","date":"2024-07-01","arxiv_id":"2407.01734","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-pure-quantum-states-almost-without","title":"Learning pure quantum states (almost) without regret","date":"2024-06-26","arxiv_id":"2406.18370","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-characterization-of-three-qubit","title":"Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers","date":"2024-06-23","arxiv_id":"2406.16018","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-quantum-states-with-the","title":"Online Learning Quantum States with the Logarithmic Loss via VB-FTRL","date":"2023-11-06","arxiv_id":"2311.04237","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-informative-latent-representation","title":"Learning Informative Latent Representation for Quantum State Tomography","date":"2023-09-30","arxiv_id":"2310.00518","repositories_listed":0,"syntology":null},{"url":null,"slug":"shadownet-for-data-centric-quantum-system","title":"ShadowNet for Data-Centric Quantum System Learning","date":"2023-08-22","arxiv_id":"2308.11290","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-state-tomography-using-quantum","title":"Quantum State Tomography using Quantum Machine Learning","date":"2023-08-20","arxiv_id":"2308.10327","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-based-transformer-networks-for","title":"Tomography of Quantum States from Structured Measurements via quantum-aware transformer","date":"2023-05-09","arxiv_id":"2305.05433","repositories_listed":0,"syntology":null},{"url":null,"slug":"unrolling-svt-to-obtain-computationally","title":"Unrolling SVT to obtain computationally efficient SVT for n-qubit quantum state tomography","date":"2022-12-17","arxiv_id":"2212.08852","repositories_listed":0,"syntology":null},{"url":null,"slug":"demonstration-of-machine-learning-enhanced","title":"Demonstration of machine-learning-enhanced Bayesian quantum state estimation","date":"2022-12-15","arxiv_id":"2212.08032","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-split-neural-network-learning-using","title":"Quantum Split Neural Network Learning using Cross-Channel Pooling","date":"2022-11-12","arxiv_id":"2211.06524","repositories_listed":0,"syntology":null},{"url":null,"slug":"granger-causality-for-compressively-sensed","title":"Granger Causality for Compressively Sensed Sparse Signals","date":"2022-09-23","arxiv_id":"2210.11420","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-stochastic-factored-gradient-descent","title":"Local Stochastic Factored Gradient Descent for Distributed Quantum State Tomography","date":"2022-03-22","arxiv_id":"2203.11579","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-application-performance-with-biased","title":"Improving application performance with biased distributions of quantum states","date":"2021-07-15","arxiv_id":"2107.07642","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-online-algorithm-for-maximum-likelihood","title":"Maximum-Likelihood Quantum State Tomography by Soft-Bayes","date":"2020-12-31","arxiv_id":"2012.15498","repositories_listed":0,"syntology":null},{"url":null,"slug":"classical-shadows-with-noise","title":"Classical Shadows With Noise","date":"2020-11-23","arxiv_id":"2011.11580","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-approximate-quantum-state","title":"Efficient Quantum State Sample Tomography with Basis-dependent Neural-networks","date":"2020-09-16","arxiv_id":"2009.07601","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-assisted-quantum-state","title":"Machine learning assisted quantum state estimation","date":"2020-03-06","arxiv_id":"2003.03441","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-quantum-state-tomography-with-neural","title":"Adaptive Quantum State Tomography with Neural Networks","date":"2018-12-17","arxiv_id":"1812.06693","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-network-state-estimation-for-full","title":"Neural network state estimation for full quantum state tomography","date":"2018-11-16","arxiv_id":"1811.06654","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-quantum-circuit-learning-for-pure","title":"Adversarial quantum circuit learning for pure state approximation","date":"2018-06-01","arxiv_id":"1806.00463","repositories_listed":0,"syntology":null},{"url":null,"slug":"run-procrustes-run-on-the-convergence-of","title":"Provably convergent acceleration in factored gradient descent with applications in matrix sensing","date":"2018-06-01","arxiv_id":"1806.00534","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-matrix-factorization-from-rank-one","title":"Nonconvex Matrix Factorization from Rank-One Measurements","date":"2018-02-17","arxiv_id":"1802.06286","repositories_listed":0,"syntology":null},{"url":null,"slug":"transforming-bells-inequalities-into-state","title":"Transforming Bell's Inequalities into State Classifiers with Machine Learning","date":"2017-05-02","arxiv_id":"1705.00813","repositories_listed":0,"syntology":null},{"url":null,"slug":"stabiliser-states-are-efficiently-pac","title":"Stabiliser states are efficiently PAC-learnable","date":"2017-04-30","arxiv_id":"1705.00345","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-of-low-rank-density-matrices-by","title":"Estimation of low rank density matrices by Pauli measurements","date":"2016-10-16","arxiv_id":"1610.04811","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-burer-monteiro-factorization-for-a","title":"Provable Burer-Monteiro factorization for a class of norm-constrained matrix problems","date":"2016-06-04","arxiv_id":"1606.01316","repositories_listed":0,"syntology":null},{"url":null,"slug":"methods-for-sparse-and-low-rank-recovery","title":"Methods for Sparse and Low-Rank Recovery under Simplex Constraints","date":"2016-05-02","arxiv_id":"1605.00507","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-estimation-of-low-rank-density","title":"Optimal Estimation of Low Rank Density Matrices","date":"2015-07-17","arxiv_id":"1507.05131","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-local-convexity-of-solving-systems-of","title":"The local convexity of solving systems of quadratic equations","date":"2015-06-25","arxiv_id":"1506.07868","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularization-free-estimation-in-trace","title":"Regularization-free estimation in trace regression with symmetric positive semidefinite matrices","date":"2015-04-23","arxiv_id":"1504.06305","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rank-corrected-procedure-for-matrix","title":"A Rank-Corrected Procedure for Matrix Completion with Fixed Basis Coefficients","date":"2012-10-13","arxiv_id":"1210.3709","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-low-rank-matrix-recovery-from-pauli","title":"Universal low-rank matrix recovery from Pauli measurements","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":3,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/task/quantum-state-tomography/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/quantum-state-tomography/papers/ran/1","json":"/task/quantum-state-tomography/papers/ran/1.json","rows":3}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"e6dfc7a36bc4ea62d678533e9dd738220d76294080db349729e2174754a3b7f0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}