Zaloguj się

Gotowe bibliografie tematyczne / Eavesdropping on the graph state / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Eavesdropping on the graph state.

Artykuły w czasopismach na temat „Eavesdropping on the graph state”

Autor: Grafiati

Data publikacji: 6 września 2023

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Eavesdropping on the graph state”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Stuart, Jeffrey L. "The eavesdropping number of a graph." Czechoslovak Mathematical Journal 59, no. 3 (2009): 623–36. http://dx.doi.org/10.1007/s10587-009-0056-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Serhiienko, S. P., V. G. Krizhanovski, D. V. Chernov, and L. V. Zagoruiko. "The use of non-steady state noise interferences to counteract passive eavesdropping devices." Radiotekhnika, no. 207 (December 24, 2021): 132–38. http://dx.doi.org/10.30837/rt.2021.4.207.14.

Pełny tekst źródła

Streszczenie:

The use of noise interference has become a common practice for information security. Recently appeared publications showing a potential possibility to use the noise radio frequency interference for information skimming by passive radio eavesdropping device. In particular, the vulnerability of the premises protected from eavesdropping devices is increased, if the radio frequency noising is switched on when confidential negotiations are being conducted. The use of radio noise waves energy for eavesdropping makes such devices invisible to nonlinear locators for listening devices if they activated

Style APA, Harvard, Vancouver, ISO itp.

3

Naik, D. S., C. G. Peterson, A. G. White, A. J. Berglund, and P. G. Kwiat. "Entangled State Quantum Cryptography: Eavesdropping on the Ekert Protocol." Physical Review Letters 84, no. 20 (2000): 4733–36. http://dx.doi.org/10.1103/physrevlett.84.4733.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

YI, XIAO-JIE, JIAN-MIN WANG, and GUO-QIANG HUANG. "SPLITTING QUANTUM INFORMATION WITH FIVE-ATOM ENTANGLED STATE IN CAVITY QED." International Journal of Quantum Information 08, no. 08 (2010): 1289–99. http://dx.doi.org/10.1142/s0219749911007071.

Pełny tekst źródła

Streszczenie:

A realizable scheme is proposed for implementing quantum information splitting with five-atom entangled state in cavity QED, where we explicitly illustrate the procedure and analyze the security against the eavesdropping. The scheme does not involve Bell-state measurement and is insensitive to the cavity and the thermal field.

Style APA, Harvard, Vancouver, ISO itp.

5

WANG, JIAN, SHENG ZHANG, QUAN ZHANG, and CHAO-JING TANG. "SEMIQUANTUM SECRET SHARING USING TWO-PARTICLE ENTANGLED STATE." International Journal of Quantum Information 10, no. 05 (2012): 1250050. http://dx.doi.org/10.1142/s0219749912500505.

Pełny tekst źródła

Streszczenie:

We present a semiquantum secret sharing protocol by using two-particle entangled states in which quantum Alice shares a secret key with two classical parties, Bob and Charlie. Classical Bob and Charlie are restricted to measuring, preparing a particle in the computational basis, or reflecting the particles. None of them can acquire the secret unless they collaborate. We also show the protocol is secure against eavesdropping.

Style APA, Harvard, Vancouver, ISO itp.

6

Liu Jing-Feng, Tang Zhi-Lie, Liang Rui-Sheng, et al. "Eavesdropping on practical QKD system based on six-state protocol." Acta Physica Sinica 54, no. 2 (2005): 517. http://dx.doi.org/10.7498/aps.54.517.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Cirac, J. I., and N. Gisin. "Coherent eavesdropping strategies for the four state quantum cryptography protocol." Physics Letters A 229, no. 1 (1997): 1–7. http://dx.doi.org/10.1016/s0375-9601(97)00176-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

CHEN, XIU-BO, TIAN-YIN WANG, JIAN-ZHONG DU, QIAO-YAN WEN, and FU-CHEN ZHU. "CONTROLLED QUANTUM SECURE DIRECT COMMUNICATION WITH QUANTUM ENCRYPTION." International Journal of Quantum Information 06, no. 03 (2008): 543–51. http://dx.doi.org/10.1142/s0219749908003566.

Pełny tekst źródła

Streszczenie:

Utilizing a partially entangled GHZ state, we propose a novel controlled quantum secure direct communication (QSDC) with quantum encryption. Under the supervision and help of the third side, the sender and the receiver can securely share the private quantum entanglement keys used to encrypt and decrypt the secret message. According to the results of checking the eavesdropping on decoy photons, communicators can decide whether the quantum keys are reused in the next round. Not only will eavesdropping inevitably disturb the states of the decoy photons and be detected, but arbitrary transmission

