{"id":"https://openalex.org/W7141483402","doi":"https://doi.org/10.48550/arxiv.2603.25101","title":"T Count as a Numerically Solvable Minimization Problem","display_name":"T Count as a Numerically Solvable Minimization Problem","publication_year":2026,"publication_date":"2026-03-26","ids":{"openalex":"https://openalex.org/W7141483402","doi":"https://doi.org/10.48550/arxiv.2603.25101"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.25101","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25101","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.25101","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130727093","display_name":"Marc Grau Davis","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Davis, Marc Grau","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130730810","display_name":"Ed Younis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Younis, Ed","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078514308","display_name":"Mathias Weiden","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weiden, Mathias","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022044689","display_name":"Hyeongrak Choi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Choi, Hyeongrak","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130795466","display_name":"Dirk R. Englund","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Englund, Dirk","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5130727093"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9126999974250793,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9126999974250793,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.01889999955892563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.011900000274181366,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.7379999756813049},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.6790000200271606},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5964000225067139},{"id":"https://openalex.org/keywords/unitary-state","display_name":"Unitary state","score":0.4959999918937683},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.492900013923645},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.45249998569488525},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.34439998865127563}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7379999756813049},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.6790000200271606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6424000263214111},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5964000225067139},{"id":"https://openalex.org/C67820243","wikidata":"https://www.wikidata.org/wiki/Q179164","display_name":"Unitary state","level":2,"score":0.4959999918937683},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.492900013923645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47839999198913574},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.45249998569488525},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.34439998865127563},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3156999945640564},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3098999857902527},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.302700012922287},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C190560348","wikidata":"https://www.wikidata.org/wiki/Q3245116","display_name":"Circuit design","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2863999903202057},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.28600001335144043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.272599995136261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2612999975681305},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.25101","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25101","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.25101","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25101","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,40],"present":[1],"a":[2,16,20,24,49,103],"formulation":[3],"of":[4,7,26,46,52,58,91,96,105],"the":[5,9,56,59,88,100],"problem":[6],"finding":[8],"smallest":[10],"T":[11,89],"-Count":[12,90],"circuit":[13,74,101],"that":[14,32,62,73,108],"implements":[15],"given":[17],"unitary":[18],"as":[19],"binary":[21],"search":[22],"over":[23],"sequence":[25],"continuous":[27],"minimization":[28],"problems,":[29],"and":[30,54],"demonstrate":[31],"these":[33],"problems":[34],"are":[35],"numerically":[36],"solvable":[37],"in":[38,67],"practice.":[39],"reproduce":[41],"best-known":[42],"results":[43],"for":[44,66],"synthesis":[45],"circuits":[47,61,92],"with":[48,93],"small":[50],"number":[51],"qubits,":[53],"push":[55],"bounds":[57],"largest":[60],"can":[63,76,109],"be":[64,77,84,110],"solved":[65],"this":[68,81],"way.":[69],"Additionally,":[70],"we":[71],"show":[72],"partitioning":[75],"used":[78,85],"to":[79,83,86],"adapt":[80],"technique":[82],"optimize":[87],"large":[94],"numbers":[95],"qubits":[97],"by":[98],"breaking":[99],"into":[102],"series":[104],"smaller":[106],"sub-circuits":[107],"optimized":[111],"independently.":[112]},"counts_by_year":[],"updated_date":"2026-03-28T06:16:51.555046","created_date":"2026-03-28T00:00:00"}