Search | arXiv e-print repository

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"/> <meta name="viewport" content="width=device-width, initial-scale=1"/>  <link rel="apple-touch-icon" sizes="180x180" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon-16x16.png"> <link rel="manifest" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/site.webmanifest"> <link rel="mask-icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/safari-pinned-tab.svg" color="#b31b1b"> <link rel="shortcut icon" href="https://static.arxiv.org/static/base/1.0.0a5/images/icons/favicon.ico"> <meta name="msapplication-TileColor" content="#b31b1b"> <meta name="msapplication-config" content="images/icons/browserconfig.xml"> <meta name="theme-color" content="#b31b1b">  <title>Search | arXiv e-print repository</title> <script defer src="https://static.arxiv.org/static/base/1.0.0a5/fontawesome-free-5.11.2-web/js/all.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/base/1.0.0a5/css/arxivstyle.css" /> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ messageStyle: "none", extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], displayMath: [ ['$$','$$'], ["\\[","\\]"] ], processEscapes: true, ignoreClass: '.*', processClass: 'mathjax.*' }, TeX: { extensions: ["AMSmath.js", "AMSsymbols.js", "noErrors.js"], noErrors: { inlineDelimiters: ["$","$"], multiLine: false, style: { "font-size": "normal", "border": "" } } }, "HTML-CSS": { availableFonts: ["TeX"] } }); </script> <script src='//static.arxiv.org/MathJax-2.7.3/MathJax.js'></script> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/notification.js"></script> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/bulma-tooltip.min.css" /> <link rel="stylesheet" href="https://static.arxiv.org/static/search/0.5.6/css/search.css" /> <script src="https://code.jquery.com/jquery-3.2.1.slim.min.js" integrity="sha256-k2WSCIexGzOj3Euiig+TlR8gA0EmPjuc79OEeY5L45g=" crossorigin="anonymous"></script> <script src="https://static.arxiv.org/static/search/0.5.6/js/fieldset.js"></script> <style> radio#cf-customfield_11400 { display: none; } </style> </head> <body> <header><a href="#main-container" class="is-sr-only">Skip to main content</a>  <div class="attribution level is-marginless" role="banner"> <div class="level-left"> <a class="level-item" href="https://cornell.edu/"><img src="https://static.arxiv.org/static/base/1.0.0a5/images/cornell-reduced-white-SMALL.svg" alt="Cornell University" width="200" aria-label="logo" /></a> </div> <div class="level-right is-marginless"><p class="sponsors level-item is-marginless"><span id="support-ack-url">We gratefully acknowledge support from<br /> the Simons Foundation, <a href="https://info.arxiv.org/about/ourmembers.html">member institutions</a>, and all contributors. <a href="https://info.arxiv.org/about/donate.html">Donate</a></span></p></div> </div>  <div class="identity level is-marginless"> <div class="level-left"> <div class="level-item"> <a class="arxiv" href="https://arxiv.org/" aria-label="arxiv-logo"> <img src="https://static.arxiv.org/static/base/1.0.0a5/images/arxiv-logo-one-color-white.svg" aria-label="logo" alt="arxiv logo" width="85" style="width:85px;"/> </a> </div> </div> <div class="search-block level-right"> <form class="level-item mini-search" method="GET" action="https://arxiv.org/search"> <div class="field has-addons"> <div class="control"> <input class="input is-small" type="text" name="query" placeholder="Search..." aria-label="Search term or terms" /> <p class="help"><a href="https://info.arxiv.org/help">Help</a> | <a href="https://arxiv.org/search/advanced">Advanced Search</a></p> </div> <div class="control"> <div class="select is-small"> <select name="searchtype" aria-label="Field to search"> <option value="all" selected="selected">All fields</option> <option value="title">Title</option> <option value="author">Author</option> <option value="abstract">Abstract</option> <option value="comments">Comments</option> <option value="journal_ref">Journal reference</option> <option value="acm_class">ACM classification</option> <option value="msc_class">MSC classification</option> <option value="report_num">Report number</option> <option value="paper_id">arXiv identifier</option> <option value="doi">DOI</option> <option value="orcid">ORCID</option> <option value="author_id">arXiv author ID</option> <option value="help">Help pages</option> <option value="full_text">Full text</option> </select> </div> </div> <input type="hidden" name="source" value="header"> <button class="button is-small is-cul-darker">Search</button> </div> </form> </div> </div>  <div class="container"> <div class="user-tools is-size-7 has-text-right has-text-weight-bold" role="navigation" aria-label="User menu"> <a href="https://arxiv.org/login">Login</a> </div> </div> </header> <main class="container" id="main-container"> <div class="level is-marginless"> <div class="level-left"> <h1 class="title is-clearfix"> Showing 1–50 of 99 results for author: <span class="mathjax">Economou, S E</span> </h1> </div> <div class="level-right is-hidden-mobile">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> <div class="content"> <form method="GET" action="/search/quant-ph" aria-role="search"> Searching in archive <strong>quant-ph</strong>. <a href="/search/?searchtype=author&query=Economou%2C+S+E">Search in all archives.</a> <div class="field has-addons-tablet"> <div class="control is-expanded"> <label for="query" class="hidden-label">Search term or terms</label> <input class="input is-medium" id="query" name="query" placeholder="Search term..." type="text" value="Economou, S E"> </div> <div class="select control is-medium"> <label class="is-hidden" for="searchtype">Field</label> <select class="is-medium" id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> </div> <div class="control"> <button class="button is-link is-medium">Search</button> </div> </div> <div class="field"> <div class="control is-size-7"> <label class="radio"> <input checked id="abstracts-0" name="abstracts" type="radio" value="show"> Show abstracts </label> <label class="radio"> <input id="abstracts-1" name="abstracts" type="radio" value="hide"> Hide abstracts </label> </div> </div> <div class="is-clearfix" style="height: 2.5em"> <div class="is-pulled-right"> <a href="/search/advanced?terms-0-term=Economou%2C+S+E&terms-0-field=author&size=50&order=-announced_date_first">Advanced Search</a> </div> </div> <input type="hidden" name="order" value="-announced_date_first"> <input type="hidden" name="size" value="50"> </form> <div class="level breathe-horizontal"> <div class="level-left"> <form method="GET" action="/search/"> <div style="display: none;"> <select id="searchtype" name="searchtype"><option value="all">All fields</option><option value="title">Title</option><option selected value="author">Author(s)</option><option value="abstract">Abstract</option><option value="comments">Comments</option><option value="journal_ref">Journal reference</option><option value="acm_class">ACM classification</option><option value="msc_class">MSC classification</option><option value="report_num">Report number</option><option value="paper_id">arXiv identifier</option><option value="doi">DOI</option><option value="orcid">ORCID</option><option value="license">License (URI)</option><option value="author_id">arXiv author ID</option><option value="help">Help pages</option><option value="full_text">Full text</option></select> <input id="query" name="query" type="text" value="Economou, S E"> <ul id="abstracts"><li><input checked id="abstracts-0" name="abstracts" type="radio" value="show"> <label for="abstracts-0">Show abstracts</label></li><li><input id="abstracts-1" name="abstracts" type="radio" value="hide"> <label for="abstracts-1">Hide abstracts</label></li></ul> </div> <div class="box field is-grouped is-grouped-multiline level-item"> <div class="control"> <span class="select is-small"> <select id="size" name="size"><option value="25">25</option><option selected value="50">50</option><option value="100">100</option><option value="200">200</option></select> </span> <label for="size">results per page</label>. </div> <div class="control"> <label for="order">Sort results by</label> <span class="select is-small"> <select id="order" name="order"><option selected value="-announced_date_first">Announcement date (newest first)</option><option value="announced_date_first">Announcement date (oldest first)</option><option value="-submitted_date">Submission date (newest first)</option><option value="submitted_date">Submission date (oldest first)</option><option value="">Relevance</option></select> </span> </div> <div class="control"> <button class="button is-small is-link">Go</button> </div> </div> </form> </div> </div> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Economou%2C+S+E&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Economou%2C+S+E&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Economou%2C+S+E&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> </ul> </nav> <ol class="breathe-horizontal" start="1"> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.09736">arXiv:2411.09736</a> <span> [<a href="https://arxiv.org/pdf/2411.09736">pdf</a>, <a href="https://arxiv.org/format/2411.09736">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Non-Variational ADAPT algorithm for quantum simulations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Tang%2C+H+L">Ho Lun Tang</a>, <a href="/search/quant-ph?searchtype=author&query=Chen%2C+Y">Yanzhu Chen</a>, <a href="/search/quant-ph?searchtype=author&query=Biswas%2C+P">Prakriti Biswas</a>, <a href="/search/quant-ph?searchtype=author&query=Magann%2C+A+B">Alicia B. Magann</a>, <a href="/search/quant-ph?searchtype=author&query=Arenz%2C+C">Christian Arenz</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.09736v1-abstract-short" style="display: inline;"> We explore a non-variational quantum state preparation approach combined with the ADAPT operator selection strategy in the application of preparing the ground state of a desired target Hamiltonian. In this algorithm, energy gradient measurements determine both the operators and the gate parameters in the quantum circuit construction. We compare this non-variational algorithm with ADAPT-VQE and wit… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.09736v1-abstract-full').style.display = 'inline'; document.getElementById('2411.09736v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.09736v1-abstract-full" style="display: none;"> We explore a non-variational quantum state preparation approach combined with the ADAPT operator selection strategy in the application of preparing the ground state of a desired target Hamiltonian. In this algorithm, energy gradient measurements determine both the operators and the gate parameters in the quantum circuit construction. We compare this non-variational algorithm with ADAPT-VQE and with feedback-based quantum algorithms in terms of the rate of energy reduction, the circuit depth, and the measurement cost in molecular simulation. We find that despite using deeper circuits, this new algorithm reaches chemical accuracy at a similar measurement cost to ADAPT-VQE. Since it does not rely on a classical optimization subroutine, it may provide robustness against circuit parameter errors due to imperfect control or gate synthesis. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.09736v1-abstract-full').style.display = 'none'; document.getElementById('2411.09736v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 pages, 8 figures. Comments are welcome</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2411.07920">arXiv:2411.07920</a> <span> [<a href="https://arxiv.org/pdf/2411.07920">pdf</a>, <a href="https://arxiv.org/format/2411.07920">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Chemical Physics">physics.chem-ph</span> </div> </div> <p class="title is-5 mathjax"> Classical Pre-optimization Approach for ADAPT-VQE: Maximizing the Potential of High-Performance Computing Resources to Improve Quantum Simulation of Chemical Applications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Mullinax%2C+J+W">J. Wayne Mullinax</a>, <a href="/search/quant-ph?searchtype=author&query=Anastasiou%2C+P+G">Panagiotis G. Anastasiou</a>, <a href="/search/quant-ph?searchtype=author&query=Larson%2C+J">Jeffrey Larson</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Tubman%2C+N+M">Norm M. Tubman</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2411.07920v1-abstract-short" style="display: inline;"> The ADAPT-VQE algorithm is a promising method for generating a compact ansatz based on derivatives of the underlying cost function, and it yields accurate predictions of electronic energies for molecules. In this work we report the implementation and performance of ADAPT-VQE with our recently developed sparse wavefunction circuit solver (SWCS) in terms of accuracy and efficiency for molecular syst… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.07920v1-abstract-full').style.display = 'inline'; document.getElementById('2411.07920v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2411.07920v1-abstract-full" style="display: none;"> The ADAPT-VQE algorithm is a promising method for generating a compact ansatz based on derivatives of the underlying cost function, and it yields accurate predictions of electronic energies for molecules. In this work we report the implementation and performance of ADAPT-VQE with our recently developed sparse wavefunction circuit solver (SWCS) in terms of accuracy and efficiency for molecular systems with up to 52 spin-orbitals. The SWCS can be tuned to balance computational cost and accuracy, which extends the application of ADAPT-VQE for molecular electronic structure calculations to larger basis sets and larger number of qubits. Using this tunable feature of the SWCS, we propose an alternative optimization procedure for ADAPT-VQE to reduce the computational cost of the optimization. By pre-optimizing a quantum simulation with a parameterized ansatz generated with ADAPT-VQE/SWCS, we aim to utilize the power of classical high-performance computing in order to minimize the work required on noisy intermediate-scale quantum hardware, which offers a promising path toward demonstrating quantum advantage for chemical applications. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2411.07920v1-abstract-full').style.display = 'none'; document.getElementById('2411.07920v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">12 pages, 6 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2408.12641">arXiv:2408.12641</a> <span> [<a href="https://arxiv.org/pdf/2408.12641">pdf</a>, <a href="https://arxiv.org/format/2408.12641">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="High Energy Physics - Lattice">hep-lat</span> </div> </div> <p class="title is-5 mathjax"> Surrogate Constructed Scalable Circuits ADAPT-VQE in the Schwinger model </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Gustafson%2C+E">Erik Gustafson</a>, <a href="/search/quant-ph?searchtype=author&query=Sherbert%2C+K">Kyle Sherbert</a>, <a href="/search/quant-ph?searchtype=author&query=Florio%2C+A">Adrien Florio</a>, <a href="/search/quant-ph?searchtype=author&query=Shirali%2C+K">Karunya Shirali</a>, <a href="/search/quant-ph?searchtype=author&query=Chen%2C+Y">Yanzhu Chen</a>, <a href="/search/quant-ph?searchtype=author&query=Lamm%2C+H">Henry Lamm</a>, <a href="/search/quant-ph?searchtype=author&query=Valgushev%2C+S">Semeon Valgushev</a>, <a href="/search/quant-ph?searchtype=author&query=Weichselbaum%2C+A">Andreas Weichselbaum</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Pisarski%2C+R+D">Robert D. Pisarski</a>, <a href="/search/quant-ph?searchtype=author&query=Tubman%2C+N+M">Norm M. Tubman</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2408.12641v1-abstract-short" style="display: inline;"> Inspired by recent advancements of simulating periodic systems on quantum computers, we develop a new approach, (SC)$^2$-ADAPT-VQE, to further advance the simulation of these systems. Our approach extends the scalable circuits ADAPT-VQE framework, which builds an ansatz from a pool of coordinate-invariant operators defined for arbitrarily large, though not arbitrarily small, volumes. Our method us… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.12641v1-abstract-full').style.display = 'inline'; document.getElementById('2408.12641v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2408.12641v1-abstract-full" style="display: none;"> Inspired by recent advancements of simulating periodic systems on quantum computers, we develop a new approach, (SC)$^2$-ADAPT-VQE, to further advance the simulation of these systems. Our approach extends the scalable circuits ADAPT-VQE framework, which builds an ansatz from a pool of coordinate-invariant operators defined for arbitrarily large, though not arbitrarily small, volumes. Our method uses a classically tractable ``Surrogate Constructed'' method to remove irrelevant operators from the pool, reducing the minimum size for which the scalable circuits are defined. Bringing together the scalable circuits and the surrogate constructed approaches forms the core of the (SC)$^2$ methodology. Our approach allows for a wider set of classical computations, on small volumes, which can be used for a more robust extrapolation protocol. While developed in the context of lattice models, the surrogate construction portion is applicable to a wide variety of problems where information about the relative importance of operators in the pool is available. As an example, we use it to compute properties of the Schwinger model - quantum electrodynamics for a single, massive fermion in $1+1$ dimensions - and show that our method can be used to accurately extrapolate to the continuum limit. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.12641v1-abstract-full').style.display = 'none'; document.getElementById('2408.12641v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 August, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 pages, 6 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> FERMILAB-PUB-24-0456-SQMS-T </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2408.00218">arXiv:2408.00218</a> <span> [<a href="https://arxiv.org/pdf/2408.00218">pdf</a>, <a href="https://arxiv.org/format/2408.00218">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Adaptive Quantum Generative Training using an Unbounded Loss Function </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Sherbert%2C+K">Kyle Sherbert</a>, <a href="/search/quant-ph?searchtype=author&query=Furches%2C+J">Jim Furches</a>, <a href="/search/quant-ph?searchtype=author&query=Shirali%2C+K">Karunya Shirali</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Marrero%2C+C+O">Carlos Ortiz Marrero</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2408.00218v1-abstract-short" style="display: inline;"> We propose a generative quantum learning algorithm, R茅nyi-ADAPT, using the Adaptive Derivative-Assembled Problem Tailored ansatz (ADAPT) framework in which the loss function to be minimized is the maximal quantum R茅nyi divergence of order two, an unbounded function that mitigates barren plateaus which inhibit training variational circuits. We benchmark this method against other state-of-the-art ad… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.00218v1-abstract-full').style.display = 'inline'; document.getElementById('2408.00218v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2408.00218v1-abstract-full" style="display: none;"> We propose a generative quantum learning algorithm, R茅nyi-ADAPT, using the Adaptive Derivative-Assembled Problem Tailored ansatz (ADAPT) framework in which the loss function to be minimized is the maximal quantum R茅nyi divergence of order two, an unbounded function that mitigates barren plateaus which inhibit training variational circuits. We benchmark this method against other state-of-the-art adaptive algorithms by learning random two-local thermal states. We perform numerical experiments on systems of up to 12 qubits, comparing our method to learning algorithms that use linear objective functions, and show that R茅nyi-ADAPT is capable of constructing shallow quantum circuits competitive with existing methods, while the gradients remain favorable resulting from the maximal R茅nyi divergence loss function. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2408.00218v1-abstract-full').style.display = 'none'; document.getElementById('2408.00218v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 31 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> DE-SC0012704, PNNL-SA-198421 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2407.15777">arXiv:2407.15777</a> <span> [<a href="https://arxiv.org/pdf/2407.15777">pdf</a>, <a href="https://arxiv.org/format/2407.15777">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Optimization complexity and resource minimization of emitter-based photonic graph state generation protocols </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Takou%2C+E">Evangelia Takou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2407.15777v1-abstract-short" style="display: inline;"> Photonic graph states are important for measurement- and fusion-based quantum computing, quantum networks, and sensing. They can in principle be generated deterministically by using emitters to create the requisite entanglement. Finding ways to minimize the number of entangling gates between emitters and understanding the overall optimization complexity of such protocols is crucial for practical i… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.15777v1-abstract-full').style.display = 'inline'; document.getElementById('2407.15777v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2407.15777v1-abstract-full" style="display: none;"> Photonic graph states are important for measurement- and fusion-based quantum computing, quantum networks, and sensing. They can in principle be generated deterministically by using emitters to create the requisite entanglement. Finding ways to minimize the number of entangling gates between emitters and understanding the overall optimization complexity of such protocols is crucial for practical implementations. Here, we address these issues using graph theory concepts. We develop optimizers that minimize the number of entangling gates, reducing them by up to 75$\%$ compared to naive schemes for moderately sized random graphs. While the complexity of optimizing emitter-emitter CNOT counts is likely NP-hard, we are able to develop heuristics based on strong connections between graph transformations and the optimization of stabilizer circuits. These patterns allow us to process large graphs and still achieve a reduction of up to $66\%$ in emitter CNOTs, without relying on subtle metrics such as edge density. We find the optimal emission orderings and circuits to prepare unencoded and encoded repeater graph states of any size, achieving global minimization of emitter and CNOT resources despite the average NP-hardness of both optimization problems. We further study the locally equivalent orbit of graphs. Although enumerating orbits is $\#$P complete for arbitrary graphs, we analytically calculate the size of the orbit of repeater graphs and find a procedure to generate the orbit for any repeater size. Finally, we inspect the entangling gate cost of preparing any graph from a given orbit and show that we can achieve the same optimal CNOT count across the orbit. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.15777v1-abstract-full').style.display = 'none'; document.getElementById('2407.15777v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">41 pages, 29 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2407.08696">arXiv:2407.08696</a> <span> [<a href="https://arxiv.org/pdf/2407.08696">pdf</a>, <a href="https://arxiv.org/format/2407.08696">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ram%C3%B4a%2C+M">Mafalda Ram么a</a>, <a href="/search/quant-ph?searchtype=author&query=Anastasiou%2C+P+G">Panagiotis G. Anastasiou</a>, <a href="/search/quant-ph?searchtype=author&query=Santos%2C+L+P">Luis Paulo Santos</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2407.08696v1-abstract-short" style="display: inline;"> Adaptive variational quantum algorithms arguably offer the best prospects for quantum advantage in the NISQ era. Since the inception of the first such algorithm, ADAPT-VQE, many improvements have appeared in the literature. We combine the key improvements along with a novel operator pool -- which we term Coupled Exchange Operator (CEO) pool -- to assess the cost of running state-of-the-art ADAPT-V… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.08696v1-abstract-full').style.display = 'inline'; document.getElementById('2407.08696v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2407.08696v1-abstract-full" style="display: none;"> Adaptive variational quantum algorithms arguably offer the best prospects for quantum advantage in the NISQ era. Since the inception of the first such algorithm, ADAPT-VQE, many improvements have appeared in the literature. We combine the key improvements along with a novel operator pool -- which we term Coupled Exchange Operator (CEO) pool -- to assess the cost of running state-of-the-art ADAPT-VQE on hardware in terms of measurement counts and circuit depth. We show a dramatic reduction of these quantum resources compared to the early versions of the algorithm. We also find that our state-of-the-art CEO-ADAPT-VQE outperforms UCCSD, the most widely regarded static VQE ansatz, in all relevant metrics. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2407.08696v1-abstract-full').style.display = 'none'; document.getElementById('2407.08696v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 July, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2024. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2406.10913">arXiv:2406.10913</a> <span> [<a href="https://arxiv.org/pdf/2406.10913">pdf</a>, <a href="https://arxiv.org/format/2406.10913">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Minimal evolution times for fast, pulse-based state preparation in silicon spin qubits </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Long%2C+C+K">Christopher K. Long</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+C+H+W">Crispin H. W. Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Martins%2C+F">Frederico Martins</a>, <a href="/search/quant-ph?searchtype=author&query=Arvidsson-Shukur%2C+D+R+M">David R. M. Arvidsson-Shukur</a>, <a href="/search/quant-ph?searchtype=author&query=Mertig%2C+N">Normann Mertig</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2406.10913v1-abstract-short" style="display: inline;"> Standing as one of the most significant barriers to reaching quantum advantage, state-preparation fidelities on noisy intermediate-scale quantum processors suffer from quantum-gate errors, which accumulate over time. A potential remedy is pulse-based state preparation. We numerically investigate the minimal evolution times (METs) attainable by optimizing (microwave and exchange) pulses on silicon… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2406.10913v1-abstract-full').style.display = 'inline'; document.getElementById('2406.10913v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2406.10913v1-abstract-full" style="display: none;"> Standing as one of the most significant barriers to reaching quantum advantage, state-preparation fidelities on noisy intermediate-scale quantum processors suffer from quantum-gate errors, which accumulate over time. A potential remedy is pulse-based state preparation. We numerically investigate the minimal evolution times (METs) attainable by optimizing (microwave and exchange) pulses on silicon hardware. We investigate two state preparation tasks. First, we consider the preparation of molecular ground states and find the METs for H$_2$, HeH$^+$, and LiH to be 2.4 ns, 4.4 ns, and 27.2 ns, respectively. Second, we consider transitions between arbitrary states and find the METs for transitions between arbitrary four-qubit states to be below 50 ns. For comparison, connecting arbitrary two-qubit states via one- and two-qubit gates on the same silicon processor requires approximately 200 ns. This comparison indicates that pulse-based state preparation is likely to utilize the coherence times of silicon hardware more efficiently than gate-based state preparation. Finally, we quantify the effect of silicon device parameters on the MET. We show that increasing the maximal exchange amplitude from 10 MHz to 1 GHz accelerates the METs, e.g., for H$_2$ from 84.3 ns to 2.4 ns. This demonstrates the importance of fast exchange. We also show that increasing the maximal amplitude of the microwave drive from 884 kHz to 56.6 MHz shortens state transitions, e.g., for two-qubit states from 1000 ns to 25 ns. Our results bound both the state-preparation times for general quantum algorithms and the execution times of variational quantum algorithms with silicon spin qubits. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2406.10913v1-abstract-full').style.display = 'none'; document.getElementById('2406.10913v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 16 June, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 + (7) pages, 6 figs, comments are welcomed</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2405.15166">arXiv:2405.15166</a> <span> [<a href="https://arxiv.org/pdf/2405.15166">pdf</a>, <a href="https://arxiv.org/format/2405.15166">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Parameterization and optimizability of pulse-level VQEs </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Sherbert%2C+K+M">Kyle M Sherbert</a>, <a href="/search/quant-ph?searchtype=author&query=Amer%2C+H">Hisham Amer</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J Mayhall</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2405.15166v1-abstract-short" style="display: inline;"> In conventional variational quantum eigensolvers (VQEs), trial states are prepared by applying series of parameterized gates to a reference state, with the gate parameters being varied to minimize the energy of the target system. Recognizing that the gates are intermediates which are ultimately compiled into a set of control pulses to be applied to each qubit in the lab, the recently proposed ctrl… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.15166v1-abstract-full').style.display = 'inline'; document.getElementById('2405.15166v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2405.15166v1-abstract-full" style="display: none;"> In conventional variational quantum eigensolvers (VQEs), trial states are prepared by applying series of parameterized gates to a reference state, with the gate parameters being varied to minimize the energy of the target system. Recognizing that the gates are intermediates which are ultimately compiled into a set of control pulses to be applied to each qubit in the lab, the recently proposed ctrl-VQE algorithm takes the amplitudes, frequencies, and phases of the pulse as the variational parameters used to minimize the molecular energy. In this work, we explore how all three degrees of freedom interrelate with one another. To this end, we consider several distinct strategies to parameterize the control pulses, assessing each one through numerical simulations of a transmon-like device. For each parameterization, we contrast the pulse duration required to prepare a good ansatz, and the difficulty to optimize that ansatz from a well-defined initial state. We deduce several guiding heuristics to implement practical ctrl-VQE in hardware, which we anticipate will generalize for generic device architectures. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.15166v1-abstract-full').style.display = 'none'; document.getElementById('2405.15166v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 pages (10 of main text), 6 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2405.10778">arXiv:2405.10778</a> <span> [<a href="https://arxiv.org/pdf/2405.10778">pdf</a>, <a href="https://arxiv.org/format/2405.10778">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> High-throughput assessment of defect-nuclear spin register controllability for quantum memory applications </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Dakis%2C+F">Filippos Dakis</a>, <a href="/search/quant-ph?searchtype=author&query=Takou%2C+E">Evangelia Takou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2405.10778v2-abstract-short" style="display: inline;"> Quantum memories play a key role in facilitating tasks within quantum networks and quantum information processing, including secure communications, advanced quantum sensing, and distributed quantum computing. Progress in characterizing large nuclear spin registers coupled to defect electronic spins has been significant, but selecting memory qubits remains challenging due to the multitude of possib… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.10778v2-abstract-full').style.display = 'inline'; document.getElementById('2405.10778v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2405.10778v2-abstract-full" style="display: none;"> Quantum memories play a key role in facilitating tasks within quantum networks and quantum information processing, including secure communications, advanced quantum sensing, and distributed quantum computing. Progress in characterizing large nuclear spin registers coupled to defect electronic spins has been significant, but selecting memory qubits remains challenging due to the multitude of possible assignments. Numerical simulations for evaluating entangling gate fidelities encounter obstacles, restricting research to small registers, while experimental investigations are time-consuming and often limited to well-understood samples. Here we present an efficient methodology for systematically assessing the controllability of defect systems coupled to nuclear spin registers. We showcase the approach by investigating the generation of entanglement links between defects in SiC and randomly selected sets of nuclear spins within the two-species ($^{13}$C and $^{29}$Si) nuclear register. We quantify the performance of entangling gate operations and present the achievable gate fidelities, considering both the size of the register and the presence of unwanted nuclear spins. We find that some control sequences perform better than others depending on the number of target versus bath nuclei. This efficient approach is a guide for both experimental investigation and engineering, facilitating the high-throughput exploration of suitable defect systems for quantum memories. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2405.10778v2-abstract-full').style.display = 'none'; document.getElementById('2405.10778v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 17 May, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">15 pages, 7 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2401.05172">arXiv:2401.05172</a> <span> [<a href="https://arxiv.org/pdf/2401.05172">pdf</a>, <a href="https://arxiv.org/format/2401.05172">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1088/2058-9565/ad904e">10.1088/2058-9565/ad904e <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ram%C3%B4a%2C+M">Mafalda Ram么a</a>, <a href="/search/quant-ph?searchtype=author&query=Santos%2C+L+P">Luis Paulo Santos</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2401.05172v2-abstract-short" style="display: inline;"> Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with ADAPT-VQE, an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variation… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.05172v2-abstract-full').style.display = 'inline'; document.getElementById('2401.05172v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2401.05172v2-abstract-full" style="display: none;"> Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with ADAPT-VQE, an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the Hessian in the state of the optimizer to better approximate the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2401.05172v2-abstract-full').style.display = 'none'; document.getElementById('2401.05172v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 November, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 January, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Quantum Sci. Technol. 10 (2024) 015031 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2310.09694">arXiv:2310.09694</a> <span> [<a href="https://arxiv.org/pdf/2310.09694">pdf</a>, <a href="https://arxiv.org/format/2310.09694">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> ADAPT-QAOA with a classically inspired initial state </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Sridhar%2C+V+K">Vishvesha K. Sridhar</a>, <a href="/search/quant-ph?searchtype=author&query=Chen%2C+Y">Yanzhu Chen</a>, <a href="/search/quant-ph?searchtype=author&query=Gard%2C+B">Bryan Gard</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2310.09694v1-abstract-short" style="display: inline;"> Quantum computing may provide advantage in solving classical optimization problems. One promising algorithm is the quantum approximate optimization algorithm (QAOA). There have been many proposals for improving this algorithm, such as using an initial state informed by classical approximation solutions. A variation of QAOA called ADAPT-QAOA constructs the ansatz dynamically and can speed up conver… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2310.09694v1-abstract-full').style.display = 'inline'; document.getElementById('2310.09694v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2310.09694v1-abstract-full" style="display: none;"> Quantum computing may provide advantage in solving classical optimization problems. One promising algorithm is the quantum approximate optimization algorithm (QAOA). There have been many proposals for improving this algorithm, such as using an initial state informed by classical approximation solutions. A variation of QAOA called ADAPT-QAOA constructs the ansatz dynamically and can speed up convergence. However, it faces the challenge of frequently converging to excited states which correspond to local minima in the energy landscape, limiting its performance. In this work, we propose to start ADAPT-QAOA with an initial state inspired by a classical approximation algorithm. Through numerical simulations we show that this new algorithm can reach the same accuracy with fewer layers than the standard QAOA and the original ADAPT-QAOA. It also appears to be less prone to the problem of converging to excited states. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2310.09694v1-abstract-full').style.display = 'none'; document.getElementById('2310.09694v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 October, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 pages, 8 figures. Comments are welcome</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2308.09035">arXiv:2308.09035</a> <span> [<a href="https://arxiv.org/pdf/2308.09035">pdf</a>, <a href="https://arxiv.org/format/2308.09035">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Protocol for nearly deterministic parity projection on two photonic qubits </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Liu%2C+C">Chenxu Liu</a>, <a href="/search/quant-ph?searchtype=author&query=Frantzeskakis%2C+R">Rafail Frantzeskakis</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2308.09035v2-abstract-short" style="display: inline;"> Photonic parity projection plays a significant role in photonic quantum information processing. Non-destructive parity projections normally require high-fidelity Controlled-Z gates between photonic and matter qubits, which can be experimentally demanding. In this paper, we propose a nearly deterministic parity projection protocol on two photonic qubits which only requires stable matter-photon Cont… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.09035v2-abstract-full').style.display = 'inline'; document.getElementById('2308.09035v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2308.09035v2-abstract-full" style="display: none;"> Photonic parity projection plays a significant role in photonic quantum information processing. Non-destructive parity projections normally require high-fidelity Controlled-Z gates between photonic and matter qubits, which can be experimentally demanding. In this paper, we propose a nearly deterministic parity projection protocol on two photonic qubits which only requires stable matter-photon Controlled-Phase gates. The fact that our protocol does not require perfect Controlled-Z gates makes it more amenable to experimental implementation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2308.09035v2-abstract-full').style.display = 'none'; document.getElementById('2308.09035v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 17 August, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">12+6 pages, 11 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2307.13523">arXiv:2307.13523</a> <span> [<a href="https://arxiv.org/pdf/2307.13523">pdf</a>, <a href="https://arxiv.org/format/2307.13523">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Long-distance photon-mediated and short-distance entangling gates in three-qubit quantum dot spin systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Estakhri%2C+N+M">Nooshin M. Estakhri</a>, <a href="/search/quant-ph?searchtype=author&query=Warren%2C+A">Ada Warren</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2307.13523v1-abstract-short" style="display: inline;"> Superconducting microwave resonator couplers will likely become an essential component in modular semiconductor quantum dot (QD) spin qubit processors, as they help alleviate cross-talk and wiring issues as the number of qubits increases. Here, we focus on a three-qubit system composed of two modules: a two-electron triple QD resonator-coupled to a single-electron double QD. Using a combination of… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.13523v1-abstract-full').style.display = 'inline'; document.getElementById('2307.13523v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2307.13523v1-abstract-full" style="display: none;"> Superconducting microwave resonator couplers will likely become an essential component in modular semiconductor quantum dot (QD) spin qubit processors, as they help alleviate cross-talk and wiring issues as the number of qubits increases. Here, we focus on a three-qubit system composed of two modules: a two-electron triple QD resonator-coupled to a single-electron double QD. Using a combination of analytical techniques and numerical results, we derive an effective Hamiltonian that describes the three-qubit logical subspace and show that it accurately captures the dynamics of the system. We examine the performance of short-range and long-range entangling gates, revealing the effect of a spectator qubit in reducing the gate fidelities in both cases. We further study the competition between non-adiabatic errors and spectator-associated errors in short-range operations and quantify their relative importance across practical parameter ranges for short and long gate times. We also analyze the impact of charge noise together with residual coupling to the spectator qubit on inter-module entangling gates and find that for current experimental settings, leakage errors are the main source of infidelities in these operations. Our results help pave the way toward identifying optimal modular QD architectures for quantum information processing on semiconductor chips. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2307.13523v1-abstract-full').style.display = 'none'; document.getElementById('2307.13523v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 25 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18 pages, 5 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2306.03227">arXiv:2306.03227</a> <span> [<a href="https://arxiv.org/pdf/2306.03227">pdf</a>, <a href="https://arxiv.org/format/2306.03227">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> How to really measure operator gradients in ADAPT-VQE </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Anastasiou%2C+P+G">Panagiotis G. Anastasiou</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2306.03227v2-abstract-short" style="display: inline;"> ADAPT-VQE is one of the leading VQE algorithms which circumvents the choice-of-ansatz conundrum by iteratively growing compact and arbitrarily accurate problem-tailored ans盲tze. However, for hardware-efficient operator pools, the gradient-measurement step of the algorithm requires the estimation of $O(N^8)$ observables, which may represent a bottleneck for relevant system sizes on real devices. We… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.03227v2-abstract-full').style.display = 'inline'; document.getElementById('2306.03227v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2306.03227v2-abstract-full" style="display: none;"> ADAPT-VQE is one of the leading VQE algorithms which circumvents the choice-of-ansatz conundrum by iteratively growing compact and arbitrarily accurate problem-tailored ans盲tze. However, for hardware-efficient operator pools, the gradient-measurement step of the algorithm requires the estimation of $O(N^8)$ observables, which may represent a bottleneck for relevant system sizes on real devices. We present an efficient strategy for measuring the pool gradients based on simultaneously measuring commuting observables. We argue that our approach is relatively robust to shot-noise effects, and show that measuring the pool gradients is in fact only $O(N)$ times as expensive as a naive VQE iteration. Our proposed measurement strategy significantly ameliorates the measurement overhead of ADAPT-VQE and brings us one step closer to practical implementations on real devices. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2306.03227v2-abstract-full').style.display = 'none'; document.getElementById('2306.03227v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 September, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 5 June, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages, 2 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2303.00893">arXiv:2303.00893</a> <span> [<a href="https://arxiv.org/pdf/2303.00893">pdf</a>, <a href="https://arxiv.org/format/2303.00893">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Mesoscale and Nanoscale Physics">cond-mat.mes-hall</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevB.108.075302">10.1103/PhysRevB.108.075302 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Time-crystalline behavior in central-spin models with Heisenberg interactions </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Frantzeskakis%2C+R">Rafail Frantzeskakis</a>, <a href="/search/quant-ph?searchtype=author&query=Van+Dyke%2C+J">John Van Dyke</a>, <a href="/search/quant-ph?searchtype=author&query=Zaporski%2C+L">Leon Zaporski</a>, <a href="/search/quant-ph?searchtype=author&query=Gangloff%2C+D+A">Dorian A. Gangloff</a>, <a href="/search/quant-ph?searchtype=author&query=Gall%2C+C+L">Claire Le Gall</a>, <a href="/search/quant-ph?searchtype=author&query=Atat%C3%BCre%2C+M">Mete Atat眉re</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2303.00893v2-abstract-short" style="display: inline;"> Time-crystalline behavior has been predicted and observed in quantum central-spin systems with periodic driving and Ising interactions. Here, we theoretically show that it can also arise in central-spin systems with Heisenberg interactions. We present two methods to achieve this: application of a sufficiently large Zeeman splitting on the central spin compared to the satellite spins, or else by ap… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2303.00893v2-abstract-full').style.display = 'inline'; document.getElementById('2303.00893v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2303.00893v2-abstract-full" style="display: none;"> Time-crystalline behavior has been predicted and observed in quantum central-spin systems with periodic driving and Ising interactions. Here, we theoretically show that it can also arise in central-spin systems with Heisenberg interactions. We present two methods to achieve this: application of a sufficiently large Zeeman splitting on the central spin compared to the satellite spins, or else by applying additional pulses to the central spin every Floquet period. In both cases, we show that the system exhibits a subharmonic response in spin magnetizations in the presence of disorder for both pure Heisenberg and XXZ interactions. Our results pertain to any XXZ central-spin system, including hyperfine-coupled electron-nuclear systems in quantum dots or color centers. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2303.00893v2-abstract-full').style.display = 'none'; document.getElementById('2303.00893v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 11 October, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 1 March, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">20 pages, 18 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. B 108, 075302 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2302.07908">arXiv:2302.07908</a> <span> [<a href="https://arxiv.org/pdf/2302.07908">pdf</a>, <a href="https://arxiv.org/format/2302.07908">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Linear optical logical Bell state measurements with optimal loss-tolerance threshold </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">Paul Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Castor%2C+Y">Yaron Castor</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Grosshans%2C+F">Fr茅d茅ric Grosshans</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2302.07908v2-abstract-short" style="display: inline;"> Quantum threshold theorems impose hard limits on the hardware capabilities to process quantum information. We derive tight and fundamental upper bounds to loss-tolerance thresholds in different linear-optical quantum information processing settings through an adversarial framework, taking into account the intrinsically probabilistic nature of linear optical Bell measurements. For logical Bell stat… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2302.07908v2-abstract-full').style.display = 'inline'; document.getElementById('2302.07908v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2302.07908v2-abstract-full" style="display: none;"> Quantum threshold theorems impose hard limits on the hardware capabilities to process quantum information. We derive tight and fundamental upper bounds to loss-tolerance thresholds in different linear-optical quantum information processing settings through an adversarial framework, taking into account the intrinsically probabilistic nature of linear optical Bell measurements. For logical Bell state measurements - ubiquitous operations in photonic quantum information - we demonstrate analytically that linear optics can achieve the fundamental loss threshold imposed by the no-cloning theorem even though, following the work of Lee et al., (Phys. Rev. A 100, 052303 (2019)), the constraint was widely assumed to be stricter. We spotlight the assumptions of the latter publication and find their bound holds for a logical Bell measurement built from adaptive physical linear-optical Bell measurements. We also give an explicit even stricter bound for non-adaptive Bell measurements. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2302.07908v2-abstract-full').style.display = 'none'; document.getElementById('2302.07908v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 22 May, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 15 February, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">17pages, 14 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2302.05580">arXiv:2302.05580</a> <span> [<a href="https://arxiv.org/pdf/2302.05580">pdf</a>, <a href="https://arxiv.org/format/2302.05580">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.22331/q-2024-03-28-1304">10.22331/q-2024-03-28-1304 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Generation of genuine all-way entanglement in defect-nuclear spin systems through dynamical decoupling sequences </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Takou%2C+E">Evangelia Takou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2302.05580v3-abstract-short" style="display: inline;"> Multipartite entangled states are an essential resource for sensing, quantum error correction, and cryptography. Color centers in solids are one of the leading platforms for quantum networking due to the availability of a nuclear spin memory that can be entangled with the optically active electronic spin through dynamical decoupling sequences. Creating electron-nuclear entangled states in these sy… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2302.05580v3-abstract-full').style.display = 'inline'; document.getElementById('2302.05580v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2302.05580v3-abstract-full" style="display: none;"> Multipartite entangled states are an essential resource for sensing, quantum error correction, and cryptography. Color centers in solids are one of the leading platforms for quantum networking due to the availability of a nuclear spin memory that can be entangled with the optically active electronic spin through dynamical decoupling sequences. Creating electron-nuclear entangled states in these systems is a difficult task as the always-on hyperfine interactions prohibit complete isolation of the target dynamics from the unwanted spin bath. While this emergent cross-talk can be alleviated by prolonging the entanglement generation, the gate durations quickly exceed coherence times. Here we show how to prepare high-quality GHZ$_M$-like states with minimal cross-talk. We introduce the $M$-tangling power of an evolution operator, which allows us to verify genuine all-way correlations. Using experimentally measured hyperfine parameters of an NV center spin in diamond coupled to carbon-13 lattice spins, we show how to use sequential or single-shot entangling operations to prepare GHZ$_M$-like states of up to $M=10$ qubits within time constraints that saturate bounds on $M$-way correlations. We study the entanglement of mixed electron-nuclear states and develop a non-unitary $M$-tangling power which additionally captures correlations arising from all unwanted nuclear spins. We further derive a non-unitary $M$-tangling power which incorporates the impact of electronic dephasing errors on the $M$-way correlations. Finally, we inspect the performance of our protocols in the presence of experimentally reported pulse errors, finding that XY decoupling sequences can lead to high-fidelity GHZ state preparation. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2302.05580v3-abstract-full').style.display = 'none'; document.getElementById('2302.05580v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 March, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 February, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">43 pages, 18 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Quantum 8, 1304 (2024) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2301.04201">arXiv:2301.04201</a> <span> [<a href="https://arxiv.org/pdf/2301.04201">pdf</a>, <a href="https://arxiv.org/format/2301.04201">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevResearch.5.033227">10.1103/PhysRevResearch.5.033227 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Randomized adaptive quantum state preparation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Magann%2C+A+B">Alicia B. Magann</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Arenz%2C+C">Christian Arenz</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2301.04201v2-abstract-short" style="display: inline;"> We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit, where each adaptive step is informed by feedback from gradient measurements in which the associated tangent space d… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2301.04201v2-abstract-full').style.display = 'inline'; document.getElementById('2301.04201v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2301.04201v2-abstract-full" style="display: none;"> We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit, where each adaptive step is informed by feedback from gradient measurements in which the associated tangent space directions are randomized. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states. We investigate different randomization procedures and develop lower bounds on the expected cost function change, which allows for drawing connections to barren plateaus and for assessing the applicability of the algorithm to large-scale problems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2301.04201v2-abstract-full').style.display = 'none'; document.getElementById('2301.04201v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 October, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 January, 2023; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2023. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. Research 5, 033227 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2212.10820">arXiv:2212.10820</a> <span> [<a href="https://arxiv.org/pdf/2212.10820">pdf</a>, <a href="https://arxiv.org/format/2212.10820">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/RevModPhys.95.045006">10.1103/RevModPhys.95.045006 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Quantum repeaters: From quantum networks to the quantum internet </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Azuma%2C+K">Koji Azuma</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Elkouss%2C+D">David Elkouss</a>, <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">Paul Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Jiang%2C+L">Liang Jiang</a>, <a href="/search/quant-ph?searchtype=author&query=Lo%2C+H">Hoi-Kwong Lo</a>, <a href="/search/quant-ph?searchtype=author&query=Tzitrin%2C+I">Ilan Tzitrin</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2212.10820v2-abstract-short" style="display: inline;"> A quantum internet is the holy grail of quantum information processing, enabling the deployment of a broad range of quantum technologies and protocols on a global scale. However, numerous challenges exist before the quantum internet can become a reality. Perhaps the most crucial of these is the realization of a quantum repeater, an essential component in the long-distance transmission of quantum i… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.10820v2-abstract-full').style.display = 'inline'; document.getElementById('2212.10820v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2212.10820v2-abstract-full" style="display: none;"> A quantum internet is the holy grail of quantum information processing, enabling the deployment of a broad range of quantum technologies and protocols on a global scale. However, numerous challenges exist before the quantum internet can become a reality. Perhaps the most crucial of these is the realization of a quantum repeater, an essential component in the long-distance transmission of quantum information. As the analog of a classical repeater, extender, or booster, the quantum repeater works to overcome loss and noise in the quantum channels comprising a quantum network. Here, we review the conceptual frameworks and architectures for quantum repeaters, as well as the experimental progress towards their realization. We also discuss the various near-term proposals to overcome the limits to the communication rates set by point-to-point quantum communication. Finally, we overview how quantum repeaters fit within the broader challenge of designing and implementing a quantum internet. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.10820v2-abstract-full').style.display = 'none'; document.getElementById('2212.10820v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 21 December, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">75 pages, 23 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Rev. Mod. Phys. 95, 045006 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2212.06167">arXiv:2212.06167</a> <span> [<a href="https://arxiv.org/pdf/2212.06167">pdf</a>, <a href="https://arxiv.org/format/2212.06167">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Architectures for Multinode Superconducting Quantum Computers </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ang%2C+J">James Ang</a>, <a href="/search/quant-ph?searchtype=author&query=Carini%2C+G">Gabriella Carini</a>, <a href="/search/quant-ph?searchtype=author&query=Chen%2C+Y">Yanzhu Chen</a>, <a href="/search/quant-ph?searchtype=author&query=Chuang%2C+I">Isaac Chuang</a>, <a href="/search/quant-ph?searchtype=author&query=DeMarco%2C+M+A">Michael Austin DeMarco</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Eickbusch%2C+A">Alec Eickbusch</a>, <a href="/search/quant-ph?searchtype=author&query=Faraon%2C+A">Andrei Faraon</a>, <a href="/search/quant-ph?searchtype=author&query=Fu%2C+K">Kai-Mei Fu</a>, <a href="/search/quant-ph?searchtype=author&query=Girvin%2C+S+M">Steven M. Girvin</a>, <a href="/search/quant-ph?searchtype=author&query=Hatridge%2C+M">Michael Hatridge</a>, <a href="/search/quant-ph?searchtype=author&query=Houck%2C+A">Andrew Houck</a>, <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">Paul Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Krsulich%2C+K">Kevin Krsulich</a>, <a href="/search/quant-ph?searchtype=author&query=Li%2C+A">Ang Li</a>, <a href="/search/quant-ph?searchtype=author&query=Liu%2C+C">Chenxu Liu</a>, <a href="/search/quant-ph?searchtype=author&query=Liu%2C+Y">Yuan Liu</a>, <a href="/search/quant-ph?searchtype=author&query=Martonosi%2C+M">Margaret Martonosi</a>, <a href="/search/quant-ph?searchtype=author&query=McKay%2C+D+C">David C. McKay</a>, <a href="/search/quant-ph?searchtype=author&query=Misewich%2C+J">James Misewich</a>, <a href="/search/quant-ph?searchtype=author&query=Ritter%2C+M">Mark Ritter</a>, <a href="/search/quant-ph?searchtype=author&query=Schoelkopf%2C+R+J">Robert J. Schoelkopf</a>, <a href="/search/quant-ph?searchtype=author&query=Stein%2C+S+A">Samuel A. Stein</a>, <a href="/search/quant-ph?searchtype=author&query=Sussman%2C+S">Sara Sussman</a>, <a href="/search/quant-ph?searchtype=author&query=Tang%2C+H+X">Hong X. Tang</a> , et al. (8 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2212.06167v1-abstract-short" style="display: inline;"> Many proposals to scale quantum technology rely on modular or distributed designs where individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, a limiting factor of these machines will be internode gates, which may be t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.06167v1-abstract-full').style.display = 'inline'; document.getElementById('2212.06167v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2212.06167v1-abstract-full" style="display: none;"> Many proposals to scale quantum technology rely on modular or distributed designs where individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, a limiting factor of these machines will be internode gates, which may be two to three orders of magnitude noisier and slower than local operations. Surmounting the limitations of internode gates will require a range of techniques, including improvements in entanglement generation, the use of entanglement distillation, and optimized software and compilers, and it remains unclear how improvements to these components interact to affect overall system performance, what performance from each is required, or even how to quantify the performance of each. In this paper, we employ a `co-design' inspired approach to quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. In the case of superconducting MNQCs with microwave-to-optical links, we uncover a tradeoff between entanglement generation and distillation that threatens to degrade performance. We show how to navigate this tradeoff, lay out how compilers should optimize between local and internode gates, and discuss when noisy quantum links have an advantage over purely classical links. Using these results, we introduce a roadmap for the realization of early MNQCs which illustrates potential improvements to the hardware and software of MNQCs and outlines criteria for evaluating the landscape, from progress in entanglement generation and quantum memory to dedicated algorithms such as distributed quantum phase estimation. While we focus on superconducting devices with optical interconnects, our approach is general across MNQC implementations. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2212.06167v1-abstract-full').style.display = 'none'; document.getElementById('2212.06167v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 12 December, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">23 pages, white paper</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2211.13242">arXiv:2211.13242</a> <span> [<a href="https://arxiv.org/pdf/2211.13242">pdf</a>, <a href="https://arxiv.org/format/2211.13242">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PRXQuantum.5.020346">10.1103/PRXQuantum.5.020346 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Deterministic generation of qudit photonic graph states from quantum emitters </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Raissi%2C+Z">Zahra Raissi</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2211.13242v2-abstract-short" style="display: inline;"> We propose and analyze deterministic protocols to generate qudit photonic graph states from quantum emitters. We show that our approach can be applied to generate any qudit graph state, and we exemplify it by constructing protocols to generate one- and two-dimensional qudit cluster states, absolutely maximally entangled states, and logical states of quantum error correcting codes. Some of these pr… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.13242v2-abstract-full').style.display = 'inline'; document.getElementById('2211.13242v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2211.13242v2-abstract-full" style="display: none;"> We propose and analyze deterministic protocols to generate qudit photonic graph states from quantum emitters. We show that our approach can be applied to generate any qudit graph state, and we exemplify it by constructing protocols to generate one- and two-dimensional qudit cluster states, absolutely maximally entangled states, and logical states of quantum error correcting codes. Some of these protocols make use of time-delayed feedback, while others do not. The only additional resource requirement compared to the qubit case is the ability to control multi-level emitters. These results significantly broaden the range of multi-photon entangled states that can be produced deterministically from quantum emitters. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2211.13242v2-abstract-full').style.display = 'none'; document.getElementById('2211.13242v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 29 February, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 23 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> November 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 pages, 10 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> PRX Quantum 5, 020346 (2024) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2210.02868">arXiv:2210.02868</a> <span> [<a href="https://arxiv.org/pdf/2210.02868">pdf</a>, <a href="https://arxiv.org/format/2210.02868">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Physics Education">physics.ed-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Popular Physics">physics.pop-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Hello Quantum World! A rigorous but accessible first-year university course in quantum information science </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2210.02868v2-abstract-short" style="display: inline;"> Addressing workforce shortages within the Quantum Information Science and Engineering (QISE) community requires attracting and retaining students from diverse backgrounds early on in their undergraduate education. Here, we describe a course we developed called Hello Quantum World! that introduces a broad range of fundamental quantum information and computation concepts in a rigorous way but withou… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.02868v2-abstract-full').style.display = 'inline'; document.getElementById('2210.02868v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2210.02868v2-abstract-full" style="display: none;"> Addressing workforce shortages within the Quantum Information Science and Engineering (QISE) community requires attracting and retaining students from diverse backgrounds early on in their undergraduate education. Here, we describe a course we developed called Hello Quantum World! that introduces a broad range of fundamental quantum information and computation concepts in a rigorous way but without requiring any knowledge of mathematics beyond high-school algebra nor any prior knowledge of quantum mechanics. Some of the topics covered include superposition, entanglement, quantum gates, teleportation, quantum algorithms, and quantum error correction. The course is designed for first-year undergraduate students, both those pursuing a degree in QISE and those who are seeking to be `quantum-aware'. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2210.02868v2-abstract-full').style.display = 'none'; document.getElementById('2210.02868v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 November, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 25 September, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 8 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2209.11430">arXiv:2209.11430</a> <span> [<a href="https://arxiv.org/pdf/2209.11430">pdf</a>, <a href="https://arxiv.org/format/2209.11430">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.22331/q-2023-02-16-924">10.22331/q-2023-02-16-924 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Performance analysis of quantum repeaters enabled by deterministically generated photonic graph states </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Zhan%2C+Y">Yuan Zhan</a>, <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">Paul Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Sun%2C+S">Shuo Sun</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2209.11430v2-abstract-short" style="display: inline;"> By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph states requires a formidable resource overhead using traditional approaches based on linear optics. Overcoming this challenge, a number of new schemes have bee… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2209.11430v2-abstract-full').style.display = 'inline'; document.getElementById('2209.11430v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2209.11430v2-abstract-full" style="display: none;"> By encoding logical qubits into specific types of photonic graph states, one can realize quantum repeaters that enable fast entanglement distribution rates approaching classical communication. However, the generation of these photonic graph states requires a formidable resource overhead using traditional approaches based on linear optics. Overcoming this challenge, a number of new schemes have been proposed that employ quantum emitters to deterministically generate photonic graph states. Although these schemes have the potential to significantly reduce the resource cost, a systematic comparison of the repeater performance among different encodings and different generation schemes is lacking. Here, we quantitatively analyze the performance of quantum repeaters based on two different graph states, i.e. the tree graph states and the repeater graph states. For both states, we compare the performance between two generation schemes, one based on a single quantum emitter coupled to ancillary matter qubits, and one based on a single quantum emitter coupled to a delayed feedback. We identify the numerically optimal scheme at different system parameters. Our analysis provides a clear guideline on the selection of the generation scheme for graph-state-based quantum repeaters, and lays out the parameter requirements for future experimental realizations of different schemes. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2209.11430v2-abstract-full').style.display = 'none'; document.getElementById('2209.11430v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 8 February, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 23 September, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18 pages, 8 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Quantum 7, 924 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2209.10562">arXiv:2209.10562</a> <span> [<a href="https://arxiv.org/pdf/2209.10562">pdf</a>, <a href="https://arxiv.org/format/2209.10562">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevResearch.6.013254">10.1103/PhysRevResearch.6.013254 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit ans盲tze </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Anastasiou%2C+P+G">Panagiotis G. Anastasiou</a>, <a href="/search/quant-ph?searchtype=author&query=Chen%2C+Y">Yanzhu Chen</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2209.10562v1-abstract-short" style="display: inline;"> Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this work, we introduce an algorithm called TETRIS-ADAPT-VQE, which iteratively builds up variational ans盲tze a few operators at a time in a way di… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2209.10562v1-abstract-full').style.display = 'inline'; document.getElementById('2209.10562v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2209.10562v1-abstract-full" style="display: none;"> Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this work, we introduce an algorithm called TETRIS-ADAPT-VQE, which iteratively builds up variational ans盲tze a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of CNOT gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared to ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2209.10562v1-abstract-full').style.display = 'none'; document.getElementById('2209.10562v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 21 September, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">10 pages, 7 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2209.00678">arXiv:2209.00678</a> <span> [<a href="https://arxiv.org/pdf/2209.00678">pdf</a>, <a href="https://arxiv.org/format/2209.00678">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> An entanglement-based volumetric benchmark for near-term quantum hardware </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Hamilton%2C+K+E">Kathleen E. Hamilton</a>, <a href="/search/quant-ph?searchtype=author&query=Laanait%2C+N">Nouamane Laanait</a>, <a href="/search/quant-ph?searchtype=author&query=Francis%2C+A">Akhil Francis</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barron%2C+G+S">George S. Barron</a>, <a href="/search/quant-ph?searchtype=author&query=Yeter-Aydeniz%2C+K">K眉bra Yeter-Aydeniz</a>, <a href="/search/quant-ph?searchtype=author&query=Morris%2C+T">Titus Morris</a>, <a href="/search/quant-ph?searchtype=author&query=Cooley%2C+H">Harrison Cooley</a>, <a href="/search/quant-ph?searchtype=author&query=Kang%2C+M">Muhun Kang</a>, <a href="/search/quant-ph?searchtype=author&query=Kemper%2C+A+F">Alexander F. Kemper</a>, <a href="/search/quant-ph?searchtype=author&query=Pooser%2C+R">Raphael Pooser</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2209.00678v1-abstract-short" style="display: inline;"> We introduce a volumetric benchmark for near-term quantum platforms based on the generation and verification of genuine entanglement across n-qubits using graph states and direct stabilizer measurements. Our benchmark evaluates the robustness of multipartite and bipartite n-qubit entanglement with respect to many sources of hardware noise: qubit decoherence, CNOT and swap gate noise, and readout e… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2209.00678v1-abstract-full').style.display = 'inline'; document.getElementById('2209.00678v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2209.00678v1-abstract-full" style="display: none;"> We introduce a volumetric benchmark for near-term quantum platforms based on the generation and verification of genuine entanglement across n-qubits using graph states and direct stabilizer measurements. Our benchmark evaluates the robustness of multipartite and bipartite n-qubit entanglement with respect to many sources of hardware noise: qubit decoherence, CNOT and swap gate noise, and readout error. We demonstrate our benchmark on multiple superconducting qubit platforms available from IBM (ibmq_belem, ibmq_toronto, ibmq_guadalupe and ibmq_jakarta). Subsets of $n<10$ qubits are used for graph state preparation and stabilizer measurement. Evaluation of genuine and biseparable entanglement witnesses we report observations of $5$ qubit genuine entanglement, but robust multipartite entanglement is difficult to generate for $n>4$ qubits and identify two-qubit gate noise as strongly correlated with the quality of genuine multipartite entanglement. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2209.00678v1-abstract-full').style.display = 'none'; document.getElementById('2209.00678v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 1 September, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">21 pages, 17 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2207.09881">arXiv:2207.09881</a> <span> [<a href="https://arxiv.org/pdf/2207.09881">pdf</a>, <a href="https://arxiv.org/format/2207.09881">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1038/s41566-023-01186-0">10.1038/s41566-023-01186-0 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> High-rate entanglement between a semiconductor spin and indistinguishable photons </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Coste%2C+N">N. Coste</a>, <a href="/search/quant-ph?searchtype=author&query=Fioretto%2C+D">D. Fioretto</a>, <a href="/search/quant-ph?searchtype=author&query=Belabas%2C+N">N. Belabas</a>, <a href="/search/quant-ph?searchtype=author&query=Wein%2C+S+C">S. C. Wein</a>, <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">P. Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Frantzeskakis%2C+R">R. Frantzeskakis</a>, <a href="/search/quant-ph?searchtype=author&query=Gundin%2C+M">M. Gundin</a>, <a href="/search/quant-ph?searchtype=author&query=Goes%2C+B">B. Goes</a>, <a href="/search/quant-ph?searchtype=author&query=Somaschi%2C+N">N. Somaschi</a>, <a href="/search/quant-ph?searchtype=author&query=Morassi%2C+M">M. Morassi</a>, <a href="/search/quant-ph?searchtype=author&query=Lema%C3%AEtre%2C+A">A. Lema卯tre</a>, <a href="/search/quant-ph?searchtype=author&query=Sagnes%2C+1+I">1 I. Sagnes</a>, <a href="/search/quant-ph?searchtype=author&query=Harouri%2C+A">A. Harouri</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">S. E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Auffeves%2C+A">A. Auffeves</a>, <a href="/search/quant-ph?searchtype=author&query=Krebs%2C+O">O. Krebs</a>, <a href="/search/quant-ph?searchtype=author&query=Lanco%2C+L">L. Lanco</a>, <a href="/search/quant-ph?searchtype=author&query=Senellart%2C+P">P. Senellart</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2207.09881v1-abstract-short" style="display: inline;"> Photonic graph states, quantum light states where multiple photons are mutually entangled, are key resources for optical quantum technologies. They are notably at the core of error-corrected measurement-based optical quantum computing and all-optical quantum networks. In the discrete variable framework, these applications require high efficiency generation of cluster-states whose nodes are indisti… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.09881v1-abstract-full').style.display = 'inline'; document.getElementById('2207.09881v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2207.09881v1-abstract-full" style="display: none;"> Photonic graph states, quantum light states where multiple photons are mutually entangled, are key resources for optical quantum technologies. They are notably at the core of error-corrected measurement-based optical quantum computing and all-optical quantum networks. In the discrete variable framework, these applications require high efficiency generation of cluster-states whose nodes are indistinguishable photons. Such photonic cluster states can be generated with heralded single photon sources and probabilistic quantum gates, yet with challenging efficiency and scalability. Spin-photon entanglement has been proposed to deterministically generate linear cluster states. First demonstrations have been obtained with semiconductor spins achieving high photon indistinguishablity, and most recently with atomic systems at high collection efficiency and record length. Here we report on the efficient generation of three partite cluster states made of one semiconductor spin and two indistinguishable photons. We harness a semiconductor quantum dot inserted in an optical cavity for efficient photon collection and electrically controlled for high indistinguishability. We demonstrate two and three particle entanglement with fidelities of 80 % and 63 % respectively, with photon indistinguishability of 88%. The spin-photon and spin-photon-photon entanglement rates exceed by three and two orders of magnitude respectively the previous state of the art. Our system and experimental scheme, a monolithic solid-state device controlled with a resource efficient simple experimental configuration, are very promising for future scalable applications. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.09881v1-abstract-full').style.display = 'none'; document.getElementById('2207.09881v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 July, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2207.03063">arXiv:2207.03063</a> <span> [<a href="https://arxiv.org/pdf/2207.03063">pdf</a>, <a href="https://arxiv.org/ps/2207.03063">ps</a>, <a href="https://arxiv.org/format/2207.03063">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Symmetry breaking slows convergence of the ADAPT Variational Quantum Eigensolver </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Bertels%2C+L+W">Luke W. Bertels</a>, <a href="/search/quant-ph?searchtype=author&query=Grimsley%2C+H+R">Harper R. Grimsley</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2207.03063v1-abstract-short" style="display: inline;"> Because quantum simulation of molecular systems is expected to provide the strongest advantage over classical computing methods for systems exhibiting strong electron correlation, it is critical that the performance of VQEs be assessed for strongly correlated systems. For classical simulation, strong correlation often results in symmetry-breaking of the Hartree-Fock reference, leading to L枚wdin's… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.03063v1-abstract-full').style.display = 'inline'; document.getElementById('2207.03063v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2207.03063v1-abstract-full" style="display: none;"> Because quantum simulation of molecular systems is expected to provide the strongest advantage over classical computing methods for systems exhibiting strong electron correlation, it is critical that the performance of VQEs be assessed for strongly correlated systems. For classical simulation, strong correlation often results in symmetry-breaking of the Hartree-Fock reference, leading to L枚wdin's well-known ``symmetry dilemma'' whereby accuracy in the energy can be increased by breaking spin or spatial symmetries. Here, we explore the impact of symmetry breaking on the performance of ADAPT-VQE using two strongly correlated systems: (i) the ``fermionized" anisotropic Heisenberg model, where the anisotropy parameter controls the correlation in the system, and (ii) symmetrically-stretched linear \ce{H4}, where correlation increases with increasing H-H separation. In both of these cases, increasing the level of correlation of the system leads to spontaneous symmetry breaking (parity and $\hat{S}^{2}$, respectively) of the mean-field solutions. We analyze the role that symmetry breaking in the reference states and orbital mappings of the fermionic Hamiltonians have on the compactness and performance of ADAPT-VQE. We observe that improving the energy of the reference states by breaking symmetry has a deleterious effect on ADAPT-VQE by increasing the length of the ansatz necessary for energy convergence and exacerbating the problem of ``gradient troughs". <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2207.03063v1-abstract-full').style.display = 'none'; document.getElementById('2207.03063v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 July, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">16 pages, 5 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2206.14215">arXiv:2206.14215</a> <span> [<a href="https://arxiv.org/pdf/2206.14215">pdf</a>, <a href="https://arxiv.org/format/2206.14215">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Strongly Correlated Electrons">cond-mat.str-el</span> </div> </div> <p class="title is-5 mathjax"> Scaling adaptive quantum simulation algorithms via operator pool tiling </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Van+Dyke%2C+J+S">John S. Van Dyke</a>, <a href="/search/quant-ph?searchtype=author&query=Shirali%2C+K">Karunya Shirali</a>, <a href="/search/quant-ph?searchtype=author&query=Barron%2C+G+S">George S. Barron</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2206.14215v2-abstract-short" style="display: inline;"> Adaptive variational quantum simulation algorithms use information from the quantum computer to dynamically create optimal trial wavefunctions for a given problem Hamiltonian. A key ingredient in these algorithms is a predefined operator pool from which trial wavefunctions are constructed. Finding suitable pools is critical for the efficiency of the algorithm as the problem size increases. Here, w… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2206.14215v2-abstract-full').style.display = 'inline'; document.getElementById('2206.14215v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2206.14215v2-abstract-full" style="display: none;"> Adaptive variational quantum simulation algorithms use information from the quantum computer to dynamically create optimal trial wavefunctions for a given problem Hamiltonian. A key ingredient in these algorithms is a predefined operator pool from which trial wavefunctions are constructed. Finding suitable pools is critical for the efficiency of the algorithm as the problem size increases. Here, we present a technique called operator pool tiling that facilitates the construction of problem-tailored pools for arbitrarily large problem instances. By first performing an ADAPT-VQE calculation on a smaller instance of the problem using a large, but computationally inefficient operator pool, we extract the most relevant operators and use them to design more efficient pools for larger instances. We demonstrate the method here on strongly correlated quantum spin models in one and two dimensions, finding that ADAPT automatically finds a highly effective ansatz for these systems. Given that many problems, such as those arising in condensed matter physics, have a naturally repeating lattice structure, we expect the pool tiling method to be a widely applicable technique apt for such systems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2206.14215v2-abstract-full').style.display = 'none'; document.getElementById('2206.14215v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 28 June, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">9 pages, 4 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2206.10502">arXiv:2206.10502</a> <span> [<a href="https://arxiv.org/pdf/2206.10502">pdf</a>, <a href="https://arxiv.org/format/2206.10502">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Strongly Correlated Electrons">cond-mat.str-el</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Chemical Physics">physics.chem-ph</span> </div> </div> <p class="title is-5 mathjax"> Quantum self-consistent equation-of-motion method for computing molecular excitation energies, ionization potentials, and electron affinities on a quantum computer </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Asthana%2C+A">Ayush Asthana</a>, <a href="/search/quant-ph?searchtype=author&query=Kumar%2C+A">Ashutosh Kumar</a>, <a href="/search/quant-ph?searchtype=author&query=Abraham%2C+V">Vibin Abraham</a>, <a href="/search/quant-ph?searchtype=author&query=Grimsley%2C+H">Harper Grimsley</a>, <a href="/search/quant-ph?searchtype=author&query=Zhang%2C+Y">Yu Zhang</a>, <a href="/search/quant-ph?searchtype=author&query=Cincio%2C+L">Lukasz Cincio</a>, <a href="/search/quant-ph?searchtype=author&query=Tretiak%2C+S">Sergei Tretiak</a>, <a href="/search/quant-ph?searchtype=author&query=Dub%2C+P+A">Pavel A. Dub</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2206.10502v2-abstract-short" style="display: inline;"> Near-term quantum computers are expected to facilitate material and chemical research through accurate molecular simulations. Several developments have already shown that accurate ground-state energies for small molecules can be evaluated on present-day quantum devices. Although electronically excited states play a vital role in chemical processes and applications, the search for a reliable and pr… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2206.10502v2-abstract-full').style.display = 'inline'; document.getElementById('2206.10502v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2206.10502v2-abstract-full" style="display: none;"> Near-term quantum computers are expected to facilitate material and chemical research through accurate molecular simulations. Several developments have already shown that accurate ground-state energies for small molecules can be evaluated on present-day quantum devices. Although electronically excited states play a vital role in chemical processes and applications, the search for a reliable and practical approach for routine excited-state calculations on near-term quantum devices is ongoing. Inspired by excited-state methods developed for the unitary coupled-cluster theory in quantum chemistry, we present an equation-of-motion-based method to compute excitation energies following the variational quantum eigensolver algorithm for ground-state calculations on a quantum computer. We perform numerical simulations on H$_2$, H$_4$, H$_2$O, and LiH molecules to test our quantum self-consistent equation-of-motion (q-sc-EOM) method and compare it to other current state-of-the-art methods. q-sc-EOM makes use of self-consistent operators to satisfy the vacuum annihilation condition, a critical property for accurate calculations. It provides real and size-intensive energy differences corresponding to vertical excitation energies, ionization potentials and electron affinities. We also find that q-sc-EOM is more suitable for implementation on NISQ devices as it is expected to be more resilient to noise compared with the currently available methods. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2206.10502v2-abstract-full').style.display = 'none'; document.getElementById('2206.10502v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 February, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 21 June, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> LA-UR-22-25463 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2206.03647">arXiv:2206.03647</a> <span> [<a href="https://arxiv.org/pdf/2206.03647">pdf</a>, <a href="https://arxiv.org/format/2206.03647">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevApplied.18.L061003">10.1103/PhysRevApplied.18.L061003 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Deterministic generation of entangled photonic cluster states from quantum dot molecules </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Vezvaee%2C+A">Arian Vezvaee</a>, <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">Paul Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Doty%2C+M+F">Matthew F. Doty</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2206.03647v1-abstract-short" style="display: inline;"> Successful generation of photonic cluster states is the key step in the realization of measurement-based quantum computation and quantum network protocols. Several proposals for the generation of such entangled states from different solid-state emitters have been put forward. Each of these protocols come with their own challenges in terms of both conception and implementation. In this work we prop… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2206.03647v1-abstract-full').style.display = 'inline'; document.getElementById('2206.03647v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2206.03647v1-abstract-full" style="display: none;"> Successful generation of photonic cluster states is the key step in the realization of measurement-based quantum computation and quantum network protocols. Several proposals for the generation of such entangled states from different solid-state emitters have been put forward. Each of these protocols come with their own challenges in terms of both conception and implementation. In this work we propose deterministic generation of these photonic cluster states from a spin-photon interface based on a hole spin qubit hosted in a quantum dot molecule. Our protocol resolves many of the difficulties of existing proposals and paves the way for an experimentally feasible realization of highly entangled multi-qubit photonic states with a high production rate. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2206.03647v1-abstract-full').style.display = 'none'; document.getElementById('2206.03647v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 7 June, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys.Rev.Applied 18 (2022) L061003 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2205.12283">arXiv:2205.12283</a> <span> [<a href="https://arxiv.org/pdf/2205.12283">pdf</a>, <a href="https://arxiv.org/format/2205.12283">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> How Much Entanglement Do Quantum Optimization Algorithms Require? </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Chen%2C+Y">Yanzhu Chen</a>, <a href="/search/quant-ph?searchtype=author&query=Zhu%2C+L">Linghua Zhu</a>, <a href="/search/quant-ph?searchtype=author&query=Liu%2C+C">Chenxu Liu</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2205.12283v2-abstract-short" style="display: inline;"> Many classical optimization problems can be mapped to finding the ground states of diagonal Ising Hamiltonians, for which variational quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) provide heuristic methods. Because the solutions of such classical optimization problems are necessarily product states, it is unclear how entanglement affects their performance. An Ada… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.12283v2-abstract-full').style.display = 'inline'; document.getElementById('2205.12283v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2205.12283v2-abstract-full" style="display: none;"> Many classical optimization problems can be mapped to finding the ground states of diagonal Ising Hamiltonians, for which variational quantum algorithms such as the Quantum Approximate Optimization Algorithm (QAOA) provide heuristic methods. Because the solutions of such classical optimization problems are necessarily product states, it is unclear how entanglement affects their performance. An Adaptive Derivative-Assembled Problem-Tailored (ADAPT) variation of QAOA improves the convergence rate by allowing entangling operations in the mixer layers whereas it requires fewer CNOT gates in the entire circuit. In this work, we study the entanglement generated during the execution of ADAPT-QAOA. Through simulations of the weighted Max-Cut problem, we show that ADAPT-QAOA exhibits substantial flexibility in entangling and disentangling qubits. By incrementally restricting this flexibility, we find that a larger amount of entanglement entropy at earlier stages coincides with faster convergence at later stages. In contrast, while the standard QAOA quickly generates entanglement within a few layers, it cannot remove excess entanglement efficiently. Our results demonstrate that the role of entanglement in quantum optimization is subtle and provide guidance for building favorable features into quantum optimization algorithms. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.12283v2-abstract-full').style.display = 'none'; document.getElementById('2205.12283v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 9 July, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 24 May, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">15 pages, 7 figures. Comments are welcome</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2205.09750">arXiv:2205.09750</a> <span> [<a href="https://arxiv.org/pdf/2205.09750">pdf</a>, <a href="https://arxiv.org/format/2205.09750">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.22331/q-2023-04-27-992">10.22331/q-2023-04-27-992 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">Paul Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Vidro%2C+L">Leonid Vidro</a>, <a href="/search/quant-ph?searchtype=author&query=Eisenberg%2C+H+S">Hagai S. Eisenberg</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2205.09750v5-abstract-short" style="display: inline;"> Since linear-optical two-photon gates are inherently probabilistic, measurement-based implementations are particularly well suited for photonic platforms: a large highly-entangled photonic resource state, called a graph state, is consumed through measurements to perform a computation. The challenge is thus to produce these graph states. Several generation procedures, which use either interacting q… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.09750v5-abstract-full').style.display = 'inline'; document.getElementById('2205.09750v5-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2205.09750v5-abstract-full" style="display: none;"> Since linear-optical two-photon gates are inherently probabilistic, measurement-based implementations are particularly well suited for photonic platforms: a large highly-entangled photonic resource state, called a graph state, is consumed through measurements to perform a computation. The challenge is thus to produce these graph states. Several generation procedures, which use either interacting quantum emitters or efficient spin-photon interface, have been proposed to create these photonic graph states deterministically. Yet, these solutions are still out of reach experimentally since the state-of-the-art is the generation of a linear graph state. Here, we introduce near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities. We propose hybridizing quantum-emitter-based graph state generation with all-photonic fusion gates to produce graph states of complex topology near-deterministically. Our results should pave the way towards the practical implementation of resource-efficient quantum information processing, including measurement-based quantum communication and quantum computing. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.09750v5-abstract-full').style.display = 'none'; document.getElementById('2205.09750v5-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 26 April, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 19 May, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">22 pages, 10 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Quantum 7, 992 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2205.06945">arXiv:2205.06945</a> <span> [<a href="https://arxiv.org/pdf/2205.06945">pdf</a>, <a href="https://arxiv.org/format/2205.06945">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Mesoscale and Nanoscale Physics">cond-mat.mes-hall</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PRXQuantum.4.030312">10.1103/PRXQuantum.4.030312 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Avoiding leakage and errors caused by unwanted transitions in Lambda systems </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Vezvaee%2C+A">Arian Vezvaee</a>, <a href="/search/quant-ph?searchtype=author&query=Takou%2C+E">Evangelia Takou</a>, <a href="/search/quant-ph?searchtype=author&query=Hilaire%2C+P">Paul Hilaire</a>, <a href="/search/quant-ph?searchtype=author&query=Doty%2C+M+F">Matthew F. Doty</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2205.06945v1-abstract-short" style="display: inline;"> Three-level Lambda systems appear in various quantum information processing platforms. In several control schemes, the excited level serves as an auxiliary state for implementing gate operations between the lower qubit states. However, extra excited levels give rise to unwanted transitions that cause leakage and other errors, degrading the gate fidelity. We focus on a coherent-population-trapping… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.06945v1-abstract-full').style.display = 'inline'; document.getElementById('2205.06945v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2205.06945v1-abstract-full" style="display: none;"> Three-level Lambda systems appear in various quantum information processing platforms. In several control schemes, the excited level serves as an auxiliary state for implementing gate operations between the lower qubit states. However, extra excited levels give rise to unwanted transitions that cause leakage and other errors, degrading the gate fidelity. We focus on a coherent-population-trapping scheme for gates and design protocols that reduce the effects of the unwanted off-resonant couplings and improve the gate performance up to several orders of magnitude. For a particular setup of unwanted couplings, we find an exact solution, which leads to error-free gate operations via only a static detuning modification. In the general case, we improve gate operations by adding corrective modulations to the pulses, thereby generalizing the DRAG protocol to Lambda systems. Our techniques enable fast and high-fidelity gates and apply to a wide range of optically driven platforms, such as quantum dots, color centers, and trapped ions. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.06945v1-abstract-full').style.display = 'none'; document.getElementById('2205.06945v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 May, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2204.07179">arXiv:2204.07179</a> <span> [<a href="https://arxiv.org/pdf/2204.07179">pdf</a>, <a href="https://arxiv.org/format/2204.07179">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Chemical Physics">physics.chem-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1038/s41534-023-00681-0">10.1038/s41534-023-00681-0 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> ADAPT-VQE is insensitive to rough parameter landscapes and barren plateaus </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Grimsley%2C+H+R">Harper R. Grimsley</a>, <a href="/search/quant-ph?searchtype=author&query=Barron%2C+G+S">George S. Barron</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2204.07179v1-abstract-short" style="display: inline;"> Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider Adaptive, Problem-Tailored (ADAPT)-VQE ans盲tze, and examine how they are impacted by these local minima. We find t… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.07179v1-abstract-full').style.display = 'inline'; document.getElementById('2204.07179v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2204.07179v1-abstract-full" style="display: none;"> Variational quantum eigensolvers (VQEs) represent a powerful class of hybrid quantum-classical algorithms for computing molecular energies. Various numerical issues exist for these methods, however, including barren plateaus and large numbers of local minima. In this work, we consider Adaptive, Problem-Tailored (ADAPT)-VQE ans盲tze, and examine how they are impacted by these local minima. We find that while ADAPT-VQE does not remove local minima, the gradient-informed, one-operator-at-a-time circuit construction seems to accomplish two things: First, it provides an initialization strategy that is dramatically better than random initialization, and which is applicable in situations where chemical intuition cannot help with initialization, i.e., when Hartree-Fock is a poor approximation to the ground state. Second, even if an ADAPT-VQE iteration converges to a local trap at one step, it can still "burrow" toward the exact solution by adding more operators, which preferentially deepens the occupied trap. This same mechanism helps highlight a surprising feature of ADAPT-VQE: It should not suffer optimization problems due to "barren plateaus". Even if barren plateaus appear in the parameter landscape, our analysis and simulations reveal that ADAPT-VQE avoids such regions by design. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.07179v1-abstract-full').style.display = 'none'; document.getElementById('2204.07179v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 14 April, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2022. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2204.02876">arXiv:2204.02876</a> <span> [<a href="https://arxiv.org/pdf/2204.02876">pdf</a>, <a href="https://arxiv.org/format/2204.02876">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevApplied.19.044094">10.1103/PhysRevApplied.19.044094 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Designing globally optimal entangling gates using geometric space curves </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Tang%2C+H+L">Ho Lun Tang</a>, <a href="/search/quant-ph?searchtype=author&query=Connelly%2C+K">Kyle Connelly</a>, <a href="/search/quant-ph?searchtype=author&query=Warren%2C+A">Ada Warren</a>, <a href="/search/quant-ph?searchtype=author&query=Zhuang%2C+F">Fei Zhuang</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2204.02876v1-abstract-short" style="display: inline;"> High-fidelity entangling gates are essential for quantum computation. Currently, most approaches to designing such gates are based either on simple, analytical pulse waveforms or on ones obtained from numerical optimization techniques. In both cases, it is typically not possible to obtain a global understanding of the space of waveforms that generate a target gate operation, making it challenging… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.02876v1-abstract-full').style.display = 'inline'; document.getElementById('2204.02876v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2204.02876v1-abstract-full" style="display: none;"> High-fidelity entangling gates are essential for quantum computation. Currently, most approaches to designing such gates are based either on simple, analytical pulse waveforms or on ones obtained from numerical optimization techniques. In both cases, it is typically not possible to obtain a global understanding of the space of waveforms that generate a target gate operation, making it challenging to design globally optimal gates. Here, we show that in the case of weakly coupled qubits, it is possible to find all pulses that implement a target entangling gate. We do this by mapping quantum evolution onto geometric space curves. We derive the minimal conditions these curves must satisfy in order to guarantee a gate with a desired entangling power is implemented. Pulse waveforms are extracted from the curvatures of these curves. We illustrate our method by designing fast, CNOT-equivalent entangling gates for silicon quantum dot spin qubits with fidelities exceeding 99%. We show that fidelities can be further improved while maintaining low bandwidth requirements by using geometrically derived pulses as initial guesses in numerical optimization routines. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2204.02876v1-abstract-full').style.display = 'none'; document.getElementById('2204.02876v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 April, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">8 pages, 3 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. Applied 19, 044094 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2203.12757">arXiv:2203.12757</a> <span> [<a href="https://arxiv.org/pdf/2203.12757">pdf</a>, <a href="https://arxiv.org/ps/2203.12757">ps</a>, <a href="https://arxiv.org/format/2203.12757">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> Adaptive variational algorithms for quantum Gibbs state preparation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Warren%2C+A">Ada Warren</a>, <a href="/search/quant-ph?searchtype=author&query=Zhu%2C+L">Linghua Zhu</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2203.12757v1-abstract-short" style="display: inline;"> The preparation of Gibbs thermal states is an important task in quantum computation with applications in quantum simulation, quantum optimization, and quantum machine learning. However, many algorithms for preparing Gibbs states rely on quantum subroutines which are difficult to implement on near-term hardware. Here, we address this by (i) introducing an objective function that, unlike the free en… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.12757v1-abstract-full').style.display = 'inline'; document.getElementById('2203.12757v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2203.12757v1-abstract-full" style="display: none;"> The preparation of Gibbs thermal states is an important task in quantum computation with applications in quantum simulation, quantum optimization, and quantum machine learning. However, many algorithms for preparing Gibbs states rely on quantum subroutines which are difficult to implement on near-term hardware. Here, we address this by (i) introducing an objective function that, unlike the free energy, is easily measured, and (ii) using dynamically generated, problem-tailored ans盲tze. This allows for arbitrarily accurate Gibbs state preparation using low-depth circuits. To verify the effectiveness of our approach, we numerically demonstrate that our algorithm can prepare high-fidelity Gibbs states across a broad range of temperatures and for a variety of Hamiltonians. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.12757v1-abstract-full').style.display = 'none'; document.getElementById('2203.12757v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 March, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">7 pages, 3 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2203.09459">arXiv:2203.09459</a> <span> [<a href="https://arxiv.org/pdf/2203.09459">pdf</a>, <a href="https://arxiv.org/format/2203.09459">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevX.13.011004">10.1103/PhysRevX.13.011004 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Precise control of entanglement in multinuclear spin registers coupled to defects </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Takou%2C+E">Evangelia Takou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2203.09459v2-abstract-short" style="display: inline;"> Quantum networks play an indispensable role in quantum information tasks such as secure communications, enhanced quantum sensing, and distributed computing. Among the most mature and promising platforms for quantum networking are nitrogen-vacancy centers in diamond and other color centers in solids. One of the challenges in using these systems for networking applications is to controllably manipul… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.09459v2-abstract-full').style.display = 'inline'; document.getElementById('2203.09459v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2203.09459v2-abstract-full" style="display: none;"> Quantum networks play an indispensable role in quantum information tasks such as secure communications, enhanced quantum sensing, and distributed computing. Among the most mature and promising platforms for quantum networking are nitrogen-vacancy centers in diamond and other color centers in solids. One of the challenges in using these systems for networking applications is to controllably manipulate entanglement between the electron and the nuclear spin register despite the always-on nature of the hyperfine interactions, which makes this an inherently many-body quantum system. Here, we develop a general formalism to quantify and control the generation of entanglement in an arbitrarily large nuclear spin register coupled to a color center electronic spin. We provide a reliable measure of nuclear spin selectivity, by exactly incorporating into our treatment the dynamics with unwanted nuclei. We also show how to realize direct multipartite gates through the use of dynamical decoupling sequences, drastically reducing the total gate time compared to protocols based on sequential entanglement with individual nuclear spins. We quantify the performance of such gate operations in the presence of unwanted residual entanglement links, capturing the dynamics of the entire nuclear spin register. Finally, using experimental parameters of a well-characterized 27 nuclear spin register device, we show how to prepare with high fidelity entangled states for quantum error correction. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.09459v2-abstract-full').style.display = 'none'; document.getElementById('2203.09459v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 17 May, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 17 March, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">17+18 pages, 16 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. X 13, 011004 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2203.07210">arXiv:2203.07210</a> <span> [<a href="https://arxiv.org/pdf/2203.07210">pdf</a>, <a href="https://arxiv.org/format/2203.07210">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevResearch.5.023124">10.1103/PhysRevResearch.5.023124 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Frantzeskakis%2C+R">Rafail Frantzeskakis</a>, <a href="/search/quant-ph?searchtype=author&query=Liu%2C+C">Chenxu Liu</a>, <a href="/search/quant-ph?searchtype=author&query=Raissi%2C+Z">Zahra Raissi</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2203.07210v2-abstract-short" style="display: inline;"> Photonic GHZ states serve as the central resource for a number of important applications in quantum information science, including secret sharing, sensing, and fusion-based quantum computing. The use of photon-emitter entangling gates is a promising approach to creating these states that sidesteps many of the difficulties associated with intrinsically probabilistic methods based on linear optics.… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.07210v2-abstract-full').style.display = 'inline'; document.getElementById('2203.07210v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2203.07210v2-abstract-full" style="display: none;"> Photonic GHZ states serve as the central resource for a number of important applications in quantum information science, including secret sharing, sensing, and fusion-based quantum computing. The use of photon-emitter entangling gates is a promising approach to creating these states that sidesteps many of the difficulties associated with intrinsically probabilistic methods based on linear optics. However, the efficient creation of high-fidelity GHZ states of many photons remains an outstanding challenge due to both coherent and incoherent errors during the generation process. Here, we propose an entanglement concentration protocol that is capable of generating perfect GHZ states using only local gates and measurements on imperfect weighted graph states. We show that our protocol is both efficient and robust to incoherent noise errors. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.07210v2-abstract-full').style.display = 'none'; document.getElementById('2203.07210v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 December, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 14 March, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">11 pages, 8 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. Research 5, 023124 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2203.06818">arXiv:2203.06818</a> <span> [<a href="https://arxiv.org/pdf/2203.06818">pdf</a>, <a href="https://arxiv.org/format/2203.06818">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Chemical Physics">physics.chem-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevApplied.19.064071">10.1103/PhysRevApplied.19.064071 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Minimizing state preparation times in pulse-level variational molecular simulations </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Asthana%2C+A">Ayush Asthana</a>, <a href="/search/quant-ph?searchtype=author&query=Liu%2C+C">Chenxu Liu</a>, <a href="/search/quant-ph?searchtype=author&query=Meitei%2C+O+R">Oinam Romesh Meitei</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2203.06818v1-abstract-short" style="display: inline;"> Quantum simulation on NISQ devices is severely limited by short coherence times. A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue by eliminating the need for parameterized quantum circuits, which lead to long state preparation times. Here, we find the shortest possible pulses for ctrl-VQE to prepare target molecular wavefunctions for a given devic… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.06818v1-abstract-full').style.display = 'inline'; document.getElementById('2203.06818v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2203.06818v1-abstract-full" style="display: none;"> Quantum simulation on NISQ devices is severely limited by short coherence times. A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue by eliminating the need for parameterized quantum circuits, which lead to long state preparation times. Here, we find the shortest possible pulses for ctrl-VQE to prepare target molecular wavefunctions for a given device Hamiltonian describing coupled transmon qubits. We find that the time-optimal pulses that do this have a bang-bang form consistent with Pontryagin's maximum principle. We further investigate how the minimal state preparation time is impacted by truncating the transmons to two versus more levels. We find that leakage outside the computational subspace (something that is usually considered problematic) speeds up the state preparation, further reducing device coherence-time demands. This speedup is due to an enlarged solution space of target wavefunctions and to the appearance of additional channels connecting initial and target states. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.06818v1-abstract-full').style.display = 'none'; document.getElementById('2203.06818v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 13 March, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. Applied 19, 064071 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2203.01619">arXiv:2203.01619</a> <span> [<a href="https://arxiv.org/pdf/2203.01619">pdf</a>, <a href="https://arxiv.org/format/2203.01619">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Nuclear Theory">nucl-th</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevC.105.064317">10.1103/PhysRevC.105.064317 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Solving Nuclear Structure Problems with the Adaptive Variational Quantum Algorithm </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Romero%2C+A+M">A. M. Romero</a>, <a href="/search/quant-ph?searchtype=author&query=Engel%2C+J">J. Engel</a>, <a href="/search/quant-ph?searchtype=author&query=Tang%2C+H+L">Ho Lun Tang</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2203.01619v2-abstract-short" style="display: inline;"> We use the Lipkin-Meshkov-Glick (LMG) model and the valence-space nuclear shell model to examine the likely performance of variational quantum eigensolvers in nuclear-structure theory. The LMG model exhibits both a phase transition and spontaneous symmetry breaking at the mean-field level in one of the phases, features that characterize collective dynamics in medium-mass and heavy nuclei. We show… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.01619v2-abstract-full').style.display = 'inline'; document.getElementById('2203.01619v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2203.01619v2-abstract-full" style="display: none;"> We use the Lipkin-Meshkov-Glick (LMG) model and the valence-space nuclear shell model to examine the likely performance of variational quantum eigensolvers in nuclear-structure theory. The LMG model exhibits both a phase transition and spontaneous symmetry breaking at the mean-field level in one of the phases, features that characterize collective dynamics in medium-mass and heavy nuclei. We show that with appropriate modifications, the ADAPT-VQE algorithm, a particularly flexible and accurate variational approach, is not troubled by these complications. We treat up to 12 particles and show that the number of quantum operations needed to approach the ground-state energy scales linearly with the number of qubits. We find similar scaling when the algorithm is applied to the nuclear shell model with realistic interactions in the $sd$ and $pf$ shells. Although most of these simulations contain no noise, we use a noise model from real IBM hardware to show that for the LMG model with four particles, weak noise has no effect on the efficiency of the algorithm. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2203.01619v2-abstract-full').style.display = 'none'; document.getElementById('2203.01619v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 28 June, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 3 March, 2022; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2022. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">10 pages, 7 figures. Identical in content to published version. Now incudes analysis of noise</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. C 105, 064317 (2022) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2109.05607">arXiv:2109.05607</a> <span> [<a href="https://arxiv.org/pdf/2109.05607">pdf</a>, <a href="https://arxiv.org/format/2109.05607">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1088/1751-8121/ac4640">10.1088/1751-8121/ac4640 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Preparing exact eigenstates of the open XXZ chain on a quantum computer </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Van+Dyke%2C+J+S">John S. Van Dyke</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Nepomechie%2C+R+I">Rafael I. Nepomechie</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2109.05607v2-abstract-short" style="display: inline;"> The open spin-1/2 XXZ spin chain with diagonal boundary magnetic fields is the paradigmatic example of a quantum integrable model with open boundary conditions. We formulate a quantum algorithm for preparing Bethe states of this model, corresponding to real solutions of the Bethe equations. The algorithm is probabilistic, with a success probability that decreases with the number of down spins. For… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2109.05607v2-abstract-full').style.display = 'inline'; document.getElementById('2109.05607v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2109.05607v2-abstract-full" style="display: none;"> The open spin-1/2 XXZ spin chain with diagonal boundary magnetic fields is the paradigmatic example of a quantum integrable model with open boundary conditions. We formulate a quantum algorithm for preparing Bethe states of this model, corresponding to real solutions of the Bethe equations. The algorithm is probabilistic, with a success probability that decreases with the number of down spins. For a Bethe state of $L$ spins with $M$ down spins, which contains a total of $\binom{L}{M}\, 2^{M}\, M!$ terms, the algorithm requires $L+M^2+2M$ qubits. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2109.05607v2-abstract-full').style.display = 'none'; document.getElementById('2109.05607v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 December, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 September, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">18 pages, 3 figures; v2: references added and further minor improvements - to appear in J. Phys. A</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Report number:</span> UMTG-312 </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2109.05340">arXiv:2109.05340</a> <span> [<a href="https://arxiv.org/pdf/2109.05340">pdf</a>, <a href="https://arxiv.org/format/2109.05340">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.22331/q-2023-06-12-1040">10.22331/q-2023-06-12-1040 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Shkolnikov%2C+V+O">V. O. Shkolnikov</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2109.05340v2-abstract-short" style="display: inline;"> Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. Minimizing quantum computational resources is crucial to achieving this goal. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs). Among these, problem-tailored versions such as ADAPT-VQE that build variational ans盲tz… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2109.05340v2-abstract-full').style.display = 'inline'; document.getElementById('2109.05340v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2109.05340v2-abstract-full" style="display: none;"> Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. Minimizing quantum computational resources is crucial to achieving this goal. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs). Among these, problem-tailored versions such as ADAPT-VQE that build variational ans盲tze step by step from a predefined operator pool perform particularly well in terms of circuit depths and variational parameter counts. However, this improved performance comes at the expense of an additional measurement overhead compared to standard VQEs. Here, we show that this overhead can be reduced to an amount that grows only linearly with the number $n$ of qubits, instead of quartically as in the original ADAPT-VQE. We do this by proving that operator pools of size $2n-2$ can represent any state in Hilbert space if chosen appropriately. We prove that this is the minimal size of such "complete" pools, discuss their algebraic properties, and present necessary and sufficient conditions for their completeness that allow us to find such pools efficiently. We further show that, if the simulated problem possesses symmetries, then complete pools can fail to yield convergent results, unless the pool is chosen to obey certain symmetry rules. We demonstrate the performance of such symmetry-adapted complete pools by using them in classical simulations of ADAPT-VQE for several strongly correlated molecules. Our findings are relevant for any VQE that uses an ansatz based on Pauli strings. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2109.05340v2-abstract-full').style.display = 'none'; document.getElementById('2109.05340v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 6 June, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 11 September, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">15+10 pages, 7 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Quantum 7, 1040 (2023) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2108.12466">arXiv:2108.12466</a> <span> [<a href="https://arxiv.org/pdf/2108.12466">pdf</a>, <a href="https://arxiv.org/format/2108.12466">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1038/s41534-022-00522-6">10.1038/s41534-022-00522-6 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Photonic resource state generation from a minimal number of quantum emitters </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Li%2C+B">Bikun Li</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2108.12466v2-abstract-short" style="display: inline;"> Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing c… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2108.12466v2-abstract-full').style.display = 'inline'; document.getElementById('2108.12466v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2108.12466v2-abstract-full" style="display: none;"> Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2108.12466v2-abstract-full').style.display = 'none'; document.getElementById('2108.12466v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 August, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 27 August, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">14 pages, 8 figures</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2108.01311">arXiv:2108.01311</a> <span> [<a href="https://arxiv.org/pdf/2108.01311">pdf</a>, <a href="https://arxiv.org/format/2108.01311">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Physics Education">physics.ed-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1109/TE.2022.3144943">10.1109/TE.2022.3144943 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Building a Quantum Engineering Undergraduate Program </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Asfaw%2C+A">Abraham Asfaw</a>, <a href="/search/quant-ph?searchtype=author&query=Blais%2C+A">Alexandre Blais</a>, <a href="/search/quant-ph?searchtype=author&query=Brown%2C+K+R">Kenneth R. Brown</a>, <a href="/search/quant-ph?searchtype=author&query=Candelaria%2C+J">Jonathan Candelaria</a>, <a href="/search/quant-ph?searchtype=author&query=Cantwell%2C+C">Christopher Cantwell</a>, <a href="/search/quant-ph?searchtype=author&query=Carr%2C+L+D">Lincoln D. Carr</a>, <a href="/search/quant-ph?searchtype=author&query=Combes%2C+J">Joshua Combes</a>, <a href="/search/quant-ph?searchtype=author&query=Debroy%2C+D+M">Dripto M. Debroy</a>, <a href="/search/quant-ph?searchtype=author&query=Donohue%2C+J+M">John M. Donohue</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Edwards%2C+E">Emily Edwards</a>, <a href="/search/quant-ph?searchtype=author&query=Fox%2C+M+F+J">Michael F. J. Fox</a>, <a href="/search/quant-ph?searchtype=author&query=Girvin%2C+S+M">Steven M. Girvin</a>, <a href="/search/quant-ph?searchtype=author&query=Ho%2C+A">Alan Ho</a>, <a href="/search/quant-ph?searchtype=author&query=Hurst%2C+H+M">Hilary M. Hurst</a>, <a href="/search/quant-ph?searchtype=author&query=Jacob%2C+Z">Zubin Jacob</a>, <a href="/search/quant-ph?searchtype=author&query=Johnson%2C+B+R">Blake R. Johnson</a>, <a href="/search/quant-ph?searchtype=author&query=Johnston-Halperin%2C+E">Ezekiel Johnston-Halperin</a>, <a href="/search/quant-ph?searchtype=author&query=Joynt%2C+R">Robert Joynt</a>, <a href="/search/quant-ph?searchtype=author&query=Kapit%2C+E">Eliot Kapit</a>, <a href="/search/quant-ph?searchtype=author&query=Klein-Seetharaman%2C+J">Judith Klein-Seetharaman</a>, <a href="/search/quant-ph?searchtype=author&query=Laforest%2C+M">Martin Laforest</a>, <a href="/search/quant-ph?searchtype=author&query=Lewandowski%2C+H+J">H. J. Lewandowski</a>, <a href="/search/quant-ph?searchtype=author&query=Lynn%2C+T+W">Theresa W. Lynn</a>, <a href="/search/quant-ph?searchtype=author&query=McRae%2C+C+R+H">Corey Rae H. McRae</a> , et al. (12 additional authors not shown) </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2108.01311v1-abstract-short" style="display: inline;"> The rapidly growing quantum information science and engineering (QISE) industry will require both quantum-aware and quantum-proficient engineers at the bachelor's level. We provide a roadmap for building a quantum engineering education program to satisfy this need. For quantum-aware engineers, we describe how to design a first quantum engineering course accessible to all STEM students. For the edu… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2108.01311v1-abstract-full').style.display = 'inline'; document.getElementById('2108.01311v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2108.01311v1-abstract-full" style="display: none;"> The rapidly growing quantum information science and engineering (QISE) industry will require both quantum-aware and quantum-proficient engineers at the bachelor's level. We provide a roadmap for building a quantum engineering education program to satisfy this need. For quantum-aware engineers, we describe how to design a first quantum engineering course accessible to all STEM students. For the education and training of quantum-proficient engineers, we detail both a quantum engineering minor accessible to all STEM majors, and a quantum track directly integrated into individual engineering majors. We propose that such programs typically require only three or four newly developed courses that complement existing engineering and science classes available on most larger campuses. We describe a conceptual quantum information science course for implementation at any post-secondary institution, including community colleges and military schools. QISE presents extraordinary opportunities to work towards rectifying issues of inclusivity and equity that continue to be pervasive within engineering. We present a plan to do so and describe how quantum engineering education presents an excellent set of education research opportunities. Finally, we outline a hands-on training plan on quantum hardware, a key component of any quantum engineering program, with a variety of technologies including optics, atoms and ions, cryogenic and solid-state technologies, nanofabrication, and control and readout electronics. Our recommendations provide a flexible framework that can be tailored for academic institutions ranging from teaching and undergraduate-focused two- and four-year colleges to research-intensive universities. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2108.01311v1-abstract-full').style.display = 'none'; document.getElementById('2108.01311v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 3 August, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> August 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">25 pages, 2 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> IEEE Transactions on Education 65, 220 (2022) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2105.08594">arXiv:2105.08594</a> <span> [<a href="https://arxiv.org/pdf/2105.08594">pdf</a>, <a href="https://arxiv.org/format/2105.08594">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevB.104.115302">10.1103/PhysRevB.104.115302 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Optical control protocols for high-fidelity spin rotations of single SiV$^{-}$ and SnV$^{-}$ centers in diamond </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Takou%2C+E">Evangelia Takou</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2105.08594v1-abstract-short" style="display: inline;"> Silicon-vacancy and tin-vacancy defects in diamond are of interest as alternative qubits to the NV center due to their superior optical properties. While the availability of optical transitions in these defects is one of their assets, high-fidelity optical coherent control has not been demonstrated. Here, we design novel optical control schemes tailored to these defects. We evaluate the performanc… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2105.08594v1-abstract-full').style.display = 'inline'; document.getElementById('2105.08594v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2105.08594v1-abstract-full" style="display: none;"> Silicon-vacancy and tin-vacancy defects in diamond are of interest as alternative qubits to the NV center due to their superior optical properties. While the availability of optical transitions in these defects is one of their assets, high-fidelity optical coherent control has not been demonstrated. Here, we design novel optical control schemes tailored to these defects. We evaluate the performance of arbitrary single-qubit rotations of the electron spin qubit both in the absence and presence of an external magnetic field, by taking into account both coherent and incoherent errors. We find that rotations in excess of $98.0\%$ ($T=4$~K) and $99.71\%$ ($T=6$~K) can be achieved for Si-V and Sn-V respectively in the presence of realistic relaxation and leakage errors. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2105.08594v1-abstract-full').style.display = 'none'; document.getElementById('2105.08594v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 18 May, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> May 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">23 pages, 12 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. B 104, 115302 (2021) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2103.13388">arXiv:2103.13388</a> <span> [<a href="https://arxiv.org/pdf/2103.13388">pdf</a>, <a href="https://arxiv.org/format/2103.13388">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PRXQuantum.2.040329">10.1103/PRXQuantum.2.040329 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Preparing Bethe Ansatz Eigenstates on a Quantum Computer </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Van+Dyke%2C+J+S">John S. Van Dyke</a>, <a href="/search/quant-ph?searchtype=author&query=Barron%2C+G+S">George S. Barron</a>, <a href="/search/quant-ph?searchtype=author&query=Mayhall%2C+N+J">Nicholas J. Mayhall</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2103.13388v3-abstract-short" style="display: inline;"> Several quantum many-body models in one dimension possess exact solutions via the Bethe ansatz method, which has been highly successful for understanding their behavior. Nevertheless, there remain physical properties of such models for which analytic results are unavailable, and which are also not well-described by approximate numerical methods. Preparing Bethe ansatz eigenstates directly on a qua… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.13388v3-abstract-full').style.display = 'inline'; document.getElementById('2103.13388v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2103.13388v3-abstract-full" style="display: none;"> Several quantum many-body models in one dimension possess exact solutions via the Bethe ansatz method, which has been highly successful for understanding their behavior. Nevertheless, there remain physical properties of such models for which analytic results are unavailable, and which are also not well-described by approximate numerical methods. Preparing Bethe ansatz eigenstates directly on a quantum computer would allow straightforward extraction of these quantities via measurement. We present a quantum algorithm for preparing Bethe ansatz eigenstates of the spin-1/2 XXZ spin chain that correspond to real-valued solutions of the Bethe equations. The algorithm is polynomial in the number of T gates and circuit depth, with modest constant prefactors. Although the algorithm is probabilistic, with a success rate that decreases with increasing eigenstate energy, we employ amplitude amplification to boost the success probability. The resource requirements for our approach are lower than other state-of-the-art quantum simulation algorithms for small error-corrected devices, and thus may offer an alternative and computationally less-demanding demonstration of quantum advantage for physically relevant problems. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.13388v3-abstract-full').style.display = 'none'; document.getElementById('2103.13388v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 24 November, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 24 March, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">14 pages, 9 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> PRX Quantum 2, 040329 (2021) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2103.12305">arXiv:2103.12305</a> <span> [<a href="https://arxiv.org/pdf/2103.12305">pdf</a>, <a href="https://arxiv.org/format/2103.12305">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> </div> <p class="title is-5 mathjax"> A universal quantum gate set for transmon qubits with strong ZZ interactions </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Long%2C+J">Junling Long</a>, <a href="/search/quant-ph?searchtype=author&query=Zhao%2C+T">Tongyu Zhao</a>, <a href="/search/quant-ph?searchtype=author&query=Bal%2C+M">Mustafa Bal</a>, <a href="/search/quant-ph?searchtype=author&query=Zhao%2C+R">Ruichen Zhao</a>, <a href="/search/quant-ph?searchtype=author&query=Barron%2C+G+S">George S. Barron</a>, <a href="/search/quant-ph?searchtype=author&query=Ku%2C+H">Hsiang-sheng Ku</a>, <a href="/search/quant-ph?searchtype=author&query=Howard%2C+J+A">Joel A. Howard</a>, <a href="/search/quant-ph?searchtype=author&query=Wu%2C+X">Xian Wu</a>, <a href="/search/quant-ph?searchtype=author&query=McRae%2C+C+R+H">Corey Rae H. McRae</a>, <a href="/search/quant-ph?searchtype=author&query=Deng%2C+X">Xiu-Hao Deng</a>, <a href="/search/quant-ph?searchtype=author&query=Ribeill%2C+G+J">Guilhem J. Ribeill</a>, <a href="/search/quant-ph?searchtype=author&query=Singh%2C+M">Meenakshi Singh</a>, <a href="/search/quant-ph?searchtype=author&query=Ohki%2C+T+A">Thomas A. Ohki</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Pappas%2C+D+P">David P. Pappas</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2103.12305v1-abstract-short" style="display: inline;"> High-fidelity single- and two-qubit gates are essential building blocks for a fault-tolerant quantum computer. While there has been much progress in suppressing single-qubit gate errors in superconducting qubit systems, two-qubit gates still suffer from error rates that are orders of magnitude higher. One limiting factor is the residual ZZ-interaction, which originates from a coupling between comp… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.12305v1-abstract-full').style.display = 'inline'; document.getElementById('2103.12305v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2103.12305v1-abstract-full" style="display: none;"> High-fidelity single- and two-qubit gates are essential building blocks for a fault-tolerant quantum computer. While there has been much progress in suppressing single-qubit gate errors in superconducting qubit systems, two-qubit gates still suffer from error rates that are orders of magnitude higher. One limiting factor is the residual ZZ-interaction, which originates from a coupling between computational states and higher-energy states. While this interaction is usually viewed as a nuisance, here we experimentally demonstrate that it can be exploited to produce a universal set of fast single- and two-qubit entangling gates in a coupled transmon qubit system. To implement arbitrary single-qubit rotations, we design a new protocol called the two-axis gate that is based on a three-part composite pulse. It rotates a single qubit independently of the state of the other qubit despite the strong ZZ-coupling. We achieve single-qubit gate fidelities as high as 99.1% from randomized benchmarking measurements. We then demonstrate both a CZ gate and a CNOT gate. Because the system has a strong ZZ-interaction, a CZ gate can be achieved by letting the system freely evolve for a gate time $t_g=53.8$ ns. To design the CNOT gate, we utilize an analytical microwave pulse shape based on the SWIPHT protocol for realizing fast, low-leakage gates. We obtain fidelities of 94.6% and 97.8% for the CNOT and CZ gates respectively from quantum progress tomography. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.12305v1-abstract-full').style.display = 'none'; document.getElementById('2103.12305v1-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 23 March, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2021. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2103.08029">arXiv:2103.08029</a> <span> [<a href="https://arxiv.org/pdf/2103.08029">pdf</a>, <a href="https://arxiv.org/format/2103.08029">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PRXQuantum.2.030333">10.1103/PRXQuantum.2.030333 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Doubly geometric quantum control </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Dong%2C+W">Wenzheng Dong</a>, <a href="/search/quant-ph?searchtype=author&query=Zhuang%2C+F">Fei Zhuang</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2103.08029v2-abstract-short" style="display: inline;"> In holonomic quantum computation, single-qubit gates are performed using driving protocols that trace out closed loops on the Bloch sphere, making them robust to certain pulse errors. However, dephasing noise that is transverse to the drive, which is significant in many qubit platforms, lies outside the family of correctable errors. Here, we present a general procedure that combines two types of g… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.08029v2-abstract-full').style.display = 'inline'; document.getElementById('2103.08029v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2103.08029v2-abstract-full" style="display: none;"> In holonomic quantum computation, single-qubit gates are performed using driving protocols that trace out closed loops on the Bloch sphere, making them robust to certain pulse errors. However, dephasing noise that is transverse to the drive, which is significant in many qubit platforms, lies outside the family of correctable errors. Here, we present a general procedure that combines two types of geometry -- holonomy loops on the Bloch sphere and geometric space curves in three dimensions -- to design gates that simultaneously suppress pulse errors and transverse noise errors. We demonstrate this doubly geometric control technique by designing explicit examples of such dynamically corrected holonomic gates. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.08029v2-abstract-full').style.display = 'none'; document.getElementById('2103.08029v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 20 July, 2021; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 14 March, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">15 pages, 13 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> PRX Quantum 2, 030333 (2021) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2103.07586">arXiv:2103.07586</a> <span> [<a href="https://arxiv.org/pdf/2103.07586">pdf</a>, <a href="https://arxiv.org/format/2103.07586">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.22331/q-2022-02-02-639">10.22331/q-2022-02-02-639 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Noise-resistant Landau-Zener sweeps from geometrical curves </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Zhuang%2C+F">Fei Zhuang</a>, <a href="/search/quant-ph?searchtype=author&query=Zeng%2C+J">Junkai Zeng</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2103.07586v3-abstract-short" style="display: inline;"> Landau-Zener physics is often exploited to generate quantum logic gates and to perform state initialization and readout. The quality of these operations can be degraded by noise fluctuations in the energy gap at the avoided crossing. We leverage a recently discovered correspondence between qubit evolution and space curves in three dimensions to design noise-robust Landau-Zener sweeps through an av… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.07586v3-abstract-full').style.display = 'inline'; document.getElementById('2103.07586v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2103.07586v3-abstract-full" style="display: none;"> Landau-Zener physics is often exploited to generate quantum logic gates and to perform state initialization and readout. The quality of these operations can be degraded by noise fluctuations in the energy gap at the avoided crossing. We leverage a recently discovered correspondence between qubit evolution and space curves in three dimensions to design noise-robust Landau-Zener sweeps through an avoided crossing. In the case where the avoided crossing is purely noise-induced, we prove that operations based on monotonic sweeps cannot be robust to noise. Hence, we design families of phase gates based on non-monotonic drives that are error-robust up to second order. In the general case where there is an avoided crossing even in the absence of noise, we present a general technique for designing robust driving protocols that takes advantage of a relationship between the Landau-Zener problem and space curves of constant torsion. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2103.07586v3-abstract-full').style.display = 'none'; document.getElementById('2103.07586v3-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 31 January, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 12 March, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">13 pages, 11 figures; v3: final published version</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Quantum 6, 639 (2022) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2101.11592">arXiv:2101.11592</a> <span> [<a href="https://arxiv.org/pdf/2101.11592">pdf</a>, <a href="https://arxiv.org/format/2101.11592">other</a>] </span> </p> <div class="tags is-inline-block"> <span class="tag is-small is-link tooltip is-tooltip-top" data-tooltip="Quantum Physics">quant-ph</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Mesoscale and Nanoscale Physics">cond-mat.mes-hall</span> </div> <div class="is-inline-block" style="margin-left: 0.5rem"> <div class="tags has-addons"> <span class="tag is-dark is-size-7">doi</span> <span class="tag is-light is-size-7"><a class="" href="https://doi.org/10.1103/PhysRevB.106.165302">10.1103/PhysRevB.106.165302 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Fast high-fidelity single-qubit gates for flip-flop qubits in silicon </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Calderon-Vargas%2C+F+A">Fernando A. Calderon-Vargas</a>, <a href="/search/quant-ph?searchtype=author&query=Barnes%2C+E">Edwin Barnes</a>, <a href="/search/quant-ph?searchtype=author&query=Economou%2C+S+E">Sophia E. Economou</a> </p> <p class="abstract mathjax"> <span class="has-text-black-bis has-text-weight-semibold">Abstract</span>: <span class="abstract-short has-text-grey-dark mathjax" id="2101.11592v2-abstract-short" style="display: inline;"> The flip-flop qubit, encoded in the states with antiparallel donor-bound electron and donor nuclear spins in silicon, showcases long coherence times, good controllability, and, in contrast to other donor-spin-based schemes, long-distance coupling. Electron spin control near the interface, however, is likely to shorten the relaxation time by many orders of magnitude, reducing the overall qubit qual… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2101.11592v2-abstract-full').style.display = 'inline'; document.getElementById('2101.11592v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2101.11592v2-abstract-full" style="display: none;"> The flip-flop qubit, encoded in the states with antiparallel donor-bound electron and donor nuclear spins in silicon, showcases long coherence times, good controllability, and, in contrast to other donor-spin-based schemes, long-distance coupling. Electron spin control near the interface, however, is likely to shorten the relaxation time by many orders of magnitude, reducing the overall qubit quality factor. Here, we theoretically study the multilevel system that is formed by the interacting electron and nuclear spins and derive analytical effective two-level Hamiltonians with and without periodic driving. We then propose an optimal control scheme that produces fast and robust single-qubit gates in the presence of low-frequency noise without relying on parametrically restrictive sweet spots. This scheme increases considerably both the relaxation time and the qubit quality factor. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2101.11592v2-abstract-full').style.display = 'none'; document.getElementById('2101.11592v2-abstract-short').style.display = 'inline';">△ Less</a> </span> </p> <p class="is-size-7"><span class="has-text-black-bis has-text-weight-semibold">Submitted</span> 10 October, 2022; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 27 January, 2021; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> January 2021. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Comments:</span> <span class="has-text-grey-dark mathjax">Published version, 16 pages, 8 figures</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Rev. B 106, 165302 (2022) </p> </li> </ol> <nav class="pagination is-small is-centered breathe-horizontal" role="navigation" aria-label="pagination"> <a href="" class="pagination-previous is-invisible">Previous </a> <a href="/search/?searchtype=author&query=Economou%2C+S+E&start=50" class="pagination-next" >Next </a> <ul class="pagination-list"> <li> <a href="/search/?searchtype=author&query=Economou%2C+S+E&start=0" class="pagination-link is-current" aria-label="Goto page 1">1 </a> </li> <li> <a href="/search/?searchtype=author&query=Economou%2C+S+E&start=50" class="pagination-link " aria-label="Page 2" aria-current="page">2 </a> </li> </ul> </nav> <div class="is-hidden-tablet">  <span class="help" style="display: inline-block;"><a href="https://github.com/arXiv/arxiv-search/releases">Search v0.5.6 released 2020-02-24</a>  </span> </div> </div> </main> <footer> <div class="columns is-desktop" role="navigation" aria-label="Secondary">  <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/about">About</a></li> <li><a href="https://info.arxiv.org/help">Help</a></li> </ul> </div> <div class="column"> <ul class="nav-spaced"> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>contact arXiv</title><desc>Click here to contact arXiv</desc><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg> <a href="https://info.arxiv.org/help/contact.html"> Contact</a> </li> <li> <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><title>subscribe to arXiv mailings</title><desc>Click here to subscribe</desc><path d="M476 3.2L12.5 270.6c-18.1 10.4-15.8 35.6 2.2 43.2L121 358.4l287.3-253.2c5.5-4.9 13.3 2.6 8.6 8.3L176 407v80.5c0 23.6 28.5 32.9 42.5 15.8L282 426l124.6 52.2c14.2 6 30.4-2.9 33-18.2l72-432C515 7.8 493.3-6.8 476 3.2z"/></svg> <a href="https://info.arxiv.org/help/subscribe"> Subscribe</a> </li> </ul> </div> </div> </div>   <div class="column"> <div class="columns"> <div class="column"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/license/index.html">Copyright</a></li> <li><a href="https://info.arxiv.org/help/policies/privacy_policy.html">Privacy Policy</a></li> </ul> </div> <div class="column sorry-app-links"> <ul class="nav-spaced"> <li><a href="https://info.arxiv.org/help/web_accessibility.html">Web Accessibility Assistance</a></li> <li> <p class="help"> <a class="a11y-main-link" href="https://status.arxiv.org" target="_blank">arXiv Operational Status <svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 256 512" class="icon filter-dark_grey" role="presentation"><path d="M224.3 273l-136 136c-9.4 9.4-24.6 9.4-33.9 0l-22.6-22.6c-9.4-9.4-9.4-24.6 0-33.9l96.4-96.4-96.4-96.4c-9.4-9.4-9.4-24.6 0-33.9L54.3 103c9.4-9.4 24.6-9.4 33.9 0l136 136c9.5 9.4 9.5 24.6.1 34z"/></svg></a><br> Get status notifications via <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/email/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512" class="icon filter-black" role="presentation"><path d="M502.3 190.8c3.9-3.1 9.7-.2 9.7 4.7V400c0 26.5-21.5 48-48 48H48c-26.5 0-48-21.5-48-48V195.6c0-5 5.7-7.8 9.7-4.7 22.4 17.4 52.1 39.5 154.1 113.6 21.1 15.4 56.7 47.8 92.2 47.6 35.7.3 72-32.8 92.3-47.6 102-74.1 131.6-96.3 154-113.7zM256 320c23.2.4 56.6-29.2 73.4-41.4 132.7-96.3 142.8-104.7 173.4-128.7 5.8-4.5 9.2-11.5 9.2-18.9v-19c0-26.5-21.5-48-48-48H48C21.5 64 0 85.5 0 112v19c0 7.4 3.4 14.3 9.2 18.9 30.6 23.9 40.7 32.4 173.4 128.7 16.8 12.2 50.2 41.8 73.4 41.4z"/></svg>email</a> or <a class="is-link" href="https://subscribe.sorryapp.com/24846f03/slack/new" target="_blank"><svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512" class="icon filter-black" role="presentation"><path d="M94.12 315.1c0 25.9-21.16 47.06-47.06 47.06S0 341 0 315.1c0-25.9 21.16-47.06 47.06-47.06h47.06v47.06zm23.72 0c0-25.9 21.16-47.06 47.06-47.06s47.06 21.16 47.06 47.06v117.84c0 25.9-21.16 47.06-47.06 47.06s-47.06-21.16-47.06-47.06V315.1zm47.06-188.98c-25.9 0-47.06-21.16-47.06-47.06S139 32 164.9 32s47.06 21.16 47.06 47.06v47.06H164.9zm0 23.72c25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06H47.06C21.16 243.96 0 222.8 0 196.9s21.16-47.06 47.06-47.06H164.9zm188.98 47.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06s-21.16 47.06-47.06 47.06h-47.06V196.9zm-23.72 0c0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06V79.06c0-25.9 21.16-47.06 47.06-47.06 25.9 0 47.06 21.16 47.06 47.06V196.9zM283.1 385.88c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06-25.9 0-47.06-21.16-47.06-47.06v-47.06h47.06zm0-23.72c-25.9 0-47.06-21.16-47.06-47.06 0-25.9 21.16-47.06 47.06-47.06h117.84c25.9 0 47.06 21.16 47.06 47.06 0 25.9-21.16 47.06-47.06 47.06H283.1z"/></svg>slack</a> </p> </li> </ul> </div> </div> </div>  </div> </footer> <script src="https://static.arxiv.org/static/base/1.0.0a5/js/member_acknowledgement.js"></script> </body> </html>

CINXE.COM

Search | arXiv e-print repository