Style APA, Harvard, Vancouver, ISO itp.

9

Zaidi, Ali Mustafa, and David Greaves. "Value State Flow Graph." ACM Transactions on Reconfigurable Technology and Systems 9, no. 2 (2016): 1–22. http://dx.doi.org/10.1145/2807702.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Bouajjani, A., J. C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. "Minimal state graph generation." Science of Computer Programming 18, no. 3 (1992): 247–69. http://dx.doi.org/10.1016/0167-6423(92)90018-7.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Chen, Guihong, Xi Liu, Mohammad Shorfuzzaman, Ali Karime, Yonghua Wang, and Yuanhang Qi. "MEC-Based Jamming-Aided Anti-Eavesdropping with Deep Reinforcement Learning for WBANs." ACM Transactions on Internet Technology 22, no. 3 (2022): 1–17. http://dx.doi.org/10.1145/3453186.

Pełny tekst źródła

Streszczenie:

Wireless body area network (WBAN) suffers secure challenges, especially the eavesdropping attack, due to constraint resources. In this article, deep reinforcement learning (DRL) and mobile edge computing (MEC) technology are adopted to formulate a DRL-MEC-based jamming-aided anti-eavesdropping (DMEC-JAE) scheme to resist the eavesdropping attack without considering the channel state information. In this scheme, a MEC sensor is chosen to send artificial jamming signals to improve the secrecy rate of the system. Power control technique is utilized to optimize the transmission power of both the s

Style APA, Harvard, Vancouver, ISO itp.

12

Peng, Yue Hong, Jia Wang Li, Jin Hao Liu, and Yu Min Liu. "Influence of Path Attacks on Security of Six-State Scheme." Applied Mechanics and Materials 263-266 (December 2012): 3114–19. http://dx.doi.org/10.4028/www.scientific.net/amm.263-266.3114.

Pełny tekst źródła

Streszczenie:

The safety of the six-state scheme in the practical communication systems was studied based on an effective eavesdropping method, which called path attacks adopted by eavesdroppers. In the practical systems, eavesdropper can select appropriate path to eavesdrop on legitimate users to obtain some information. This method will keep photon number distribution in the laser pulses, and the eavesdropper can be hidden by the losses of quantum channel without being detected. The results show that eavesdropper can get more information with the increase of transmission distance and the average number of

Style APA, Harvard, Vancouver, ISO itp.

13

Bechmann-Pasquinucci, H., and N. Gisin. "Incoherent and coherent eavesdropping in the six-state protocol of quantum cryptography." Physical Review A 59, no. 6 (1999): 4238–48. http://dx.doi.org/10.1103/physreva.59.4238.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

Hao, Yuan, Liu Yin-Min, Zhang Wen, and Zhang Zhan-Jun. "Eavesdropping on Quantum Secure Direct Communication with W State in Noisy Channel." Communications in Theoretical Physics 49, no. 1 (2008): 103–6. http://dx.doi.org/10.1088/0253-6102/49/1/22.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

SHADMAN, Z., H. KAMPERMANN, T. MEYER, and D. BRUß. "OPTIMAL EAVESDROPPING ON NOISY STATES IN QUANTUM KEY DISTRIBUTION." International Journal of Quantum Information 07, no. 01 (2009): 297–306. http://dx.doi.org/10.1142/s0219749909004554.

Pełny tekst źródła

Streszczenie:

We study eavesdropping in quantum key distribution with the six state protocol, when the signal states are mixed with white noise. This situation may arise either when Alice deliberately adds noise to the signal states before they leave her lab, or in a realistic scenario where Eve cannot replace the noisy quantum channel by a noiseless one. We find Eve's optimal mutual information with Alice, for individual attacks, as a function of the qubit error rate. Our result is that added quantum noise reduces Eve's mutual information more than Bob's.

Style APA, Harvard, Vancouver, ISO itp.

16

Qin, Huawang, Wallace K. S. Tang, and Raylin Tso. "Three-party quantum secret sharing based on d-dimensional Bell state." Modern Physics Letters B 33, no. 03 (2019): 1950023. http://dx.doi.org/10.1142/s0217984919500234.

Pełny tekst źródła

Streszczenie:

