Relevant bibliographies by topics / Quantum channels on a graph state

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

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 (April 10, 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 accordingly can resist the general individual attack strategies.
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 (July 10, 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 the qubits involved in it. In order to construct this dynamical perspective, it has been necessary to define some auxiliary elements, namely virtual nodes and edges, as well as an additional notation for nodes describing potential states (against nodes accounting for actual states). With these elements, not only the flow of the process can be followed step by step, but they also allow us to establish a direct correspondence between this graph-based approach and the usual state vector description. To show the suitability and versatility of this graph-based approach, several particular teleportation examples are examined in detail, which include bipartite, tripartite, and tetrapartite maximally entangled states as quantum channels. From the analysis of these cases, a general protocol is devised to describe the sharing of quantum information in presence of maximally entangled multi-qubit system.
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} observed that BPQM implements the optimal decoder on a small example code, in that it implements the optimal measurement that distinguishes the quantum output states for the set of input codewords with highest achievable probability. Here we significantly expand the understanding, formalism, and applicability of the BPQM algorithm with the following contributions. First, we prove analytically that BPQM realizes optimal decoding for any binary linear code with tree Tanner graph. We also provide the first formal description of the BPQM algorithm in full detail and without any ambiguity. In so doing, we identify a key flaw overlooked in the original algorithm and subsequent works which implies quantum circuit realizations will be exponentially large in the code dimension. Although BPQM passes quantum messages, other information required by the algorithm is processed globally. We remedy this problem by formulating a truly message-passing algorithm which approximates BPQM and has quantum circuit complexity O(poly n,polylog 1ϵ), where n is the code length and ϵ is the approximation error. Finally, we also propose a novel method for extending BPQM to factor graphs containing cycles by making use of approximate cloning. We show some promising numerical results that indicate that BPQM on factor graphs with cycles can significantly outperform the best possible classical decoder.
APA, Harvard, Vancouver, ISO, and other styles
4

Lowe, Angus, Matija Medvidović, Anthony Hayes, Lee J. O'Riordan, Thomas R. Bromley, Juan Miguel Arrazola, and Nathan Killoran. "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~(4k/ε2), where ε 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 bound of Ω(2k/ε2) for any comparable procedure. We use our techniques to show that circuits in the Quantum Approximate Optimization Algorithm (QAOA) with p entangling layers can be simulated by circuits on a fraction of the original number of qubits with an overhead that is roughly 2O(pκ), where κ is the size of a known balanced vertex separator of the graph which encodes the optimization problem. We obtain numerical evidence of practical speedups using our method applied to the QAOA, compared to prior work. Finally, we investigate the practical feasibility of applying the circuit cutting procedure to large-scale QAOA problems on clustered graphs by using a 30-qubit simulator to evaluate the variational energy of a 129-qubit problem as well as carry out a 62-qubit optimization.
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 than two, then only potentials of the special form admit complete entanglement, which is shown to be reached at NOON states. If the system is initially in Glauber’s coherent state, complete entanglement is not reached despite the presence of two entangling channels in this case. We conclude with studying the time evolution of entanglement of photons in a cavity with multiple quantum dots in the limit of large number of photons. We show that in a relatively short time scale the completely entangled states belong to the class of graph states and are formed due to the interaction with dots in resonance with the cavity modes.
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 (June 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 networks, for quantum gravity models. We focus on spin network states dual to finite regions of space, represented as entanglement graphs in the group field theory approach to quantum gravity, and illustrate how techniques from random tensor networks can be exploited to investigate their holographic properties. In particular, spin network states can be interpreted as maps from bulk to boundary, whose holographic behavior increases with the inhomogeneity of their geometric data (up to becoming proper quantum channels). The entanglement entropy of boundary states, which are obtained by feeding such maps with suitable bulk states, is then proved to follow a bulk area law with corrections due to the entanglement of the bulk state. We further review how exceeding a certain threshold of bulk entanglement leads to the emergence of a black hole-like region, revealing intriguing perspectives for quantum cosmology.
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', case, where a transition matrix becomes a quantum channel. In particular, we show that for irreducibly covariant quantum channels, expansion is equivalent to a natural analog of uniformity for graphs, generalizing the result of Conlon and Zhao. Moreover, we show that in these results, the non-commutative and commutative (resp.) Grothendieck inequalities yield the best-possible constants.
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Si-Chen, Bang-Ying Tang, Han Zhou, Hui-Cun Yu, Bo Liu, Wan-Rong Yu, and Bo Liu. "First Request First Service Entanglement Routing Scheme for Quantum Networks." Entropy 24, no. 10 (October 1, 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 supported wavelength channel, which is quite different to classical network graphs. Afterwards, we propose a novel first request first service (FRFS) entanglement routing scheme, which performs the modified Dijkstra algorithm to find out the lowest loss path from the entangled photon source to each paired user in order. Evaluation results show that the proposed FRFS entanglement routing scheme can be applied to large-scale and dynamic topology quantum networks.
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 (August 23, 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 (November 26, 2014): 113070. http://dx.doi.org/10.1088/1367-2630/16/11/113070.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Quantum channels on a graph state"

1

MEDEIROS, Rex Antonio da Costa. "Zero-Error capacity of quantum channels." Universidade Federal de Campina Grande, 2008. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1320.

Full text
Abstract:
Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-08-01T21:11:37Z No. of bitstreams: 1 REX ANTONIO DA COSTA MEDEIROS - TESE PPGEE 2008..pdf: 1089371 bytes, checksum: ea0c95501b938e0d466779a06faaa4f6 (MD5)
Made available in DSpace on 2018-08-01T21:11:37Z (GMT). No. of bitstreams: 1 REX ANTONIO DA COSTA MEDEIROS - TESE PPGEE 2008..pdf: 1089371 bytes, checksum: ea0c95501b938e0d466779a06faaa4f6 (MD5) Previous issue date: 2008-05-09
Nesta tese, a capacidade erro-zero de canais discretos sem memória é generalizada para canais quânticos. Uma nova capacidade para a transmissão de informação clássica através de canais quânticos é proposta. A capacidade erro-zero de canais quânticos (CEZQ) é definida como sendo a máxima quantidade de informação por uso do canal que pode ser enviada através de um canal quântico ruidoso, considerando uma probabilidade de erro igual a zero. O protocolo de comunicação restringe palavras-código a produtos tensoriais de estados quânticos de entrada, enquanto que medições coletivas entre várias saídas do canal são permitidas. Portanto, o protocolo empregado é similar ao protocolo de Holevo-Schumacher-Westmoreland. O problema de encontrar a CEZQ é reformulado usando elementos da teoria de grafos. Esta definição equivalente é usada para demonstrar propriedades de famílias de estados quânticos e medições que atingem a CEZQ. É mostrado que a capacidade de um canal quântico num espaço de Hilbert de dimensão d pode sempre ser alcançada usando famílias compostas de, no máximo,d estados puros. Com relação às medições, demonstra-se que medições coletivas de von Neumann são necessárias e suficientes para alcançar a capacidade. É discutido se a CEZQ é uma generalização não trivial da capacidade erro-zero clássica. O termo não trivial refere-se a existência de canais quânticos para os quais a CEZQ só pode ser alcançada através de famílias de estados quânticos não-ortogonais e usando códigos de comprimento maior ou igual a dois. É investigada a CEZQ de alguns canais quânticos. É mostrado que o problema de calcular a CEZQ de canais clássicos-quânticos é puramente clássico. Em particular, é exibido um canal quântico para o qual conjectura-se que a CEZQ só pode ser alcançada usando uma família de estados quânticos não-ortogonais. Se a conjectura é verdadeira, é possível calcular o valor exato da capacidade e construir um código de bloco quântico que alcança a capacidade. Finalmente, é demonstrado que a CEZQ é limitada superiormente pela capacidade de Holevo-Schumacher-Westmoreland.
APA, Harvard, Vancouver, ISO, and other styles
2

Tan, Si Hui Ph D. Massachusetts Institute of Technology. "Quantum state discrimination with bosonic channels and Gaussian states." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/79253.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Physics, 2010.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 161-166).
Discriminating between quantum states is an indispensable part of quantum information theory. This thesis investigates state discrimination of continuous quantum variables, focusing on bosonic communication channels and Gaussian states. The specific state discrimination problems studied are (a) quantum illumination and (b) optimal measurements for decoding bosonic channels. Quantum illumination is a technique for detection and imaging which uses entanglement between a probe and an ancilla to enhance sensitivity. I shall show how entanglement can help with the discrimination between two noisy and lossy bosonic channels, one in which a target reflects back a small part of the probe light, and the other in which all probe light is lost. This enhancement is obtained even though the channels are entanglement-breaking. The main result of this study is that, under optimum detection in the asymptotic limit of many detection trials, 6 dB of improvement in the error exponent can be achieved by using an entangled state as compared to a classical state. In the study of optimal measurements for decoding bosonic channels, I shall present an alternative measurement to the pretty-good measurement for attaining the classical capacity of the lossy bosonic channel given product coherent-state inputs. This new measurement has the feature that, at each step of the measurement, only projective measurements are needed. The measurement is a sequential one: the number of steps required is exponential in the code length, and the error rate of this measurement goes to zero in the limit of large code length. Although not physically practical in itself, this new measurement has a simple physical interpretation in terms of collective energy measurements, and may give rise to an implementation of an optimal measurement for lossy bosonic channels. The two problems studied in my thesis are examples of how state discrimination can be useful in solving problems by using quantum mechanical properties such as entanglement and entangling measurements.
by Si Hui Tan.
Ph.D.
APA, Harvard, Vancouver, ISO, and other styles
3

Bondarenko, Dmytro [Verfasser]. "Constructing networks of quantum channels for state preparation / Dmytro Bondarenko." Hannover : Gottfried Wilhelm Leibniz Universität, 2021. http://d-nb.info/1235138682/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Qu, Zhen, and Ivan B. Djordjevic. "Four-Dimensionally Multiplexed Eight-State Continuous-Variable Quantum Key Distribution Over Turbulent Channels." IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2017. http://hdl.handle.net/10150/626439.

Full text
Abstract:
We experimentally demonstrate an eight-state continuous-variable quantum key distribution (CV-QKD) over atmospheric turbulence channels. The high secret key rate (SKR) is enabled by 4-D multiplexing of 96 channels, i.e., six-channel wavelength-division multiplexing, four-channel orbital angular momentum multiplexing, two-channel polarization multiplexing, and two-channel spatial-position multiplexing. The atmospheric turbulence channel is emulated by a spatial light modulator on which a series of azimuthal phase patterns yielding Andrews' spectrum are recorded. A commercial coherent receiver is implemented at Bob's side, followed by a phase noise cancellation stage, where channel transmittance can be monitored accurately and phase noise can be effectively eliminated. Compared to four-state CV-QKD, eight-state CV-QKD protocol potentially provides a better performance by offering higher SKR, better excess noise tolerance, and longer secure transmission distance. In our proposed CV-QKD system, the minimum transmittances of 0.24 and 0.26 are required for OAM states of 2 (or -2) and 6 (or -6), respectively, to guarantee the secure transmission. A maximum SKR of 3.744 Gb/s is experimentally achievable, while a total SKR of 960 Mb/s can be obtained in case of mean channel transmittances.
APA, Harvard, Vancouver, ISO, and other styles
5

Sun, Xiaole, Ivan B. Djordjevic, and Mark A. Neifeld. "Secret Key Rates and Optimization of BB84 and Decoy State Protocols Over Time-Varying Free-Space Optical Channels." IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2016. http://hdl.handle.net/10150/621687.

Full text
Abstract:
We optimize secret key rates (SKRs) of weak coherent pulse (WCP)-based quantum key distribution (QKD) over time-varying free-space optical channels affected by atmospheric turbulence. The random irradiance fluctuation due to scintillation degrades the SKR performance of WCP-based QKD, and to improve the SKR performance, we propose an adaptive scheme in which transmit power is changed in accordance with the channel state information. We first optimize BB84 and decoy state-based QKD protocols for different channel transmittances. We then present our adaptation method, to overcome scintillation effects, of changing the source intensity based on channel state predictions from a linear autoregressive model while ensuring the security against the eavesdropper. By simulation, we demonstrate that by making the source adaptive to the time-varying channel conditions, SKRs of WCP-based QKD can be improved up to over 20%.
APA, Harvard, Vancouver, ISO, and other styles
6

Yang, Min-Chieh, and 楊閔傑. "Quantum Error Correction for Noisy Quantum Channels in Optical Coherent State Quantum Information Processing." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/26414397901156461604.

Full text
Abstract:
碩士
國立中正大學
物理學系暨研究所
101
Starting from the derived exact master equation from Zhang, et al. , we study the photon-loss dissipation of optical coherent-state qubits coupled to a reservoir at zero temperature. We consider an environment of Lorentzian coupling spectrum and apply the results of single qubit from solving the master equation to a pair of spatially separated entangled qubits subject to local environment noises. We demonstrate that the entanglement dynamics of the system can be switched between Markovian and non-Markovian limits by controlling the coupling bandwidth to the environment and their coupling efficiency can be manipulated by tuning the coupling detuning. Entanglement sudden death may take place with qubits of larger amplitude(|\alpha| > 0.6). Besides, through concurrence, fidelity and von Neumann entropy, we numerically verified that a more efficient error correction efficiency can be achieved by employing phase-flip scheme on the system proposed by Munhoz, et al. which subject to a photon-loss channel.
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Pei-Hsaun, and 李佩璇. "Entanglement Purification for Noisy Optical Coherent-State Quantum Channels." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/39645791785660464754.

Full text
Abstract:
碩士
國立中正大學
物理學系暨研究所
101
We investigate an entanglement purification protocol suggested by Jeong and Ralph for coherent-state quantum information processing. We study in detail the purification of a (quasi) Bell-state quantum channel subject to photon loss utilizing this protocol and also extend its application to general Werner-type mixed states. We compare this protocol with its discrete-variable counterpart and show that a lower fidelity threshold and higher efficiency for purification are attained.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Quantum channels on a graph state"

1

Beenakker, Carlo W. J. Classical and quantum optics. Edited by Gernot Akemann, Jinho Baik, and Philippe Di Francesco. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780198744191.013.36.

Full text
Abstract:
This article focuses on applications of random matrix theory (RMT) to both classical optics and quantum optics, with emphasis on optical systems such as disordered wave guides and chaotic resonators. The discussion centres on topics that do not have an immediate analogue in electronics, either because they cannot readily be measured in the solid state or because they involve aspects (such as absorption, amplification, or bosonic statistics) that do not apply to electrons. The article first considers applications of RMT to classical optics, including optical speckle and coherent backscattering, reflection from an absorbing random medium, long-range wave function correlations in an open resonator, and direct detection of open transmission channels. It then discusses applications to quantum optics, namely: the statistics of grey-body radiation, lasing in a chaotic cavity, and the effect of absorption on the reflection eigenvalue statistics in a multimode wave guide.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Quantum channels on a graph state"

1

Finco, Domenico. "On the Ground State for the NLS Equation on a General Graph." In Advances in Quantum Mechanics, 153–67. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58904-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Takahashi, Yasuhiro. "Simple Sets of Measurements for Universal Quantum Computation and Graph State Preparation." In Theory of Quantum Computation, Communication, and Cryptography, 26–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18073-6_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Krech, W., and F. Seume. "Quantum Decay of the Coulomb Blockade State in an Array of Two Ultrasmall Tunnel Junctions with General Channels of Tunneling." In Springer Series in Electronics and Photonics, 71–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77274-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kaye, Phillip, Raymond Laflamme, and Michele Mosca. "Superdense Coding and Quantum Teleportation." In An Introduction to Quantum Computing. Oxford University Press, 2006. http://dx.doi.org/10.1093/oso/9780198570004.003.0008.

Full text
Abstract:
We are now ready to look at our first protocols for quantum information. In this section, we examine two communication protocols which can be implemented using the tools we have developed in the preceding sections. These protocols are known as superdense coding and quantum teleportation. Both are inherently quantum: there are no classical protocols which behave in the same way. Both involve two parties who wish to perform some communication task between them. In descriptions of such communication protocols (especially in cryptography), it is very common to name the two parties ‘Alice’ and ‘Bob’, for convenience. We will follow this tradition. We will repeatedly refer to communication channels. A quantum communication channel refers to a communication line (e.g. a fiberoptic cable), which can carry qubits between two remote locations. A classical communication channel is one which can carry classical bits (but not qubits).1 The protocols (like many in quantum communication) require that Alice and Bob initially share an entangled pair of qubits in the Bell state The above Bell state is sometimes referred to as an EPR pair. Such a state would have to be created ahead of time, when the qubits are in a lab together and can be made to interact in a way which will give rise to the entanglement between them. After the state is created, Alice and Bob each take one of the two qubits away with them. Alternatively, a third party could create the EPR pair and give one particle to Alice and the other to Bob. If they are careful not to let them interact with the environment, or any other quantum system, Alice and Bob’s joint state will remain entangled. This entanglement becomes a resource which Alice and Bob can use to achieve protocols such as the following. Suppose Alice wishes to send Bob two classical bits of information. Superdense coding is a way of achieving this task over a quantum channel, requiring only that Alice send one qubit to Bob. Alice and Bob must initially share the Bell state Suppose Alice is in possession of the first qubit and Bob the second qubit.
APA, Harvard, Vancouver, ISO, and other styles
5

Guha Majumdar, Mrittunjoy. "Can We Entangle Entanglement?" In Topics on Quantum Information Science [Working Title]. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.98535.

Full text
Abstract:
In this chapter, nested multilevel entanglement is formulated and discussed in terms of Matryoshka states. The generation of such states that contain nested patterns of entanglement, based on an anisotropic XY model has been proposed. Two classes of multilevel-entanglement- the Matryoshka Q-GHZ states and Matryoshka generalised GHZ states, are studied. Potential applications of such resource states, such as for quantum teleportation of arbitrary one, two and three qubits states, bidirectional teleportation of arbitrary two qubit states and probabilistic circular controlled teleportation are proposed and discussed, in terms of a Matryoshka state over seven qubits. We also discuss fractal network protocols, surface codes and graph states as well as generation of arbitrary entangled states at remote locations in this chapter.
APA, Harvard, Vancouver, ISO, and other styles
6

"Second quantization." In The Quantum Classical Theory, edited by Gert D. Billing. Oxford University Press, 2003. http://dx.doi.org/10.1093/oso/9780195146196.003.0008.

Full text
Abstract:
Second quantization (SQ) concepts were introduced in chapter 2 as a general tool to treat excitations in molecular collisions for which the dynamics were described in cartesian coordinates. This SQ-formulation, which was derived from the TDGH representation of the wave function, could be introduced if the potential was expanded locally to second order around the position defined by a trajectory. It is, however, possible to use the SQ approach in a number of other dynamical situations, as for instance when dealing with the vibrational excitation of diatomic and polyatomic molecules, or with energy transfer to solids and chemical reactions in the socalled reaction path formulation. Since the formal expressions in the operators are the same, irrespective of the system or dynamical situation, the algebraic manipulations are also identical, and, hence, the formal solution the same. But the dynamical input to the scheme is of course different from case to case. In the second quantization formulation of the dynamical problems, one solves the operator algebraic equations formally. Once the formal solution is obtained, we can compute the dynamical quantities which enter the expressions. The advantage over state or grid expansion methods is significant since (at least for bosons) the number of dynamical operators is much less than the number of states. In order to solve the problem to infinite order, that is, also the TDSE for the system, the operators have to form a closed set with respect to commutations. This makes it necessary to drop some two-quantum operators. Historically, the M = 1 quantum problem, namely that of a linearly forced harmonic oscillator, was solved using the operator algebraic approach by Pechukas and Light in 1966 [131]. In 1972, Kelley [128] solved the two-oscillator (M = 2) problem and the author solved the M = 3 and the general problem in 1978 [129] and 1980 [147], respectively. The general case was solved using graph theory designed for the problem and it will not be repeated here. But the formulas are given in this chapter and in the appendices B and C.
APA, Harvard, Vancouver, ISO, and other styles
7

Jasim, Omer K., Safia Abbas, El-Sayed M. El-Horbaty, and Abdel-Badeeh M. Salem. "CCCE." In Advances in Systems Analysis, Software Engineering, and High Performance Computing, 71–99. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-9834-5.ch004.

Full text
Abstract:
Cloud computing technology is a modern emerging trend in the distributed computing technology that is rapidly gaining popularity in network communication field. Despite the advantages that the cloud platforms bolstered, it suffers from many security issues such as secure communication, consumer authentication, and intrusion caused by attacks. These security issues relevant to customer data filtering and lost the connection at any time. In order to address these issues, this chapter, introduces an innovative cloud computing cryptographic environment, that entails both Quantum Cryptography-as-service and Quantum Advanced Encryption Standard. CCCE poses more secure data transmission channels by provisioning secret key among cloud's instances and consumers. In addition, the QCaaS solves the key generation and key distribution problems that emerged through the online negotiation between the communication parties. It is important to note that the CCCE solves the distance limitation coverage problem that is stemmed from the quantum state property.
APA, Harvard, Vancouver, ISO, and other styles
8

Jasim, Omer K., Safia Abbas, El-Sayed M. El-Horbaty, and Abdel-Badeeh M. Salem. "CCCE." In Cloud Security, 524–51. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-8176-5.ch027.

Full text
Abstract:
Cloud computing technology is a modern emerging trend in the distributed computing technology that is rapidly gaining popularity in network communication field. Despite the advantages that the cloud platforms bolstered, it suffers from many security issues such as secure communication, consumer authentication, and intrusion caused by attacks. These security issues relevant to customer data filtering and lost the connection at any time. In order to address these issues, this chapter, introduces an innovative cloud computing cryptographic environment, that entails both Quantum Cryptography-as-service and Quantum Advanced Encryption Standard. CCCE poses more secure data transmission channels by provisioning secret key among cloud's instances and consumers. In addition, the QCaaS solves the key generation and key distribution problems that emerged through the online negotiation between the communication parties. It is important to note that the CCCE solves the distance limitation coverage problem that is stemmed from the quantum state property.
APA, Harvard, Vancouver, ISO, and other styles
9

Christine Almeida Silva, Anielle, Jerusa Maria de Oliveira, Kelen Talita Romão da Silva, Francisco Rubens Alves dos Santos, João Paulo Santos de Carvalho, Rose Kethelyn Souza Avelino, Eurípedes Alves da Silva Filho, et al. "Fluorescent Markers: Proteins and Nanocrystals." In Bioluminescence [Working Title]. IntechOpen, 2021. http://dx.doi.org/10.5772/intechopen.96675.

Full text
Abstract:
This book chapter will comment on fluorescent reporter proteins and nanocrystals’ applicability as fluorescent markers. Fluorescent reporter proteins in the Drosophila model system offer a degree of specificity that allows monitoring cellular and biochemical phenomena in vivo, such as autophagy, mitophagy, and changes in the redox state of cells. Titanium dioxide (TiO2) nanocrystals (NCs) have several biological applications and emit in the ultraviolet, with doping of europium ions can be visualized in the red luminescence. Therefore, it is possible to monitor nanocrystals in biological systems using different emission channels. CdSe/CdS magic-sized quantum dots (MSQDs) show high luminescence stability in biological systems and can be bioconjugated with biological molecules. Therefore, this chapter will show exciting results of the group using fluorescent proteins and nanocrystals in biological systems.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Quantum channels on a graph state"

1

Bae, Joonwoo. "Optimal state discrimination over quantum channels." In Quantum Communications and Quantum Imaging XVII, edited by Keith S. Deacon. SPIE, 2019. http://dx.doi.org/10.1117/12.2525569.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yan, Lei, Peng Luo, Hanyu Cui, Ronghua Shi, and Ying Guo. "Quantum Route Selection based on Graph State." In 2016 4th International Conference on Machinery, Materials and Computing Technology. Paris, France: Atlantis Press, 2016. http://dx.doi.org/10.2991/icmmct-16.2016.224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Popov, Anton I., Igor Y. Popov, and Dmitry A. Gerasimov. "Resonance state completeness problem for quantum graph." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2016). Author(s), 2017. http://dx.doi.org/10.1063/1.4992567.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xie, Wenbo, Wenhan Dai, and Don Towsley. "Graph State Distribution: Integer Formulation." In 2021 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2021. http://dx.doi.org/10.1109/qce52317.2021.00085.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ulibarrena, Andrés, Jonathan W. Webb, Federico Graselli, Joseph Ho, Gláucia Murta, and Alessandro Fedrizzi. "Photonic graph state anonymous quantum conference key agreement." In Quantum Technology: Driving Commercialisation of an Enabling Science III, edited by Kai Bongs, Miles J. Padgett, Alessandro Fedrizzi, and Alberto Politi. SPIE, 2023. http://dx.doi.org/10.1117/12.2644977.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gilbert, Gerald, Michael Hamrick, and Yaakov S. Weinstein. "Construction of Cluster States Using Graph State Equivalence Classes." In International Conference on Quantum Information. Washington, D.C.: OSA, 2007. http://dx.doi.org/10.1364/icqi.2007.jwc67.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Renault, P., J. Nokkala, N. Treps, J. Piilo, and V. Parigi. "Spectral Density and non Markovianity Measurements via Graph State Simulation." In Quantum Information and Measurement. Washington, D.C.: OSA, 2021. http://dx.doi.org/10.1364/qim.2021.w3a.2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Boroson, Don, Nicholas Hardy, Matthew Grein, P. Benjamin Dixon, Catherine Lee, Scott Hamilton, and Neal Spellmeyer. "An Architecture for Synchronizing Photonic Bell State Measurements Across Lossy, Time-Varying Channels." In Quantum 2.0. Washington, D.C.: OSA, 2020. http://dx.doi.org/10.1364/quantum.2020.qth7b.18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chang, Chun-Hung, Xuan Zhu, and Olivier Pfister. "Experimental Generation of a Multipartite Entangled Graph State in the Quantum Optical Frequency Comb." In Quantum 2.0. Washington, D.C.: OSA, 2020. http://dx.doi.org/10.1364/quantum.2020.qm4b.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gualdi, Giulia, Irene Marzoli, and Paolo Tombesi. "Spin-Chains as Quantum Channels for Qubit-State Transfer." In 2009 Third International Conference on Quantum, Nano and Micro Technologies (ICQNM). IEEE, 2009. http://dx.doi.org/10.1109/icqnm.2009.16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Quantum channels on a graph state' for particular source types:
Journal articles
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!

To the bibliography