Log in

Relevant bibliographies by topics / Quantum channels on a graph state

Contents

Journal articles

Academic literature on the topic 'Quantum channels on a graph state'

Author: Grafiati

Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Quantum channels on a graph state.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Quantum channels on a graph state"

1

Liao, Longxia, Xiaoqi Peng, Jinjing Shi, and Ying Guo. "Graph state-based quantum authentication scheme." International Journal of Modern Physics B 31, no. 09 (2017): 1750067. http://dx.doi.org/10.1142/s0217979217500679.

Full text

Abstract:

Inspired by the special properties of the graph state, a quantum authentication scheme is proposed in this paper, which is implemented with the utilization of the graph state. Two entities, a reliable party, Trent, as a verifier and Alice as prover are included. Trent is responsible for registering Alice in the beginning and confirming Alice in the end. The proposed scheme is simple in structure and convenient to realize in the realistic physical system due to the use of the graph state in a one-way quantum channel. In addition, the security of the scheme is extensively analyzed and accordingl

APA, Harvard, Vancouver, ISO, and other styles

2

Honrubia, Efrén, and Ángel S. Sanz. "Graph Approach to Quantum Teleportation Dynamics." Quantum Reports 2, no. 3 (2020): 352–77. http://dx.doi.org/10.3390/quantum2030025.

Full text

Abstract:

Quantum teleportation plays a key role in modern quantum technologies. Thus, it is of much interest to generate alternative approaches or representations that are aimed at allowing us a better understanding of the physics involved in the process from different perspectives. With this purpose, here an approach based on graph theory is introduced and discussed in the context of some applications. Its main goal is to provide a fully symbolic framework for quantum teleportation from a dynamical viewpoint, which makes explicit at each stage of the process how entanglement and information swap among

APA, Harvard, Vancouver, ISO, and other styles

3

Piveteau, Christophe, and Joseph M. Renes. "Quantum message-passing algorithm for optimal and efficient decoding." Quantum 6 (August 23, 2022): 784. http://dx.doi.org/10.22331/q-2022-08-23-784.

Full text

Abstract:

Recently, Renes proposed a quantum algorithm called belief propagation with quantum messages (BPQM) for decoding classical data encoded using a binary linear code with tree Tanner graph that is transmitted over a pure-state CQ channel \cite{renes_2017}, i.e., a channel with classical input and pure-state quantum output. The algorithm presents a genuine quantum counterpart to decoding based on the classical belief propagation algorithm, which has found wide success in classical coding theory when used in conjunction with LDPC or Turbo codes. More recently Rengaswamy etal. \cite{rengaswamy_2020}

APA, Harvard, Vancouver, ISO, and other styles

4

Lowe, Angus, Matija Medvidović, Anthony Hayes, et al. "Fast quantum circuit cutting with randomized measurements." Quantum 7 (March 2, 2023): 934. http://dx.doi.org/10.22331/q-2023-03-02-934.

Full text

Abstract:

We propose a new method to extend the size of a quantum computation beyond the number of physical qubits available on a single device. This is accomplished by randomly inserting measure-and-prepare channels to express the output state of a large circuit as a separable state across distinct devices. Our method employs randomized measurements, resulting in a sample overhead that is O&#x007E;(4k/&#x03B5;2), where &#x03B5; is the accuracy of the computation and k the number of parallel wires that are "cut" to obtain smaller sub-circuits. We also show an information-theoretic lower boun

APA, Harvard, Vancouver, ISO, and other styles

5

Erementchouk, Mikhail, and Michael N. Leuenberger. "Entanglement Dynamics of Second Quantized Quantum Fields." ISRN Mathematical Physics 2014 (January 28, 2014): 1–19. http://dx.doi.org/10.1155/2014/264956.

Full text

Abstract:

We study the entanglement dynamics in the system of coupled boson fields. We demonstrate that there are different natural notions of locality in this context leading to inequivalent notions of entanglement. We concentrate on the particle picture, when entanglement of one particle is determined by one-particle density matrix. We study, in detail, the effect of interaction preserving populations of individual one-particle states. We show that if the system is initially in a disentangled state with the definite total number of particles and the dimension of the one-particle Hilbert space is more

APA, Harvard, Vancouver, ISO, and other styles

6

Colafranceschi, Eugenia, and Gerardo Adesso. "Holographic entanglement in spin network states: A focused review." AVS Quantum Science 4, no. 2 (2022): 025901. http://dx.doi.org/10.1116/5.0087122.

Full text

Abstract:

In the long-standing quest to reconcile gravity with quantum mechanics, profound connections have been unveiled between concepts traditionally pertaining to a quantum information theory, such as entanglement, and constitutive features of gravity, like holography. Developing and promoting these connections from the conceptual to the operational level unlock access to a powerful set of tools which can be pivotal toward the formulation of a consistent theory of quantum gravity. Here, we review recent progress on the role and applications of quantum informational methods, in particular tensor netw

APA, Harvard, Vancouver, ISO, and other styles

7

Bannink, Tom, Jop Briët, Farrokh Labib, and Hans Maassen. "Quasirandom quantum channels." Quantum 4 (July 16, 2020): 298. http://dx.doi.org/10.22331/q-2020-07-16-298.

Full text

Abstract:

Mixing (or quasirandom) properties of the natural transition matrix associated to a graph can be quantified by its distance to the complete graph. Different mixing properties correspond to different norms to measure this distance. For dense graphs, two such properties known as spectral expansion and uniformity were shown to be equivalent in seminal 1989 work of Chung, Graham and Wilson. Recently, Conlon and Zhao extended this equivalence to the case of sparse vertex transitive graphs using the famous Grothendieck inequality. Here we generalize these results to the non-commutative, or `quantum'

APA, Harvard, Vancouver, ISO, and other styles

8

Li, Si-Chen, Bang-Ying Tang, Han Zhou, et al. "First Request First Service Entanglement Routing Scheme for Quantum Networks." Entropy 24, no. 10 (2022): 1404. http://dx.doi.org/10.3390/e24101404.

Full text

Abstract:

Quantum networks enable many applications beyond the reach of classical networks by supporting the establishment of long-distance entanglement connections, and are already stepped into the entanglement distribution network stage. The entanglement routing with active wavelength multiplexing schemes is urgently required for satisfying the dynamic connection demands of paired users in large-scale quantum networks. In this article, the entanglement distribution network is modeled into a directed graph, where the internal connection loss among all ports within a node is considered for each supporte

APA, Harvard, Vancouver, ISO, and other styles

9

Benjamin, Simon C., Daniel E. Browne, Joe Fitzsimons, and John J. L. Morton. "Brokered graph-state quantum computation." New Journal of Physics 8, no. 8 (2006): 141. http://dx.doi.org/10.1088/1367-2630/8/8/141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Antonio, B., D. Markham, and J. Anders. "Adiabatic graph-state quantum computation." New Journal of Physics 16, no. 11 (2014): 113070. http://dx.doi.org/10.1088/1367-2630/16/11/113070.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!