A three-party quantum secret sharing scheme is proposed, in which the dealer uses the d-dimensional Bell state to distribute the secret, the participants perform the single-particle measurements to get their shares, and the dealer performs the Bell-basis measurements to check the eavesdropping. The main merit of our scheme is that the participants only need to measure the particles in one basis. Compared to the existing schemes in which the participants need to measure the particles in two bases, our scheme will be more practical.

Style APA, Harvard, Vancouver, ISO itp.

17

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

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.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

19

Kalampakas, Antonios. "Graph Automata and Graph Colorability." European Journal of Pure and Applied Mathematics 16, no. 1 (2023): 112–20. http://dx.doi.org/10.29020/nybg.ejpam.v16i1.4629.

Pełny tekst źródła

Streszczenie:

Automata recognizing graphs can be constructed by employing the algebraic structure of graphoids. For the construction of a graph automaton, the relations over the Kleene star of the state set must constitute a graphoid. Hence different kinds of graphoids produce graph automata with diverse operation and recognition capacity. In this paper we show that graph colorability is recognized by automata operating over the simplest possible abelian graphoid.

Style APA, Harvard, Vancouver, ISO itp.

20

Fahmi, A. "New approach to quantum key distribution via quantum encryption." Quantum Information and Computation 9, no. 9&10 (2009): 879–98. http://dx.doi.org/10.26421/qic9.9-10-9.

Pełny tekst źródła

Streszczenie:

Recently, Zhang, Li and Guo (ZLG) suggested a new approach to quantum key distribution by using a shared Bell state which acts as quantum key in order to encode and decode classical information. Subsequently, others extended ZLG protocol to d-dimensional systems and to quantum secret sharing based on reusable GHZ states. However, Gao et al. have shown that if Eve employs a special strategy to attack, these protocols become insecure. Afterwards, they repair ZLG protocol so that their eavesdropping strategy becomes inefficient. In this paper, we investigate the security of ZLG quantum key distri

Style APA, Harvard, Vancouver, ISO itp.

21

Wang, Le, Xianghui Cao, Heng Zhang, Changyin Sun, and Wei Xing Zheng. "Transmission scheduling for privacy-optimal encryption against eavesdropping attacks on remote state estimation." Automatica 137 (March 2022): 110145. http://dx.doi.org/10.1016/j.automatica.2021.110145.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Cardoso-Isidoro, C., and F. Delgado. "Quantum Authentication Using Double Teleportation." Journal of Physics: Conference Series 2448, no. 1 (2023): 012018. http://dx.doi.org/10.1088/1742-6596/2448/1/012018.

Pełny tekst źródła

Streszczenie:

Abstract A process involving quantum teleportation to teleport a state to two parties in superposition is presented. Then, the process is applied to cryptography. Concretely in this work, we present the process of cryptography authentication using an undefined qubit state and the double quantum teleportation presented previously. Since quantum cryptography protocols are susceptible of eavesdropping, then such a process is considered through an eavesdropper trying to steal the information to supplant the user of authentication in order to quantify certain limits of applicability.

Style APA, Harvard, Vancouver, ISO itp.

23

Zawadzki, Piotr, and Jarosław Adam Miszczak. "A General Scheme for Information Interception in the Ping-Pong Protocol." Advances in Mathematical Physics 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/3162012.

Pełny tekst źródła

Streszczenie:

The existence of undetectable eavesdropping of dense coded information has been already demonstrated by Pavičić for the quantum direct communication based on the ping-pong paradigm. However, (a) the explicit scheme of the circuit is only given and no design rules are provided; (b) the existence of losses is implicitly assumed; (c) the attack has been formulated against qubit based protocol only and it is not clear whether it can be adapted to higher dimensional systems. These deficiencies are removed in the presented contribution. A new generic eavesdropping scheme built on a firm theoretical

Style APA, Harvard, Vancouver, ISO itp.

24

Hwang, Yongsoo, and Jun Heo. "On the relation between a graph code and a graph state." Quantum Information and Computation 16, no. 3&4 (2016): 237–50. http://dx.doi.org/10.26421/qic16.3-4-3.

Pełny tekst źródła

Streszczenie:

A graph state and a graph code respectively are defined based on a mathematical simple graph. In this work, we examine a relation between a graph state and a graph code both obtained from the same graph, and show that a graph state is a superposition of logical qubits of the related graph code. By using the relation, we first discuss that a local complementation which has been used for a graph state can be useful for searching locally equivalent stabilizer codes, and second provide a method to find a stabilizer group of a graph code.

Style APA, Harvard, Vancouver, ISO itp.

25

