Pub Date : 2023-11-08DOI: 10.1088/2058-9565/ad04e6
Manuel S. Rudolph, Jing Chen, Jacob Miller, Atithi Acharya, Alejandro Perdomo-Ortiz
Abstract Tensor networks (TNs) are a family of computational methods built on graph-structured factorizations of large tensors, which have long represented state-of-the-art methods for the approximate simulation of complex quantum systems on classical computers. The rapid pace of recent advancements in numerical computation, notably the rise of GPU and TPU hardware accelerators, have allowed TN algorithms to scale to even larger quantum simulation problems, and to be employed more broadly for solving machine learning tasks. The ‘quantum-inspired’ nature of TNs permits them to be mapped to parametrized quantum circuits (PQCs), a fact which has inspired recent proposals for enhancing the performance of TN algorithms using near-term quantum devices, as well as enabling joint quantum–classical training frameworks that benefit from the distinct strengths of TN and PQC models. However, the success of any such methods depends on efficient and accurate methods for approximating TN states using realistic quantum circuits, which remains an unresolved question. This work compares a range of novel and previously-developed algorithmic protocols for decomposing matrix product states (MPS) of arbitrary bond dimension into low-depth quantum circuits consisting of stacked linear layers of two-qubit unitaries. These protocols are formed from different combinations of a preexisting analytical decomposition method together with constrained optimization of circuit unitaries, with initialization by the former method helping to avoid poor-quality local minima in the latter optimization process. While all of these protocols have efficient classical runtimes, our experimental results reveal one particular protocol employing sequential growth and optimization of the quantum circuit to outperform all others, with even greater benefits in the setting of limited computational resources. Given these promising results, we expect our proposed decomposition protocol to form a useful ingredient within any joint application of TNs and PQCs, further unlocking the rich and complementary benefits of classical and quantum computation.
{"title":"Decomposition of Matrix Product States into Shallow Quantum Circuits","authors":"Manuel S. Rudolph, Jing Chen, Jacob Miller, Atithi Acharya, Alejandro Perdomo-Ortiz","doi":"10.1088/2058-9565/ad04e6","DOIUrl":"https://doi.org/10.1088/2058-9565/ad04e6","url":null,"abstract":"Abstract Tensor networks (TNs) are a family of computational methods built on graph-structured factorizations of large tensors, which have long represented state-of-the-art methods for the approximate simulation of complex quantum systems on classical computers. The rapid pace of recent advancements in numerical computation, notably the rise of GPU and TPU hardware accelerators, have allowed TN algorithms to scale to even larger quantum simulation problems, and to be employed more broadly for solving machine learning tasks. The ‘quantum-inspired’ nature of TNs permits them to be mapped to parametrized quantum circuits (PQCs), a fact which has inspired recent proposals for enhancing the performance of TN algorithms using near-term quantum devices, as well as enabling joint quantum–classical training frameworks that benefit from the distinct strengths of TN and PQC models. However, the success of any such methods depends on efficient and accurate methods for approximating TN states using realistic quantum circuits, which remains an unresolved question. This work compares a range of novel and previously-developed algorithmic protocols for decomposing matrix product states (MPS) of arbitrary bond dimension into low-depth quantum circuits consisting of stacked linear layers of two-qubit unitaries. These protocols are formed from different combinations of a preexisting analytical decomposition method together with constrained optimization of circuit unitaries, with initialization by the former method helping to avoid poor-quality local minima in the latter optimization process. While all of these protocols have efficient classical runtimes, our experimental results reveal one particular protocol employing sequential growth and optimization of the quantum circuit to outperform all others, with even greater benefits in the setting of limited computational resources. Given these promising results, we expect our proposed decomposition protocol to form a useful ingredient within any joint application of TNs and PQCs, further unlocking the rich and complementary benefits of classical and quantum computation.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":" 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135293110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-07DOI: 10.1088/2058-9565/ad0a48
Robert J Chapman, Samuel Häusler, Giovanni Finco, Fabian Kaufmann, Rachel Grange
Abstract The two-qubit controlled-NOT gate is one of the central entangling operations in quantum information technology. The controlled-NOT gate for single photon qubits is normally realized as a network of five individual beamsplitters on six optical modes. Quantum walks are an alternative photonic architecture involving arrays of coupled waveguides, which have been successful for investigating condensed matter physics, however, have not yet been applied to quantum logical operations. Here, we engineer the tight-binding Hamiltonian of an array of lithium niobate-on-insulator waveguides to experimentally demonstrate the two-qubit controlled-NOT gate in a quantum walk. We measure the two-qubit transfer matrix with 0.938±0.003 fidelity, and we use the gate to generate entangled qubits with 0.945±0.002 fidelity by preparing the control photon in a superposition state. Our results highlight a new application for quantum walks that use a compact multi-mode interaction region to realize large multi-component quantum circuits.
{"title":"Quantum logical controlled-NOT gate in a lithium niobate-on-insulator photonic quantum walk","authors":"Robert J Chapman, Samuel Häusler, Giovanni Finco, Fabian Kaufmann, Rachel Grange","doi":"10.1088/2058-9565/ad0a48","DOIUrl":"https://doi.org/10.1088/2058-9565/ad0a48","url":null,"abstract":"Abstract The two-qubit controlled-NOT gate is one of the central entangling operations in quantum information technology. The controlled-NOT gate for single photon qubits is normally realized as a network of five individual beamsplitters on six optical modes. Quantum walks are an alternative photonic architecture involving arrays of coupled waveguides, which have been successful for investigating condensed matter physics, however, have not yet been applied to quantum logical operations. Here, we engineer the tight-binding Hamiltonian of an array of lithium niobate-on-insulator waveguides to experimentally demonstrate the two-qubit controlled-NOT gate in a quantum walk. We measure the two-qubit transfer matrix with 0.938±0.003 fidelity, and we use the gate to generate entangled qubits with 0.945±0.002 fidelity by preparing the control photon in a superposition state. Our results highlight a new application for quantum walks that use a compact multi-mode interaction region to realize large multi-component quantum circuits.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"2 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135479634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-06DOI: 10.1088/2058-9565/ad0a05
Dongkeun Lee, Kyunghyun Baek, Joonsuk Huh, Daniel Kyungdeock Park
Abstract Quantum state discrimination (QSD) is a fundamental task in quantum information processing with numerous applications. We present a variational quantum algorithm that performs the minimum-error QSD, called the variational quantum state discriminator (VQSD). The VQSD uses a parameterized quantum circuit that is trained by minimizing a cost function derived from the QSD, and finds the optimal positive-operator valued measure (POVM) for distinguishing target quantum states. The VQSD is capable of discriminating even unknown states, eliminating the need for expensive quantum state tomography. Our numerical simulations and comparisons with semidefinite programming demonstrate the effectiveness of the VQSD in finding optimal POVMs for minimum-error QSD of both pure and mixed states. In addition, the VQSD can be utilized as a supervised machine learning algorithm for multi-class classification. The area under the receiver operating characteristic curve obtained in numerical simulations with the Iris flower dataset ranges from 0.97 to 1 with an average of 0.985, demonstrating excellent performance of the VQSD classifier.
{"title":"Variational quantum state discriminator for supervised machine learning","authors":"Dongkeun Lee, Kyunghyun Baek, Joonsuk Huh, Daniel Kyungdeock Park","doi":"10.1088/2058-9565/ad0a05","DOIUrl":"https://doi.org/10.1088/2058-9565/ad0a05","url":null,"abstract":"Abstract Quantum state discrimination (QSD) is a fundamental task in quantum information processing with numerous applications. We present a variational quantum algorithm that performs the minimum-error QSD, called the variational quantum state discriminator (VQSD). The VQSD uses a parameterized quantum circuit that is trained by minimizing a cost function derived from the QSD, and finds the optimal positive-operator valued measure (POVM) for distinguishing target quantum states. The VQSD is capable of discriminating even unknown states, eliminating the need for expensive quantum state tomography. Our numerical simulations and comparisons with semidefinite programming demonstrate the effectiveness of the VQSD in finding optimal POVMs for minimum-error QSD of both pure and mixed states. In addition, the VQSD can be utilized as a supervised machine learning algorithm for multi-class classification. The area under the receiver operating characteristic curve obtained in numerical simulations with the Iris flower dataset ranges from 0.97 to 1 with an average of 0.985, demonstrating excellent performance of the VQSD classifier.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"19 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135589396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-03DOI: 10.1088/2058-9565/ad097c
Paolo Abiuso
Abstract A proper quantum memory is argued to consist in a quantum channel which cannot be simulated with a measurement followed by classical information storage and a final state preparation, i.e. an entanglement breaking (EB) channel. The verification of quantum memories (non-EB channels) is a task in which an honest user wants to test the quantum memory of an untrusted, remote provider.
This task is inherently suited for the class of protocols with trusted quantum inputs, sometimes called measurement-device-independent (MDI) protocols.
Here, we study the MDI certification of non-EB channels in continuous variable (CV) systems. We provide a simple witness based on adversarial metrology, and describe an experimentally friendly protocol that can be used to verify all non Gaussian incompatibility breaking quantum memories. Our results can be tested with current technology and can be applied to test other devices resulting
in non-EB channels, such as CV quantum transducers and transmission lines.
{"title":"Verification of continuous-variable quantum memories","authors":"Paolo Abiuso","doi":"10.1088/2058-9565/ad097c","DOIUrl":"https://doi.org/10.1088/2058-9565/ad097c","url":null,"abstract":"Abstract A proper quantum memory is argued to consist in a quantum channel which cannot be simulated with a measurement followed by classical information storage and a final state preparation, i.e. an entanglement breaking (EB) channel. The verification of quantum memories (non-EB channels) is a task in which an honest user wants to test the quantum memory of an untrusted, remote provider.
This task is inherently suited for the class of protocols with trusted quantum inputs, sometimes called measurement-device-independent (MDI) protocols.
Here, we study the MDI certification of non-EB channels in continuous variable (CV) systems. We provide a simple witness based on adversarial metrology, and describe an experimentally friendly protocol that can be used to verify all non Gaussian incompatibility breaking quantum memories. Our results can be tested with current technology and can be applied to test other devices resulting
in non-EB channels, such as CV quantum transducers and transmission lines.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"102 1‐2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135818974","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-30DOI: 10.1088/2058-9565/ad0389
Florian Rehm, SOFIA VALLECORSA, Kerstin Borras, Dirk Krücker, Michele Grossi, Valle Varo
Abstract The quantum angle generator (QAG) is a new full quantum machine learning model designed to generate accurate images on current noise intermediate scale quantum devices. Variational quantum circuits form the core of the QAG model, and various circuit architectures are evaluated. In combination with the so-called MERA-upsampling architecture, the QAG model achieves excellent results, which are analyzed and evaluated in detail. To our knowledge, this is the first time that a quantum model has achieved such accurate results. To explore the robustness of the model to noise, an extensive quantum noise study is performed. In this paper, it is demonstrated that the model trained on a physical quantum device learns the noise characteristics of the hardware and generates outstanding results. It is verified that even a quantum hardware machine calibration change during training of up to 8% can be well tolerated. For demonstration, the model is employed in indispensable simulations in high energy physics required to measure particle energies and, ultimately, to discover unknown particles at the large Hadron Collider at CERN.
{"title":"Precise Image Generation on Current Noisy Quantum Computing Devices","authors":"Florian Rehm, SOFIA VALLECORSA, Kerstin Borras, Dirk Krücker, Michele Grossi, Valle Varo","doi":"10.1088/2058-9565/ad0389","DOIUrl":"https://doi.org/10.1088/2058-9565/ad0389","url":null,"abstract":"Abstract The quantum angle generator (QAG) is a new full quantum machine learning model designed to generate accurate images on current noise intermediate scale quantum devices. Variational quantum circuits form the core of the QAG model, and various circuit architectures are evaluated. In combination with the so-called MERA-upsampling architecture, the QAG model achieves excellent results, which are analyzed and evaluated in detail. To our knowledge, this is the first time that a quantum model has achieved such accurate results. To explore the robustness of the model to noise, an extensive quantum noise study is performed. In this paper, it is demonstrated that the model trained on a physical quantum device learns the noise characteristics of the hardware and generates outstanding results. It is verified that even a quantum hardware machine calibration change during training of up to 8% can be well tolerated. For demonstration, the model is employed in indispensable simulations in high energy physics required to measure particle energies and, ultimately, to discover unknown particles at the large Hadron Collider at CERN.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136019103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-26DOI: 10.1088/2058-9565/ad0770
Casey Jameson, Bora Basyildiz, Daniel Moore, Kyle Clark, Zhexuan Gong
Abstract The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly long-range interacting systems such as a fully-connected quantum computer, such a speed limit is still unknown. Here we develop a new Quantum Brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer.
{"title":"Time optimal quantum state transfer in a fully-connected quantum computer","authors":"Casey Jameson, Bora Basyildiz, Daniel Moore, Kyle Clark, Zhexuan Gong","doi":"10.1088/2058-9565/ad0770","DOIUrl":"https://doi.org/10.1088/2058-9565/ad0770","url":null,"abstract":"Abstract The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb-Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly long-range interacting systems such as a fully-connected quantum computer, such a speed limit is still unknown. Here we develop a new Quantum Brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"64 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134907365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-19DOI: 10.1088/2058-9565/ad04e5
Jung Jun Park, Kyunghyun Baek, Myungshik Kim, Hyunchul Nha, Jaewan Kim, Jeongho Bang
Abstract Quantum search algorithms offer a remarkable advantage of quadratic reduction in query complexity using quantum superposition principle. However, how an actual architecture may access and handle the database in a quantum superposed state has been largely unexplored so far; the quantum state of data was simply assumed to be prepared and accessed by a black-box operation---so-called quantum oracle, even though this process, if not appropriately designed, may adversely diminish the quantum query advantage. Here, we introduce an efficient quantum data-access process, dubbed as quantum data-access machine (QDAM), and present a general architecture for quantum search algorithm. We analyze the runtime of our algorithm in view of the fault-tolerant quantum computation (FTQC) consisting of logical qubits within an effective quantum error correction code. Specifically, we introduce a measure involving two computational complexities, i.e. quantum query and T-depth complexities, which can be critical to assess performance since the logical non-Clifford gates, such as the T (i.e., π/8 rotation) gate, are known to be costliest to implement in FTQC. Our analysis shows that for N searching data, a QDAM model exhibiting a logarithmic, i.e., O(logN), growth of the T -depth complexity can be constructed. Further analysis reveals that our QDAM-embedded quantum search requires O(√N × logN) runtime cost. Our study thus demonstrates that the quantum data search algorithm can truly speed up over classical approaches with the logarithmic T -depth QDAM as a key component.
{"title":"T-depth-optimized Quantum Search with Quantum Data-access Machine","authors":"Jung Jun Park, Kyunghyun Baek, Myungshik Kim, Hyunchul Nha, Jaewan Kim, Jeongho Bang","doi":"10.1088/2058-9565/ad04e5","DOIUrl":"https://doi.org/10.1088/2058-9565/ad04e5","url":null,"abstract":"Abstract Quantum search algorithms offer a remarkable advantage of quadratic reduction in query complexity using quantum superposition principle. However, how an actual architecture may access and handle the database in a quantum superposed state has been largely unexplored so far; the quantum state of data was simply assumed to be prepared and accessed by a black-box operation---so-called quantum oracle, even though this process, if not appropriately designed, may adversely diminish the quantum query advantage. Here, we introduce an efficient quantum data-access process, dubbed as quantum data-access machine (QDAM), and present a general architecture for quantum search algorithm. We analyze the runtime of our algorithm in view of the fault-tolerant quantum computation (FTQC) consisting of logical qubits within an effective quantum error correction code. Specifically, we introduce a measure involving two computational complexities, i.e. quantum query and T-depth complexities, which can be critical to assess performance since the logical non-Clifford gates, such as the T (i.e., π/8 rotation) gate, are known to be costliest to implement in FTQC. Our analysis shows that for N searching data, a QDAM model exhibiting a logarithmic, i.e., O(logN), growth of the T -depth complexity can be constructed. Further analysis reveals that our QDAM-embedded quantum search requires O(√N × logN) runtime cost. Our study thus demonstrates that the quantum data search algorithm can truly speed up over classical approaches with the logarithmic T -depth QDAM as a key component.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135728919","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-19DOI: 10.1088/2058-9565/ad04e7
Simone Roncallo, Lorenzo Maccone, Chiara Macchiavello
Abstract We present a tomographic protocol for the characterization of multiqubit quantum channels. We discuss a specific class of input states, for which the set of Pauli measurements at the output of the channel directly relates to its Pauli transfer matrix components. We compare our results to those of standard quantum process tomography, showing an exponential reduction in the number of different experimental configurations required by a single matrix element extraction, while keeping the same number of shots. This paves the way for more efficient experimental implementations, whenever a selective knowledge of the Pauli transfer matrix is needed. We provide several examples and simulations.
{"title":"Pauli transfer matrix direct reconstruction: channel characterization without full process tomography","authors":"Simone Roncallo, Lorenzo Maccone, Chiara Macchiavello","doi":"10.1088/2058-9565/ad04e7","DOIUrl":"https://doi.org/10.1088/2058-9565/ad04e7","url":null,"abstract":"Abstract We present a tomographic protocol for the characterization of multiqubit quantum channels. We discuss a specific class of input states, for which the set of Pauli measurements at the output of the channel directly relates to its Pauli transfer matrix components. We compare our results to those of standard quantum process tomography, showing an exponential reduction in the number of different experimental configurations required by a single matrix element extraction, while keeping the same number of shots. This paves the way for more efficient experimental implementations, whenever a selective knowledge of the Pauli transfer matrix is needed. We provide several examples and simulations.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135728931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-16DOI: 10.1088/2058-9565/ad038a
Ding-Zu Wang, Guo-Feng Zhang, Maciej Lewenstein, Shi-Ju Ran
Abstract Exploring the bulk-boundary correspondences and the boundary-induced phenomena in the strongly-correlated quantum systems belongs to the most fundamental topics of condensed matter physics. In this work, we study the bulk-boundary competition in a simulative Hamiltonian, with which the thermodynamic properties of the infinite-size translationally-invariant system can be optimally mimicked. The simulative Hamiltonian is constructed by introducing local interactions on the boundaries, coined as the entanglement-bath Hamiltonian (EBH) that is analogous to the heat bath. The terms within the EBH are variationally determined by a thermal tensor network method, with coefficients varying with the temperature of the infinite-size system. By treating the temperature as an adjustable hyper-parameter of the EBH, we identify a discontinuity point of the coefficients, dubbed as the ``boundary quench point'' (BQP), whose physical implication is to distinguish the point, below which the thermal fluctuations from the boundaries to the bulk become insignificant. Fruitful phenomena are revealed when considering the simulative Hamiltonian, with the EBH featuring its own hyper-parameter, under the canonical ensembles at different temperatures. Specifically, a discontinuity in bulk entropy at the BQP is observed. The exotic entropic distribution, the relations between the symmetries of Hamiltonian and BQP, and the impacts from the entanglement-bath dimension are also explored. Our results show that such a singularity differs from those in the conventional thermodynamic phase transition points that normally fall into the Landau-Ginzburg paradigm. Our work provides the opportunities on exploring the exotic phenomena induced by the competition between the bulk and boundaries.
{"title":"Boundary-induced singularity in strongly-correlated quantum systems at finite temperature","authors":"Ding-Zu Wang, Guo-Feng Zhang, Maciej Lewenstein, Shi-Ju Ran","doi":"10.1088/2058-9565/ad038a","DOIUrl":"https://doi.org/10.1088/2058-9565/ad038a","url":null,"abstract":"Abstract Exploring the bulk-boundary correspondences and the boundary-induced phenomena in the strongly-correlated quantum systems belongs to the most fundamental topics of condensed matter physics. In this work, we study the bulk-boundary competition in a simulative Hamiltonian, with which the thermodynamic properties of the infinite-size translationally-invariant system can be optimally mimicked. The simulative Hamiltonian is constructed by introducing local interactions on the boundaries, coined as the entanglement-bath Hamiltonian (EBH) that is analogous to the heat bath. The terms within the EBH are variationally determined by a thermal tensor network method, with coefficients varying with the temperature of the infinite-size system. By treating the temperature as an adjustable hyper-parameter of the EBH, we identify a discontinuity point of the coefficients, dubbed as the ``boundary quench point'' (BQP), whose physical implication is to distinguish the point, below which the thermal fluctuations from the boundaries to the bulk become insignificant. Fruitful phenomena are revealed when considering the simulative Hamiltonian, with the EBH featuring its own hyper-parameter, under the canonical ensembles at different temperatures. Specifically, a discontinuity in bulk entropy at the BQP is observed. The exotic entropic distribution, the relations between the symmetries of Hamiltonian and BQP, and the impacts from the entanglement-bath dimension are also explored. Our results show that such a singularity differs from those in the conventional thermodynamic phase transition points that normally fall into the Landau-Ginzburg paradigm. Our work provides the opportunities on exploring the exotic phenomena induced by the competition between the bulk and boundaries.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136079749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-16DOI: 10.1088/2058-9565/ad00d9
Lexin Ding, Gesa Dünnweber, Christian Schilling
Abstract The goal of the present work is to guide the development of quantum technologies in the context of fermionic systems. For this, we first elucidate the process of entanglement swapping in electron systems such as atoms, molecules or solid bodies. This demonstrates the significance of the number-parity superselection rule and highlights the relevance of localized few-orbital subsystems for quantum information processing tasks. Then, we explore and quantify the entanglement between localized orbitals in two systems, a tight-binding model of non-interacting electrons and the hydrogen ring. For this, we apply the first closed formula of a faithful entanglement measure, derived in (arXiv: 2207.03377 ) as an extension of the von Neumann entropy to genuinely correlated many-orbital systems. For both systems, long-distance entanglement is found at low and high densities η , whereas for medium densities, η≈12 , practically only neighboring orbitals are entangled. The Coulomb interaction does not change the entanglement pattern qualitatively except for low and high densities where the entanglement increases as function of the distance between both orbitals.
{"title":"Physical entanglement between localized orbitals","authors":"Lexin Ding, Gesa Dünnweber, Christian Schilling","doi":"10.1088/2058-9565/ad00d9","DOIUrl":"https://doi.org/10.1088/2058-9565/ad00d9","url":null,"abstract":"Abstract The goal of the present work is to guide the development of quantum technologies in the context of fermionic systems. For this, we first elucidate the process of entanglement swapping in electron systems such as atoms, molecules or solid bodies. This demonstrates the significance of the number-parity superselection rule and highlights the relevance of localized few-orbital subsystems for quantum information processing tasks. Then, we explore and quantify the entanglement between localized orbitals in two systems, a tight-binding model of non-interacting electrons and the hydrogen ring. For this, we apply the first closed formula of a faithful entanglement measure, derived in (arXiv: 2207.03377 ) as an extension of the von Neumann entropy to genuinely correlated many-orbital systems. For both systems, long-distance entanglement is found at low and high densities η , whereas for medium densities, <?CDATA $eta approx frac{1}{2}$?> <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" overflow=\"scroll\"> <mml:mi>η</mml:mi> <mml:mo>≈</mml:mo> <mml:mfrac> <mml:mn>1</mml:mn> <mml:mn>2</mml:mn> </mml:mfrac> </mml:math> , practically only neighboring orbitals are entangled. The Coulomb interaction does not change the entanglement pattern qualitatively except for low and high densities where the entanglement increases as function of the distance between both orbitals.","PeriodicalId":20821,"journal":{"name":"Quantum Science and Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136077735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：