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–14 of 14 results for author: <span class="mathjax">Ying, S</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=Ying%2C+S">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="Ying, S"> </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=Ying%2C+S&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="Ying, S"> <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> <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/2412.20893">arXiv:2412.20893</a> <span> [<a href="https://arxiv.org/pdf/2412.20893">pdf</a>, <a href="https://arxiv.org/format/2412.20893">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"> Redesign Quantum Circuits on Quantum Hardware Device </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=He%2C+R">Runhong He</a>, <a href="/search/quant-ph?searchtype=author&query=Guan%2C+J">Ji Guan</a>, <a href="/search/quant-ph?searchtype=author&query=Hong%2C+X">Xin Hong</a>, <a href="/search/quant-ph?searchtype=author&query=Xu%2C+X">Xusheng Xu</a>, <a href="/search/quant-ph?searchtype=author&query=Cui%2C+G">Guolong Cui</a>, <a href="/search/quant-ph?searchtype=author&query=Wang%2C+S">Shengbin Wang</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</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="2412.20893v1-abstract-short" style="display: inline;"> In the process of exploring quantum algorithms, researchers often need to conduct equivalence checking of quantum circuits with different structures or to reconstruct a circuit in a variational manner, aiming to reduce the depth of the target circuit. Whereas the exponential resource overhead for describing quantum systems classically makes the existing methods not amenable to serving large-scale… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.20893v1-abstract-full').style.display = 'inline'; document.getElementById('2412.20893v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2412.20893v1-abstract-full" style="display: none;"> In the process of exploring quantum algorithms, researchers often need to conduct equivalence checking of quantum circuits with different structures or to reconstruct a circuit in a variational manner, aiming to reduce the depth of the target circuit. Whereas the exponential resource overhead for describing quantum systems classically makes the existing methods not amenable to serving large-scale quantum circuits. Grounded in the entangling quantum generative adversarial network (EQ-GAN), we present in this article a new architecture which enables one to redesign large-scale quantum circuits on quantum hardware. For concreteness, we apply this architecture to three crucial applications in circuit optimization, including the equivalence checking of (non-) parameterized circuits, as well as the variational reconstruction of quantum circuits. The feasibility of our approach is demonstrated by the excellent results of these applications, which are implemented both in classical computers and current NISQ hardware. We believe our work should facilitate the implementation and validation of the advantages of quantum algorithms. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2412.20893v1-abstract-full').style.display = 'none'; document.getElementById('2412.20893v1-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> 30 December, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 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,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/2409.03185">arXiv:2409.03185</a> <span> [<a href="https://arxiv.org/pdf/2409.03185">pdf</a>, <a href="https://arxiv.org/ps/2409.03185">ps</a>, <a href="https://arxiv.org/format/2409.03185">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="Emerging Technologies">cs.ET</span> </div> </div> <p class="title is-5 mathjax"> DasAtom: A Divide-and-Shuttle Atom Approach to Quantum Circuit Transformation </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Huang%2C+Y">Yunqi Huang</a>, <a href="/search/quant-ph?searchtype=author&query=Gao%2C+D">Dingchao Gao</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Li%2C+S">Sanjiang Li</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="2409.03185v2-abstract-short" style="display: inline;"> Neutral atom (NA) quantum systems are emerging as a leading platform for quantum computation, offering superior or competitive qubit count and gate fidelity compared to superconducting circuits and ion traps. However, the unique features of NA devices, such as long-range interactions, long qubit coherence time, and the ability to physically move qubits, present distinct challenges for quantum circ… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.03185v2-abstract-full').style.display = 'inline'; document.getElementById('2409.03185v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2409.03185v2-abstract-full" style="display: none;"> Neutral atom (NA) quantum systems are emerging as a leading platform for quantum computation, offering superior or competitive qubit count and gate fidelity compared to superconducting circuits and ion traps. However, the unique features of NA devices, such as long-range interactions, long qubit coherence time, and the ability to physically move qubits, present distinct challenges for quantum circuit compilation. In this paper, we introduce DasAtom, a novel divide-and-shuttle atom approach designed to optimise quantum circuit transformation for NA devices by leveraging these capabilities. DasAtom partitions circuits into subcircuits, each associated with a qubit mapping that allows all gates within the subcircuit to be directly executed. The algorithm then shuttles atoms to transition seamlessly from one mapping to the next, enhancing both execution efficiency and overall fidelity. For a 30-qubit Quantum Fourier Transform (QFT), DasAtom achieves a 414x improvement in fidelity over the move-based algorithm Enola and a 10.6x improvement over the SWAP-based algorithm Tetris. Notably, this improvement is expected to increase exponentially with the number of qubits, positioning DasAtom as a highly promising solution for scaling quantum computation on NA platforms. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2409.03185v2-abstract-full').style.display = 'none'; document.getElementById('2409.03185v2-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 January, 2025; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 4 September, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> September 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">This paper is accepted by IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2404.02509">arXiv:2404.02509</a> <span> [<a href="https://arxiv.org/pdf/2404.02509">pdf</a>, <a href="https://arxiv.org/ps/2404.02509">ps</a>, <a href="https://arxiv.org/format/2404.02509">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 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/1402-4896/ad770b">10.1088/1402-4896/ad770b <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Utilizing Quantum Processor for the Analysis of Strongly Correlated Materials </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Li%2C+H">Hengyue Li</a>, <a href="/search/quant-ph?searchtype=author&query=Yang%2C+Y">Yusheng Yang</a>, <a href="/search/quant-ph?searchtype=author&query=Lv%2C+P">Pin Lv</a>, <a href="/search/quant-ph?searchtype=author&query=Qu%2C+J">Jinglong Qu</a>, <a href="/search/quant-ph?searchtype=author&query=Wang%2C+Z">Zhe-Hui Wang</a>, <a href="/search/quant-ph?searchtype=author&query=Sun%2C+J">Jian Sun</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</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="2404.02509v2-abstract-short" style="display: inline;"> This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's Green's function, requiring only real-number computations on the quantum circuit instead of complex ones. This approach is inherently more suited to quantum circui… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.02509v2-abstract-full').style.display = 'inline'; document.getElementById('2404.02509v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2404.02509v2-abstract-full" style="display: none;"> This study introduces a systematic approach for analyzing strongly correlated systems by adapting the conventional quantum cluster method to a quantum circuit model. We have developed a more concise formula for calculating the cluster's Green's function, requiring only real-number computations on the quantum circuit instead of complex ones. This approach is inherently more suited to quantum circuits, which primarily yield statistical probabilities. As an illustrative example, we explored the Hubbard model on a 2D lattice. The ground state is determined utilizing Xiaohong, a superconducting quantum processor equipped with 66 qubits, supplied by QuantumCTek Co., Ltd. Subsequently, we employed the circuit model to compute the real-time retarded Green's function for the cluster, which is then used to determine the lattice Green's function. We conducted an examination of the band structure in the insulator phase of the lattice system. This preliminary investigation lays the groundwork for exploring a wealth of innovative physics within the field of condensed matter physics. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2404.02509v2-abstract-full').style.display = 'none'; document.getElementById('2404.02509v2-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 August, 2024; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 3 April, 2024; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2024. </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Scr. 99 105117 (2024) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/2205.03866">arXiv:2205.03866</a> <span>  </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"> isQ: Towards a Practical Software Stack for Quantum Programming </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Guo%2C+J">Jingzhe Guo</a>, <a href="/search/quant-ph?searchtype=author&query=Lou%2C+H">Huazhe Lou</a>, <a href="/search/quant-ph?searchtype=author&query=Li%2C+R">Riling Li</a>, <a href="/search/quant-ph?searchtype=author&query=Fang%2C+W">Wang Fang</a>, <a href="/search/quant-ph?searchtype=author&query=Liu%2C+J">Junyi Liu</a>, <a href="/search/quant-ph?searchtype=author&query=Long%2C+P">Peixun Long</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</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.03866v2-abstract-short" style="display: inline;"> We introduce isQ, a new software stack for quantum programming in an imperative programming language, also named isQ. The aim of isQ is to make the programmers write quantum programs as conveniently as possible. In particular: 1) The isQ language and its compiler contain many features, including some not well supported by (most) other quantum programming platforms, e.g. classical control flow such… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.03866v2-abstract-full').style.display = 'inline'; document.getElementById('2205.03866v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="2205.03866v2-abstract-full" style="display: none;"> We introduce isQ, a new software stack for quantum programming in an imperative programming language, also named isQ. The aim of isQ is to make the programmers write quantum programs as conveniently as possible. In particular: 1) The isQ language and its compiler contain many features, including some not well supported by (most) other quantum programming platforms, e.g. classical control flow such as recursion; decomposition of selfdefined unitary gates; and oracle programming and its circuit realization. 2) To make it flexible, an isQ program can be compiled into several kinds of intermediate representation, including OpenQASM 3.0, QIR and QCIS (specially tailored for the superconducting quantum hardware at USTC). 3) Besides interfacing isQ with true superconducting hardware, a QIR simulator is also developed for demonstration and testing of isQ programs. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('2205.03866v2-abstract-full').style.display = 'none'; document.getElementById('2205.03866v2-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 November, 2023; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 8 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">This old version was not well written. And a new version of this paper is published (open access) on TQE. DOI:doi.org/10.1109/TQE.2023.3275868</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1803.10393">arXiv:1803.10393</a> <span> [<a href="https://arxiv.org/pdf/1803.10393">pdf</a>, <a href="https://arxiv.org/ps/1803.10393">ps</a>, <a href="https://arxiv.org/format/1803.10393">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="Logic in Computer Science">cs.LO</span> </div> </div> <p class="title is-5 mathjax"> Quantum Coupling and Strassen Theorem </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Zhou%2C+L">Li Zhou</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Yu%2C+N">Nengkun Yu</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</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="1803.10393v1-abstract-short" style="display: inline;"> We introduce a quantum generalisation of the notion of coupling in probability theory. Several interesting examples and basic properties of quantum couplings are presented. In particular, we prove a quantum extension of Strassen theorem for probabilistic couplings, a fundamental theorem in probability theory that can be used to bound the probability of an event in a distribution by the probability… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1803.10393v1-abstract-full').style.display = 'inline'; document.getElementById('1803.10393v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1803.10393v1-abstract-full" style="display: none;"> We introduce a quantum generalisation of the notion of coupling in probability theory. Several interesting examples and basic properties of quantum couplings are presented. In particular, we prove a quantum extension of Strassen theorem for probabilistic couplings, a fundamental theorem in probability theory that can be used to bound the probability of an event in a distribution by the probability of an event in another distribution coupled with the first. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1803.10393v1-abstract-full').style.display = 'none'; document.getElementById('1803.10393v1-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> 27 March, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2018. </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1803.02673">arXiv:1803.02673</a> <span> [<a href="https://arxiv.org/pdf/1803.02673">pdf</a>, <a href="https://arxiv.org/ps/1803.02673">ps</a>, <a href="https://arxiv.org/format/1803.02673">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.1063/5.0068344">10.1063/5.0068344 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Quantum Earth mover's distance, No-go Quantum Kantorovich-Rubinstein theorem, and Quantum Marginal Problem </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Yu%2C+N">Nengkun Yu</a>, <a href="/search/quant-ph?searchtype=author&query=Zhou%2C+L">Li Zhou</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</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="1803.02673v2-abstract-short" style="display: inline;"> The earth mover's distance is a measure of the distance between two probabilistic measures. It plays a fundamental role in mathematics and computer science. The Kantorovich-Rubinstein theorem provides a formula for the earth mover's distance on the space of regular probability Borel measures on a compact metric space. In this paper, we investigate the quantum earth mover's distance. We show a no-g… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1803.02673v2-abstract-full').style.display = 'inline'; document.getElementById('1803.02673v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1803.02673v2-abstract-full" style="display: none;"> The earth mover's distance is a measure of the distance between two probabilistic measures. It plays a fundamental role in mathematics and computer science. The Kantorovich-Rubinstein theorem provides a formula for the earth mover's distance on the space of regular probability Borel measures on a compact metric space. In this paper, we investigate the quantum earth mover's distance. We show a no-go Kantorovich-Rubinstein theorem in the quantum setting. More precisely, we show that the trace distance between two quantum states can not be determined by their earth mover's distance. The technique here is to track the bipartite quantum marginal problem. Then we provide inequality to describe the structure of quantum coupling, which can be regarded as quantum generalization of Kantorovich-Rubinstein theorem. After that, we generalize it to obtain into the tripartite version, and build a new class of necessary criteria for the tripartite marginal problem. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1803.02673v2-abstract-full').style.display = 'none'; document.getElementById('1803.02673v2-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 March, 2019; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 28 February, 2018; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> March 2018. </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">arXiv admin note: text overlap with arXiv:quant-ph/0506138 by other authors</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1707.09893">arXiv:1707.09893</a> <span> [<a href="https://arxiv.org/pdf/1707.09893">pdf</a>, <a href="https://arxiv.org/ps/1707.09893">ps</a>, <a href="https://arxiv.org/format/1707.09893">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="Cryptography and Security">cs.CR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Quantum Privacy-Preserving Perceptron </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Feng%2C+Y">Yuan Feng</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="1707.09893v1-abstract-short" style="display: inline;"> With the extensive applications of machine learning, the issue of private or sensitive data in the training examples becomes more and more serious: during the training process, personal information or habits may be disclosed to unexpected persons or organisations, which can cause serious privacy problems or even financial loss. In this paper, we present a quantum privacy-preserving algorithm for m… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1707.09893v1-abstract-full').style.display = 'inline'; document.getElementById('1707.09893v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1707.09893v1-abstract-full" style="display: none;"> With the extensive applications of machine learning, the issue of private or sensitive data in the training examples becomes more and more serious: during the training process, personal information or habits may be disclosed to unexpected persons or organisations, which can cause serious privacy problems or even financial loss. In this paper, we present a quantum privacy-preserving algorithm for machine learning with perceptron. There are mainly two steps to protect original training examples. Firstly when checking the current classifier, quantum tests are employed to detect data user's possible dishonesty. Secondly when updating the current classifier, private random noise is used to protect the original data. The advantages of our algorithm are: (1) it protects training examples better than the known classical methods; (2) it requires no quantum database and thus is easy to implement. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1707.09893v1-abstract-full').style.display = 'none'; document.getElementById('1707.09893v1-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, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> July 2017. </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">30 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/1702.04420">arXiv:1702.04420</a> <span> [<a href="https://arxiv.org/pdf/1702.04420">pdf</a>, <a href="https://arxiv.org/ps/1702.04420">ps</a>, <a href="https://arxiv.org/format/1702.04420">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="Cryptography and Security">cs.CR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Databases">cs.DB</span> </div> </div> <p class="title is-5 mathjax"> Quantum Privacy-Preserving Data Analytics </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Feng%2C+Y">Yuan Feng</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="1702.04420v1-abstract-short" style="display: inline;"> Data analytics (such as association rule mining and decision tree mining) can discover useful statistical knowledge from a big data set. But protecting the privacy of the data provider and the data user in the process of analytics is a serious issue. Usually, the privacy of both parties cannot be fully protected simultaneously by a classical algorithm. In this paper, we present a quantum protocol… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.04420v1-abstract-full').style.display = 'inline'; document.getElementById('1702.04420v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1702.04420v1-abstract-full" style="display: none;"> Data analytics (such as association rule mining and decision tree mining) can discover useful statistical knowledge from a big data set. But protecting the privacy of the data provider and the data user in the process of analytics is a serious issue. Usually, the privacy of both parties cannot be fully protected simultaneously by a classical algorithm. In this paper, we present a quantum protocol for data mining that can much better protect privacy than the known classical algorithms: (1) if both the data provider and the data user are honest, the data user can know nothing about the database except the statistical results, and the data provider can get nearly no information about the results mined by the data user; (2) if the data user is dishonest and tries to disclose private information of the other, she/he will be detected with a high probability; (3) if the data provider tries to disclose the privacy of the data user, she/he cannot get any useful information since the data user hides his privacy among noises. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1702.04420v1-abstract-full').style.display = 'none'; document.getElementById('1702.04420v1-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 February, 2017; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> February 2017. </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">50 pages, 1 figure</span> </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1512.04009">arXiv:1512.04009</a> <span> [<a href="https://arxiv.org/pdf/1512.04009">pdf</a>, <a href="https://arxiv.org/ps/1512.04009">ps</a>, <a href="https://arxiv.org/format/1512.04009">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="Cryptography and Security">cs.CR</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Databases">cs.DB</span> <span class="tag is-small is-grey tooltip is-tooltip-top" data-tooltip="Machine Learning">cs.LG</span> </div> </div> <p class="title is-5 mathjax"> Quantum Privacy-Preserving Data Mining </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Feng%2C+Y">Yuan Feng</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="1512.04009v2-abstract-short" style="display: inline;"> Data mining is a key technology in big data analytics and it can discover understandable knowledge (patterns) hidden in large data sets. Association rule is one of the most useful knowledge patterns, and a large number of algorithms have been developed in the data mining literature to generate association rules corresponding to different problems and situations. Privacy becomes a vital issue when… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1512.04009v2-abstract-full').style.display = 'inline'; document.getElementById('1512.04009v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1512.04009v2-abstract-full" style="display: none;"> Data mining is a key technology in big data analytics and it can discover understandable knowledge (patterns) hidden in large data sets. Association rule is one of the most useful knowledge patterns, and a large number of algorithms have been developed in the data mining literature to generate association rules corresponding to different problems and situations. Privacy becomes a vital issue when data mining is used to sensitive data sets like medical records, commercial data sets and national security. In this Letter, we present a quantum protocol for mining association rules on vertically partitioned databases. The quantum protocol can improve the privacy level preserved by known classical protocols and at the same time it can exponentially reduce the computational complexity and communication cost. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1512.04009v2-abstract-full').style.display = 'none'; document.getElementById('1512.04009v2-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 January, 2016; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 13 December, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> December 2015. </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">5 pages. 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/1506.01365">arXiv:1506.01365</a> <span> [<a href="https://arxiv.org/pdf/1506.01365">pdf</a>, <a href="https://arxiv.org/ps/1506.01365">ps</a>, <a href="https://arxiv.org/format/1506.01365">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.1016/j.ic.2015.09.003">10.1016/j.ic.2015.09.003 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Hardy is (almost) everywhere: nonlocality without inequalities for almost all entangled multipartite states </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Abramsky%2C+S">Samson Abramsky</a>, <a href="/search/quant-ph?searchtype=author&query=Constantin%2C+C+M">Carmen M. Constantin</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</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="1506.01365v1-abstract-short" style="display: inline;"> We show that all $n$-qubit entangled states, with the exception of tensor products of single-qubit and bipartite maximally-entangled states, admit Hardy-type proofs of non-locality without inequalities or probabilities. More precisely, we show that for all such states, there are local, one-qubit observables such that the resulting probability tables are logically contextual in the sense of Abramsk… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1506.01365v1-abstract-full').style.display = 'inline'; document.getElementById('1506.01365v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1506.01365v1-abstract-full" style="display: none;"> We show that all $n$-qubit entangled states, with the exception of tensor products of single-qubit and bipartite maximally-entangled states, admit Hardy-type proofs of non-locality without inequalities or probabilities. More precisely, we show that for all such states, there are local, one-qubit observables such that the resulting probability tables are logically contextual in the sense of Abramsky and Brandenburger, this being the general form of the Hardy-type property. Moreover, our proof is constructive: given a state, we show how to produce the witnessing local observables. In fact, we give an algorithm to do this. Although the algorithm is reasonably straightforward, its proof of correctness is non-trivial. A further striking feature is that we show that $n+2$ local observables suffice to witness the logical contextuality of any $n$-qubit state: two each for two for the parties, and one each for the remaining $n-2$ parties. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1506.01365v1-abstract-full').style.display = 'none'; document.getElementById('1506.01365v1-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 June, 2015; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2015. </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. Submitted for publication</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Information and Computation vol. 250, pages 3--14 (2016) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/1406.6146">arXiv:1406.6146</a> <span> [<a href="https://arxiv.org/pdf/1406.6146">pdf</a>, <a href="https://arxiv.org/ps/1406.6146">ps</a>, <a href="https://arxiv.org/format/1406.6146">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="Logic in Computer Science">cs.LO</span> </div> </div> <p class="title is-5 mathjax"> Reachability Analysis of Quantum Markov Decision Processes </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</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="1406.6146v2-abstract-short" style="display: inline;"> We introduce the notion of quantum Markov decision process (qMDP) as a semantic model of nondeterministic and concurrent quantum programs. It is shown by examples that qMDPs can be used in analysis of quantum algorithms and protocols. We study various reachability problems of qMDPs both for the finite-horizon and for the infinite-horizon. The (un)decidability and complexity of these problems are s… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1406.6146v2-abstract-full').style.display = 'inline'; document.getElementById('1406.6146v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1406.6146v2-abstract-full" style="display: none;"> We introduce the notion of quantum Markov decision process (qMDP) as a semantic model of nondeterministic and concurrent quantum programs. It is shown by examples that qMDPs can be used in analysis of quantum algorithms and protocols. We study various reachability problems of qMDPs both for the finite-horizon and for the infinite-horizon. The (un)decidability and complexity of these problems are settled, or their relationships with certain long-standing open problems are clarified. We also develop an algorithm for finding optimal scheduler that attains the supremum reachability probability. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1406.6146v2-abstract-full').style.display = 'none'; document.getElementById('1406.6146v2-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, 2014; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 24 June, 2014; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> June 2014. </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, 4 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/1304.0060">arXiv:1304.0060</a> <span> [<a href="https://arxiv.org/pdf/1304.0060">pdf</a>, <a href="https://arxiv.org/ps/1304.0060">ps</a>, <a href="https://arxiv.org/format/1304.0060">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"> Reachability Probabilities of Quantum Markov Chains </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S">Shenggang Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Feng%2C+Y">Yuan Feng</a>, <a href="/search/quant-ph?searchtype=author&query=Yu%2C+N">Nengkun Yu</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M">Mingsheng Ying</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="1304.0060v2-abstract-short" style="display: inline;"> This paper studies three kinds of long-term behaviours, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for com… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.0060v2-abstract-full').style.display = 'inline'; document.getElementById('1304.0060v2-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="1304.0060v2-abstract-full" style="display: none;"> This paper studies three kinds of long-term behaviours, namely reachability, repeated reachability and persistence, of quantum Markov chains (qMCs). As a stepping-stone, we introduce the notion of bottom strongly connected component (BSCC) of a qMC and develop an algorithm for finding BSCC decompositions of the state space of a qMC. As the major contribution, several (classical) algorithms for computing the reachability, repeated reachability and persistence probabilities of a qMC are presented, and their complexities are analysed. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('1304.0060v2-abstract-full').style.display = 'none'; document.getElementById('1304.0060v2-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, 2013; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 29 March, 2013; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2013. </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">Accepted by Concur 2013. 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/quant-ph/0410073">arXiv:quant-ph/0410073</a> <span> [<a href="https://arxiv.org/pdf/quant-ph/0410073">pdf</a>, <a href="https://arxiv.org/ps/quant-ph/0410073">ps</a>, <a href="https://arxiv.org/format/quant-ph/0410073">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.1016/j.physleta.2005.12.097">10.1016/j.physleta.2005.12.097 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Unambiguous discrimination of mixed quantum states </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Zhang%2C+C">Chi Zhang</a>, <a href="/search/quant-ph?searchtype=author&query=Feng%2C+Y">Yuan Feng</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+M+S">Ming Sheng Ying</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="quant-ph/0410073v3-abstract-short" style="display: inline;"> In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by the fact that it comes from ensemble of pure quantum states. The first part will not contribute anything to the discrimination, the second part has support space linearly independent to each other. Then the problem we… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('quant-ph/0410073v3-abstract-full').style.display = 'inline'; document.getElementById('quant-ph/0410073v3-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="quant-ph/0410073v3-abstract-full" style="display: none;"> In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by the fact that it comes from ensemble of pure quantum states. The first part will not contribute anything to the discrimination, the second part has support space linearly independent to each other. Then the problem we consider can be reduced to a problem in which the strategy of set discrimination can be used in designing measurements to discriminate mixed states unambiguously. We find a necessary and sufficient condition of unambiguous mixed state discrimination, and also point out that searching the optimal success probability of unambiguous discrimination is mathematically the well-known semi-definite programming problem. A upper bound of the optimal success probability is also presented. Finally, We generalize the concept of set discrimination to mixed state and point out that the problem of discriminating it unambiguously is equivalent to that of unambiguously discriminating mixed states. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('quant-ph/0410073v3-abstract-full').style.display = 'none'; document.getElementById('quant-ph/0410073v3-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 October, 2006; <span class="has-text-black-bis has-text-weight-semibold">v1</span> submitted 10 October, 2004; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> October 2004. </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</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys. Lett. A, 353, 300-306 (2006) </p> </li> <li class="arxiv-result"> <div class="is-marginless"> <p class="list-title is-inline-block"><a href="https://arxiv.org/abs/quant-ph/0104074">arXiv:quant-ph/0104074</a> <span> [<a href="https://arxiv.org/pdf/quant-ph/0104074">pdf</a>, <a href="https://arxiv.org/ps/quant-ph/0104074">ps</a>, <a href="https://arxiv.org/format/quant-ph/0104074">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="Statistical Mechanics">cond-mat.stat-mech</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/PhysRevLett.86.5092">10.1103/PhysRevLett.86.5092 <i class="fa fa-external-link" aria-hidden="true"></i></a></span> </div> </div> </div> <p class="title is-5 mathjax"> Quantum Diffusion of H/Ni(111) through the Monte Carlo Wave Function Formalism </p> <p class="authors"> <span class="search-hit">Authors:</span> <a href="/search/quant-ph?searchtype=author&query=Badescu%2C+S+C">S. C. Badescu</a>, <a href="/search/quant-ph?searchtype=author&query=Ying%2C+S+C">S. C. Ying</a>, <a href="/search/quant-ph?searchtype=author&query=Ala-Nissila%2C+T">T. Ala-Nissila</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="quant-ph/0104074v1-abstract-short" style="display: inline;"> We consider a quantum system coupled to a dissipative background with many degrees of freedom using the Monte Carlo Wave Function method. Instead of dealing with a density matrix which can be very high-dimensional, the method consists of integrating a stochastic Schrodinger equation with a non-hermitian damping term in the evolution operator, and with random quantum jumps. The method is applied… <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('quant-ph/0104074v1-abstract-full').style.display = 'inline'; document.getElementById('quant-ph/0104074v1-abstract-short').style.display = 'none';">▽ More</a> </span> <span class="abstract-full has-text-grey-dark mathjax" id="quant-ph/0104074v1-abstract-full" style="display: none;"> We consider a quantum system coupled to a dissipative background with many degrees of freedom using the Monte Carlo Wave Function method. Instead of dealing with a density matrix which can be very high-dimensional, the method consists of integrating a stochastic Schrodinger equation with a non-hermitian damping term in the evolution operator, and with random quantum jumps. The method is applied to the diffusion of hydrogen on the Ni(111) surface below 100 K. We show that the recent experimental diffusion data for this system can be understood through an interband activation process, followed by quantum tunnelling. <a class="is-size-7" style="white-space: nowrap;" onclick="document.getElementById('quant-ph/0104074v1-abstract-full').style.display = 'none'; document.getElementById('quant-ph/0104074v1-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, 2001; <span class="has-text-black-bis has-text-weight-semibold">originally announced</span> April 2001. </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">In press at Phys.Rev.Lett</span> </p> <p class="comments is-size-7"> <span class="has-text-black-bis has-text-weight-semibold">Journal ref:</span> Phys Rev Lett 86(22), 5092(2001) </p> </li> </ol> <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