PIRANDOLA, STEFANO. "SYMMETRIC COLLECTIVE ATTACKS FOR THE EAVESDROPPING OF SYMMETRIC QUANTUM KEY DISTRIBUTION." International Journal of Quantum Information 06, supp01 (2008): 765–71. http://dx.doi.org/10.1142/s0219749908004080.

Pełny tekst źródła

Streszczenie:

We consider the collective eavesdropping of the BB84 and six-state protocols. Since these protocols are symmetric in the eigenstates of conjugate bases, we consider collective attacks having the same kind of symmetry. We then show how these symmetric collective attacks are sufficiently strong in order to minimize the Devetak–Winter rates. In fact, it is quite easy to construct simple examples able to reach the unconditionally secure key rates of these protocols.

Style APA, Harvard, Vancouver, ISO itp.

26

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.

Pełny tekst źródła

Streszczenie:

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

Style APA, Harvard, Vancouver, ISO itp.

27

Katayama, H., and A. Ichikawa. "Pole assignment by state transition graph." IEEE Transactions on Automatic Control 37, no. 8 (1992): 1196–201. http://dx.doi.org/10.1109/9.151103.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Kauffman, Louis H. "A state calculus for graph coloring." Illinois Journal of Mathematics 60, no. 1 (2016): 251–71. http://dx.doi.org/10.1215/ijm/1498032032.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Marzuola, Jeremy L., and Dmitry E. Pelinovsky. "Ground State on the Dumbbell Graph." Applied Mathematics Research eXpress 2016, no. 1 (2016): 98–145. http://dx.doi.org/10.1093/amrx/abv011.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Li, Yipeng, Xiaogang Liu, and Shenggui Zhang. "Laplacian state transfer in Q-graph." Applied Mathematics and Computation 384 (November 2020): 125370. http://dx.doi.org/10.1016/j.amc.2020.125370.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Sandhir, Radha Pyari. "State-independent quantum key distribution with two-way classical communication." Quantum Information and Computation 19, no. 15&16 (2019): 1279–93. http://dx.doi.org/10.26421/qic19.15-16-2.

Pełny tekst źródła

Streszczenie:

A quantum key distribution protocol is proposed that is a variation of BB84 that provides raw key generation from correlations that violate a Bell-type inequality for single qubit systems and not entangled pairs. Additionally, it 1) is state-independent, 2) involves two-way classical communication, and 3) does not require basis matching between the two parties. The Brukner-Taylor-Cheung-Vedral (BTCV) time-like form of the Bell-CHSH inequality by Bruk and by Tay is employed as an eavesdropping check; sequential measurements lead to an inequality identical in form to the Bell-CHSH inequality, wh

Style APA, Harvard, Vancouver, ISO itp.

32

ACÍN, ANTONIO, NICOLAS GISIN, LLUIS MASANES, and VALERIO SCARANI. "BELL'S INEQUALITIES DETECT EFFICIENT ENTANGLEMENT." International Journal of Quantum Information 02, no. 01 (2004): 23–31. http://dx.doi.org/10.1142/s0219749904000043.

Pełny tekst źródła

Streszczenie:

We review the status of Bell's inequalities in quantum information, stressing mainly the links with quantum key distribution and distillation of entanglement. We also prove that for all the eavesdropping attacks using one qubit, and for a family of attacks of two qubits, acting on half of a maximally entangled state of two qubits, the violation of a Bell inequality implies the possibility of an efficient secret-key extraction.

Style APA, Harvard, Vancouver, ISO itp.

33

Cai, Deng, and Wai Lam. "Graph Transformer for Graph-to-Sequence Learning." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (2020): 7464–71. http://dx.doi.org/10.1609/aaai.v34i05.6243.

Pełny tekst źródła

Streszczenie:

The dominant graph-to-sequence transduction models employ graph neural networks for graph representation learning, where the structural information is reflected by the receptive field of neurons. Unlike graph neural networks that restrict the information exchange between immediate neighborhood, we propose a new model, known as Graph Transformer, that uses explicit relation encoding and allows direct communication between two distant nodes. It provides a more efficient way for global graph structure modeling. Experiments on the applications of text generation from Abstract Meaning Representatio

Style APA, Harvard, Vancouver, ISO itp.

34

Liu, Chenghua, Zhuolin Liao, Yixuan Ma, and Kun Zhan. "Stationary Diffusion State Neural Estimation for Multiview Clustering." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 7 (2022): 7542–49. http://dx.doi.org/10.1609/aaai.v36i7.20719.

Pełny tekst źródła

Streszczenie:

Although many graph-based clustering methods attempt to model the stationary diffusion state in their objectives, their performance limits to using a predefined graph. We argue that the estimation of the stationary diffusion state can be achieved by gradient descent over neural networks. We specifically design the Stationary Diffusion State Neural Estimation (SDSNE) to exploit multiview structural graph information for co-supervised learning. We explore how to design a graph neural network specially for unsupervised multiview learning and integrate multiple graphs into a unified consensus grap

Style APA, Harvard, Vancouver, ISO itp.

35

Yang, Chunxin, Ryan P. Scott, David J. Geisler, Nicolas K. Fontaine, Jonathan P. Heritage, and S. J. Ben Yoo. "Four-State Data Encoding for Enhanced Security Against Upstream Eavesdropping in SPECTS O-CDMA." Journal of Lightwave Technology 29, no. 1 (2011): 62–68. http://dx.doi.org/10.1109/jlt.2010.2090129.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Adcock, Jeremy C., Sam Morley-Short, Axel Dahlberg, and Joshua W. Silverstone. "Mapping graph state orbits under local complementation." Quantum 4 (August 7, 2020): 305. http://dx.doi.org/10.22331/q-2020-08-07-305.

Pełny tekst źródła

Streszczenie:

Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation – the graph operation that links all local-Clifford equivalent graph states – allows us to classify all stabiliser states by their entanglement. Here, we study the structure of the orbits generated by local complementation, mapping them up to 9 qubits and revealing a rich hidden structure. We provide programs to compute these orbits, along with our data for each of the 587 orbits up to 9 qubits and a means to visualise them. We find direct links betwee

Style APA, Harvard, Vancouver, ISO itp.

37

ANGELES-CANUL, RICARDO JAVIER, RACHAEL M. NORTON, MICHAEL C. OPPERMAN, CHRISTOPHER C. PARIBELLO, MATTHEW C. RUSSELL, and CHRISTINO TAMON. "QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS." International Journal of Quantum Information 07, no. 08 (2009): 1429–45. http://dx.doi.org/10.1142/s0219749909006103.

Pełny tekst źródła

Streszczenie:

This paper studies quantum perfect state transfer on weighted graphs. We prove that the join of a weighted two-vertex graph with any regular graph has perfect state transfer. This generalizes a result of Casaccino et al.1 where the regular graph is a complete graph with or without a missing edge. In contrast, we prove that the half-join of a weighted two-vertex graph with any weighted regular graph has no perfect state transfer. As a corollary, unlike for complete graphs, adding weights in complete bipartite graphs does not produce perfect state transfer. We also observe that any Hamming graph

Style APA, Harvard, Vancouver, ISO itp.

38

Bechmann-Pasquinucci, H., and N. Gisin. "Bell inequality for quNits with binary measurements." Quantum Information and Computation 3, no. 2 (2003): 157–64. http://dx.doi.org/10.26421/qic3.2-6.

Pełny tekst źródła

Streszczenie:

We present a generalized Bell inequality for two entangled quNits. On one quNit the choice is between two standard von Neumann measurements, whereas for the other quNit there are N^2 different binary measurements. These binary measurements are related to the intermediate states known from eavesdropping in quantum cryptography. The maximum violation by \sqrt{N} is reached for the maximally entangled state. Moreover, for N=2 it coincides with the familiar CHSH-inequality.

Style APA, Harvard, Vancouver, ISO itp.

39

Qian, Pengzhi, Yu Zhang, Xiaojuan Yan, Yong Chen, and Yifu Sun. "A Robust Scheme for RIS-Assisted UAV Secure Communication in IoT." Electronics 12, no. 11 (2023): 2507. http://dx.doi.org/10.3390/electronics12112507.

Pełny tekst źródła

Streszczenie:

Reconfigurable intelligent surface (RIS)-assisted unmanned aerial vehicles (UAV) have been extensively studied on the Internet of Things (IoT) systems to improve communication performance. In this paper, we aimed to counter simultaneous jamming and eavesdropping attacks by jointly designing an active beamforming vector at the base station (BS) and reflect phase shifts at the RIS. Specifically, considering imperfect angular channel state information (CSI), the sum secrecy rate maximization problem in the worst case could be formulated, which is NP-hard and non-convex. To address this problem, w

Style APA, Harvard, Vancouver, ISO itp.

40

Coutinho, Gabriel, and Chris Godsil. "Perfect state transfer is poly-time." Quantum Information and Computation 17, no. 5&6 (2017): 495–502. http://dx.doi.org/10.26421/qic17.5-6-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

KAWASAKI, Yosuke, and Masaki TAKAHASHI. "World state dependent action graph based on knowledge representation using scene graph." Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec) 2022 (2022): 1A1—T08. http://dx.doi.org/10.1299/jsmermd.2022.1a1-t08.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Brown, John, Chris Godsil, Devlin Mallory, Abigail Raz, and Christino Tamon. "Perfect state transfer on signed graphs." Quantum Information and Computation 13, no. 5&6 (2013): 511–30. http://dx.doi.org/10.26421/qic13.5-6-10.

Pełny tekst źródła

Streszczenie:

We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. First, we show that the signed join of a negative $2$-clique with any positive $(n,3)$-regular graph has perfect state transfer even if the unsigned join does not. Curiously, the perfect state transfer time improves as $n$ increases. Next, we prove that a signed complete graph has perfect state transfer if its positive subgraph is a regular graph with perfect state transfer and its negative subgraph is periodic. This shows that signing is useful for c

Style APA, Harvard, Vancouver, ISO itp.

43

Li, Jian, HaiFei Jin, and Bo Jing. "Improved eavesdropping detection strategy based on four-particle cluster state in quantum direct communication protocol." Chinese Science Bulletin 57, no. 34 (2012): 4434–41. http://dx.doi.org/10.1007/s11434-012-5516-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

44

Li, Jian, Hai-Fei Jin, and Bo Jing. "Improved Eavesdropping Detection Strategy in Quantum Direct Communication Protocol Based on Five-Particle Cluster State." International Journal of Theoretical Physics 51, no. 9 (2012): 2759–70. http://dx.doi.org/10.1007/s10773-012-1151-5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

45

Liao, Longxia, Xiaoqi Peng, Jinjing Shi, and Ying Guo. "Graph State-Based Quantum Group Authentication Scheme." Journal of the Physical Society of Japan 86, no. 2 (2017): 024403. http://dx.doi.org/10.7566/jpsj.86.024403.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

46

Herrera-Marti, David A., and Terry Rudolph. "Loss tolerance with a concatenated graph state." Quantum Information and Computation 13, no. 11&12 (2013): 995–1006. http://dx.doi.org/10.26421/qic13.11-12-6.

Pełny tekst źródła

Streszczenie:

A new way of addressing loss errors is introduced which combines ideas from measurement-based quantum computation and concatenated quantum codes, allowing for universal quantum computation. It is shown that for the case where qubit loss is detected upon measurement, the scheme performs well under $23\%$ loss rate. For loss rates below $10\%$ this approach performs better than the best scheme known up to date \cite{varnava2006loss}. If lost qubits are tagged prior to measurement, it can tolerate up to $50\%$ loss. The overhead per logical qubit is shown to be significantly lower than other sche

Style APA, Harvard, Vancouver, ISO itp.

47

Hajdušek, M., and M. Murao. "Direct evaluation of pure graph state entanglement." New Journal of Physics 15, no. 1 (2013): 013039. http://dx.doi.org/10.1088/1367-2630/15/1/013039.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Tian, Yu-Ling, Tian-Feng Feng, and Xiao-Qi Zhou. "Collaborative quantum computation with redundant graph state." Acta Physica Sinica 68, no. 11 (2019): 110302. http://dx.doi.org/10.7498/aps.68.20190142.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Zambon, Eduardo, and Arend Rensink. "Graph Subsumption in Abstract State Space Exploration." Electronic Proceedings in Theoretical Computer Science 99 (October 23, 2012): 35–49. http://dx.doi.org/10.4204/eptcs.99.6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

50

Kaur, Hargeet, and Atul Kumar. "An Improved Ping-Pong Protocol Using Three-Qubit Nonmaximally Nonorthogonal Entangled States." Zeitschrift für Naturforschung A 74, no. 9 (2019): 799–811. http://dx.doi.org/10.1515/zna-2018-0448.

Pełny tekst źródła

Streszczenie:

AbstractWe analyse the ping-pong (PP) protocol [K. Bostrom and T. Felbinger, Phys. Rev. Lett. 89, 187902 (2002)] using different sets of partially entangled three-qubit states. Interestingly, our results show that the partially entangled nonorthogonal three-qubit states are more useful as resources in comparison to three-qubit maximally entangled Greenberger–Horne–Zeilinger (GHZ) states. The properties of orthogonal set of partially entangled states as resources for PP protocol, however, are similar to that of maximally entangled GHZ states – both the states are not preferable due to the vulne

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!