Quantum memory receiver for superadditive communication using binary coherent states
Klimek, Aleksandra; Wasilewski, Wojciech; Banaszek, Konrad
2015-01-01
We propose a simple architecture based on multimode quantum memories for collective readout of classical information keyed using a pair coherent states, exemplified by the well-known binary phase shift keying format. Such a configuration enables demonstration of the superadditivity effect in classical communication over quantum channels, where the transmission rate becomes enhanced through joint detection applied to multiple channel uses. The proposed scheme relies on the recently introduced idea to prepare Hadamard sequences of input symbols that are mapped by a linear optical transformation onto the pulse position modulation format [Guha, S. {\\em Phys. Rev. Lett.}\\ {\\bf 2011}, {\\em 106}, 240502]. We analyze two versions of readout based on direct detection and an optional Dolinar receiver which implements the minimum-error measurement for individual detection of a binary coherent state alphabet.
Quantum memory receiver for superadditive communication using binary coherent states.
Klimek, Aleksandra; Jachura, Michał; Wasilewski, Wojciech; Banaszek, Konrad
2016-11-12
We propose a simple architecture based on multimode quantum memories for collective readout of classical information keyed using a pair coherent states, exemplified by the well-known binary phase shift keying format. Such a configuration enables demonstration of the superadditivity effect in classical communication over quantum channels, where the transmission rate becomes enhanced through joint detection applied to multiple channel uses. The proposed scheme relies on the recently introduced idea to prepare Hadamard sequences of input symbols that are mapped by a linear optical transformation onto the pulse position modulation format [Guha, S. Phys. Rev. Lett.2011, 106, 240502]. We analyze two versions of readout based on direct detection and an optional Dolinar receiver which implements the minimum-error measurement for individual detection of a binary coherent state alphabet.
General immunity and superadditivity of two-way Gaussian quantum cryptography
Ottaviani, Carlo; Pirandola, Stefano
2016-03-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks.
General immunity and superadditivity of two-way Gaussian quantum cryptography.
Ottaviani, Carlo; Pirandola, Stefano
2016-03-01
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune to coherent attacks. More precisely we show the general superadditivity of the two-way security thresholds, which are proven to be higher than the corresponding one-way counterparts in all cases. We perform the security analysis first reducing the general eavesdropping to a two-mode coherent Gaussian attack, and then showing that the superadditivity is achieved by exploiting the random on/off switching of the two-way quantum communication. This allows the parties to choose the appropriate communication instances to prepare the key, accordingly to the tomography of the quantum channel. The random opening and closing of the circuit represents, in fact, an additional degree of freedom allowing the parties to convert, a posteriori, the two-mode correlations of the eavesdropping into noise. The eavesdropper is assumed to have no access to the on/off switching and, indeed, cannot adapt her attack. We explicitly prove that this mechanism enhances the security performance, no matter if the eavesdropper performs collective or coherent attacks.
Reliable quantum communication over a quantum relay channel
Energy Technology Data Exchange (ETDEWEB)
Gyongyosi, Laszlo, E-mail: gyongyosi@hit.bme.hu [Quantum Technologies Laboratory, Department of Telecommunications, Budapest University of Technology and Economics, 2 Magyar tudosok krt, Budapest, H-1117, Hungary and Information Systems Research Group, Mathematics and Natural Sciences, Hungarian Ac (Hungary); Imre, Sandor [Quantum Technologies Laboratory, Department of Telecommunications, Budapest University of Technology and Economics, 2 Magyar tudosok krt, Budapest, H-1117 (Hungary)
2014-12-04
We show that reliable quantum communication over an unreliable quantum relay channels is possible. The coding scheme combines the results on the superadditivity of quantum channels and the efficient quantum coding approaches.
Institute of Scientific and Technical Information of China (English)
2008-01-01
Quantum error correcting codes are indispensable for quantum information processing and quantum computation.In 1995 and 1996,Shor and Steane gave first several examples of quantum codes from classical error correcting codes.The construction of efficient quantum codes is now an active multi-discipline research field.In this paper we review the known several constructions of quantum codes and present some examples.
Nested Quantum Error Correction Codes
Wang, Zhuo; Fan, Hen; Vedral, Vlatko
2009-01-01
The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are available in constructing new quantum error correction codes from old codes. Here we exhibit a simple and general method to construct new quantum error correction codes by nesting certain quantum codes together. The problem of finding long quantum error correction codes is reduced to that of searching several short length quantum codes with certain properties. Our method works for all length and all distance codes, and is quite efficient to construct optimal or near optimal codes. Two main known methods in constructing new codes from old codes in quantum error-correction theory, the concatenating and pasting, can be understood in the framework of nested quantum error correction codes.
Quantum measurements of atoms using cavity QED
Dada, Adetunmise C; Jones, Martin L; Kendon, Vivien M; Everitt, Mark S
2010-01-01
Generalized quantum measurements are an important extension of projective or von Neumann measurements, in that they can be used to describe any measurement that can be implemented on a quantum system. We describe how to realize two non-standard quantum measurements using cavity quantum electrodynamics (QED). The first measurement optimally and unabmiguously distinguishes between two non-orthogonal quantum states. The second example is a measurement that demonstrates superadditive quantum coding gain. The experimental tools used are single-atom unitary operations effected by Ramsey pulses and two-atom Tavis-Cummings interactions. We show how the superadditive quantum coding gain is affected by errors in the field-ionisation detection of atoms, and that even with rather high levels of experimental imperfections, a reasonable amount of superadditivity can still be seen. To date, these types of measurement have only been realized on photons. It would be of great interest to have realizations using other physical ...
Correlation additivity relation is superadditive for separable states
Zhang, Zhanjun
2012-01-01
We deny with a concrete example the generality of the correlation subadditivity relation conjectured by Modi et al's [Phys. Rev. Lett. {\\bf 104}, 080501 (2010)] for any quantum state and point out that the correlation additivity relation is actually super-additive for separable states. This work indicates that any effort on explicitly proving the conjecture and finding the subadditivity source is unnecessary and fruitless.
On Asymmetric Quantum MDS Codes
Ezerman, Martianus Frederic; Ling, San
2010-01-01
Assuming the validity of the MDS Conjecture, the weight distribution of all MDS codes is known. Using a recently-established characterization of asymmetric quantum error-correcting codes, linear MDS codes can be used to construct asymmetric quantum MDS codes with $d_{z} \\geq d_{x}\\geq 2$ for all possible values of length $n$ for which linear MDS codes over $\\F_{q}$ are known to exist.
Pastawski, Fernando; Wilming, Henrik
2016-01-01
Approximate quantum error-correcting codes are codes with "soft recovery guarantees" wherein information can be approximately recovered. In this article, we propose a complementary "soft code-spaces" wherein a weighted prior distribution is assumed over the possible logical input states. The performance for protecting information from noise is then evaluated in terms of entanglement fidelity. We apply a recent construction for approximate recovery maps, which come with a guaranteed lower-bounds on the decoding performance. These lower bound are straightforwardly obtained by evaluating entropies on marginals of the mixed state which represents the "soft code-space". As an example, we consider thermal states of the transverse field Ising model at criticality and provide numerical evidence that the entanglement fidelity admits non-trivial recoverability from local errors. This provides the first concrete interpretation of a bonafide conformal field theory as a quantum error-correcting code. We further suggest, t...
Quantum BCH Codes Based on Spectral Techniques
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
When the time variable in quantum signal processing is discrete, the Fourier transform exists on the vector space of n-tuples over the Galois field F2, which plays an important role in the investigation of quantum signals. By using Fourier transforms, the idea of quantum coding theory can be described in a setting that is much different from that seen that far. Quantum BCH codes can be defined as codes whose quantum states have certain specified consecutive spectral components equal to zero and the error-correcting ability is also described by the number of the consecutive zeros. Moreover, the decoding of quantum codes can be described spectrally with more efficiency.
An Introduction to Topological Quantum Codes
Bombin, H.
2013-01-01
This is the chapter \\emph{Topological Codes} of the book \\emph{Quantum Error Correction}, edited by Daniel A. Lidar and Todd A. Brun, Cambridge University Press, New York, 2013. http://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/quantum-error-correction
Relating quantum discord with the quantum dense coding capacity
Energy Technology Data Exchange (ETDEWEB)
Wang, Xin; Qiu, Liang, E-mail: lqiu@cumt.edu.cn; Li, Song; Zhang, Chi [China University of Mining and Technology, School of Sciences (China); Ye, Bin [China University of Mining and Technology, School of Information and Electrical Engineering (China)
2015-01-15
We establish the relations between quantum discord and the quantum dense coding capacity in (n + 1)-particle quantum states. A necessary condition for the vanishing discord monogamy score is given. We also find that the loss of quantum dense coding capacity due to decoherence is bounded below by the sum of quantum discord. When these results are restricted to three-particle quantum states, some complementarity relations are obtained.
Quantum coding theory with realistic physical constraints
Yoshida, Beni
2010-01-01
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum error-correcting codes with geometrically local generators, (b) the feasibility of a self-correcting quantum memory. To investigate these problems, we study stabilizer codes supported by local interaction terms with translation and scale symmetries on a $D$-dimensional lattice. Our analysis uses the notion of topology emerging in geometric shapes of logical operators, which sheds a surprising new light on theory of quantum codes with physical constraints.
Inhomogenous quantum codes (Ⅰ):additive case
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
In this paper,the quantum error-correcting codes are generalized to the inhomogenous quantumstate space Cq1 Cq2 ··· Cqn,where qi(1 i n) are arbitrary positive integers.By attaching an abelian group Ai of order qi to the space Cqi(1 i n),we present the stabilizer construction of such inhomogenous quantum codes,called additive quantum codes,in term of the character theory of the abelian group A = A1⊕A2⊕···⊕An.As usual case,such construction opens a way to get inhomogenous quantum codes from the classical mixed linear codes.We also present Singleton bound for inhomogenous additive quantum codes and show several quantum codes to meet such bound by using classical mixed algebraic-geometric codes.
Decoder for Nonbinary CWS Quantum Codes
Melo, Nolmar; Portugal, Renato
2012-01-01
We present a decoder for nonbinary CWS quantum codes using the structure of union codes. The decoder runs in two steps: first we use a union of stabilizer codes to detect a sequence of errors, and second we build a new code, called union code, that allows to correct the errors.
Classical codes for quantum broadcast channels
Savov, Ivan
2011-01-01
We discuss two techniques for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum simultaneous nonunique decoder and obtain a simpler proof of the rate region recently published by Yard et al. in independent work. Our second result is a quantum Marton coding scheme, which gives the best known achievable rate region for quantum broadcast channels. Both results exploit recent advances in quantum simultaneous decoding developed in the context of quantum interference channels.
Quantum codes from linear codes over finite chain rings
Liu, Xiusheng; Liu, Hualu
2017-10-01
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring {\\mathbb {F}}_{p^{2m}}+u{\\mathbb {F}}_{p^{2m}}. The good parameters of quantum codes from cyclic codes over finite chain rings are obtained.
A quantum analog of Huffman coding
Braunstein, S L; Gottesman, D; Lo, H K; Braunstein, Samuel L.; Fuchs, Christopher A.; Gottesman, Daniel; Lo, Hoi-Kwong
1998-01-01
We analyse a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. However, for the storage of quantum information, we have succeeded in constructing a Huffman-coding inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be polynomial in log N by a massively parallel implementation of a quantum gate array. This is to be compared with the N^3 computational steps required in the sequential implementation by Cleve and DiVincenzo of the well-known quantum noiseless block coding scheme by Schumacher. The powers and limitations in using this scheme in communication are also discussed.
New quantum codes constructed from quaternary BCH codes
Xu, Gen; Li, Ruihu; Guo, Luobin; Ma, Yuena
2016-10-01
In this paper, we firstly study construction of new quantum error-correcting codes (QECCs) from three classes of quaternary imprimitive BCH codes. As a result, the improved maximal designed distance of these narrow-sense imprimitive Hermitian dual-containing quaternary BCH codes are determined to be much larger than the result given according to Aly et al. (IEEE Trans Inf Theory 53:1183-1188, 2007) for each different code length. Thus, families of new QECCs are newly obtained, and the constructed QECCs have larger distance than those in the previous literature. Secondly, we apply a combinatorial construction to the imprimitive BCH codes with their corresponding primitive counterpart and construct many new linear quantum codes with good parameters, some of which have parameters exceeding the finite Gilbert-Varshamov bound for linear quantum codes.
Upper and lower bounds on quantum codes
Smith, Graeme Stewart Baird
This thesis provides bounds on the performance of quantum error correcting codes when used for quantum communication and quantum key distribution. The first two chapters provide a bare-bones introduction to classical and quantum error correcting codes, respectively. The next four chapters present achievable rates for quantum codes in various scenarios. The final chapter is dedicated to an upper bound on the quantum channel capacity. Chapter 3 studies coding for adversarial noise using quantum list codes, showing there exist quantum codes with high rates and short lists. These can be used, together with a very short secret key, to communicate with high fidelity at noise levels for which perfect fidelity is, impossible. Chapter 4 explores the performance of a family of degenerate codes when used to communicate over Pauli channels, showing they can be used to communicate over almost any Pauli channel at rates that are impossible for a nondegenerate code and that exceed those of previously known degenerate codes. By studying the scaling of the optimal block length as a function of the channel's parameters, we develop a heuristic for designing even better codes. Chapter 5 describes an equivalence between a family of noisy preprocessing protocols for quantum key distribution and entanglement distillation protocols whose target state belongs to a class of private states called "twisted states." In Chapter 6, the codes of Chapter 4 are combined with the protocols of Chapter 5 to provide higher key rates for one-way quantum key distribution than were previously thought possible. Finally, Chapter 7 presents a new upper bound on the quantum channel capacity that is both additive and convex, and which can be interpreted as the capacity of the channel for communication given access to side channels from a class of zero capacity "cloning" channels. This "clone assisted capacity" is equal to the unassisted capacity for channels that are degradable, which we use to find new upper
Quantifying the Performance of Quantum Codes
Cafaro, C; Lupo, C; Mancini, S
2011-01-01
We study the properties of error correcting codes for noise models in the presence of asymmetries and/or correlations by means of the entanglement fidelity and the code entropy. First, we consider a dephasing Markovian memory channel and characterize the performance of both a repetition code and an error avoiding code in terms of the entanglement fidelity. We also consider the concatenation of such codes and show that it is especially advantageous in the regime of partial correlations. Finally, we characterize the effectiveness of the codes and their concatenation by means of the code entropy and find, in particular, that the effort required for recovering such codes decreases when the error probability decreases and the memory parameter increases. Second, we consider both symmetric and asymmetric depolarizing noisy quantum memory channels and perform quantum error correction via the five qubit stabilizer code. We characterize this code by means of the entanglement fidelity and the code entropy as function of...
Robust entanglement distribution via quantum network coding
Epping, Michael; Kampermann, Hermann; Bruß, Dagmar
2016-10-01
Many protocols of quantum information processing, like quantum key distribution or measurement-based quantum computation, ‘consume’ entangled quantum states during their execution. When participants are located at distant sites, these resource states need to be distributed. Due to transmission losses quantum repeater become necessary for large distances (e.g. ≳ 300 {{km}}). Here we generalize the concept of the graph state repeater to D-dimensional graph states and to repeaters that can perform basic measurement-based quantum computations, which we call quantum routers. This processing of data at intermediate network nodes is called quantum network coding. We describe how a scheme to distribute general two-colourable graph states via quantum routers with network coding can be constructed from classical linear network codes. The robustness of the distribution of graph states against outages of network nodes is analysed by establishing a link to stabilizer error correction codes. Furthermore we show, that for any stabilizer error correction code there exists a corresponding quantum network code with similar error correcting capabilities.
ON CLASSICAL BCH CODES AND QUANTUM BCH CODES
Institute of Scientific and Technical Information of China (English)
Xu Yajie; Ma Zhi; Zhang Chunyuan
2009-01-01
It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.
Structured error recovery for code-word-stabilized quantum codes
Li, Yunfan; Dumer, Ilya; Grassl, Markus; Pryadko, Leonid P.
2010-05-01
Code-word-stabilized (CWS) codes are, in general, nonadditive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical nonlinear codes. For an n-qubit quantum code correcting errors on up to t qubits, this brute-force approach consecutively tests different errors of weight t or less and employs a separate n-qubit measurement in each test. In this article, we suggest an error grouping technique that allows one to simultaneously test large groups of errors in a single measurement. This structured error recovery technique exponentially reduces the number of measurements by about 3t times. While it still leaves exponentially many measurements for a generic CWS code, the technique is equivalent to syndrome-based recovery for the special case of additive CWS codes.
A class of constacyclic BCH codes and new quantum codes
liu, Yang; Li, Ruihu; Lv, Liangdong; Ma, Yuena
2017-03-01
Constacyclic BCH codes have been widely studied in the literature and have been used to construct quantum codes in latest years. However, for the class of quantum codes of length n=q^{2m}+1 over F_{q^2} with q an odd prime power, there are only the ones of distance δ ≤ 2q^2 are obtained in the literature. In this paper, by a detailed analysis of properties of q2-ary cyclotomic cosets, maximum designed distance δ _{max} of a class of Hermitian dual-containing constacyclic BCH codes with length n=q^{2m}+1 are determined, this class of constacyclic codes has some characteristic analog to that of primitive BCH codes over F_{q^2}. Then we can obtain a sequence of dual-containing constacyclic codes of designed distances 2q^2 2q^2 can be constructed from these dual-containing codes via Hermitian Construction. These newly obtained quantum codes have better code rate compared with those constructed from primitive BCH codes.
Opportunistic quantum network coding based on quantum teleportation
Shang, Tao; Du, Gang; Liu, Jian-wei
2016-04-01
It seems impossible to endow opportunistic characteristic to quantum network on the basis that quantum channel cannot be overheard without disturbance. In this paper, we propose an opportunistic quantum network coding scheme by taking full advantage of channel characteristic of quantum teleportation. Concretely, it utilizes quantum channel for secure transmission of quantum states and can detect eavesdroppers by means of quantum channel verification. What is more, it utilizes classical channel for both opportunistic listening to neighbor states and opportunistic coding by broadcasting measurement outcome. Analysis results show that our scheme can reduce the times of transmissions over classical channels for relay nodes and can effectively defend against classical passive attack and quantum active attack.
Quantum secret sharing based on quantum error-correcting codes
Institute of Scientific and Technical Information of China (English)
Zhang Zu-Rong; Liu Wei-Tao; Li Cheng-Zu
2011-01-01
Quantum secret sharing(QSS) is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k - 1,1, k] quantum error-correcting code (QECC) to implement a quantum (k, 2k - 1) threshold scheme. It also takes advantage of classical enhancement of the [2k - 1, l,k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.
Analysis of quantum error-correcting codes: Symplectic lattice codes and toric codes
Harrington, James William
Quantum information theory is concerned with identifying how quantum mechanical resources (such as entangled quantum states) can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g. , factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system (such as a mode of light) can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under various error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in certain condensed matter models. I also present
Quantum internet using code division multiple access
Zhang, Jing; Liu, Yu-xi; Özdemir, Şahin Kaya; Wu, Re-Bing; Gao, Feifei; Wang, Xiang-Bin; Yang, Lan; Nori, Franco
2013-01-01
A crucial open problem inS large-scale quantum networks is how to efficiently transmit quantum data among many pairs of users via a common data-transmission medium. We propose a solution by developing a quantum code division multiple access (q-CDMA) approach in which quantum information is chaotically encoded to spread its spectral content, and then decoded via chaos synchronization to separate different sender-receiver pairs. In comparison to other existing approaches, such as frequency division multiple access (FDMA), the proposed q-CDMA can greatly increase the information rates per channel used, especially for very noisy quantum channels. PMID:23860488
Quantum internet using code division multiple access
Zhang, Jing; Ozdemir, Sahin Kaya; Wu, Re-Bing; Wang, Xiang-Bin; Nori, Franco
2012-01-01
Code division multiple access (CDMA) is a spread-spectrum technology, in which a code is used to spread the spectral content of information to achieve larger network capacity. It has been widely used in classical communication and wireless networks. Here, we extend CDMA to the quantum case, where many pairs of nodes can transmit quantum information through a shared channel. This can be achieved by chaotic encoding of quantum information to spread its spectral content and by chaos synchronization, to separate different sender-receiver pairs. The proposed method is robust to low-frequency noise, and achieves faithful transmission with fidelities of up to 0.99.
Continuous-variable quantum erasure correcting code
DEFF Research Database (Denmark)
Lassen, Mikael Østergaard; Sabuncu, Metin; Huck, Alexander
2010-01-01
We experimentally demonstrate a continuous variable quantum erasure-correcting code, which protects coherent states of light against complete erasure. The scheme encodes two coherent states into a bi-party entangled state, and the resulting 4-mode code is conveyed through 4 independent channels...
Complete multiple round quantum dense coding with quantum logical network
Institute of Scientific and Technical Information of China (English)
LI ChunYan; LI XiHan; DENG FuGuo; ZHOU Ping; ZHOU HongYu
2007-01-01
We present a complete multiple round quantum dense coding scheme for improving the source capacity of that introduced recently by Zhang et al. The receiver resorts to two qubits for storing the four local unitary operations in each round.
Group representations, error bases and quantum codes
Energy Technology Data Exchange (ETDEWEB)
Knill, E
1996-01-01
This report continues the discussion of unitary error bases and quantum codes. Nice error bases are characterized in terms of the existence of certain characters in a group. A general construction for error bases which are non-abelian over the center is given. The method for obtaining codes due to Calderbank et al. is generalized and expressed purely in representation theoretic terms. The significance of the inertia subgroup both for constructing codes and obtaining the set of transversally implementable operations is demonstrated.
Nonbinary codeword-stabilized quantum codes
Chen, Xie; Zeng, Bei; Chuang, Isaac L.
2008-12-01
The codeword-stabilized (CWS) quantum code formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes [see A. Cross , e-print arXiv:0708.1021], but only for binary states. Here we generalize the CWS framework to the nonbinary case (of both prime and nonprime dimensions) and map the search for nonbinary quantum codes to a corresponding search problem for classical nonbinary codes with specific error patterns. We show that while the additivity properties of nonbinary CWS codes are similar to the binary case, the structural properties of the nonbinary codes differ substantially from the binary case, even for prime dimensions. In particular, we identify specific structure patterns of stabilizer groups, based on which efficient constructions might be possible for codes that encode more dimensions than any stabilizer codes of the same length and distance; similar methods cannot be applied in the binary case. Understanding of these structural properties can help prune the search space and facilitate the identification of good nonbinary CWS codes.
Quantum Codes for Controlling Coherent Evolution
Sharf, Y; Cory, D G; Sharf, Yehuda; Havel, Timothy F.; Cory, David G.
2000-01-01
Control over spin dynamics has been obtained in NMR via coherent averaging, which is implemented through a sequence of RF pulses, and via quantum codes which can protect against incoherent evolution. Here, we discuss the design and implementation of quantum codes to protect against coherent evolution. A detailed example is given of a quantum code for protecting two data qubits from evolution under a weak coupling (Ising) term in the Hamiltonian, using an ``isolated'' ancilla which does not evolve on the experimental time scale. The code is realized in a three-spin system by liquid-state NMR spectroscopy on 13C-labelled alanine, and tested for two initial states. It is also shown that for coherent evolution and isolated ancillae, codes exist that do not require the ancillae to initially be in a (pseudo-)pure state. Finally, it is shown that even with non-isolated ancillae quantum codes exist which can protect against evolution under weak coupling. An example is presented for a six qubit code that protects two ...
Codeword stabilized quantum codes: Algorithm and structure
Chuang, Isaac; Cross, Andrew; Smith, Graeme; Smolin, John; Zeng, Bei
2009-04-01
The codeword stabilized (CWS) quantum code formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes [IEEE Trans. Inf. Theory 55, 433 (2009)]. This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we provide three structure theorems which reduce the search space, specifying certain admissible and optimal ((n,K,d)) additive codes. In particular, we find that the re does not exist any ((7,3,3)) CWS code though the linear programming bound does not rule it out. The complexity of the CWS-search algorithm is compared with the contrasting method introduced by Aggarwal and Calderbank [IEEE Trans. Inf. Theory 54, 1700 (2008)].
Frequency-coded quantum key distribution.
Bloch, Matthieu; McLaughlin, Steven W; Merolla, Jean-Marc; Patois, Frédéric
2007-02-01
We report an intrinsically stable quantum key distribution scheme based on genuine frequency-coded quantum states. The qubits are efficiently processed without fiber interferometers by fully exploiting the nonlinear interaction occurring in electro-optic phase modulators. The system requires only integrated off-the-shelf devices and could be used with a true single-photon source. Preliminary experiments have been performed with weak laser pulses and have demonstrated the feasibility of this new setup.
Hiding Quantum Information in the Perfect Code
Shaw, Bilal A
2010-01-01
We present and analyze a protocol for quantum steganography where the sender (Alice) encodes her steganographic information into the error syndromes of the perfect (five-qubit) quantum error-correcting code, and sends it to the receiver (Bob) over a depolarizing channel. Alice and Bob share a classical secret key, and hide quantum information in such a way that to an eavesdropper (Eve) without access to the secret key, the quantum message looks like an innocent codeword with a typical sequence of quantum errors. We calculate the average rate of key consumption, and show how the protocol improves in performance as information is spread over multiple codeword blocks. Alice and Bob utilize different encodings to optimize the average number of steganographic bits that they can send to each other while matching the error statistics of the depolarizing channel.
A surface code quantum computer in silicon.
Hill, Charles D; Peretz, Eldad; Hile, Samuel J; House, Matthew G; Fuechsle, Martin; Rogge, Sven; Simmons, Michelle Y; Hollenberg, Lloyd C L
2015-10-01
The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in parallel-posing formidable fabrication and control challenges. We present an architecture that addresses these problems through a novel shared-control paradigm that is particularly suited to the natural uniformity of the phosphorus donor nuclear spin qubit states and electronic confinement. The architecture comprises a two-dimensional lattice of donor qubits sandwiched between two vertically separated control layers forming a mutually perpendicular crisscross gate array. Shared-control lines facilitate loading/unloading of single electrons to specific donors, thereby activating multiple qubits in parallel across the array on which the required operations for surface code quantum error correction are carried out by global spin control. The complexities of independent qubit control, wave function engineering, and ad hoc quantum interconnects are explicitly avoided. With many of the basic elements of fabrication and control based on demonstrated techniques and with simulated quantum operation below the surface code error threshold, the architecture represents a new pathway for large-scale quantum information processing in silicon and potentially in other qubit systems where uniformity can be exploited.
Quantum error correcting codes and one-way quantum computing: Towards a quantum memory
Schlingemann, D
2003-01-01
For realizing a quantum memory we suggest to first encode quantum information via a quantum error correcting code and then concatenate combined decoding and re-encoding operations. This requires that the encoding and the decoding operation can be performed faster than the typical decoherence time of the underlying system. The computational model underlying the one-way quantum computer, which has been introduced by Hans Briegel and Robert Raussendorf, provides a suitable concept for a fast implementation of quantum error correcting codes. It is shown explicitly in this article is how encoding and decoding operations for stabilizer codes can be realized on a one-way quantum computer. This is based on the graph code representation for stabilizer codes, on the one hand, and the relation between cluster states and graph codes, on the other hand.
Overhead analysis of universal concatenated quantum codes
Chamberland, Christopher; Jochym-O'Connor, Tomas; Laflamme, Raymond
2017-02-01
We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code, which allows for the construction of the 49- and 105-qubit codes that do not require the need for magic state distillation for universality. We compute a lower bound for the adversarial noise threshold of the 105-qubit code and find it to be 8.33 ×10-6. We obtain a depolarizing noise threshold for the 49-qubit code of 9.69 ×10-4 which is competitive with the 105-qubit threshold result of 1.28 ×10-3 . We then provide lower bounds on the resource requirements of the 49- and 105-qubit codes and compare them with the surface code implementation of a logical T gate using magic state distillation. For the sampled input error rates and noise model, we find that the surface code achieves a smaller overhead compared to our concatenated schemes.
Quantum superdense coding based on hyperentanglement
Institute of Scientific and Technical Information of China (English)
Zhao Rui-Tong; Guo Qi; Chen Li; Wang Hong-Fu; Zhang Shou
2012-01-01
We present a scheme for quantum superdense coding with hyperentanglement,in which the sender can transfer four bits of classical information by sending only one photon.The important device in the scheme is the hyperentangled Bell-state analyzer in both polarization and frequency degrees of freedom,which is also constructed in the paper by using a quantum nondemolition detector assisted by cross-Kerr nonlinearity.Our scheme can transfer more information with less resources than the existing schemes and is nearly deterministic and nondestructive.
Quantum control using genetic algorithms in quantum communication: superdense coding
Domínguez-Serna, Francisco; Rojas, Fernando
2015-06-01
We present a physical example model of how Quantum Control with genetic algorithms is applied to implement the quantum superdense code protocol. We studied a model consisting of two quantum dots with an electron with spin, including spin-orbit interaction. The electron and the spin get hybridized with the site acquiring two degrees of freedom, spin and charge. The system has tunneling and site energies as time dependent control parameters that are optimized by means of genetic algorithms to prepare a hybrid Bell-like state used as a transmission channel. This state is transformed to obtain any state of the four Bell basis as required by superdense protocol to transmit two bits of classical information. The control process protocol is equivalent to implement one of the quantum gates in the charge subsystem. Fidelities larger than 99.5% are achieved for the hybrid entangled state preparation and the superdense operations.
A construction of quantum turbo product codes based on CSS-type quantum convolutional codes
Xiao, Hailin; Ni, Ju; Xie, Wu; Ouyang, Shan
As in classical coding theory, turbo product codes (TPCs) through serially concatenated block codes can achieve approximatively Shannon capacity limit and have low decoding complexity. However, special requirements in the quantum setting severely limit the structures of turbo product codes (QTPCs). To design a good structure for QTPCs, we present a new construction of QTPCs with the interleaved serial concatenation of CSS(L1,L2)-type quantum convolutional codes (QCCs). First, CSS(L1,L2)-type QCCs are proposed by exploiting the theory of CSS-type quantum stabilizer codes and QCCs, and the description and the analysis of encoder circuit are greatly simplified in the form of Hadamard gates and C-NOT gates. Second, the interleaved coded matrix of QTPCs is derived by quantum permutation SWAP gate definition. Finally, we prove the corresponding relation on the minimum Hamming distance of QTPCs associated with classical TPCs, and describe the state diagram of encoder and decoder of QTPCs that have a highly regular structure and simple design idea.
Thresholds for Universal Concatenated Quantum Codes
Chamberland, Christopher; Jochym-O'Connor, Tomas; Laflamme, Raymond
2016-07-01
Quantum error correction and fault tolerance make it possible to perform quantum computations in the presence of imprecision and imperfections of realistic devices. An important question is to find the noise rate at which errors can be arbitrarily suppressed. By concatenating the 7-qubit Steane and 15-qubit Reed-Muller codes, the 105-qubit code enables a universal set of fault-tolerant gates despite not all of them being transversal. Importantly, the cnot gate remains transversal in both codes, and as such has increased error protection relative to the other single qubit logical gates. We show that while the level-1 pseudothreshold for the concatenated scheme is limited by the logical Hadamard gate, the error suppression of the logical cnot gates allows for the asymptotic threshold to increase by orders of magnitude at higher levels. We establish a lower bound of 1.28 ×10-3 for the asymptotic threshold of this code, which is competitive with known concatenated models and does not rely on ancillary magic state preparation for universal computation.
On the distance of stabilizer quantum codes from J-affine variety codes
Galindo, Carlos; Geil, Olav; Hernando, Fernando; Ruano, Diego
2017-04-01
Self-orthogonal J-affine variety codes have been successfully used to obtain quantum stabilizer codes with excellent parameters. In a previous paper we gave formulae for the dimension of this family of quantum codes, but no bound for the minimum distance was given. In this work, we show how to derive quantum stabilizer codes with designed minimum distance from J-affine variety codes and their subfield-subcodes. Moreover, this allows us to obtain new quantum codes, some of them either with better parameters, or with larger distances than the previously known codes.
Non-binary Entanglement-assisted Stabilizer Quantum Codes
Riguang, Leng
2011-01-01
In this paper, we show how to construct non-binary entanglement-assisted stabilizer quantum codes by using pre-shared entanglement between the sender and receiver. We also give an algorithm to determine the circuit for non-binary entanglement-assisted stabilizer quantum codes and some illustrated examples. The codes we constructed do not require the dual-containing constraint, and many non-binary classical codes, like non-binary LDPC codes, which do not satisfy the condition, can be used to construct non-binary entanglement-assisted stabilizer quantum codes.
Lossless quantum coding in many-letter spaces
Boström, K J
2000-01-01
Based on the concept of many-letter theory a general characterization of quantum codes using the Kraus representation is given. Compression codes are defined by their property of decreasing the average information content of a given a priori message ensemble. Lossless quantum codes, in contrast to lossy codes, provide the retrieval of the original input states with perfect fidelity. A general lossless coding scheme is given that translates between two quantum alphabets. It is shown that this scheme is never compressive. Furthermore, a lossless quantum coding scheme, analog to the classical Huffman scheme but different from the Braunstein scheme, is implemented, which provides optimal compression. Motivated by the concept of lossless quantum compression, an observable is defined that measures the amount of compressible quantum information contained in a particular message with respect to a given \\emph{a priori} message ensemble. The average of this observable yields the von Neumann entropy, which is finally es...
Secure quantum network coding for controlled repeater networks
Shang, Tao; Li, Jiao; Liu, Jian-wei
2016-07-01
To realize efficient quantum communication based on quantum repeater, we propose a secure quantum network coding scheme for controlled repeater networks, which adds a controller as a trusted party and is able to control the process of EPR-pair distribution. As the key operations of quantum repeater, local operations and quantum communication are designed to adopt quantum one-time pad to enhance the function of identity authentication instead of local operations and classical communication. Scheme analysis shows that the proposed scheme can defend against active attacks for quantum communication and realize long-distance quantum communication with minimal resource consumption.
Quantum computation with Turaev-Viro codes
Koenig, Robert; Reichardt, Ben W
2010-01-01
The Turaev-Viro invariant for a closed 3-manifold is defined as the contraction of a certain tensor network. The tensors correspond to tetrahedra in a triangulation of the manifold, with values determined by a fixed spherical category. For a manifold with boundary, the tensor network has free indices that can be associated to qudits, and its contraction gives the coefficients of a quantum error-correcting code. The code has local stabilizers determined by Levin and Wen. For example, applied to the genus-one handlebody using the Z_2 category, this construction yields the well-known toric code. For other categories, such as the Fibonacci category, the construction realizes a non-abelian anyon model over a discrete lattice. By studying braid group representations acting on equivalence classes of colored ribbon graphs embedded in a punctured sphere, we identify the anyons, and give a simple recipe for mapping fusion basis states of the doubled category to ribbon graphs. We explain how suitable initial states can ...
Constructions of quantum Bose Chadhuri Hocquenghem code using spectral techniques
Guo, Ying; Zeng, Guihua; Lee, Moon Ho; Fan, Jianping
2007-08-01
A quantum Bose-Chadhuri-Hocquenghem (BCH) code is constructed over Fnpm in the spectrum domain by employing Fourier transform. The constructed code may be employed to describe the characters of the quantum code over Fnp in the time domain. Each quantum state of the proposed code has certain specified consecutive spectral components equalling zeros, and the error-correcting ability of the code can hence be determined by the number of consecutive zeros in its parity spectrums. Moreover, the decoding process may be performed more efficiently by using the spectrum techniques rather than by using the traditional methods.
Yamakami, T
2006-01-01
Our task of quantum list decoding for a classical block code is to recover from a given quantumly corrupted codeword a short list containing all messages whose codewords have high "presence" in this quantumly corrupted codeword. All known families of efficiently quantum list decodable codes, nonetheless, have exponentially-small message rate. We show that certain generalized Reed-Solomon codes concatenated with Hadamard codes of polynomially-small rate and constant codeword alphabet size have efficient quantum list decoding algorithms, provided that target codewords should have relatively high presence in a given quantumly corrupted codeword.
On the bargaining set, kernel and core of superadditive games
TamÂs Solymosi
1999-01-01
We prove that for superadditive games a necessary and sufficient condition for the bargaining set to coincide with the core is that the monotonic cover of the excess game induced by a payoff be balanced for each imputation in the bargaining set. We present some new results obtained by verifying this condition for specific classes of games. For N-zero-monotonic games we show that the same condition required at each kernel element is also necessary and sufficient for the kernel to be contained ...
Quantum error correcting codes and 4-dimensional arithmetic hyperbolic manifolds
Guth, Larry; Lubotzky, Alexander
2014-08-01
Using 4-dimensional arithmetic hyperbolic manifolds, we construct some new homological quantum error correcting codes. They are low density parity check codes with linear rate and distance nɛ. Their rate is evaluated via Euler characteristic arguments and their distance using {Z}_2-systolic geometry. This construction answers a question of Zémor ["On Cayley graphs, surface codes, and the limits of homological coding for quantum error correction," in Proceedings of Second International Workshop on Coding and Cryptology (IWCC), Lecture Notes in Computer Science Vol. 5557 (2009), pp. 259-273], who asked whether homological codes with such parameters could exist at all.
Quantum error-correcting codes from algebraic geometry codes of Castle type
Munuera, Carlos; Tenório, Wanderson; Torres, Fernando
2016-10-01
We study algebraic geometry codes producing quantum error-correcting codes by the CSS construction. We pay particular attention to the family of Castle codes. We show that many of the examples known in the literature in fact belong to this family of codes. We systematize these constructions by showing the common theory that underlies all of them.
NMR experimental implementation of three-parties quantum superdense coding
Institute of Scientific and Technical Information of China (English)
WEI Daxiu; YANG Xiaodong; LUO Jun; SUN Xianping; ZENG Xizhi; LIU Maili
2004-01-01
In this study, we report an experiment realization of quantum superdense coding (QSDC) between three parties using nuclear magnetic resonance (NMR). The experimental results have shown that in terms of the QSDC schemes between multiparties proposed by Liu et al. and Crudka et al., three-qubit QSDC can transmit three bits of classical information by sending two qubits only. Our results experimentally show that quantum superdense coding, as one of the quantum information processing protocols, is superior to classical ones.
Efficient Quantum Private Communication Based on Dynamic Control Code Sequence
Cao, Zheng-Wen; Feng, Xiao-Yi; Peng, Jin-Ye; Zeng, Gui-Hua; Qi, Jin
2016-12-01
Based on chaos and quantum properties, we propose a quantum private communication scheme with dynamic control code sequence. The initial sequence is obtained via chaotic systems, and the control code sequence is derived by grouping, XOR and extracting. A shift cycle algorithm is designed to enable the dynamic change of control code sequence. Analysis shows that transmission efficiency could reach 100 % with high dynamics and security.
Efficient Quantum Private Communication Based on Dynamic Control Code Sequence
Cao, Zheng-Wen; Feng, Xiao-Yi; Peng, Jin-Ye; Zeng, Gui-Hua; Qi, Jin
2017-04-01
Based on chaos and quantum properties, we propose a quantum private communication scheme with dynamic control code sequence. The initial sequence is obtained via chaotic systems, and the control code sequence is derived by grouping, XOR and extracting. A shift cycle algorithm is designed to enable the dynamic change of control code sequence. Analysis shows that transmission efficiency could reach 100 % with high dynamics and security.
Design of additive quantum codes via the code-word-stabilized framework
Kovalev, Alexey A.; Dumer, Ilya; Pryadko, Leonid P.
2011-12-01
We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or nonadditive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cyclic stabilizer codes. We present several families of simple stabilizer codes with relatively good parameters.
Experimental Realization of Continuous-Variable Quantum Error Correction Codes
DEFF Research Database (Denmark)
Lassen, Mikael Østergaard; Madsen, Lars Skovgaard; Andersen, Ulrik Lund
Quantum information processing relies on the robust and faithful transmission, storage and manipulation of quantum information. However, since different decoherent processes are inherent to any realistic implementation, the future of quantum information systems strongly relies on the ability to d...... to detect and perform error code correction and noise filtration. We present two different schemes to eliminate erasure errors and channel excess noise in continuous-variable quantum channels....
Non-binary unitary error bases and quantum codes
Energy Technology Data Exchange (ETDEWEB)
Knill, E.
1996-06-01
Error operator bases for systems of any dimension are defined and natural generalizations of the bit-flip/ sign-change error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of Abelian groups. As a consequence, quantum codes can be constructed form linear codes over {ital Z}{sub {ital n}} for any {ital n}. The generalization of the punctured code construction leads to many codes which permit transversal (i.e. fault tolerant) implementations of certain operations compatible with the error basis.
Methodology for bus layout for topological quantum error correcting codes
Energy Technology Data Exchange (ETDEWEB)
Wosnitzka, Martin; Pedrocchi, Fabio L.; DiVincenzo, David P. [RWTH Aachen University, JARA Institute for Quantum Information, Aachen (Germany)
2016-12-15
Most quantum computing architectures can be realized as two-dimensional lattices of qubits that interact with each other. We take transmon qubits and transmission line resonators as promising candidates for qubits and couplers; we use them as basic building elements of a quantum code. We then propose a simple framework to determine the optimal experimental layout to realize quantum codes. We show that this engineering optimization problem can be reduced to the solution of standard binary linear programs. While solving such programs is a NP-hard problem, we propose a way to find scalable optimal architectures that require solving the linear program for a restricted number of qubits and couplers. We apply our methods to two celebrated quantum codes, namely the surface code and the Fibonacci code. (orig.)
Quantum Dense Coding in Multiparticle Entangled States via Local Measurements
Institute of Scientific and Technical Information of China (English)
陈建兰; 匡乐满
2004-01-01
We study quantum dense coding between two arbitrarily fixed particles in a (N + 2)-particle maximally-entangled states through introducing an auxiliary qubit and carrying out local measurements. It is shown that the transmitted classical information amount through such an entangled quantum channel is usually less than two classical bits. However, the information amount may reach two classical bits of information, and the classical information capacity is independent of the number of the entangled particles under certain conditions. The results offer deeper insight into quantum dense coding via quantum channels of multi-particle entangled states.
Institute of Scientific and Technical Information of China (English)
WANG Tie-Jun; LI Tao; DU Fang-Fang; DENG Fu-Guo
2011-01-01
We present a quantum hyperdense coding protocol with hyperentanglement in polarization and spatial-mode degrees of freedom of photons first and then give the details for a quantum secure direct communication (QSDC)protocol based on this quantum hyperdense coding protocol. This QSDC protocol has the advantage of having a higher capacity than the quantum communication protocols with a qubit system. Compared with the QSDC protocol based on superdense coding with d-dimensional systems, this QSDC protocol is more feasible as the preparation of a high-dimension quantum system is more difficult than that of a two-level quantum system at present.%@@ We present a quantum hyperdense coding protocol with hyperentanglement in polarization and spatial-mode degrees of freedom of photons first and then give the details for a quantum secure direct communication(QSDC)protocol based on this quantum hyperdense coding protocol.This QSDC protocol has the advantage of having a higher capacity than the quantum communication protocols with a qubit system.Compared with the QSDC protocol based on superdense coding with d-dimensional systems, this QSDC protocol is more feasible as the preparation of a high-dimension quantum system is more difficult than that of a two-level quantum system at present.
DEFF Research Database (Denmark)
Lassen, Mikael Østergaard; Sabuncu, Metin; Huck, Alexander
2010-01-01
A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code that robustly protects the involved fragile quantum states from their environment. Just as classical error-correcting codes are indispensible in today's information t...... is generally the strongest limitation to quantum communication, such an erasure-correcting code provides a new tool for establishing quantum optical coherence over longer distances.......A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code that robustly protects the involved fragile quantum states from their environment. Just as classical error-correcting codes are indispensible in today's information...... technologies, it is believed that quantum error-correcting code will play a similarly crucial role in tomorrow's quantum information systems. Here, we report on the experimental demonstration of a quantum erasure-correcting code that overcomes the devastating effect of photon losses. Our quantum code is based...
Quantum Turbulence ---Another da Vinci Code---
Tsubota, M.
Quantum turbulence comprises a tangle of quantized vorticeswhich are stable topological defects created by Bose-Einstein condensation, being realized in superfluid helium and atomic Bose-Einstein condensates. In recent years there has been a growing interest in quantum turbulence. One of the important motivations is to understand the relation between quantum and classical turbulence. Quantum turbulence is expected to be much simpler than usual classical turbulence and give a prototype of turbulence. This article reviews shortly the recent research developments on quantum turbulence.
Lassen, Mikael; Huck, Alexander; Niset, Julien; Leuchs, Gerd; Cerf, Nicolas J; Andersen, Ulrik L
2010-01-01
A fundamental requirement for enabling fault-tolerant quantum information processing is an efficient quantum error-correcting code (QECC) that robustly protects the involved fragile quantum states from their environment. Just as classical error-correcting codes are indispensible in today's information technologies, it is believed that QECC will play a similarly crucial role in tomorrow's quantum information systems. Here, we report on the first experimental demonstration of a quantum erasure-correcting code that overcomes the devastating effect of photon losses. Whereas {\\it errors} translate, in an information theoretic language, the noise affecting a transmission line, {\\it erasures} correspond to the in-line probabilistic loss of photons. Our quantum code protects a four-mode entangled mesoscopic state of light against erasures, and its associated encoding and decoding operations only require linear optics and Gaussian resources. Since in-line attenuation is generally the strongest limitation to quantum co...
Entanglement-assisted operator codeword stabilized quantum codes
Shin, Jeonghwan; Heo, Jun; Brun, Todd A.
2016-05-01
In this paper, we introduce a unified framework to construct entanglement-assisted quantum error-correcting codes (QECCs), including additive and nonadditive codes, based on the codeword stabilized (CWS) framework on subsystems. The CWS framework is a scheme to construct QECCs, including both additive and nonadditive codes, and gives a method to construct a QECC from a classical error-correcting code in standard form. Entangled pairs of qubits (ebits) can be used to improve capacity of quantum error correction. In addition, it gives a method to overcome the dual-containing constraint. Operator quantum error correction (OQEC) gives a general framework to construct QECCs. We construct OQEC codes with ebits based on the CWS framework. This new scheme, entanglement-assisted operator codeword stabilized (EAOCWS) quantum codes, is the most general framework we know of to construct both additive and nonadditive codes from classical error-correcting codes. We describe the formalism of our scheme, demonstrate the construction with examples, and give several EAOCWS codes
Capacities of Quantum Error Correcting Codes under adaptive concatenation
Fern, J
2007-01-01
We look at the effects of a quantum channel after each level of quantum error correcting codes (QECC) under recovery operators that are optimally adapted at each level. We use the entropy of the channel to estimate the capacities of QECCs. Considerable improvements in capacities are found under adaptive concatenation.
Experimentally feasible quantum erasure-correcting code for continuous variables
DEFF Research Database (Denmark)
Nisset, J.; Andersen, Ulrik Lund; Cerf, N.J.
2008-01-01
We devise a scheme that protects quantum coherent states of light from probabilistic losses, thus achieving the first continuous-variable quantum erasure-correcting code. If the occurrence of erasures can be probed, then the decoder enables, in principle, a perfect recovery of the original light ...
Performance of polar codes for quantum and private classical communication
Dutton, Zachary; Wilde, Mark M
2012-01-01
We analyze the practical performance of quantum polar codes, by computing rigorous bounds on block error probability and by numerically simulating them. We evaluate our bounds for quantum erasure channels with coding block lengths between 2^10 and 2^20, and we report the results of simulations for quantum erasure channels, quantum depolarizing channels, and "BB84" channels with coding block lengths up to N = 1024. For quantum erasure channels, we observe that high quantum data rates can be achieved for block error rates less than 10^(-4) and that somewhat lower quantum data rates can be achieved for quantum depolarizing and BB84 channels. Our results here also serve as bounds for and simulations of private classical data transmission over these channels, essentially due to Renes' duality bounds for privacy amplification and classical data transmission of complementary observables. Future work might be able to improve upon our numerical results for quantum depolarizing and BB84 channels by employing a polar co...
Network Coding-Based Communications via the Controlled Quantum Teleportation
Directory of Open Access Journals (Sweden)
Ying Guo
2013-02-01
Full Text Available Inspired by the structure of the network coding over the butterfly network, a framework of quantum network coding scheme is investigated, which transmits two unknown quantum states crossly over the butterfly quantum system with the multi-photon non-maximally entangled GHZ states. In this scheme, it contains certain number of entanglement-qubit source nodes that teleport unknown quantum states to other nodes on the small-scale network where each intermediate node can pass on its received quantum states to others via superdense coding. In order to transmit the unknown states in a deterministic way, the controlled quantum teleportation is adopted on the intermediate node. It makes legal nodes more convenient than any other previous teleportation schemes to transmit unknown quantum states to unknown participants in applications. It shows that the intrinsic efficiency of transmissions approaches 100% in principle. This scheme is secure based on the securely-shared quantum channels between all nodes and the quantum mechanical impossibility of local unitary transformations between non-maximally entangled GHZ states. Moreover, the generalized scheme is proposed for transmitting two multipartite entangled states.
Nonstabilizer Quantum Codes from Abelian Subgroups of the Error Group
Arvind, V; Parthasarathy, K R; Kurur, Piyush P
2002-01-01
This paper is motivated by the computer-generated nonadditive ((5,6,2)) code described in an article by Rains, Hardin, Shor and Sloane. We describe a theory of non-stabilizer codes of which the nonadditive code of Rains et al is an example. Furthermore, we give a general strategy of constructing good nonstabilizer codes from good stabilizer codes and give some explicit constructions and asymptotically good nonstabilizer codes. In fact, we explicitly construct a family of distance 2 non-stabilizer codes over all finite fields of which the ((5,6,2)) is an special example. More interestingly, using our theory, we are also able to explicitly construct examples of non-stablizer quantum codes of distance 3. Like in the case of stabilizer codes, we can design fairly efficient encoding and decoding procedures.
Continuous-variable quantum network coding for coherent states
Shang, Tao; Li, Ke; Liu, Jian-wei
2017-04-01
As far as the spectral characteristic of quantum information is concerned, the existing quantum network coding schemes can be looked on as the discrete-variable quantum network coding schemes. Considering the practical advantage of continuous variables, in this paper, we explore two feasible continuous-variable quantum network coding (CVQNC) schemes. Basic operations and CVQNC schemes are both provided. The first scheme is based on Gaussian cloning and ADD/SUB operators and can transmit two coherent states across with a fidelity of 1/2, while the second scheme utilizes continuous-variable quantum teleportation and can transmit two coherent states perfectly. By encoding classical information on quantum states, quantum network coding schemes can be utilized to transmit classical information. Scheme analysis shows that compared with the discrete-variable paradigms, the proposed CVQNC schemes provide better network throughput from the viewpoint of classical information transmission. By modulating the amplitude and phase quadratures of coherent states with classical characters, the first scheme and the second scheme can transmit 4{log _2}N and 2{log _2}N bits of information by a single network use, respectively.
Quantum secure direct communication with frequency coding scheme
Zhao, Xue-Liang; Ruan, Dong
2016-11-01
Quantum secure direct communication (QSDC) is an important branch of quantum cryptography. It can transmit secret information directly without establishing a key first, unlike quantum key distribution which requires this precursive event. One of the most highlighted QSDC protocol is the Two-step protocol. This paper will focus on proposing a frequency coding scheme in the Two-step protocol, while retaining other contents of the QSDC protocol. This new coding scheme will significantly increase the protocol's ability against channel noise and loss, and provides an efficient protocol for secure direct quantum communication in a noisy environment. Besides, the frequency coding technology is also easy to understand and highly practical. After numerically simulating the performance of the protocol in a noisy channel, the results showed that the scheme was robust against channel noise and loss.
Suppressing decoherence of quantum algorithms by jump codes
Kern, O; Kern, Oliver; Alber, Gernot
2005-01-01
The stabilizing properties of one-error correcting jump codes are explored under realistic non-ideal conditions. For this purpose the quantum algorithm of the tent-map is decomposed into a universal set of Hamiltonian quantum gates which ensure perfect correction of spontaneous decay processes under ideal circumstances even if they occur during a gate operation. An entanglement gate is presented which is capable of entangling any two logical qubits of different one-error correcting code spaces. With the help of this gate simultaneous spontaneous decay processes affecting physical qubits of different code spaces can be corrected and decoherence can be suppressed significantly.
Energy Technology Data Exchange (ETDEWEB)
Xia, Yan [School of Physic and Optoelectronic, Dalian University of Technology, Dalian 116024 (China)]. E-mail: xia-208@163.com; Song, He-Shan [School of Physic and Optoelectronic, Dalian University of Technology, Dalian 116024 (China)]. E-mail: hssong@dlut.edu.cn
2007-04-23
We present a controlled quantum secure direct communication protocol that uses a 2-dimensional Greenberger-Horne-Zeilinger (GHZ) entangled state and a 3-dimensional Bell-basis state and employs the high-dimensional quantum superdense coding, local collective unitary operations and entanglement swapping. The proposed protocol is secure and of high source capacity. It can effectively protect the communication against a destroying-travel-qubit-type attack. With this protocol, the information transmission is greatly increased. This protocol can also be modified, so that it can be used in a multi-party control system.
Quantum Algorithms and the Genetic Code
Patel, A D
2001-01-01
Replication of DNA and synthesis of proteins are studied from the view-pointof quantum database search. Identification of a base-pairing with a quantumquery gives a natural (and first ever!) explanation of why living organismshave 4 nucleotide bases and 20 amino acids. It is amazing that these numbersarise as solutions to an optimisation problem. Components of the DNA structurewhich implement Grover's algorithm are identified, and a physical scenario ispresented for the execution of the quantum algorithm. It is proposed thatenzymes play a crucial role in maintaining quantum coherence of the process.Experimental tests that can verify this scenario are pointed out.
Quantum algorithms and the genetic code
Indian Academy of Sciences (India)
Apoorva Patel
2001-02-01
Replication of DNA and synthesis of proteins are studied from the view-point of quantum database search. Identiﬁcation of a base-pairing with a quantum query gives a natural (and ﬁrst ever!) explanation of why living organisms have 4 nucleotide bases and 20 amino acids. It is amazing that these numbers arise as solutions to an optimisation problem. Components of the DNA structure which implement Grover’s algorithm are identiﬁed, and a physical scenario is presented for the execution of the quantum algorithm. It is proposed that enzymes play a crucial role in maintaining quantum coherence of the process. Experimental tests that can verify this scenario are pointed out.
Quantum Error-Correcting Codes over Mixed Alphabets
Wang, Zhuo; Fan, Heng; Oh, C H
2012-01-01
Errors are inevitable during all kinds quantum informational tasks and quantum error-correcting codes (QECCs) are powerful tools to fight various quantum noises. For standard QECCs physical systems have the same number of energy levels. Here we shall propose QECCs over mixed alphabets, i.e., physical systems of different dimensions, and investigate their constructions as well as their quantum Singleton bound. We propose two kinds of constructions: a graphical construction based a graph-theoretical object composite coding clique and a projection-based construction. We illustrate our ideas using two alphabets by finding out some 1-error correcting or detecting codes over mixed alphabets, e.g., optimal $((6,8,3))_{4^52^1}$, $((6,4,3))_{4^42^2}$ and $((5,16,2))_{4^32^2}$ code and suboptimal $((5,9,2))_{3^42^1}$ code. Our methods also shed light to the constructions of standard QECCs, e.g., the construction of the optimal $((6,16,3))_4$ code as well as the optimal $((2n+3,p^{2n+1},2))_{p}$ codes with $p=4k$.
Towards Holography via Quantum Source-Channel Codes
Pastawski, Fernando; Eisert, Jens; Wilming, Henrik
2017-07-01
While originally motivated by quantum computation, quantum error correction (QEC) is currently providing valuable insights into many-body quantum physics, such as topological phases of matter. Furthermore, mounting evidence originating from holography research (AdS/CFT) indicates that QEC should also be pertinent for conformal field theories. With this motivation in mind, we introduce quantum source-channel codes, which combine features of lossy compression and approximate quantum error correction, both of which are predicted in holography. Through a recent construction for approximate recovery maps, we derive guarantees on its erasure decoding performance from calculations of an entropic quantity called conditional mutual information. As an example, we consider Gibbs states of the transverse field Ising model at criticality and provide evidence that they exhibit nontrivial protection from local erasure. This gives rise to the first concrete interpretation of a bona fide conformal field theory as a quantum error correcting code. We argue that quantum source-channel codes are of independent interest beyond holography.
Towards Holography via Quantum Source-Channel Codes.
Pastawski, Fernando; Eisert, Jens; Wilming, Henrik
2017-07-14
While originally motivated by quantum computation, quantum error correction (QEC) is currently providing valuable insights into many-body quantum physics, such as topological phases of matter. Furthermore, mounting evidence originating from holography research (AdS/CFT) indicates that QEC should also be pertinent for conformal field theories. With this motivation in mind, we introduce quantum source-channel codes, which combine features of lossy compression and approximate quantum error correction, both of which are predicted in holography. Through a recent construction for approximate recovery maps, we derive guarantees on its erasure decoding performance from calculations of an entropic quantity called conditional mutual information. As an example, we consider Gibbs states of the transverse field Ising model at criticality and provide evidence that they exhibit nontrivial protection from local erasure. This gives rise to the first concrete interpretation of a bona fide conformal field theory as a quantum error correcting code. We argue that quantum source-channel codes are of independent interest beyond holography.
Nexus: A modular workflow management system for quantum simulation codes
Krogel, Jaron T.
2016-01-01
The management of simulation workflows represents a significant task for the individual computational researcher. Automation of the required tasks involved in simulation work can decrease the overall time to solution and reduce sources of human error. A new simulation workflow management system, Nexus, is presented to address these issues. Nexus is capable of automated job management on workstations and resources at several major supercomputing centers. Its modular design allows many quantum simulation codes to be supported within the same framework. Current support includes quantum Monte Carlo calculations with QMCPACK, density functional theory calculations with Quantum Espresso or VASP, and quantum chemical calculations with GAMESS. Users can compose workflows through a transparent, text-based interface, resembling the input file of a typical simulation code. A usage example is provided to illustrate the process.
Unitary Application of the Quantum Error Correction Codes
Institute of Scientific and Technical Information of China (English)
游波; 许可; 吴小华
2012-01-01
For applying the perfect code to transmit quantum information over a noise channel, the standard protocol contains four steps： the encoding, the noise channel, the error-correction operation, and the decoding. In present work, we show that this protocol can be simplified. The error-correction operation is not necessary if the decoding is realized by the so-called complete unitary transformation. We also offer a quantum circuit, which can correct the arbitrary single-qubit errors.
Exotic topological order from quantum fractal code
Yoshida, Beni
2014-03-01
We present a large class of three-dimensional spin models that possess topological order with stability against local perturbations, but are beyond description of topological quantum field theory. Conventional topological spin liquids, on a formal level, may be viewed as condensation of string-like extended objects with discrete gauge symmetries, being at fixed points with continuous scale symmetries. In contrast, ground states of fractal spin liquids are condensation of highly-fluctuating fractal objects with certain algebraic symmetries, corresponding to limit cycles under real-space renormalization group transformations which naturally arise from discrete scale symmetries of underlying fractal geometries. A particular class of three-dimensional models proposed in this paper may potentially saturate quantum information storage capacity for local spin systems.
A LONE code for the sparse control of quantum systems
Ciaramella, G.; Borzì, A.
2016-03-01
In many applications with quantum spin systems, control functions with a sparse and pulse-shaped structure are often required. These controls can be obtained by solving quantum optimal control problems with L1-penalized cost functionals. In this paper, the MATLAB package LONE is presented aimed to solving L1-penalized optimal control problems governed by unitary-operator quantum spin models. This package implements a new strategy that includes a globalized semi-smooth Krylov-Newton scheme and a continuation procedure. Results of numerical experiments demonstrate the ability of the LONE code in computing accurate sparse optimal control solutions.
New quantum codes from dual-containing cyclic codes over finite rings
Tang, Yongsheng; Zhu, Shixin; Kai, Xiaoshan; Ding, Jian
2016-11-01
Let R=F_{2m}+uF_{2m}+\\cdots +ukF_{2m}, where F_{2m} is the finite field with 2m elements, m is a positive integer, and u is an indeterminate with u^{k+1}=0. In this paper, we propose the constructions of two new families of quantum codes obtained from dual-containing cyclic codes of odd length over R. A new Gray map over R is defined, and a sufficient and necessary condition for the existence of dual-containing cyclic codes over R is given. A new family of 2m-ary quantum codes is obtained via the Gray map and the Calderbank-Shor-Steane construction from dual-containing cyclic codes over R. In particular, a new family of binary quantum codes is obtained via the Gray map, the trace map and the Calderbank-Shor-Steane construction from dual-containing cyclic codes over R.
Deformed quantum double realization of the toric code and beyond
Padmanabhan, Pramod; Ibieta-Jimenez, Juan Pablo; Bernabe Ferreira, Miguel Jorge; Teotonio-Sobrinho, Paulo
2016-09-01
Quantum double models, such as the toric code, can be constructed from transfer matrices of lattice gauge theories with discrete gauge groups and parametrized by the center of the gauge group algebra and its dual. For general choices of these parameters the transfer matrix contains operators acting on links which can also be thought of as perturbations to the quantum double model driving it out of its topological phase and destroying the exact solvability of the quantum double model. We modify these transfer matrices with perturbations and extract exactly solvable models which remain in a quantum phase, thus nullifying the effect of the perturbation. The algebra of the modified vertex and plaquette operators now obey a deformed version of the quantum double algebra. The Abelian cases are shown to be in the quantum double phase whereas the non-Abelian phases are shown to be in a modified phase of the corresponding quantum double phase. These are illustrated with the groups Zn and S3. The quantum phases are determined by studying the excitations of these systems namely their fusion rules and the statistics. We then go further to construct a transfer matrix which contains the other Z2 phase namely the double semion phase. More generally for other discrete groups these transfer matrices contain the twisted quantum double models. These transfer matrices can be thought of as being obtained by introducing extra parameters into the transfer matrix of lattice gauge theories. These parameters are central elements belonging to the tensor products of the algebra and its dual and are associated to vertices and volumes of the three dimensional lattice. As in the case of the lattice gauge theories we construct the operators creating the excitations in this case and study their braiding and fusion properties.
Using Concatenated Quantum Codes for Universal Fault-Tolerant Quantum Gates
Jochym-O'Connor, Tomas; Laflamme, Raymond
2014-01-01
We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure universal fault tolerance and discuss a particular example using the 7-qubit Steane and 15-qubit Reed-Muller codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria, our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. We believe that optimizing the codes used in such a scheme could provide a useful alternative to state distillation schemes that exhibit high overhead costs.
Fault-tolerant quantum computing with color codes
Landahl, Andrew J; Rice, Patrick R
2011-01-01
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based decoding algorithm for identifying the most likely error given the syndrome. We simulated our syndrome extraction and decoding algorithms against three physically-motivated noise models using Monte Carlo methods, and used the simulations to estimate the corresponding accuracy thresholds for fault-tolerant quantum error correction. We also used a self-avoiding walk analysis to lower-bound the accuracy threshold for two of these noise models. We present and analyze two architectures for fault-tolerantly computing with these codes: one with 2D arrays of qubits are stacked atop each other and one in a single 2D substrate. Our analysis demonstrates that color codes perform slightly better than Kitaev's surface codes when circuit details are ignored. When these details are considered, w...
Iterative Phase Optimization of Elementary Quantum Error Correcting Codes
Müller, M.; Rivas, A.; Martínez, E. A.; Nigg, D.; Schindler, P.; Monz, T.; Blatt, R.; Martin-Delgado, M. A.
2016-07-01
Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits, as errors can be fully characterized. For multiqubit operations, though, this is no longer the case, as in the most general case, analyzing the effect of the operation on the system requires a full state tomography for which resources scale exponentially with the system size. Furthermore, in recent experiments, additional electronic levels beyond the two-level system encoding the qubit have been used to enhance the capabilities of quantum-information processors, which additionally increases the number of parameters that need to be controlled. For the optimization of the experimental system for a given task (e.g., a quantum algorithm), one has to find a satisfactory error model and also efficient observables to estimate the parameters of the model. In this manuscript, we demonstrate a method to optimize the encoding procedure for a small quantum error correction code in the presence of unknown but constant phase shifts. The method, which we implement here on a small-scale linear ion-trap quantum computer, is readily applicable to other AMO platforms for quantum-information processing.
Quantum trade-off coding for bosonic communication
Wilde, Mark M; Guha, Saikat
2011-01-01
Recent work has precisely characterized the achievable trade-offs between three key information processing tasks---classical communication (generation or consumption), quantum communication (generation or consumption), and shared entanglement (distribution or consumption), measured in bits, qubits, and ebits per channel use respectively. Slices and corner points of this three-dimensional region reduce to several well-known quantum communication protocols over noisy channels. A single trade-off coding technique can attain any point in the region and can outperform time-sharing between the best known protocols for accomplishing each information processing task alone. Previously, the benefits of trade-off coding that had been found were too small to be of much practical value (for the dephasing and the universal cloning machine channels, for instance). In this article, we demonstrate to the contrary that the associated performance gains are remarkably high for several physically relevant bosonic channels that mo...
Quantum computation with topological codes from qubit to topological fault-tolerance
Fujii, Keisuke
2015-01-01
This book presents a self-consistent review of quantum computation with topological quantum codes. The book covers everything required to understand topological fault-tolerant quantum computation, ranging from the definition of the surface code to topological quantum error correction and topological fault-tolerant operations. The underlying basic concepts and powerful tools, such as universal quantum computation, quantum algorithms, stabilizer formalism, and measurement-based quantum computation, are also introduced in a self-consistent way. The interdisciplinary fields between quantum information and other fields of physics such as condensed matter physics and statistical physics are also explored in terms of the topological quantum codes. This book thus provides the first comprehensive description of the whole picture of topological quantum codes and quantum computation with them.
Quantum Secure Direct Intercommunication with Superdense Coding and Entanglement Swapping
Institute of Scientific and Technical Information of China (English)
HUANG Da-Zu; GUO Ying; ZENG Gui-Hua
2008-01-01
A quantum secure direct intercommunication scheme is proposed to exchange directly the communicators' secret messages by making use of swapping entanglement of Bell states. It has great capacity to distribute the secret messages since these messages have been imposed on high-dimensional Bell states via the local unitary operations with superdense coding. The security is ensured by the secure transmission of the travel sequences and the application of entanglement swapping.
Quantum superdense coding via cavity-assisted interactions
Institute of Scientific and Technical Information of China (English)
Pan Guo-Zhu; Yang Ming; Cao Zhuo-Liang
2009-01-01
Quantum superdense coding (QSC) is an example of how entanglement can be used to minimize the number of carriers of classical information. This paper proposes two schemes for implementing QSC by means of cavity assisted interactions with single-photon pulses. The schemes are insensitive to the cavity decay and the thermal field, thus it might be realizable based on the current cavity QED techniques.
Quantum Teleportation and Superdense Coding via W-Class States
Institute of Scientific and Technical Information of China (English)
YAN Jun; WU Huai-Zhi; YANG Zhen-Biao; ZHENG Shi-Biao
2008-01-01
According to the protocol of Agrawal et al., we propose a cavity QED scheme for realization of teleportation and dense coding. Instead of using EPR states and GHZ states, our scheme is more insensitive to the loss of one particle by using a W-class state as a quantum channel. Besides, our scheme is immune to thermal field, and does not require the cavity to remain in the vacuum state throughout the procedure.
Compact Coding Using Multi-Photon Tolerant Quantum Protocols for Quantum Communication
Hajj, Rasha El; Chan, Kam Wai Clifford
2016-01-01
This paper presents a new encryption scheme called Compact Coding that encodes information in time, phase, and intensity domains, simultaneously. While these approaches have previously been used one at a time, the proposed scheme brings to bear for the first time their strengths simultaneously leading to an increase in the secure information transfer rate. The proposed scheme is applicable to both optical fibers and free space optics, and can be considered as an alternative to polarization coding. This paper applies the proposed compact coding scheme to multi-photon tolerant quantum protocols in order to produce quantum-level security during information transfer. We present the structure of the proposed coding scheme in a multi-photon environment and address its operation.
Lattice quantum codes and exotic topological phases of matter
Haah, Jeongwan
2014-03-01
Is it possible to build a ``hard disk drive'' for quantum information? The quantum coherence time in a usual thermal system is fundamentally limited by the inverse Boltzmann factor exp [ Δ / kT ] , where Δ is the energy scale of the system. This limitation is not enhanced even with a conventional topologically ordered system in three or lower dimensions. Here, a new three-dimensional spin model is presented that shows a qualitatively different behavior. It can be viewed as a quantum error correcting code, and is thus exactly solvable. The ground states are locally indistinguishable, for which it may be called topologically ordered. However, the model only admits immobile pointlike excitations, and the immobility is not affected by small perturbations of the Hamiltonian. The degeneracy of the ground state, though also insensitive to perturbations, is a complicated number-theoretic function of the system size. Under real-space renormalization group transformations, the system bifurcates into multiple noninteracting copies of itself. Similarities and differences of the model in comparison to Wegner's Ising gauge theory will be explained. When quantum information is encoded into a ground state of this model and subjected to thermal errors, the errors remain easily correctable for a long time without any active intervention, because a macroscopic energy barrier due to the immobility of excitations keeps the errors well localized. As a result, stored quantum information can be retrieved faithfully for a memory time exp [(Δ / kT) 2 ] .
Secure deterministic communication in a quantum loss channel using quantum error correction code
Institute of Scientific and Technical Information of China (English)
Wu Shuang; Liang Lin-Mei; Li Cheng-Zu
2007-01-01
The loss of a quantum channel leads to an irretrievable particle loss as well as information. In this paper, the loss of quantum channel is analysed and a method is put forward to recover the particle and information loss effectively using universal quantum error correction. Then a secure direct communication scheme is proposed, such that in a loss channel the information that an eavesdropper can obtain would be limited to arbitrarily small when the code is properly chosen and the correction operation is properly arranged.
Distributed quantum dense coding with two receivers in noisy environments
Das, Tamoghna; Prabhu, R.; SenDe, Aditi; Sen, Ujjwal
2015-11-01
We investigate the effect of noisy channels in a classical information transfer through a multipartite state which acts as a substrate for the distributed quantum dense coding protocol between several senders and two receivers. The situation is qualitatively different from the case with one or more senders and a single receiver. We obtain an upper bound on the multipartite capacity which is tightened in the case of the covariant noisy channel. We also establish a relation between the genuine multipartite entanglement of the shared state and the capacity of distributed dense coding using that state, both in the noiseless and the noisy scenarios. Specifically, we find that, in the case of multiple senders and two receivers, the corresponding generalized Greenberger-Horne-Zeilinger states possess higher dense coding capacities as compared to a significant fraction of pure states having the same multipartite entanglement.
A quantum algorithm for Viterbi decoding of classical convolutional codes
Grice, Jon R.; Meyer, David A.
2015-07-01
We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper, the proposed algorithm is applied to decoding classical convolutional codes, for instance, large constraint length and short decode frames . Other applications of the classical Viterbi algorithm where is large (e.g., speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butterfly diagram of the fast Fourier transform, with its corresponding fast quantum algorithm. The tensor-product structure of the butterfly diagram corresponds to a quantum superposition that we show can be efficiently prepared. The quantum speedup is possible because the performance of the QVA depends on the fanout (number of possible transitions from any given state in the hidden Markov model) which is in general much less than . The QVA constructs a superposition of states which correspond to all legal paths through the decoding lattice, with phase as a function of the probability of the path being taken given received data. A specialized amplitude amplification procedure is applied one or more times to recover a superposition where the most probable path has a high probability of being measured.
Security of practical phase-coding quantum key distribution
Li, Hong-Wei; Han, Zheng-Fu; Bao, Wan-Su; Guo, Guang-Can
2009-01-01
Security proof of practical quantum key distribution (QKD) has attracted a lot of attentions in recent years. Most of real-life QKD implementations are based on phase-coding BB84 protocol, which usually uses Unbalanced Mach-Zehnder Interferometer (UMZI) as the information coder and decoder. However, the long arm and short arm of UMZI will introduce different loss in practical experimental realizations, the state emitted by Alice's side is nolonger standard BB84 states. In this paper, we will give a security analysis in this situation. Counterintuitively, active compensation for this different loss will only lower the secret key bit rate.
The cosmic code quantum physics as the language of nature
Pagels, Heinz R
2012-01-01
""The Cosmic Code can be read by anyone. I heartily recommend it!"" - The New York Times Book Review""A reliable guide for the nonmathematical reader across the highest ridges of physical theory. Pagels is unfailingly lighthearted and confident."" - Scientific American""A sound, clear, vital work that deserves the attention of anyone who takes an interest in the relationship between material reality and the human mind."" - Science 82This is one of the most important books on quantum mechanics ever written for general readers. Heinz Pagels, an eminent physicist and science writer, discusses and
High performance single-error-correcting quantum codes for amplitude damping
Shor, Peter W; Smolin, John A; Zeng, Bei
2009-01-01
We construct families of high performance quantum amplitude damping codes. All of our codes are nonadditive and most modestly outperform the best possible additive codes in terms of encoded dimension. One family is built from nonlinear error-correcting codes for classical asymmetric channels, with which we systematically construct quantum amplitude damping codes with parameters better than any prior construction known for any block length n > 7 except n=2^r-1. We generalize this construction to employ classical codes over GF(3) with which we numerically obtain better performing codes up to length 14. Because the resulting codes are of the codeword stabilized (CWS) type, easy encoding and decoding circuits are available.
A novel quantum LSB-based steganography method using the Gray code for colored quantum images
Heidari, Shahrokh; Farzadnia, Ehsan
2017-10-01
As one of the prevalent data-hiding techniques, steganography is defined as the act of concealing secret information in a cover multimedia encompassing text, image, video and audio, imperceptibly, in order to perform interaction between the sender and the receiver in which nobody except the receiver can figure out the secret data. In this approach a quantum LSB-based steganography method utilizing the Gray code for quantum RGB images is investigated. This method uses the Gray code to accommodate two secret qubits in 3 LSBs of each pixel simultaneously according to reference tables. Experimental consequences which are analyzed in MATLAB environment, exhibit that the present schema shows good performance and also it is more secure and applicable than the previous one currently found in the literature.
New Class of Quantum Error-Correcting Codes for a Bosonic Mode
Michael, Marios H.; Silveri, Matti; Brierley, R. T.; Albert, Victor V.; Salmilehto, Juha; Jiang, Liang; Girvin, S. M.
2016-07-01
We construct a new class of quantum error-correcting codes for a bosonic mode, which are advantageous for applications in quantum memories, communication, and scalable computation. These "binomial quantum codes" are formed from a finite superposition of Fock states weighted with binomial coefficients. The binomial codes can exactly correct errors that are polynomial up to a specific degree in bosonic creation and annihilation operators, including amplitude damping and displacement noise as well as boson addition and dephasing errors. For realistic continuous-time dissipative evolution, the codes can perform approximate quantum error correction to any given order in the time step between error detection measurements. We present an explicit approximate quantum error recovery operation based on projective measurements and unitary operations. The binomial codes are tailored for detecting boson loss and gain errors by means of measurements of the generalized number parity. We discuss optimization of the binomial codes and demonstrate that by relaxing the parity structure, codes with even lower unrecoverable error rates can be achieved. The binomial codes are related to existing two-mode bosonic codes, but offer the advantage of requiring only a single bosonic mode to correct amplitude damping as well as the ability to correct other errors. Our codes are similar in spirit to "cat codes" based on superpositions of the coherent states but offer several advantages such as smaller mean boson number, exact rather than approximate orthonormality of the code words, and an explicit unitary operation for repumping energy into the bosonic mode. The binomial quantum codes are realizable with current superconducting circuit technology, and they should prove useful in other quantum technologies, including bosonic quantum memories, photonic quantum communication, and optical-to-microwave up- and down-conversion.
Low-complexity quantum codes designed via codeword-stabilized framework
Kovalev, Alexey A; Pryadko, Leonid P
2011-01-01
We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or non-additive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cyclic stabilizer codes. We present several families of simple stabilizer codes with relatively good parameters.
Experimental realization of the analogy of quantum dense coding in classical optics
Energy Technology Data Exchange (ETDEWEB)
Yang, Zhenwei; Sun, Yifan; Li, Pengyun; Zhang, Xiong; Song, Xinbing, E-mail: zhangxd@bit.edu.cn, E-mail: songxinbing@bit.edu.cn; Zhang, Xiangdong, E-mail: zhangxd@bit.edu.cn, E-mail: songxinbing@bit.edu.cn [School of Physics, Beijing Institute of Technology and Beijing Key Laboratory of Fractional Signals and Systems, 100081, Beijing (China)
2016-06-15
We report on the experimental realization of the analogy of quantum dense coding in classical optical communication using classical optical correlations. Compared to quantum dense coding that uses pairs of photons entangled in polarization, we find that the proposed design exhibits many advantages. Considering that it is convenient to realize in optical communication, the attainable channel capacity in the experiment for dense coding can reach 2 bits, which is higher than that of the usual quantum coding capacity (1.585 bits). This increased channel capacity has been proven experimentally by transmitting ASCII characters in 12 quaternary digitals instead of the usual 24 bits.
Dumer, Ilya; Kovalev, Alexey A; Pryadko, Leonid P
2015-07-31
We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum low-density parity-check codes with logarithmic or larger distances. These threshold estimates are parametrically better than the existing analytical bound based on percolation.
Minimal memory requirements for pearl necklace encoders of quantum convolutional codes
Houshmand, Monireh; Wilde, Mark M
2010-01-01
One of the major goals in quantum computer science is to reduce the overhead associated with the implementation of quantum computers, and inevitably, routines for quantum error correction will account for most of this overhead. A particular technique for quantum error correction that may be useful in the outer layers of a concatenated scheme for fault tolerance is quantum convolutional coding. The encoder for a quantum convolutional code has a representation as a convolutional encoder or as a "pearl necklace" encoder. In the pearl necklace representation, it has not been particularly clear in the research literature how much quantum memory such an encoder would require for implementation. Here, we offer an algorithm that answers this question. The algorithm first constructs a weighted, directed acyclic graph where each vertex of the graph corresponds to a gate string in the pearl necklace encoder, and each path through the graph represents a non-commutative path through gates in the encoder. We show that the ...
Quantum coding demonstrated feasible to overcome qubit loss error
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
@@ Inspired by quantum mechanics,people have been dreaming of a new type of computers to revolutionize computing technique-quantum computers.Such dream machines take advantage of the fact that the quantum bit (qubit),the fundamental unit of quantum information,can be in a superposition state and thus is able to store massive data and solve complicated problems at an incredible speed beyond the capacity of classical computers.
Quantum error-correcting codes need not completely reveal the error syndrome
Shor, P W; Shor, Peter W; Smolin, John A
1996-01-01
Quantum error-correcting codes so far proposed have not been able to work in the presence of noise levels which introduce greater than one bit of entropy per qubit sent through the quantum channel. This has been because all such codes either find the complete error syndrome of the noise or trivially map onto such codes. We describe a code which does not find complete information on the noise and can be used for reliable transmission of quantum information through channels which introduce more than one bit of entropy per transmitted bit. In the case of the depolarizing ``Werner'' channel our code can be used in a channel of fidelity .8096 while the best existing code worked only down to .8107.
A NOVEL CONSTRUCTION OF QUANTUM LDPC CODES BASED ON CYCLIC CLASSES OF LINES IN EUCLIDEAN GEOMETRIES
Institute of Scientific and Technical Information of China (English)
Cao Dong; Song Yaoliang; Zhao Shengmei
2012-01-01
The dual-containing (or self-orthogonal) formalism of Calderbank-Shor-Steane (CSS) codes provides a universal connection between a classical linear code and a Quantum Error-Correcting Code (QECC).We propose a novel class of quantum Low Density Parity Check (LDPC) codes constructed from cyclic classes of lines in Euclidean Geometry (EG).The corresponding constructed parity check matrix has quasi-cyclic structure that can be encoded flexibility,and satisfies the requirement of dual-containing quantum code.Taking the advantage of quasi-cyclic structure,we use a structured approach to construct Generalized Parity Check Matrix (GPCM).This new class of quantum codes has higher code rate,more sparse check matrix,and exactly one four-cycle in each pair of two rows.Experimental results show that the proposed quantum codes,such as EG(2,q)Ⅱ-QECC,EG(3,q)Ⅱ-QECC,have better performance than that of other methods based on EG,over the depolarizing channel and decoded with iterative decoding based on the sum-product decoding algorithm.
The two-qubit amplitude damping channel: Characterization using quantum stabilizer codes
Omkar, S.; Srikanth, R.; Banerjee, Subhashish; Shaji, Anil
2016-10-01
A protocol based on quantum error correction based characterization of quantum dynamics (QECCD) is developed for quantum process tomography on a two-qubit system interacting dissipatively with a vacuum bath. The method uses a 5-qubit quantum error correcting code that corrects arbitrary errors on the first two qubits, and also saturates the quantum Hamming bound. The dissipative interaction with a vacuum bath allows for both correlated and independent noise on the two-qubit system. We study the dependence of the degree of the correlation of the noise on evolution time and inter-qubit separation.
Experimental demonstration of a graph state quantum error-correction code.
Bell, B A; Herrera-Martí, D A; Tame, M S; Markham, D; Wadsworth, W J; Rarity, J G
2014-04-22
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum computing. However, recently a family of entangled resources known as graph states has emerged as a versatile alternative for protecting quantum information. Depending on the graph's structure, errors can be detected and corrected in an efficient way using measurement-based techniques. Here we report an experimental demonstration of error correction using a graph state code. We use an all-optical setup to encode quantum information into photons representing a four-qubit graph state. We are able to reliably detect errors and correct against qubit loss. The graph we realize is setup independent, thus it could be employed in other physical settings. Our results show that graph state codes are a promising approach for achieving scalable quantum information processing.
Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes$\\,$"
Huang, Dazu; Li, Xin; Guo, Ying
2010-01-01
In our recent paper entitled "Quantum Quasi-Cyclic Low-Density Parity-Check codes" [ICIC 2009. LNCS 5754], it was claimed that some new quantum codes can be constructed via the CSS encoding/decoding approach with various lengths and rates. However, the further investigation shows that the proposed construction may steal some ideas from the paper entitled "Quantum Quasi-Cyclic LDPC codes" [quant-ph/0701020v2]. We feel that the apologizing point of the original protocol is that some results are almost similar to that of construction methods with algebraic combinatorics although we suggest the different approach for improving them. Also, there is a weak point of the original coding approach while considering the application of codes in imperfect channels.
New q-ary quantum MDS codes with distances bigger than q/2
He, Xianmang; Xu, Liqing; Chen, Hao
2016-07-01
The construction of quantum MDS codes has been studied by many authors. We refer to the table in page 1482 of (IEEE Trans Inf Theory 61(3):1474-1484, 2015) for known constructions. However, there have been constructed only a few q-ary quantum MDS [[n,n-2d+2,d
A quantum-inspired genetic algorithm based on probabilistic coding for multiple sequence alignment.
Huo, Hong-Wei; Stojkovic, Vojislav; Xie, Qiao-Luan
2010-02-01
Quantum parallelism arises from the ability of a quantum memory register to exist in a superposition of base states. Since the number of possible base states is 2(n), where n is the number of qubits in the quantum memory register, one operation on a quantum computer performs what an exponential number of operations on a classical computer performs. The power of quantum algorithms comes from taking advantages of quantum parallelism. Quantum algorithms are exponentially faster than classical algorithms. Genetic optimization algorithms are stochastic search algorithms which are used to search large, nonlinear spaces where expert knowledge is lacking or difficult to encode. QGMALIGN--a probabilistic coding based quantum-inspired genetic algorithm for multiple sequence alignment is presented. A quantum rotation gate as a mutation operator is used to guide the quantum state evolution. Six genetic operators are designed on the coding basis to improve the solution during the evolutionary process. The experimental results show that QGMALIGN can compete with the popular methods, such as CLUSTALX and SAGA, and performs well on the presenting biological data. Moreover, the addition of genetic operators to the quantum-inspired algorithm lowers the cost of overall running time.
Multiple-valued logic-protected coding for an optical non-quantum communication line
Antipov, A. L.; Bykovsky, A. Yu.; Vasiliev, N. A.; Egorov, A. A.
2006-01-01
A simple and cheap method of secret coding in an optical line is proposed based on multiple-valued logic. This method is shown to have very high cryptography resources and is designated for bidirectional information exchange in a team of mobile robots, where quantum teleportation coding cannot yet b
Superconducting quantum circuits at the surface code threshold for fault tolerance.
Barends, R; Kelly, J; Megrant, A; Veitia, A; Sank, D; Jeffrey, E; White, T C; Mutus, J; Fowler, A G; Campbell, B; Chen, Y; Chen, Z; Chiaro, B; Dunsworth, A; Neill, C; O'Malley, P; Roushan, P; Vainsencher, A; Wenner, J; Korotkov, A N; Cleland, A N; Martinis, John M
2014-04-24
A quantum computer can solve hard problems, such as prime factoring, database searching and quantum simulation, at the cost of needing to protect fragile quantum states from error. Quantum error correction provides this protection by distributing a logical state among many physical quantum bits (qubits) by means of quantum entanglement. Superconductivity is a useful phenomenon in this regard, because it allows the construction of large quantum circuits and is compatible with microfabrication. For superconducting qubits, the surface code approach to quantum computing is a natural choice for error correction, because it uses only nearest-neighbour coupling and rapidly cycled entangling gates. The gate fidelity requirements are modest: the per-step fidelity threshold is only about 99 per cent. Here we demonstrate a universal set of logic gates in a superconducting multi-qubit processor, achieving an average single-qubit gate fidelity of 99.92 per cent and a two-qubit gate fidelity of up to 99.4 per cent. This places Josephson quantum computing at the fault-tolerance threshold for surface code error correction. Our quantum processor is a first step towards the surface code, using five qubits arranged in a linear array with nearest-neighbour coupling. As a further demonstration, we construct a five-qubit Greenberger-Horne-Zeilinger state using the complete circuit and full set of gates. The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
Joint source-channel coding for a quantum multiple access channel
Wilde, Mark M.; Savov, Ivan
2012-11-01
Suppose that two senders each obtain one share of the output of a classical, bivariate, correlated information source. They would like to transmit the correlated source to a receiver using a quantum multiple access channel. In prior work, Cover, El Gamal and Salehi provided a combined source-channel coding strategy for a classical multiple access channel which outperforms the simpler ‘separation’ strategy where separate codebooks are used for the source coding and the channel coding tasks. In this paper, we prove that a coding strategy similar to the Cover-El Gamal-Salehi strategy and a corresponding quantum simultaneous decoder allow for the reliable transmission of a source over a quantum multiple access channel, as long as a set of information inequalities involving the Holevo quantity hold.
Joint source-channel coding for a quantum multiple access channel
Wilde, Mark M
2012-01-01
Suppose that two senders each obtain one share of the output of a classical, bivariate, correlated information source. They would like to transmit the correlated source to a receiver using a quantum multiple access channel. In prior work, Cover, El Gamal, and Salehi provided a combined source-channel coding strategy for a classical multiple access channel which outperforms the simpler "separation" strategy where separate codebooks are used for the source coding and the channel coding tasks. In the present paper, we prove that a coding strategy similar to the Cover-El Gamal-Salehi strategy and a corresponding quantum simultaneous decoder allow for the reliable transmission of a source over a quantum multiple access channel, as long as a set of information inequalities involving the Holevo quantity hold.
Introduction to error correcting codes in quantum computers
Salas, P J
2006-01-01
The goal of this paper is to review the theoretical basis for achieving a faithful quantum information transmission and processing in the presence of noise. Initially encoding and decoding, implementing gates and quantum error correction will be considered error free. Finally we will relax this non realistic assumption, introducing the quantum fault-tolerant concept. The existence of an error threshold permits to conclude that there is no physical law preventing a quantum computer from being built. An error model based on the depolarizing channel will be able to provide a simple estimation of the storage or memory computation error threshold: < 5.2 10-5. The encoding is made by means of the [[7,1,3
Superdense Coding with GHZ and Quantum Key Distribution with W in the ZX-calculus
Directory of Open Access Journals (Sweden)
Anne Hillebrand
2012-10-01
Full Text Available Quantum entanglement is a key resource in many quantum protocols, such as quantum teleportation and quantum cryptography. Yet entanglement makes protocols presented in Dirac notation difficult to verify. This is why Coecke and Duncan have introduced a diagrammatic language for quantum protocols, called the ZX-calculus. This diagrammatic notation is both intuitive and formally rigorous. It is a simple, graphical, high level language that emphasises the composition of systems and naturally captures the essentials of quantum mechanics. In the author's MSc thesis it has been shown for over 25 quantum protocols that the ZX-calculus provides a relatively easy and more intuitive presentation. Moreover, the author embarked on the task to apply categorical quantum mechanics on quantum security; earlier works did not touch anything but Bennett and Brassard's quantum key distribution protocol, BB84. Superdense coding with the Greenberger-Horne-Zeilinger state and quantum key distribution with the W-state are presented in the ZX-calculus in this paper.
Design of additive quantum codes via the codeword-stabilized framework
Pryadko, Leonid P.; Dumer, Ilya; Kovalev, Alexey A.
2012-02-01
Codeword stabilized (CWS) construction defines a quantum code by combining a classical binary code with some underlying graph state. In general, CWS codes are non-additive but become additive stabilizer codes if derived from a linear binary code. Generic CWS codes typically require complex error correction; however, we show that the CWS framework is an efficient tool for constructing good stabilizer codes with simple decoding. We start by proving the lower Gilbert-Varshamov bound on the parameters of an additive CWS code which can be obtained from a given graph. We also show that cyclic additive CWS codes belong to a previously overlooked family of single-generator cyclic stabilizer codes; these codes are derived from a circulant graph and a cyclic binary code. Finally, we present several families of simple stabilizer codes with relatively good parameters, including a family of the smallest toric-like cyclic CWS codes which have length, dimension, and distance as follows: [[t^2+(t+1)^2,1,2t+1
Matsumoto, Ryutaroh; Uyematsu, Tomohiko
1999-01-01
Comment: 10 pages, LaTeX2e. To appear in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (ISSN 0916-8508), vol. E83-A, no. 10, Oct. 2000. Revision on Dec. 14, 1999: Added a note on a systematic construction of quantum codes with efficient decoding algorithms. Revision on June 26, 2000: Corrected lots of errors, and added a review on the overall error correction process. No original materials were added
High-capacity quantum Fibonacci coding for key distribution
Simon, David S.; Lawrence, Nate; Trevino, Jacob; Dal Negro, Luca; Sergienko, Alexander V.
2013-03-01
Quantum cryptography and quantum key distribution (QKD) have been the most successful applications of quantum information processing, highlighting the unique capability of quantum mechanics, through the no-cloning theorem, to securely share encryption keys between two parties. Here, we present an approach to high-capacity, high-efficiency QKD by exploiting cross-disciplinary ideas from quantum information theory and the theory of light scattering of aperiodic photonic media. We propose a unique type of entangled-photon source, as well as a physical mechanism for efficiently sharing keys. The key-sharing protocol combines entanglement with the mathematical properties of a recursive sequence to allow a realization of the physical conditions necessary for implementation of the no-cloning principle for QKD, while the source produces entangled photons whose orbital angular momenta (OAM) are in a superposition of Fibonacci numbers. The source is used to implement a particular physical realization of the protocol by randomly encoding the Fibonacci sequence onto entangled OAM states, allowing secure generation of long keys from few photons. Unlike in polarization-based protocols, reference frame alignment is unnecessary, while the required experimental setup is simpler than other OAM-based protocols capable of achieving the same capacity and its complexity grows less rapidly with increasing range of OAM used.
Dinh, Hang; Russell, Alexander
2011-01-01
The Code Equivalence problem is that of determining whether two given linear codes are equivalent to each other up to a permutation of the coordinates. This problem has a direct reduction to a nonabelian hidden subgroup problem (HSP), suggesting a possible quantum algorithm analogous to Shor's algorithms for factoring or discrete log. However, we recently showed that in many cases of interest---including Goppa codes---solving this case of the HSP requires rich, entangled measurements. Thus, solving these cases of Code Equivalence via Fourier sampling appears to be out of reach of current families of quantum algorithms. Code equivalence is directly related to the security of McEliece-type cryptosystems in the case where the private code is known to the adversary. However, for many codes the support splitting algorithm of Sendrier provides a classical attack in this case. We revisit the claims of our previous article in the light of these classical attacks, and discuss the particular case of the Sidelnikov cryp...
Physical implementation of a Majorana fermion surface code for fault-tolerant quantum computation
Vijay, Sagar; Fu, Liang
2016-12-01
We propose a physical realization of a commuting Hamiltonian of interacting Majorana fermions realizing Z 2 topological order, using an array of Josephson-coupled topological superconductor islands. The required multi-body interaction Hamiltonian is naturally generated by a combination of charging energy induced quantum phase-slips on the superconducting islands and electron tunneling between islands. Our setup improves on a recent proposal for implementing a Majorana fermion surface code (Vijay et al 2015 Phys. Rev. X 5 041038), a ‘hybrid’ approach to fault-tolerant quantum computation that combines (1) the engineering of a stabilizer Hamiltonian with a topologically ordered ground state with (2) projective stabilizer measurements to implement error correction and a universal set of logical gates. Our hybrid strategy has advantages over the traditional surface code architecture in error suppression and single-step stabilizer measurements, and is widely applicable to implementing stabilizer codes for quantum computation.
Chau, H F
2009-01-01
Many entanglement distillation schemes use either universal random hashing or breading as their final step to obtain shared almost perfect EPR pairs. Both methods involve random stabilizer quantum error-correcting codes whose syndromes can be measured using simple and efficient quantum circuits. When applied to high fidelity Werner states, the highest yield protocol among those using local Bell measurements and local unitary operations is the one that uses a certain breading method. And random hashing method losses to breading just by a thin margin. In spite of their high yield, the hardness of decoding random linear code makes the use of random hashing and breading infeasible in practice. In this pilot study, we analyze the performance of recurrence method, a well-known entanglement distillation scheme, by replacing the final random hashing or breading procedure by various efficiently decodable quantum codes. We find that among all the replacements we have investigated, the one using a certain adaptive quant...
An Allele Real-Coded Quantum Evolutionary Algorithm Based on Hybrid Updating Strategy.
Zhang, Yu-Xian; Qian, Xiao-Yi; Peng, Hui-Deng; Wang, Jian-Hui
2016-01-01
For improving convergence rate and preventing prematurity in quantum evolutionary algorithm, an allele real-coded quantum evolutionary algorithm based on hybrid updating strategy is presented. The real variables are coded with probability superposition of allele. A hybrid updating strategy balancing the global search and local search is presented in which the superior allele is defined. On the basis of superior allele and inferior allele, a guided evolutionary process as well as updating allele with variable scale contraction is adopted. And H ε gate is introduced to prevent prematurity. Furthermore, the global convergence of proposed algorithm is proved by Markov chain. Finally, the proposed algorithm is compared with genetic algorithm, quantum evolutionary algorithm, and double chains quantum genetic algorithm in solving continuous optimization problem, and the experimental results verify the advantages on convergence rate and search accuracy.
An Allele Real-Coded Quantum Evolutionary Algorithm Based on Hybrid Updating Strategy
Directory of Open Access Journals (Sweden)
Yu-Xian Zhang
2016-01-01
Full Text Available For improving convergence rate and preventing prematurity in quantum evolutionary algorithm, an allele real-coded quantum evolutionary algorithm based on hybrid updating strategy is presented. The real variables are coded with probability superposition of allele. A hybrid updating strategy balancing the global search and local search is presented in which the superior allele is defined. On the basis of superior allele and inferior allele, a guided evolutionary process as well as updating allele with variable scale contraction is adopted. And Hε gate is introduced to prevent prematurity. Furthermore, the global convergence of proposed algorithm is proved by Markov chain. Finally, the proposed algorithm is compared with genetic algorithm, quantum evolutionary algorithm, and double chains quantum genetic algorithm in solving continuous optimization problem, and the experimental results verify the advantages on convergence rate and search accuracy.
Quantum secure direct communication network with superdense coding and decoy photons
Energy Technology Data Exchange (ETDEWEB)
Deng Fuguo [Key Laboratory of Beam Technology and Material Modification of Ministry of Education, Beijing Normal University, Beijing 100875 (China); Li Xihan [Key Laboratory of Beam Technology and Material Modification of Ministry of Education, Beijing Normal University, Beijing 100875 (China); Li Chunyan [Key Laboratory of Beam Technology and Material Modification of Ministry of Education, Beijing Normal University, Beijing 100875 (China); Zhou Ping [Key Laboratory of Beam Technology and Material Modification of Ministry of Education, Beijing Normal University, Beijing 100875 (China); Zhou Hongyu [Key Laboratory of Beam Technology and Material Modification of Ministry of Education, Beijing Normal University, Beijing 100875 (China)
2007-07-15
A quantum secure direct communication network scheme is proposed with quantum superdense coding and decoy photons. The servers on a passive optical network prepare and measure the quantum signal, i.e. a sequence of the d-dimensional Bell states. After confirming the security of the photons received from the receiver, the sender codes his secret message on them directly. For preventing a dishonest server from eavesdropping, some decoy photons prepared by measuring one photon in the Bell states are used to replace some original photons. One of the users on the network can communicate to any other one. This scheme has the advantage of high capacity, and it is more convenient than others as only a sequence of photons is transmitted in quantum line.
Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
Pastawski, Fernando; Yoshida, Beni; Harlow, Daniel; Preskill, John
2015-01-01
We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an isometry from the bulk Hilbert space to the boundary Hilbert space. The entire tensor network is an encoder for a quantum error-correcting code, where the bulk and boundary degrees of freedom may be ...
Is A Quantum Stabilizer Code Degenerate or Nondegenerate for Pauli Channel?
Xiao, Fangying
2010-01-01
Mapping an error syndrome to the error operator is the core of quantum decoding network and is also the key step of recovery. The definitions of the bit-flip error syndrome matrix and the phase-flip error syndrome matrix were presented, and then the error syndromes of quantum errors were expressed in terms of the columns of the bit-flip error syndrome matrix and the phase-flip error syndrome matrix. It also showed that the error syndrome matrices of a stabilizer code are determined by its check matrix, which is similar to the classical case. So, the error-detection and recovery techniques of classical linear codes can be applied to quantum stabilizer codes after some modifications. Some necessary and/or sufficient conditions for the stabilizer code over GF(2) is degenerate or nondegenerate for Pauli channel based on the relationship between the error syndrome matrices and the check matrix was presented. A new way to find the minimum distance of the quantum stabilizer codes based on their check matrices was pr...
Implementation of a multiple round quantum dense coding using nuclear magnetic resonance
Institute of Scientific and Technical Information of China (English)
ZHANG; Jingfu; XIE; Jingyi; WANG; Chuan; DENG; Zhiwei; LU
2005-01-01
A multiple round quantum dense coding scheme based on the quantum phase estimation algorithm is proposed and implemented in a three qubit nuclear magnetic resonance (NMR) quantum computer. Using an m + 1 qubit system, Bob can transmit one of 2m+1 messages to Alice, through manipulating only one qubit and exchanging it between Alice and Bob for m rounds. The information capacity is enhanced to m + 1 bits as compared to m bits in a classical scheme. The scheme has been demonstrated in NMR system, and the experimental results show a good agreement between theory and experiment.
A probabilistic coding based quantum genetic algorithm for multiple sequence alignment.
Huo, Hongwei; Xie, Qiaoluan; Shen, Xubang; Stojkovic, Vojislav
2008-01-01
This paper presents an original Quantum Genetic algorithm for Multiple sequence ALIGNment (QGMALIGN) that combines a genetic algorithm and a quantum algorithm. A quantum probabilistic coding is designed for representing the multiple sequence alignment. A quantum rotation gate as a mutation operator is used to guide the quantum state evolution. Six genetic operators are designed on the coding basis to improve the solution during the evolutionary process. The features of implicit parallelism and state superposition in quantum mechanics and the global search capability of the genetic algorithm are exploited to get efficient computation. A set of well known test cases from BAliBASE2.0 is used as reference to evaluate the efficiency of the QGMALIGN optimization. The QGMALIGN results have been compared with the most popular methods (CLUSTALX, SAGA, DIALIGN, SB_PIMA, and QGMALIGN) results. The QGMALIGN results show that QGMALIGN performs well on the presenting biological data. The addition of genetic operators to the quantum algorithm lowers the cost of overall running time.
Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
Brooks, Peter; Preskill, John
2013-03-01
We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the noise strength and the noise bias, and estimate the logical error rate and overhead cost achieved by this optimal code. Our fault-tolerant gadgets, based on gate teleportation, are well suited for hardware platforms with geometrically local gates in two dimensions.
Scheme for implementing quantum dense coding with W-class state in cavity QED
Institute of Scientific and Technical Information of China (English)
He Juan; Ye Liu; Ni Zhi-Xiang
2008-01-01
An experimentally feasible protocol for realizing dense coding by using a class of W-state in cavity quantum electrodynamics (QED) is proposed in this paper.The prominent advantage of our scheme is that the succeasful probability of the dense coding with a W-class state can reach 1.In addition,the scheme can be implemented by the present cavity QED techniques.
Rossi, Elda; Evangelisti, Stefano; Laganà, Antonio; Monari, Antonio; Rampino, Sergio; Verdicchio, Marco; Baldridge, Kim K; Bendazzoli, Gian Luigi; Borini, Stefano; Cimiraglia, Renzo; Angeli, Celestino; Kallay, Peter; Lüthi, Hans P; Ruud, Kenneth; Sanchez-Marin, José; Scemama, Anthony; Szalay, Peter G; Tajti, Attila
2014-03-30
Code interoperability and the search for domain-specific standard data formats represent critical issues in many areas of computational science. The advent of novel computing infrastructures such as computational grids and clouds make these issues even more urgent. The design and implementation of a common data format for quantum chemistry (QC) and quantum dynamics (QD) computer programs is discussed with reference to the research performed in the course of two Collaboration in Science and Technology Actions. The specific data models adopted, Q5Cost and D5Cost, are shown to work for a number of interoperating codes, regardless of the type and amount of information (small or large datasets) to be exchanged. The codes are either interfaced directly, or transfer data by means of wrappers; both types of data exchange are supported by the Q5/D5Cost library. Further, the exchange of data between QC and QD codes is addressed. As a proof of concept, the H + H2 reaction is discussed. The proposed scheme is shown to provide an excellent basis for cooperative code development, even across domain boundaries. Moreover, the scheme presented is found to be useful also as a production tool in the grid distributed computing environment.
Baianu,I C
2004-01-01
The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal concept of quantum automaton and quantum computation, respectively, were introduced and their possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of topological semigroup, quantum automaton, or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebra...
Directory of Open Access Journals (Sweden)
Daniel Litinski
2017-09-01
Full Text Available We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely, the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture, including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and we present protocols for realizing topologically protected Clifford gates. These hexagonal-cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome read-out and logical T gates via magic-state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and we give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but it could also be realized in alternative settings such as quantum-Hall–superconductor hybrids.
High-capacity three-party quantum secret sharing with superdense coding
Institute of Scientific and Technical Information of China (English)
Gu Bin; Li Chuan-Qi; Xu Fei; Chen Yu-Lin
2009-01-01
This paper presents a scheme for high-capacity three-party quantum secret sharing with quantum superdense coding, following some ideas in the work by Liu et al (2002 Phys. Rev. A 65 022304) and the quantum secret sharing scheme by Deng et al (2008 Phys. Left. A 372 1957). Instead of using two sets of nonorthogonal states, the boss Alice needs only to prepare a sequence of Einstein-Podolsky-Rosen pairs in d-dimension. The two agents Bob and Charlie encode their information with dense coding unitary operations, and security is checked by inserting decoy photons. The scheme has a high capacity and intrinsic efficiency as each pair can carry 21bd bits of information, and almost all the pairs can be used for carrying useful information.
Hybrid threshold adaptable quantum secret sharing scheme with reverse Huffman-Fibonacci-tree coding
Lai, Hong; Zhang, Jun; Luo, Ming-Xing; Pan, Lei; Pieprzyk, Josef; Xiao, Fuyuan; Orgun, Mehmet A.
2016-08-01
With prevalent attacks in communication, sharing a secret between communicating parties is an ongoing challenge. Moreover, it is important to integrate quantum solutions with classical secret sharing schemes with low computational cost for the real world use. This paper proposes a novel hybrid threshold adaptable quantum secret sharing scheme, using an m-bonacci orbital angular momentum (OAM) pump, Lagrange interpolation polynomials, and reverse Huffman-Fibonacci-tree coding. To be exact, we employ entangled states prepared by m-bonacci sequences to detect eavesdropping. Meanwhile, we encode m-bonacci sequences in Lagrange interpolation polynomials to generate the shares of a secret with reverse Huffman-Fibonacci-tree coding. The advantages of the proposed scheme is that it can detect eavesdropping without joint quantum operations, and permits secret sharing for an arbitrary but no less than threshold-value number of classical participants with much lower bandwidth. Also, in comparison with existing quantum secret sharing schemes, it still works when there are dynamic changes, such as the unavailability of some quantum channel, the arrival of new participants and the departure of participants. Finally, we provide security analysis of the new hybrid quantum secret sharing scheme and discuss its useful features for modern applications.
Institute of Scientific and Technical Information of China (English)
Zheng Xiao-Juan; Cao Shuai; Fang Mao-Fa; Liao Xiang-Ping
2008-01-01
This paper proposes an experimentally feasible scheme for implementing quantum dense coding of trapped-ion system in decoherence-free states.As the phase changes due to time evolution of components with different eigenenergies of quantum superposition are completely frozen,quantum dense coding based on this model would be perfect.The scheme is insensitive to heating of vibrational mode and Bell states can be exactly distinguished via detecting the ionic state.
Error correcting codes for binary unitary channels on multipartite quantum systems
Choi, M D; Kribs, D W; Zyczkowski, K; Choi, Man-Duen; Holbrook, John A.; Kribs, David W.; Zyczkowski, Karol
2006-01-01
We conduct an analysis of ideal error correcting codes for randomized unitary channels determined by two unitary error operators -- what we call ``binary unitary channels'' -- on multipartite quantum systems. In a wide variety of cases we give a complete description of the code structure for such channels. Specifically, we find a practical geometric technique to determine the existence of codes of arbitrary dimension, and then derive an explicit construction of codes of a given dimension when they exist. For instance, given any binary unitary noise model on an n-qubit system, we design codes that support n-2 qubits. We accomplish this by verifying a conjecture for higher rank numerical ranges of normal operators in many cases.
Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm
Directory of Open Access Journals (Sweden)
Jianyong Liu
2015-01-01
Full Text Available The method that the real-coded quantum-inspired genetic algorithm (RQGA used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.
Error threshold in topological quantum-computing models with color codes
Katzgraber, Helmut; Bombin, Hector; Martin-Delgado, Miguel A.
2009-03-01
Dealing with errors in quantum computing systems is possibly one of the hardest tasks when attempting to realize physical devices. By encoding the qubits in topological properties of a system, an inherent protection of the quantum states can be achieved. Traditional topologically-protected approaches are based on the braiding of quasiparticles. Recently, a braid-less implementation using brane-net condensates in 3-colexes has been proposed. In 2D it allows the transversal implementation of the whole Clifford group of quantum gates. In this work, we compute the error threshold for this topologically-protected quantum computing system in 2D, by means of mapping its error correction process onto a random 3-body Ising model on a triangular lattice. Errors manifest themselves as random perturbation of the plaquette interaction terms thus introducing frustration. Our results from Monte Carlo simulations suggest that these topological color codes are similarly robust to perturbations as the toric codes. Furthermore, they provide more computational capabilities and the possibility of having more qubits encoded in the quantum memory.
ForceFit: a code to fit classical force fields to quantum mechanical potential energy surfaces.
Waldher, Benjamin; Kuta, Jadwiga; Chen, Samuel; Henson, Neil; Clark, Aurora E
2010-09-01
The ForceFit program package has been developed for fitting classical force field parameters based upon a force matching algorithm to quantum mechanical gradients of configurations that span the potential energy surface of the system. The program, which runs under UNIX and is written in C++, is an easy-to-use, nonproprietary platform that enables gradient fitting of a wide variety of functional force field forms to quantum mechanical information obtained from an array of common electronic structure codes. All aspects of the fitting process are run from a graphical user interface, from the parsing of quantum mechanical data, assembling of a potential energy surface database, setting the force field, and variables to be optimized, choosing a molecular mechanics code for comparison to the reference data, and finally, the initiation of a least squares minimization algorithm. Furthermore, the code is based on a modular templated code design that enables the facile addition of new functionality to the program. Copyright 2010 Wiley Periodicals, Inc.
Nuclear numerical range and quantum error correction codes for non-unitary noise models
Lipka-Bartosik, Patryk; Życzkowski, Karol
2017-01-01
We introduce a notion of nuclear numerical range defined as the set of expectation values of a given operator A among normalized pure states, which belong to the nucleus of an auxiliary operator Z. This notion proves to be applicable to investigate models of quantum noise with block-diagonal structure of the corresponding Kraus operators. The problem of constructing a suitable quantum error correction code for this model can be restated as a geometric problem of finding intersection points of certain sets in the complex plane. This technique, worked out in the case of two-qubit systems, can be generalized for larger dimensions.
Effect of relativistic acceleration on continuous variable quantum teleportation and dense coding
Grochowski, Piotr T.; Rajchel, Grzegorz; Kiałka, Filip; Dragan, Andrzej
2017-01-01
We investigate how relativistic acceleration of the observers can affect the performance of the quantum teleportation and dense coding for continuous variable states of localized wavepackets. Such protocols are typically optimized for symmetric resources prepared in an inertial frame of reference. A mismatch of the sender and the receiver's accelerations can introduce asymmetry to the shared entanglement, which has an effect on the efficiency of the protocol that goes beyond entanglement degr...
Algorithms and computer codes for atomic and molecular quantum scattering theory. Volume I
Energy Technology Data Exchange (ETDEWEB)
Thomas, L. (ed.)
1979-01-01
The goals of this workshop are to identify which of the existing computer codes for solving the coupled equations of quantum molecular scattering theory perform most efficiently on a variety of test problems, and to make tested versions of those codes available to the chemistry community through the NRCC software library. To this end, many of the most active developers and users of these codes have been invited to discuss the methods and to solve a set of test problems using the LBL computers. The first volume of this workshop report is a collection of the manuscripts of the talks that were presented at the first meeting held at the Argonne National Laboratory, Argonne, Illinois June 25-27, 1979. It is hoped that this will serve as an up-to-date reference to the most popular methods with their latest refinements and implementations.
Quantum Dense Coding About a Two-Qubit Heisenberg XYZ Model
Xu, Hui-Yun; Yang, Guo-Hui
2017-09-01
By taking into account the nonuniform magnetic field, the quantum dense coding with thermal entangled states of a two-qubit anisotropic Heisenberg XYZ chain are investigated in detail. We mainly show the different properties about the dense coding capacity ( χ) with the changes of different parameters. It is found that dense coding capacity χ can be enhanced by decreasing the magnetic field B, the degree of inhomogeneity b and temperature T, or increasing the coupling constant along z-axis J z . In addition, we also find χ remains the stable value as the change of the anisotropy of the XY plane Δ in a certain temperature condition. Through studying different parameters effect on χ, it presents that we can properly turn the values of B, b, J z , Δ or adjust the temperature T to obtain a valid dense coding capacity ( χ satisfies χ > 1). Moreover, the temperature plays a key role in adjusting the value of dense coding capacity χ. The valid dense coding capacity could be always obtained in the lower temperature-limit case.
Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
Pastawski, Fernando; Harlow, Daniel; Preskill, John
2015-01-01
We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an exact isometry from bulk operators to boundary operators. The entire tensor network is a quantum error-correcting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the Ryu-Takayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindler-wedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed by Almheiri et. al in arXiv:1411.70...
Institute of Scientific and Technical Information of China (English)
HAN Lian-Fang; CHEN Yue-Ming; YUAN Hao
2009-01-01
We propose a deterministic quantum secure direct communication protocol by using dense coding.The two check photon sequences are used to check the securities of the channels between the message sender and the receiver.The continuous variable operations instead of the usual discrete unitary operations are performed on the travel photons so that the security of the present protocol can be enhanced.Therefore some specific attacks such as denial-of-service attack, intercept-measure-resend attack and invisible photon attack can be prevented in ideal quantum channel.In addition, the scheme is still secure in noise channel.Furthurmore, this protocol has the advantage of high capacity and can be realized in the experiment.
Institute of Scientific and Technical Information of China (English)
Ye Tian-Yu; Jiang Li-Zhen
2013-01-01
A quantum steganography protocol with a large payload is proposed based on the dense coding and the entanglement swapping of the Greenberger-Home-Zeilinger (GHZ) states.Its super quantum channel is formed by building up a hidden channel within the original quantum secure direct communication (QSDC) scheme.Based on the original QSDC,secret messages are transmitted by integrating the dense coding and the entanglement swapping of the GHZ states.The capacity of the super quantum channel achieves six bits per round covert communication,much higher than the previous quantum steganography protocols.Its imperceptibility is good,since the information and the secret messages can be regarded to be random or pseudo-random.Moreover,its security is proved to be reliable.
Ye, Tian-Yu; Jiang, Li-Zhen
2013-05-01
A quantum steganography protocol with a large payload is proposed based on the dense coding and the entanglement swapping of the Greenberger—Horne—Zeilinger (GHZ) states. Its super quantum channel is formed by building up a hidden channel within the original quantum secure direct communication (QSDC) scheme. Based on the original QSDC, secret messages are transmitted by integrating the dense coding and the entanglement swapping of the GHZ states. The capacity of the super quantum channel achieves six bits per round covert communication, much higher than the previous quantum steganography protocols. Its imperceptibility is good, since the information and the secret messages can be regarded to be random or pseudo-random. Moreover, its security is proved to be reliable.
Fortran code for generating random probability vectors, unitaries, and quantum states
Directory of Open Access Journals (Sweden)
Jonas eMaziero
2016-03-01
Full Text Available The usefulness of generating random configurations is recognized in many areas of knowledge. Fortran was born for scientific computing and has been one of the main programming languages in this area since then. And several ongoing projects targeting towards its betterment indicate that it will keep this status in the decades to come. In this article, we describe Fortran codes produced, or organized, for the generation of the following random objects: numbers, probability vectors, unitary matrices, and quantum state vectors and density matrices. Some matrix functions are also included and may be of independent interest.
Semi-device independent random number expansion protocol with n to 1 quantum random access codes
Li, Hong-Wei; Yin, Zhen-Qiang; Guo, Guang-Can; Han, Zheng-Fu
2011-01-01
We study random number expansion protocols based on the n to 1 quantum random access codes (QRACs). We consider them in the semi-device independent scenario where the inner workings of the devices are unknown to us but we can certify the dimensions of the systems being communicated. This approach does not require the use of the entanglement and makes the physical realization of these protocols much easier than in the standard device independent scenario. We calculate the dependence of the effectiveness of the randomness generation on $n$ and find it optimal for n=3. We provide the explanation for this fact.
Lai, Hong; Orgun, Mehmet A.; Pieprzyk, Josef; Li, Jing; Luo, Mingxing; Xiao, Jinghua; Xiao, Fuyuan
2016-08-01
We propose an approach that achieves high-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding. In particular, we encode a key with the Chebyshev-map values corresponding to Lucas numbers and then use k-Chebyshev maps to achieve consecutive and flexible key expansion and apply the pre-shared classical information between Alice and Bob and fountain codes for privacy amplification to solve the security of the exchange of classical information via the classical channel. Consequently, our high-capacity protocol does not have the limitations imposed by orbital angular momentum and down-conversion bandwidths, and it meets the requirements for longer distances and lower error rates simultaneously.
Lai, Hong; Orgun, Mehmet A.; Pieprzyk, Josef; Li, Jing; Luo, Mingxing; Xiao, Jinghua; Xiao, Fuyuan
2016-11-01
We propose an approach that achieves high-capacity quantum key distribution using Chebyshev-map values corresponding to Lucas numbers coding. In particular, we encode a key with the Chebyshev-map values corresponding to Lucas numbers and then use k-Chebyshev maps to achieve consecutive and flexible key expansion and apply the pre-shared classical information between Alice and Bob and fountain codes for privacy amplification to solve the security of the exchange of classical information via the classical channel. Consequently, our high-capacity protocol does not have the limitations imposed by orbital angular momentum and down-conversion bandwidths, and it meets the requirements for longer distances and lower error rates simultaneously.
Institute of Scientific and Technical Information of China (English)
HU Li-Yun; LIU Jun; FAN Hong-Yi; LIU Yi-Min; XIA Yan; ZHANG Zhan-Jun
2008-01-01
Recently Xia and Song [Phys. Left. A 364 (2007) 117] have proposed a controlled quantum secure direct communication (CQSDC) protocol. They claimed that in their protocol only with the help of the controller Charlie,the receiver Alice can succeasfully extract the secret message from the sender Bob. In this letter, first we will show that within their protocol the controller Charlie's role could have been excluded if it were not for their unreasonable design.We then revise the Xia-Song CQSDC protocol such that its original advantages are retained and the CQSDC can be really realized.
Quantum codes from cyclic codes over F3 + μF3 + υF3 + μυ F3
Özen, Mehmet; Tuğba Özzaim, N.; İnce, Halit
2016-10-01
In this paper, it will be argued that structure of cyclic codes over F3 + μF3 + υF3 + μυ F3 where u 2 = 1, v 2 = 1 and uv = vu for arbitrary length n. We define a new Gray map which is a distance preserving map. By using decomposition theory, we find generator polynomials of cyclic codes over F3 + μF3 + υF3 + μυ F3 and obtain the result that cyclic codes over F3 + μF3 + υF3 + μυ F3 are principally generated. Further, using these results we determine the parameters of quantum codes which constructed from cyclic codes over F3 + μF3 + υF3 + μυ F3. We present some of the results of computer search.
Generating multi-photon W-like states for perfect quantum teleportation and superdense coding
Li, Ke; Kong, Fan-Zhen; Yang, Ming; Ozaydin, Fatih; Yang, Qing; Cao, Zhuo-Liang
2016-08-01
An interesting aspect of multipartite entanglement is that for perfect teleportation and superdense coding, not the maximally entangled W states but a special class of non-maximally entangled W-like states are required. Therefore, efficient preparation of such W-like states is of great importance in quantum communications, which has not been studied as much as the preparation of W states. In this paper, we propose a simple optical scheme for efficient preparation of large-scale polarization-based entangled W-like states by fusing two W-like states or expanding a W-like state with an ancilla photon. Our scheme can also generate large-scale W states by fusing or expanding W or even W-like states. The cost analysis shows that in generating large-scale W states, the fusion mechanism achieves a higher efficiency with non-maximally entangled W-like states than maximally entangled W states. Our scheme can also start fusion or expansion with Bell states, and it is composed of a polarization-dependent beam splitter, two polarizing beam splitters and photon detectors. Requiring no ancilla photon or controlled gate to operate, our scheme can be realized with the current photonics technology and we believe it enable advances in quantum teleportation and superdense coding in multipartite settings.
Energy Technology Data Exchange (ETDEWEB)
Bergbauer, Werner [OSRAM Opto Semiconductors GmbH, Regensburg (Germany); FH Deggendorf (Germany); Laubsch, Ansgar; Peter, Matthias; Mayer, Tobias; Bader, Stefan; Oberschmid, Raimund; Hahn, Berthold [OSRAM Opto Semiconductors GmbH, Regensburg (Germany); Benstetter, Guenther [FH Deggendorf (Germany)
2008-07-01
As the efficiency and the luminous flux have been increased enormously in the last few years, today Light Emitting Diodes (LEDs) are even pushed to applications like general lighting and Home Cinema Projection. Still, InGaN/GaN heterostructure based LEDs suffer from loss-mechanisms like non-radiative defect and Auger recombination, carrier leakage and piezo-field induced carrier separation. To optimize the high current efficiency we evaluated the benefit of Multiple Quantum Well (MQW) compared to Single Quantum Well (SQW) LEDs. Temperature dependent electroluminescence of colour-coded structures with different Indium content in certain Quantum Wells was measured. The experiments demonstrated a strong temperature and current dependence of the MQW operation. The comparison between different LED structures showed effectively the increased LED performance of those structures which operate with a well adjusted MQW active area. Due to the enhanced carrier distribution in the high current range, these LEDs show a higher light output and additionally a reduced wavelength shift.
Construction of quantum codes from line graph of cube%利用立方图的线图构造量子纠错码
Institute of Scientific and Technical Information of China (English)
钱建发; 张莉娜
2013-01-01
量子纠错码在量子通信和量子计算中起着非常重要的作用,之前的量子纠错码的构造大部分都是利用经典的纠错码来构造得到,如Hamming码,BCH码,RS码,Reed-Muller码等各种经典纠错码.目前,很少有人利用图生成的线性码方法来构造量子纠错码,提出了一个新的构造量子纠错码和非对称量子纠错码的方法,即利用n立方图的线图生成的二元线性码来构造量子纠错码和非对称量子纠错码,得到了一类新的量子纠错码和非对称量子纠错码,并且,当码字的长度较大时,对所构造的非对称量子纠错码,在非对称信道上有更大的纠错能力.%Quantum error-correcting codes play an important role in not only quantum communication but also quantum computation. Many good quantum error-correcting codes have been constructed by using classical linear codes, for example, Hamming codes, BCH codes, RS codes and Reed-Muller codes. A new method to obtain quantum codes and asymmetric quantum codes is presented. Based on line graph of the n-cube, infinite families of new quantum codes and asymmetric quantum codes are presented. Moreover, if the length of asymmetric quantum codes is large, the asymmetric quantum codes are able to correct quantum errors with great asymmetry.
A New Quantum Key Distribution Scheme Based on Frequency and Time Coding
Institute of Scientific and Technical Information of China (English)
ZHU Chang-Hua; PEI Chang-Xing; QUAN Dong-Xiao; GAO Jing-Liang; CHEN Nan; YI Yun-Hui
2010-01-01
@@ A new scheme of quantum key distribution (QKD) using frequency and time coding is proposed,in which the security is based on the frequency-time uncertainty relation.In this scheme,the binary information sequence is encoded randomly on either the central frequency or the time delay of the optical pulse at the sender.The central frequency of the single photon pulse is set as ω1 for bit 0 and set as ω2 for bit 1 when frequency coding is selected.However,the single photon pulse is not delayed for bit 0 and is delayed in T for 1 when time coding is selected.At the receiver,either the frequency or the time delay of the pulse is measured randomly,and the final key is obtained after basis comparison,data reconciliation and privacy amplification.With the proposed method,the effect of the noise in the fiber channel and environment on the QKD system can be reduced effectively.
Hierarchical surface code for network quantum computing with modules of arbitrary size
Li, Ying; Benjamin, Simon C.
2016-10-01
The network paradigm for quantum computing involves interconnecting many modules to form a scalable machine. Typically it is assumed that the links between modules are prone to noise while operations within modules have a significantly higher fidelity. To optimize fault tolerance in such architectures we introduce a hierarchical generalization of the surface code: a small "patch" of the code exists within each module and constitutes a single effective qubit of the logic-level surface code. Errors primarily occur in a two-dimensional subspace, i.e., patch perimeters extruded over time, and the resulting noise threshold for intermodule links can exceed ˜10 % even in the absence of purification. Increasing the number of qubits within each module decreases the number of qubits necessary for encoding a logical qubit. But this advantage is relatively modest, and broadly speaking, a "fine-grained" network of small modules containing only about eight qubits is competitive in total qubit count versus a "course" network with modules containing many hundreds of qubits.
Analytical Lower and Upper Bounds for the Threshold Surfaces of Quantum Error Correcting Codes
Takagi, Ryuji; Yoder, Theodore; Chuang, Isaac
If all the physical gates in a fault tolerant code construction have a failure probability below a certain value, the failure probability of the construction approaches zero after many concatenations. This value is called the threshold value of the code and lower bounds for it for various codes have been reported in the literature. However, these approaches do not take into account that the failure probability of each species of logical gate depends on that of many different species of physical gates, and that the distribution of logical failure probability depends on that of many different physical gates. How can we reconcile the interdependency of the failure probabilities of all the various species of gates? Direct simulation would be one of the possible ways to attack this question, but it would be difficult to be done at high concatenation levels because of the exponential growth of simulation time. Here, we deal with this question by instead considering a multidimensional space of the failure probabilities of the physical gates and study the set of points that approach zero error after a large number of concatenations. We present a way to obtain lower and upper bounds for the boundary of this set, what we call the threshold surface, given a particular code and constructions of logical gates. Our method uses only the logical failure probabilities after one concatenation, and moreover the running time of the algorithm scales linearly with respect to concatenation levels. We hope this will establish a reasonable goal for experiments to work towards a scalable quantum computer.
Liang, Wen-Ye; Wang, Shuang; Li, Hong-Wei; Yin, Zhen-Qiang; Chen, Wei; Yao, Yao; Huang, Jing-Zheng; Guo, Guang-Can; Han, Zheng-Fu
2014-01-01
We have demonstrated a proof-of-principle experiment of reference-frame-independent phase coding quantum key distribution (RFI-QKD) over an 80-km optical fiber. After considering the finite-key bound, we still achieve a distance of 50 km. In this scenario, the phases of the basis states are related by a slowly time-varying transformation. Furthermore, we developed and realized a new decoy state method for RFI-QKD systems with weak coherent sources to counteract the photon-number-splitting attack. With the help of a reference-frame-independent protocol and a Michelson interferometer with Faraday rotator mirrors, our system is rendered immune to the slow phase changes of the interferometer and the polarization disturbances of the channel, making the procedure very robust.
Fortran code for generating random probability vectors, unitaries, and quantum states
Maziero, Jonas
2015-01-01
The usefulness of generating random configurations is recognized in a variety of contexts, as for instance in the simulation of physical systems, in the verification of bounds and/or ansatz solutions for optimization problems, and in secure communications. Fortran was born for scientific computing and has been one of the main programming languages in this area since then. And the several ongoing projects targeting towards its betterment indicate that it will keep this status in the decades to come. In this article, we describe Fortran codes produced, or organized, for the generation of the following random objects: numbers, probability vectors, unitary matrices, and quantum state vectors and density matrices. Some matrix functions are also included and may be of independent interest.
Zhou, Yu-Qian; Gao, Fei; Li, Dan-Dan; Li, Xin-Hui; Wen, Qiao-Yan
2016-09-01
We have proved that new randomness can be certified by partially free sources using 2 →1 quantum random access code (QRAC) in the framework of semi-device-independent (SDI) protocols [Y.-Q. Zhou, H.-W. Li, Y.-K. Wang, D.-D. Li, F. Gao, and Q.-Y. Wen, Phys. Rev. A 92, 022331 (2015), 10.1103/PhysRevA.92.022331]. To improve the effectiveness of the randomness generation, here we propose the SDI randomness expansion using 3 →1 QRAC and obtain the corresponding classical and quantum bounds of the two-dimensional quantum witness. Moreover, we get the condition which should be satisfied by the partially free sources to successfully certify new randomness, and the analytic relationship between the certified randomness and the two-dimensional quantum witness violation.
Gueddana, Amor; Attia, Moez; Chatta, Rihab
2014-05-01
In this work, we simulate a fiber-based Quantum Key Distribution Protocol (QKDP) BB84 working at the telecoms wavelength 1550 nm with taking into consideration an optimized attack strategy. We consider in our work a quantum channel composed by probabilistic Single Photon Source (SPS), single mode optical Fiber and quantum detector with high efficiency. We show the advantages of using the Quantum Dots (QD) embedded in micro-cavity compared to the Heralded Single Photon Sources (HSPS). Second, we show that Eve is always getting some information depending on the mean photon number per pulse of the used SPS and therefore, we propose an optimized version of the QKDP BB84 based on Quantum Dense Coding (QDC) that could be implemented by quantum CNOT gates. We evaluate the success probability of implementing the optimized QKDP BB84 when using nowadays probabilistic quantum optical devices for circuit realization. We use for our modeling an abstract probabilistic model of a CNOT gate based on linear optical components and having a success probability of sqrt (4/27), we take into consideration the best SPSs realizations, namely the QD and the HSPS, generating a single photon per pulse with a success probability of 0.73 and 0.37, respectively. We show that the protocol is totally secure against attacks but could be correctly implemented only with a success probability of few percent.
EOSTA-an improved EOS quantum mechanical model in the STA opacity code
Energy Technology Data Exchange (ETDEWEB)
Bar-Shalom, A. [Koifman 32, Beer-Sheva (Israel) and Artep Inc., Columbia, MD 21045 (United States)]. E-mail: avibs@bgumail.bgu.ac.il; Oreg, J. [Artep Inc., Columbia, MD 21045 (United States); Klapisch, M. [Artep Inc., Columbia, MD 21045 (United States)
2006-05-15
The STA model is extended to include calculations of thermodynamical quantities required for equation of state (EOS). For that purpose the plasma free electrons are now treated quantum mechanically accounting for shape resonances. The resulting gradual orbital ionization assures a regular behavior of all the thermodynamical quantities vs. density and temperature. The relativistic quantum mechanical framework that we have applied in a new code named EOSTA follows Liberman's Inferno model with several improvements that accomplish higher accuracy. These improvements include: a numerical technique to trace all the resonances and follow their detailed structure and application of the phase amplitude method that allows the inclusion of higher angular momenta partial waves and higher energies of the free orbitals. In addition we employ two complementary methods to treat the exchange potential in the calculation of orbital wave functions: (1) for EOS calculations Local Density Approximation is used and (2) for ionization lowering and orbital energies required in the opacity calculations we have found two satisfactory alternatives: (a) the optimized effective potential (OEP) and (b) first order corrected Local Density Approximation. In both alternatives the resulting orbitals are used to calculate the detailed exchange term that includes a proper reduction of the self energy. A new approach for calculating the electronic pressure is presented. The relativistic virial theorem expresses the pressure as a sum of the total energy and a local density term. This form allows consistent calibration of the correlation energy to comply with the periodic table zero pressure density points and higher density pressures. Results are presented describing the various thermodynamical quantities vs. density and temperature in comparison with other calculations and experiments.
Local non-Calderbank-Shor-Steane quantum error-correcting code on a three-dimensional lattice
Kim, Isaac H.
2011-05-01
We present a family of non-Calderbank-Shor-Steane quantum error-correcting code consisting of geometrically local stabilizer generators on a 3D lattice. We study the Hamiltonian constructed from ferromagnetic interaction of overcomplete set of local stabilizer generators. The degenerate ground state of the system is characterized by a quantum error-correcting code whose number of encoded qubits are equal to the second Betti number of the manifold. These models (i) have solely local interactions; (ii) admit a strong-weak duality relation with an Ising model on a dual lattice; (iii) have topological order in the ground state, some of which survive at finite temperature; and (iv) behave as classical memory at finite temperature.
Zhang, Jingfu; Laflamme, Raymond; Suter, Dieter
2012-09-07
Large-scale universal quantum computing requires the implementation of quantum error correction (QEC). While the implementation of QEC has already been demonstrated for quantum memories, reliable quantum computing requires also the application of nontrivial logical gate operations to the encoded qubits. Here, we present examples of such operations by implementing, in addition to the identity operation, the NOT and the Hadamard gate to a logical qubit encoded in a five qubit system that allows correction of arbitrary single-qubit errors. We perform quantum process tomography of the encoded gate operations, demonstrate the successful correction of all possible single-qubit errors, and measure the fidelity of the encoded logical gate operations.
Performance analysis of quantum access network using code division multiple access model
Hu, Linxi; Yang, Can; He, Guangqiang
2017-06-01
Not Available Project supported by the National Natural Science Foundation of China (Grant Nos. 61475099 and 61102053), the Program of State Key Laboratory of Quantum Optics and Quantum Optics Devices (Grant No. KF201405), the Open Fund of IPOC (BUPT) (Grant No. IPOC2015B004), and the Program of State Key Laboratory of Information Security (Grant No. 2016-MS-05).
Algorithms and computer codes for atomic and molecular quantum scattering theory
Energy Technology Data Exchange (ETDEWEB)
Thomas, L. (ed.)
1979-01-01
This workshop has succeeded in bringing up 11 different coupled equation codes on the NRCC computer, testing them against a set of 24 different test problems and making them available to the user community. These codes span a wide variety of methodologies, and factors of up to 300 were observed in the spread of computer times on specific problems. A very effective method was devised for examining the performance of the individual codes in the different regions of the integration range. Many of the strengths and weaknesses of the codes have been identified. Based on these observations, a hybrid code has been developed which is significantly superior to any single code tested. Thus, not only have the original goals been fully met, the workshop has resulted directly in an advancement of the field. All of the computer programs except VIVS are available upon request from the NRCC. Since an improved version of VIVS is contained in the hybrid program, VIVAS, it was not made available for distribution. The individual program LOGD is, however, available. In addition, programs which compute the potential energy matrices of the test problems are also available. The software library names for Tests 1, 2 and 4 are HEH2, LICO, and EN2, respectively.
量子高密度编码原理及其 MATLAB 仿真%Principles of quantum dense coding and MATLAB simulation
Institute of Scientific and Technical Information of China (English)
张慧泽
2014-01-01
Communication technicians and students usually have no conditions for quantum bit control. MATLAB which has handy matrix control system and powerful science calculation function is a good simulation tool of quantum communication study. This paper gives the MATLAB language depiction of quantum bit, quantum bit measure, quantum sequence, Bell states and common quantum logic gate. Principles of quantum dense coding are also analyzed. MATLAB simulation program of quantum dense coding is obtained.%由于没有实际操纵量子比特的条件，MATLAB 以其简便的矩阵操纵手段和强大的科学计算功能，成为通信工程人员和在校学生学习量子通信基本原理的良好工具。给出了量子比特及其测定、量子序列、贝尔态基和常用量子逻辑门的 MATLAB 语言描述。分析了量子高密度编码原理，给出了 MATLAB 仿真程序。
IMPLEMENTATION OF REACTION FIELD METHODS IN QUANTUM-CHEMISTRY COMPUTER CODES
DEVRIES, AH; VANDUIJNEN, PT; JUFFER, AH; RULLMANN, JAC; DIJKMAN, JP; MERENGA, H; THOLE, BT
1995-01-01
The embedding of a quantum mechanically described subsystem by classical representations of its surroundings is reviewed. The choices for a distributed monopole representation and a distributed (group) polarizability representation, as well as the continuum approach to model bulk effects, are discus
Quantum-Mechanical Variant of the Thouless-Anderson-Palmer Equation for Error-Correcting Codes
Inoue, J.; Saika, Y.; Okada, M.
Statistical mechanics of information has been applied to problems in various research topics of information science and technology [1],[2]. Among those research topics, error-correcting code is one of the most developed subjects. In the research field of error-correcting codes, Nicolas Sourlas showed that the so-called convolutional codes can be constructed by spin glass with infinite range p-body interactions and the decoded message should be corresponded to the ground state of the Hamiltonian [3]. Ruján pointed out that the bit error can be suppressed if one uses finite temperature equilibrium states as the decoding result, instead of the ground state [4], and the so-called Bayes-optimal decoding at some specific condition was proved by Nishimori [5] and Nishimori and Wong [6]. Kabashima and Saad succeeded in constructing more practical codes, namely low-density parity check (LDPC) codes by using the infinite range spin glass model with finite connectivities [7]. They used the so-called TAP (Thouless-Anderson-Palmer) equations to decode the original message for a given parity check.
Large-Capacity Three-Party Quantum Digital Secret Sharing Using Three Particular Matrices Coding
Lai, Hong; Luo, Ming-Xing; Pieprzyk, Josef; Tao, Li; Liu, Zhi-Ming; Orgun, Mehmet A.
2016-11-01
In this paper, we develop a large-capacity quantum digital secret sharing (QDSS) scheme, combined the Fibonacci- and Lucas-valued orbital angular momentum (OAM) entanglement with the recursive Fibonacci and Lucas matrices. To be exact, Alice prepares pairs of photons in the Fibonacci- and Lucas-valued OAM entangled states, and then allocates them to two participants, say, Bob and Charlie, to establish the secret key. Moreover, the available Fibonacci and Lucas values from the matching entangled states are used as the seed for generating the Fibonacci and Lucas matrices. This is achieved because the entries of the Fibonacci and Lucas matrices are recursive. The secret key can only be obtained jointly by Bob and Charlie, who can further recover the secret. Its security is based on the facts that nonorthogonal states are indistinguishable, and Bob or Charlie detects a Fibonacci number, there is still a twofold uncertainty for Charlie' (Bob') detected value. Supported by the Fundamental Research Funds for the Central Universities under Grant No. XDJK2016C043 and the Doctoral Program of Higher Education under Grant No. SWU115091, the National Natural Science Foundation of China under Grant No. 61303039, the Fundamental Research Funds for the Central Universities under Grant No. XDJK2015C153 and the Doctoral Program of Higher Education under Grant No. SWU114112, and the Financial Support the 1000-Plan of Chongqing by Southwest University under Grant No. SWU116007
Institute of Scientific and Technical Information of China (English)
YAN Hai-Qing; TANG Chen; LIU Ming; ZHANG Hao
2005-01-01
We present a global optimization method, called the real-code genetic algorithm (RGA), to the ground state energies. The proposed method does not require partial derivatives with respect to each variational parameter or solving an eigenequation, so the present method overcomes the major difficulties of the variational method. RGAs also do not require coding and encoding procedures, so the computation time and complexity are reduced. The ground state energies of hydrogenic donors in GaAs-(Ga,Al)As quantum dots have been calculated for a range of the radius of the quantum dot radii of practical interest. They are compared with those obtained by the variational method. The results obtained demonstrate the proposed method is simple, accurate, and easy implement.
Al-Khalili, Jim
2003-01-01
In this lively look at quantum science, a physicist takes you on an entertaining and enlightening journey through the basics of subatomic physics. Along the way, he examines the paradox of quantum mechanics--beautifully mathematical in theory but confoundingly unpredictable in the real world. Marvel at the Dual Slit experiment as a tiny atom passes through two separate openings at the same time. Ponder the peculiar communication of quantum particles, which can remain in touch no matter how far apart. Join the genius jewel thief as he carries out a quantum measurement on a diamond without ever touching the object in question. Baffle yourself with the bizzareness of quantum tunneling, the equivalent of traveling partway up a hill, only to disappear then reappear traveling down the opposite side. With its clean, colorful layout and conversational tone, this text will hook you into the conundrum that is quantum mechanics.
基于快速Jacket变换的量子纠错码%Quantum error-correction codes based on fast Jacket transform
Institute of Scientific and Technical Information of China (English)
黄成荣; 郭迎; 李门浩
2011-01-01
Motivated by the fast block Jacket transform based on Pauli matrices, this paper showed how block Jacket matrix could simplify the coding theory of quantum error-correction.Quantum Jacket codes (QJCs) did not require the dual-containing constraint necessary for standard quantum error-correction codes (QECCs), thus allowing to construct quantum codes of large block length with efficiency.These QJCs were generated from some Abelian subgroups of Pauli group that were composed of different rows of the yielded block Jacket matrix, and had advantages of being fast constructed with asymptotically good behaviors.%受到基于Pauli矩阵的快速Jacket变换的启发,提出一种利用分块Jacket矩阵简化量子纠错码编码方案的方法.与已有的量子纠错码构造法相比,在构造量子Jacket码的稳定子的时候,不需要检验经典纠错码的自对偶条件,因此,它能促使高效地利用由分块Jacket矩阵产生的Pauli矩阵群的Abelian子群直接生成辛内积为零的独立向量,在此基础上构造出码长较大、参数较好的量子纠错码.该量子Jacket码具有构造快速、纠错行为渐进好的优点.
From Quantum Cheating to Quantum Security
Gottesman, D; Gottesman, Daniel; Lo, Hoi-Kwong
2000-01-01
For thousands of years, code-makers and code-breakers have been competing for supremacy. Their arsenals may soon include a powerful new weapon: quantum mechanics. We give an overview of quantum cryptology as of November 2000.
Avis, Ingalill; Martínez, Alfredo; Tauler, Jordi; Zudaire, Enrique; Mayburd, Anatoly; Abu-Ghazaleh, Raed; Ondrey, Frank; Mulshine, James L
2005-05-15
Arachidonic acid (AA) metabolizing enzymes and peroxisome proliferator-activated receptors (PPARs) have been shown to regulate the growth of epithelial cells. We have previously reported that exposure to the 5-lipoxygenase activating protein-directed inhibitor MK886 but not the cyclooxygenase inhibitor, indomethacin, reduced growth, increased apoptosis, and up-regulated PPARalpha and gamma expression in breast cancer cell lines. In the present study, we explore approaches to maximizing the proapoptotic effects of PPARgamma on lung cancer cell lines. Non-small-cell cancer cell line A549 revealed dose-dependent PPARgamma reporter activity after treatment with MK886. The addition of indomethacin in combination with MK886 further increases reporter activity. We also show increased growth inhibition and up-regulation of apoptosis after exposure to MK886 alone, or in combination with indomethacin and the PPAR ligand, 15-deoxy-Delta12,14-prostaglandin J2 compared with single drug exposures on the adenocarcinoma cell line A549 and small-cell cancer cell lines H345, N417, and H510. Real-time PCR analyses showed increased PPAR mRNA and retinoid X receptor (RXR)alpha mRNA expression after exposure to MK886 and indomethacin in a time-dependent fashion. The results suggest that the principal proapoptotic effect of these drugs may be mediated through the known antiproliferative effects of the PPARgamma-RXR interaction. We therefore explored a three-drug approach to attempt to maximize this effect. The combination of low-dose MK886, ciglitazone, and 13-cis-retinoic acid interacted at least in a superadditive fashion to inhibit the growth of lung cancer cell lines A549 and H1299, suggesting that targeting PPARgamma and AA action is a promising approach to lung cancer growth with a favorable therapeutic index.
Latorre, Jose I
2015-01-01
There exists a remarkable four-qutrit state that carries absolute maximal entanglement in all its partitions. Employing this state, we construct a tensor network that delivers a holographic many body state, the H-code, where the physical properties of the boundary determine those of the bulk. This H-code is made of an even superposition of states whose relative Hamming distances are exponentially large with the size of the boundary. This property makes H-codes natural states for a quantum memory. H-codes exist on tori of definite sizes and get classified in three different sectors characterized by the sum of their qutrits on cycles wrapped through the boundaries of the system. We construct a parent Hamiltonian for the H-code which is highly non local and finally we compute the topological entanglement entropy of the H-code.
Quantum genetic algorithm based on multi-chain coding scheme%基于多链拓展编码方案的量子遗传算法
Institute of Scientific and Technical Information of China (English)
王之腾; 张宏军; 张睿; 邢英; 何健
2012-01-01
为了提高量子遗传算法的性能,提出了一种基于多链拓展编码方案的量子遗传算法.根据编码方案,将每个量子位分解为多个并列的基因,有效地拓展了搜索空间；结合编码方案提出量子更新策略,并引入了动态调整旋转角机制对个体进行更新,使用量子非门变异策略实现量子变异.仿真实验中,分析了使用不同变异概率[0,0.1,…,0.9,1]时对算法性能的影响,对比了分别使用普通量子遗传算法、双链编码方案、三链编码方案以及四链编码方案的量子遗传算法在优化函数极值问题时算法的性能.实验结果证明,通过增加基因链可以显著提高算法的性能,多链拓展编码方案可以提高量子遗传算法的性能,是有效的.%In order to improve the efficiency of the quantum genetic algorithm, this paper proposed a quantum genetic algorithm based on a expanded multi-chain coding scheme. The algorithm took qubit as chromosome. Each chromosome generated multiple and parallel gene chains which were mapping to multiple optimized solutions by separating qubit into multiple and parallel genes. The expanded genes chains expanded the searching space effectively and increased evolutionary rate for quantum genetic algorithm. It introduced the dynamic adjusting rotation angle mechanism to quantum rotation gate to guide individual e-volution and used quantum not-gate to prevent algorithm occurring premature convergence. The method further improved searching efficiency. In the simulation experiment, analysed the influence for the algorithm with different variation probability ( [0,0. 1 ,…,0. 9,1 ] )and used different code schemes to optimize extremal function. The simulation experiment result shows that it can obviously improve the efficiency of quantum genetic algorithm by adding gene chain, and the quantum genetic algorithm based on a expanded multi-chain coding scheme is efficient.
Steane, A M
1998-01-01
The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This review aims to summarise not just quantum computing, but the whole subject of quantum information theory. It turns out that information theory and quantum mechanics fit together very well. In order to explain their relationship, the review begins with an introduction to classical information theory and computer science, including Shannon's theorem, error correcting codes, Turing machines and computational complexity. The principles of quantum mechanics are then outlined, and the EPR experiment described. The EPR-Bell correlations, and quantum entanglement in general, form the essential new ingredient which distinguishes quantum from classical information theory, and, arguably, quantum from classical physics. Basic quantum information ideas are described, including key distribution, teleportation, data compression, quantum error correction, the universal quantum computer and qua...
非对称量子通道密集编码的安全直接通讯%Quantum Direct Communication with Non-symmetric Quantum Channel Superdense Coding
Institute of Scientific and Technical Information of China (English)
樊秋波; 郑贞今
2007-01-01
提出了一个利用非对称密集编码的直接通讯方案.在这个方案中,服务器把初始状态制备在两组正交基上,这样就可以防止其他人完美地复制这些量子态,提高方案的安全性.而且本方案是基于密集编码之上,大大提高了信息量的传输率.%A scheme of quantum direct communication using non-symmetric quantum channel superdense coding is proposed.In this scheme,the server prepares the initial states in two nonorthogonal basis sets which forbids any one to copy them perfectly,so the scheme is more secure.This scheme also has a higher capacity than other schemes,for using the ideas in non-symmetric quantum channel superdense coding.
Institute of Scientific and Technical Information of China (English)
LUO Ming-Xing; CHEN Xiu-Bo; DENG Yun; Yang Yi-Xian
2013-01-01
The semiquantum techniques have been explored recently to bridge the classical communications and the quantum communications.In this paper,we present one scheme to distribute the messages from one quantum participate to one weak quantum participate who can only measure the quantum states.It is proved to be robust by combining the classical coding encryption,quantum coding and other quantum techniques.
Non-Pauli observables for CWS codes
Santiago, Douglas F. G.; Portugal, Renato; Melo, Nolmar
2013-05-01
It is known that nonadditive quantum codes can have higher code dimensions than stabilizer codes for the same length and minimum distance. The class of codeword stabilized codes (CWS) provides tools to obtain new nonadditive quantum codes by reducing the problem to finding nonlinear classical codes. In this work, we establish some results on the kind of non-Pauli operators that can be used as observables in the decoding scheme of CWS codes and propose a procedure to obtain those observables.
Catalytic quantum error correction
Brun, T; Hsieh, M H; Brun, Todd; Devetak, Igor; Hsieh, Min-Hsiu
2006-01-01
We develop the theory of entanglement-assisted quantum error correcting (EAQEC) codes, a generalization of the stabilizer formalism to the setting in which the sender and receiver have access to pre-shared entanglement. Conventional stabilizer codes are equivalent to dual-containing symplectic codes. In contrast, EAQEC codes do not require the dual-containing condition, which greatly simplifies their construction. We show how any quaternary classical code can be made into a EAQEC code. In particular, efficient modern codes, like LDPC codes, which attain the Shannon capacity, can be made into EAQEC codes attaining the hashing bound. In a quantum computation setting, EAQEC codes give rise to catalytic quantum codes which maintain a region of inherited noiseless qubits. We also give an alternative construction of EAQEC codes by making classical entanglement assisted codes coherent.
Controlled information transmission of multi-dimensional quantum superdense coding%多维量子超密编码可控信息传输
Institute of Scientific and Technical Information of China (English)
蒋忠胜; 吕洪君; 解光军
2013-01-01
在量子信息传输过程中应减少作为量子信道的粒子数并尽量增加传输的信息,保证传输过程的安全和对传输信息过程进行有效控制.提出了一种多维量子编码的可控信息传输方案,首先Alice要和Bob对编码的信息制定一个规范,然后,Alice对粒子做幺正变换,接受者Bob对接收到的粒子进行测量,根据控制者Charlie发来的测量信息就可以知道Alice要传输的信息,这种量子信息传输粒子少,有一个控制者可对传输过程进行控制,所以易于实现,而且保证安全.%In the process of transferring quantum information,it is repuired to reduce the number of particles as the quantum channel and maximize the transmission of information,while the safety and control of the transmission procession must be ensured.A scheme of multi-dimensional quantum superdense coding controlled transmission of information was proposed.At first,Alice and Bob should make a standard for information that would be encoded,then Alice does unitary transformation to particles,Bob measures the received particles and obtains the information that Alice wants to transfer according to the information of Charlie sending.This kind of information transmission requires less transform particles,so it is easier to accomplish.There is a controller to control the transmission process for the safty.
Quantum memory in quantum cryptography
Mor, T
1999-01-01
[Shortened abstract:] This thesis investigates the importance of quantum memory in quantum cryptography, concentrating on quantum key distribution schemes. In the hands of an eavesdropper -- a quantum memory is a powerful tool, putting in question the security of quantum cryptography; Classical privacy amplification techniques, used to prove security against less powerful eavesdroppers, might not be effective when the eavesdropper can keep quantum states for a long time. In this work we suggest a possible direction for approaching this problem. We define strong attacks of this type, and show security against them, suggesting that quantum cryptography is secure. We start with a complete analysis regarding the information about a parity bit (since parity bits are used for privacy amplification). We use the results regarding the information on parity bits to prove security against very strong eavesdropping attacks, which uses quantum memories and all classical data (including error correction codes) to attack th...
Algebraic geometric codes with applications
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2007-01-01
The theory of linear error-correcting codes from algebraic geomet-ric curves (algebraic geometric (AG) codes or geometric Goppa codes) has been well-developed since the work of Goppa and Tsfasman, Vladut, and Zink in 1981-1982. In this paper we introduce to readers some recent progress in algebraic geometric codes and their applications in quantum error-correcting codes, secure multi-party computation and the construction of good binary codes.
Horodecki, R; Horodecki, M; Horodecki, K; Horodecki, Ryszard; Horodecki, Pawel; Horodecki, Michal; Horodecki, Karol
2007-01-01
All our former experience with application of quantum theory seems to say: {\\it what is predicted by quantum formalism must occur in laboratory}. But the essence of quantum formalism - entanglement, recognized by Einstein, Podolsky, Rosen and Schr\\"odinger - waited over 70 years to enter to laboratories as a new resource as real as energy. This holistic property of compound quantum systems, which involves nonclassical correlations between subsystems, is a potential for many quantum processes, including ``canonical'' ones: quantum cryptography, quantum teleportation and dense coding. However, it appeared that this new resource is very complex and difficult to detect. Being usually fragile to environment, it is robust against conceptual and mathematical tools, the task of which is to decipher its rich structure. This article reviews basic aspects of entanglement including its characterization, detection, distillation and quantifying. In particular, the authors discuss various manifestations of entanglement via ...
Probabilistic quantum error correction
Fern, J; Fern, Jesse; Terilla, John
2002-01-01
There are well known necessary and sufficient conditions for a quantum code to correct a set of errors. We study weaker conditions under which a quantum code may correct errors with probabilities that may be less than one. We work with stabilizer codes and as an application study how the nine qubit code, the seven qubit code, and the five qubit code perform when there are errors on more than one qubit. As a second application, we discuss the concept of syndrome quality and use it to suggest a way that quantum error correction can be practically improved.
Yan, Zhongdan; Gan, Ning; Zhang, Huairong; Wang, De; Qiao, Li; Cao, Yuting; Li, Tianhua; Hu, Futao
2015-09-15
A novel sandwich-hybridization assay for simultaneous electrochemical detection of multiple DNA targets related to human immune deficiency virus (HIV) and tuberculosis (TB) was developed based on the different quantum dots-PowerVision(TM) polymer nanotracers. The polymer nanotracers were respectively fabricated by immobilizing SH-labeled oligonucleotides (s-HIV or s-TB), which can partially hybrid with virus DNA (HIV or TB), on gold nanoparticles (Au NPs) and then modified with PowerVision(TM) (PV) polymer-encapsulated quantum dots (CdS or PbS) as signal tags. PV is a dendrimer enzyme linked polymer, which can immobilize abundant QDs to amplify the stripping voltammetry signals from the metal ions (Pb or Cd). The capture probes were prepared through the immobilization of SH-labeled oligonucleotides, which can complementary with HIV and TB DNA, on the magnetic Fe3O4@Au (GMPs) beads. After sandwich-hybridization, the polymer nanotracers together with HIV and TB DNA targets were simultaneously introduced onto the surface of GMPs. Then the two encoding metal ions (Cd(2+) and Pb(2+)) were used to differentiate two viruses DNA due to the different subsequent anodic stripping voltammetric peaks at -0.84 V (Cd) and -0.61 V (Pb). Because of the excellent signal amplification of the polymer nanotracers and the great specificity of DNA targets, this assay could detect targets DNA as low as 0.2 femtomolar and exhibited excellent selectivity with the dynamitic range from 0.5 fM to 500 pM. Those results demonstrated that this electrochemical coding assay has great potential in applications for screening more viruses DNA while changing the probes.
Quantum Advantage in Communication Networks
De, Aditi Sen
2011-01-01
Quantum channels are known to provide qualitatively better information transfer capacities over their classical counterparts. Examples include quantum cryptography, quantum dense coding, and quantum teleportation. This is a short review on paradigmatic quantum communication protocols in both bipartite as well as multipartite scenarios.
Application of Quantum Process Calculus to Higher Dimensional Quantum Protocols
Directory of Open Access Journals (Sweden)
Simon J. Gay
2014-07-01
Full Text Available We describe the use of quantum process calculus to describe and analyze quantum communication protocols, following the successful field of formal methods from classical computer science. We have extended the quantum process calculus to describe d-dimensional quantum systems, which has not been done before. We summarise the necessary theory in the generalisation of quantum gates and Bell states and use the theory to apply the quantum process calculus CQP to quantum protocols, namely qudit teleportation and superdense coding.
Quantum Steganography and Quantum Error-Correction
Shaw, Bilal A.
2010-01-01
Quantum error-correcting codes have been the cornerstone of research in quantum information science (QIS) for more than a decade. Without their conception, quantum computers would be a footnote in the history of science. When researchers embraced the idea that we live in a world where the effects of a noisy environment cannot completely be…
Quantum Steganography and Quantum Error-Correction
Shaw, Bilal A.
2010-01-01
Quantum error-correcting codes have been the cornerstone of research in quantum information science (QIS) for more than a decade. Without their conception, quantum computers would be a footnote in the history of science. When researchers embraced the idea that we live in a world where the effects of a noisy environment cannot completely be…
Energy Technology Data Exchange (ETDEWEB)
2016-11-18
There is a lack of state-of-the-art HPC simulation tools for simulating general quantum computing. Furthermore, there are no real software tools that integrate current quantum computers into existing classical HPC workflows. This product, the Quantum Virtual Machine (QVM), solves this problem by providing an extensible framework for pluggable virtual, or physical, quantum processing units (QPUs). It enables the execution of low level quantum assembly codes and returns the results of such executions.
Balázs, András
2006-08-01
A physical (affine Hilbert spaces) frame is developed for the discussion of the interdependence of the problem of the origin (symbolic assignment) of the genetic code and a possible endophysical (a kind of "internal") quantum measurement in an explicite way, following the general considerations of Balázs (Balázs, A., 2003. BioSystems 70, 43-54; Balázs, A., 2004a. BioSystems 73, 1-11). Using the Everett (a dynamic) interpretation of quantum mechanics, both the individual code assignment and the concatenated linear symbolism is discussed. It is concluded that there arises a skewed quantal probability field, with a natural dynamic non-linearity in codon assignment within the physical model adopted (essentially corresponding to a much discussed biochemical frame of self-catalyzed binding (charging) of t RNA like proto RNAs (ribozymes) with amino acids). This dynamic specific molecular complex assumption of individual code assignment, and the divergence of the code in relation to symbol concatenation, are discussed: our frame supports the former and interpret the latter as single-type codon (triplet), also unambiguous and extended assignment, selection in molecular evolution, corresponding to converging towards the fixedpoint of the internal dynamics of measurement, either in a protein- or RNA-world. In this respect, the general physical consequence is the introduction of a fourth rank semidiagonal energy tensor (see also Part II) ruling the internal dynamics as a non-linear in principle second-order one. It is inferred, as a summary, that if the problem under discussion could be expressed by the concepts of the Copenhagen interpretation of quantum mechanics in some yet not quite specified way, the matter would be particularly interesting with respect to both the origin of life and quantum mechanics, as a dynamically supported natural measurement-theoretical split between matter ("hardware") and (internal) symbolism ("software") aspects of living matter.
Roadmap to Majorana surface codes
Plugge, S.; Landau, L. A.; Sela, E.; Altland, A.; Flensberg, K.; Egger, R.
2016-11-01
Surface codes offer a very promising avenue towards fault-tolerant quantum computation. We argue that two-dimensional interacting networks of Majorana bound states in topological superconductor/semiconductor heterostructures hold several key advantages in that direction, concerning both the hardware realization and the actual operation of the code. We here discuss how topologically protected logical qubits in this Majorana surface code architecture can be defined, initialized, manipulated, and read out. All physical ingredients needed to implement these operations are routinely used in topologically trivial quantum devices. By means of quantum interference terms in linear conductance measurements, single-electron pumping protocols, and gate-tunable tunnel barriers, the full set of quantum gates required for universal quantum computation can be achieved. In particular, we show that designated multistep pumping sequences via tunnel-coupled quantum dots realize high-fidelity ancilla states for phase gates.
On the non-existence for quantum LDPC codes of type IEEE802.16e with rates 1/2 and 2/3B
2008-01-01
In this paper, we discuss a construction of CSS codes derived from pairs of practical irregular LDPC codes. Our design of irregular LDPC codes is based the design written in the standardization of IEEE802.16e. Our research has tried to make a CSS code with a pair of LDPC codes of type IEEE802.16e. To our regret, we proved that it was impossible to construct a CSS code if one of classical codes was of type IEEE802.16e with rate 1/2 and 2/3B. We would like to report the discussion on its imposs...
Controlling Quantum Information
Landahl, A J
2002-01-01
Quantum information science explores ways in which quantum physical laws can be harnessed to control the acquisition, transmission, protection, and processing of information. This field has seen explosive growth in the past several years from progress on both theoretical and experimental fronts. Essential to this endeavor are methods for controlling quantum information. In this thesis, I present three new approaches for controlling quantum information. First, I present a new protocol for continuously protecting unknown quantum states from noise. This protocol combines and expands ideas from the theories of quantum error correction and quantum feedback control. The result can outperform either approach by itself. I generalize this protocol to all known quantum stabilizer codes, and study its application to the three-qubit repetition code in detail via Monte Carlo simulations. Next, I present several new protocols for controlling quantum information that are fault-tolerant. These protocols require only local qu...
Nielsen, M A
1998-01-01
Quantum information theory is the study of the achievable limits of information processing within quantum mechanics. Many different types of information can be accommodated within quantum mechanics, including classical information, coherent quantum information, and entanglement. Exploring the rich variety of capabilities allowed by these types of information is the subject of quantum information theory, and of this Dissertation. In particular, I demonstrate several novel limits to the information processing ability of quantum mechanics. Results of especial interest include: the demonstration of limitations to the class of measurements which may be performed in quantum mechanics; a capacity theorem giving achievable limits to the transmission of classical information through a two-way noiseless quantum channel; resource bounds on distributed quantum computation; a new proof of the quantum noiseless channel coding theorem; an information-theoretic characterization of the conditions under which quantum error-cor...
Fowler, Austin G; McInnes, Angus L; Rabbani, Alimohammad
2012-01-01
Tailoring a fault-tolerant quantum error correction scheme to a specific physical architecture can be a laborious task. We describe a tool Autotune capable of analyzing and optimizing the classical processing for an arbitrary 2-D qubit architecture making use of arbitrary circuits implementing either the surface code or progressively generated slices of a 3-D topological cluster state with arbitrary stochastic error models for each quantum gate. Autotune is designed to facilitate precise study of the performance of real hardware running topological quantum error correction.
Bibliographic guide to the foundations of quantum mechanics and quantum information
Cabello, A
2000-01-01
This is a collection of references (papers, books, preprints, book reviews, Ph. D. thesis, patents, etc.), sorted alphabetically and (some of them) classified by subject, on foundations of quantum mechanics and quantum information. Specifically, it covers hidden variables (``no-go'' theorems, experiments), interpretations of quantum mechanics, entanglement, quantum effects (quantum Zeno effect, quantum erasure, ``interaction-free'' measurements, quantum ``non-demolition'' measurements), quantum information (cryptography, cloning, dense coding, teleportation), and quantum computation.
Quantum dense key distribution
Degiovanni, I P; Castelletto, S; Rastello, M L; Bovino, F A; Colla, A M; Castagnoli, G C
2004-01-01
This paper proposes a new protocol for quantum dense key distribution. This protocol embeds the benefits of a quantum dense coding and a quantum key distribution and is able to generate shared secret keys four times more efficiently than BB84 one. We hereinafter prove the security of this scheme against individual eavesdropping attacks, and we present preliminary experimental results, showing its feasibility.
Quantum Communication Scheme Using Non-symmetric Quantum Channel
Institute of Scientific and Technical Information of China (English)
CAO Hai-Jing; CHEN Zhong-Hua; SONG He-Shan
2008-01-01
A theoretical quantum communication scheme based on entanglement swapping and superdense coding is proposed with a 3-dimensional Bell state and 2-dimensional Bell state function as quantum channel quantum key distribution and quantum secure direct communication can be simultaneously accomplished in the scheme. The scheme is secure and has high source capacity. At last, we generalize the quantum communication scheme to d-dimensional quantum channel.
An algorithm for minimization of quantum cost
Banerjee, Anindita; Pathak, Anirban
2009-01-01
A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.
Quantum proofs for classical theorems
Drucker, A.; de Wolf, R.
2011-01-01
Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in diverse classical (non-quantum) areas, such as coding theory, communication complexity, and polynomial approximations. In this paper
Quantum Information An Introduction
Hayashi, Masahito
2006-01-01
Recently, quantum information theory has been developing through a fusion of results from various research fields. This requires that understanding of basic results on diverse topics, and derived from different disciplinary perspectives, is required for appreciating the overall picture. Intended to merge key topics from both the information-theoretic and quantum- mechanical viewpoints, this graduate-level textbook provides a unified viewpoint of quantum information theory and lucid explanations of those basic results, so that the reader fundamentally grasps advances and challenges. For example, advanced topics in quantum communication such as quantum teleportation, superdense coding, quantum state transmission (quantum error-correction), and quantum encryption especially benefit from this unified approach. Unlike earlier treatments, the text requires knowledge of only linear algebra, probability theory, and quantum mechanics, while it treats the topics of quantum hypothesis testing and the discrimination of q...
Introduction to quantum information science
Energy Technology Data Exchange (ETDEWEB)
Hayashi, Masahito [Nagoya Univ. (Japan). Graduate School of Mathematics; Ishizaka, Satoshi [Hiroshima Univ., Higashi-Hiroshima (Japan). Graduate School of Integrated Arts and Sciences; Kawachi, Akinori [Tokyo Institute of Technology (Japan). Dept. of Mathematical and Computing Sciences; Kimura, Gen [Shibaura Institute of Technology, Saitama (Japan). College of Systems Engineering and Science; Ogawa, Tomohiro [Univ. of Electro-Communications, Tokyo (Japan). Graduate School of Information Systems
2015-04-01
Presents the mathematical foundation for quantum information in a very didactic way. Summarizes all required mathematical knowledge in linear algebra. Supports teaching and learning with more than 100 exercises with solutions. Includes brief descriptions to recent results with references. This book presents the basics of quantum information, e.g., foundation of quantum theory, quantum algorithms, quantum entanglement, quantum entropies, quantum coding, quantum error correction and quantum cryptography. The required knowledge is only elementary calculus and linear algebra. This way the book can be understood by undergraduate students. In order to study quantum information, one usually has to study the foundation of quantum theory. This book describes it from more an operational viewpoint which is suitable for quantum information while traditional textbooks of quantum theory lack this viewpoint. The current book bases on Shor's algorithm, Grover's algorithm, Deutsch-Jozsa's algorithm as basic algorithms. To treat several topics in quantum information, this book covers several kinds of information quantities in quantum systems including von Neumann entropy. The limits of several kinds of quantum information processing are given. As important quantum protocols,this book contains quantum teleportation, quantum dense coding, quantum data compression. In particular conversion theory of entanglement via local operation and classical communication are treated too. This theory provides the quantification of entanglement, which coincides with von Neumann entropy. The next part treats the quantum hypothesis testing. The decision problem of two candidates of the unknown state are given. The asymptotic performance of this problem is characterized by information quantities. Using this result, the optimal performance of classical information transmission via noisy quantum channel is derived. Quantum information transmission via noisy quantum channel by quantum error
Brehm, Enrico M
2016-01-01
In this work, we introduce classical holographic codes. These can be understood as concatenated probabilistic codes and can be represented as networks uniformly covering hyperbolic space. In particular, classical holographic codes can be interpreted as maps from bulk degrees of freedom to boundary degrees of freedom. Interestingly, they are shown to exhibit features similar to those expected from the AdS/CFT correspondence. Among these are a version of the Ryu-Takayanagi formula and intriguing properties regarding bulk reconstruction and boundary representations of bulk operations. We discuss the relation of our findings with expectations from AdS/CFT and, in particular, with recent results from quantum error correction.
Layered Architecture for Quantum Computing
National Research Council Canada - National Science Library
Jones, N. Cody; Van Meter, Rodney; Fowler, Austin G; McMahon, Peter L; Kim, Jungsang; Ladd, Thaddeus D; Yamamoto, Yoshihisa
2012-01-01
.... We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface-code quantum error correction...
Coherence protection by random coding
Energy Technology Data Exchange (ETDEWEB)
Brion, E [Laboratoire Aime Cotton, CNRS II, Batiment 505, 91405 Orsay Cedex (France); Akulin, V M [Laboratoire Aime Cotton, CNRS II, Batiment 505, 91405 Orsay Cedex (France); Dumer, I [College of Engineering, University of California, Riverside, CA 92521 (United States); Harel, G [Spinoza Institute, Utrecht University, Leuvenlaan 4, 3508 TD Utrecht (Netherlands); Kurizki, G [Department of Chemical Physics, Weizmann Institute of Science, Rehovot 76100 (Israel)
2005-10-01
We show that the multidimensional Zeno effect combined with non-holonomic control allows one to efficiently protect quantum systems from decoherence by a method similar to classical random coding. The method is applicable to arbitrary error-inducing Hamiltonians and general quantum systems. The quantum encoding approaches the Hamming upper bound for large dimension increases. Applicability of the method is demonstrated with a seven-qubit toy computer.
Study on Quantum Error-Correcting Code in Electric Power System Communication%电力系统通信中量子纠错码应用研究
Institute of Scientific and Technical Information of China (English)
魏人杰; 周静
2012-01-01
The technique of quantum error correcting code(QECC) is the foundation of quantum information utility, and for introduction of quantum technology to power system, it's necessary to choose a coding scheme suitable for the overhead line of electric power system and the strong electromagnetic environment of transformer substation. This paper first describes the development history of QECC and then compares the four typical QECC schemes from the principles, advantages and disadvantages, practicability, and finally analyzes the special environment faced by power system communication as compared with that by public communication network. Quantum LDPC is regarded as a scheme suitable for power system communication.%量子纠错编码技术是量子信息实用化的技术基础，电力系统在引进量子技术的同时，需要首先选择适用于电力系统架空线路环境和变电站等高电磁干扰环境下的量子纠错编码方案。文中在介绍量子纠错编码发展历史的基础上，比较4种典型的量子纠错编码方案原理、优缺点、实用性，分析电力系统通信与公共通信网相比所具有的环境特殊性，量子LDPC码被认为是一种适用于电力系统通信的量子纠错编码方案。
Quantum information causality.
Pitalúa-García, Damián
2013-05-24
How much information can a transmitted physical system fundamentally communicate? We introduce the principle of quantum information causality, which states the maximum amount of quantum information that a quantum system can communicate as a function of its dimension, independently of any previously shared quantum physical resources. We present a new quantum information task, whose success probability is upper bounded by the new principle, and show that an optimal strategy to perform it combines the quantum teleportation and superdense coding protocols with a task that has classical inputs.
Quantum secure direct communication and deterministic secure quantum communication
Institute of Scientific and Technical Information of China (English)
LONG Gui-lu; DENG Fu-guo; WANG Chuan; LI Xi-han; WEN Kai; WANG Wan-ying
2007-01-01
In this review article,we review the recent development of quantum secure direct communication(QSDC)and deterministic secure quantum communication(DSQC) which both are used to transmit secret message,including the criteria for QSDC,some interesting QSDC protocols,the DSQC protocols and QSDC network,etc.The difference between these two branches of quantum Communication is that DSOC requires the two parties exchange at least one bit of classical information for reading out the message in each qubit,and QSDC does not.They are attractivebecause they are deterministic,in particular,the QSDC protocol is fully quantum mechanical.With sophisticated quantum technology in the future,the QSDC may become more and more popular.For ensuring the safety of QSDC with single photons and quantum information sharing of single qubit in a noisy channel,a quantum privacy amplification protocol has been proposed.It involves very simple CHC operations and reduces the information leakage to a negligible small level.Moreover,with the one-party quantum error correction,a relation has been established between classical linear codes and quantum one-party codes,hence it is convenient to transfer many good classical error correction codes to the quantum world.The one-party quantum error correction codes are especially designed for quantum dense coding and related QSDC protocols based on dense coding.
Quantum information theory mathematical foundation
Hayashi, Masahito
2017-01-01
This graduate textbook provides a unified view of quantum information theory. Clearly explaining the necessary mathematical basis, it merges key topics from both information-theoretic and quantum- mechanical viewpoints and provides lucid explanations of the basic results. Thanks to this unified approach, it makes accessible such advanced topics in quantum communication as quantum teleportation, superdense coding, quantum state transmission (quantum error-correction) and quantum encryption. Since the publication of the preceding book Quantum Information: An Introduction, there have been tremendous strides in the field of quantum information. In particular, the following topics – all of which are addressed here – made seen major advances: quantum state discrimination, quantum channel capacity, bipartite and multipartite entanglement, security analysis on quantum communication, reverse Shannon theorem and uncertainty relation. With regard to the analysis of quantum security, the present book employs an impro...
DEFF Research Database (Denmark)
Gauthier Umana, Valérie
The security of almost all the public-key cryptosystems used in practice depends on the fact that the prime factorization of a number and the discrete logarithm are hard problems to solve. In 1994, Peter Shor found a polynomial-time algorithm which solves these two problems using quantum computers....... The public key cryptosystems that can resist these emerging attacks are called quantum resistant or post-quantum cryptosystems. There are mainly four classes of public-key cryptography that are believed to resist classical and quantum attacks: code-based cryptography, hash-based cryptography, lattice......-cyclic alternant codes and quasi-dyadic codes (joint work with Gregor Leander). We also present a deterministic polynomial-time algorithm to solve the Goppa Code Distinguisher problem for high rate codes (joint work with Jean-Charles Faugere, Ayoub Otmani, Ludovic Perret and Jean-Pierre Tillich). In the second...
Institute of Scientific and Technical Information of China (English)
林毅; 何广强; 曾贵华
2013-01-01
密钥协商是量子密钥分配(QKD)的重要环节,影响着QKD的密钥率和安全距离.作为一种低信噪比时较为高效的密钥协商方案,多维协商算法被很好地应用在高斯调制连续变量QKD中,延长了通信距离.本文研究了二进制LDPC码在多维协商算法中的应用方案,进而扩展到多进制LDPC码.仿真表明,相比二进制LDPC码,利用多进制LDPC码能够使多维协商性能获得明显增益.%Secret key reconciliation is an important phase in quantum key distribution (QKD),which influences both the secret key rate and the speed of QKD.As an efficient reconciliation scheme under low SNR regime,multidimensional reconciliation scheme has been well adapted to the Gaussian-modulated continuous-variable QKD protocol and has extended the communication distance.We first investigate the application of binary LDPC Codes in the multidimensional reconciliation,and then extend to non-binary LDPC Codes.In the numerical simulations,we observe an obvious performace gain with our settings by using non-binary LDPC Codes,compared to binary LDPC Codes.
Wang, Guang-Li; Liu, Kang-Li; Shu, Jun-Xian; Gu, Tian-Tian; Wu, Xiu-Ming; Dong, Yu-Ming; Li, Zai-Jun
2015-07-15
Photocathode based on p-type PbS quantum dots (QDs) combing a novel signal amplification strategy utilizing catalase (CAT) mimetics was designed and utilized for sensitive photoelectrochemical (PEC) detection of DNA. The bio-bar-coded Pt nanoparticles (NPs)/G-quadruplex/hemin exhibited high CAT-like activity following the Michaelis-Menten model for decomposing H2O2 to water and oxygen, whose activity even slightly exceeded that of natural CAT. The bio-bar-code as a catalytic label was conjugated onto the surface of PbS QDs modified electrodes through the formed sandwich-type structure due to DNA hybridization. Oxygen in situ generated by the CAT mimetics of the bio-bar-code of Pt NPs/G-quadruplex/hemin acted as an efficient electron acceptor of illuminated PbS QDs, promoting charge separation and enhancing cathodic photocurrent. Under optimal conditions, the developed PEC biosensor for target DNA exhibited a dynamic range of 0.2pmol/L to 1.0nmol/L with a low detection limit of 0.08pmol/L. The high sensitivity of the method was resulted from the sensitive response of PbS QDs to oxygen and the highly efficient CAT-like catalytic activity of the bio-bar-coded Pt NPs/G-quadruplex/hemin.
Quantum Genetic Algorithm Based on Angle Coding of 3D%基于3D角度编码的量子遗传算法
Institute of Scientific and Technical Information of China (English)
钱国红; 黄德才
2012-01-01
为了充分利用量子态在算法中的量子特性,提高算法的搜索效率,减少存储空间,提出了一种基于3D角度编码的量子遗传算法.该算法将量子位描述为3D球面坐标下的一对相位角,充分利用了量子的空间运动特性,并引入一种自适应旋转角大小和方向的确定方案,从而进一步简化了染色体的更新和变异过程,而且使算法的量子特性、存储性能、时间性能都得到很大的提高.仿真结果表明,其在算法优化效率和搜索能力上都优于简单遗传算法和普通量子遗传算法.%In order to make full use of the quantum characteristics of the quantum state in the algorithm, and improve the search efficiency,reduce storage space,a new quantum genetic algorithm called 3D-AQGA was proposed. The algorithm describes quantum bit as a pair of angles in 3D spherical coordinate, makes full use of the quantum space motion characteristics,and introduces a kind of adaptive scheme to calculate the rotation angle size and direction which not only makes the process of chromosome's update and variation simplified,but also improves quantum characteristics,storage properties and time performance of the algorithm greatly . The simulation results show that the efficiency of the algorithm and the search ability are superior to the simple genetic algorithm and common quantum genetic algorithm.
Foundations of quantum theory and quantum information applications
Galvão, E F
2002-01-01
This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement characterisation, and of a few quantum information protocols. Quantum non-locality and contextuality are shown to be essential for different implementations of quantum information protocols known as quantum random access codes and quantum communication complexity protocols. I derive sufficient experimental conditions for tests of these quantum properties. I also discuss how the distribution of quantum information through quantum cloning processes can be useful in quantum computing. Regarding entanglement characterisation, some results are obtained relating two problems, that of additivity of the relative entropy of entanglement, and that of identifying different types of tripartite entanglement in the asymptotic regime of manipulations of many copies of a given state. The thesis end...
Code properties from holographic geometries
Pastawski, Fernando
2016-01-01
Almheiri, Dong, and Harlow [hep-th/1411.7041] proposed a highly illuminating connection between the AdS/CFT holographic correspondence and operator algebra quantum error correction (OAQEC). Here we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes which admit a holographic interpretation. We introduce a new quantity called `price', which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit `uberholography', meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for q...
Transversal Clifford gates on folded surface codes
Moussa, Jonathan E.
2016-10-01
Surface and color codes are two forms of topological quantum error correction in two spatial dimensions with complementary properties. Surface codes have lower-depth error detection circuits and well-developed decoders to interpret and correct errors, while color codes have transversal Clifford gates and better code efficiency in the number of physical qubits needed to achieve a given code distance. A formal equivalence exists between color codes and folded surface codes, but it does not guarantee the transferability of any of these favorable properties. However, the equivalence does imply the existence of constant-depth circuit implementations of logical Clifford gates on folded surface codes. We achieve and improve this result by constructing two families of folded surface codes with transversal Clifford gates. This construction is presented generally for qudits of any dimension. The specific application of these codes to universal quantum computation based on qubit fusion is also discussed.
Function Optimization Based on Quantum Genetic Algorithm
Ying Sun; Hegen Xiong
2014-01-01
Optimization method is important in engineering design and application. Quantum genetic algorithm has the characteristics of good population diversity, rapid convergence and good global search capability and so on. It combines quantum algorithm with genetic algorithm. A novel quantum genetic algorithm is proposed, which is called Variable-boundary-coded Quantum Genetic Algorithm (vbQGA) in which qubit chromosomes are collapsed into variable-boundary-coded chromosomes instead of binary-coded c...
Function Optimization Based on Quantum Genetic Algorithm
Ying Sun; Yuesheng Gu; Hegen Xiong
2013-01-01
Quantum genetic algorithm has the characteristics of good population diversity, rapid convergence and good global search capability and so on.It combines quantum algorithm with genetic algorithm. A novel quantum genetic algorithm is proposed ,which is called variable-boundary-coded quantum genetic algorithm (vbQGA) in which qubit chromosomes are collapsed into variableboundary- coded chromosomes instead of binary-coded chromosomes. Therefore much shorter chromosome strings can be gained.The m...
Codes in W*-Metric Spaces: Theory and Examples
Bumgardner, Christopher J.
2011-01-01
We introduce a "W*"-metric space, which is a particular approach to non-commutative metric spaces where a "quantum metric" is defined on a von Neumann algebra. We generalize the notion of a quantum code and quantum error correction to the setting of finite dimensional "W*"-metric spaces, which includes codes and error correction for classical…
Quantum Digital Signature based on quantum one-way functions
Lü, X; L\\"u, Xin; Feng, Deng-Guo
2004-01-01
A quantum digital signature protocol based on quantum mechanics is proposed in this paper. The security of the protocol relies on the existence of quantum one-way functions by quantum information theorem. This protocol involves a so-called arbitrator who validates and authenticates the signed message. In this protocol, we use privacy key algorithm to ensure the security of quantum information on channel and use quantum public keys to sign message. To guarantee the authenticity of the message, a family of quantum stabilizer codes are employed. Our protocol presents a novel method to construct ultimately secure digital system in future secure communication.
Quantum Error Correction Protects Quantum Search Algorithms Against Decoherence.
Botsinis, Panagiotis; Babar, Zunaira; Alanis, Dimitrios; Chandra, Daryus; Nguyen, Hung; Ng, Soon Xin; Hanzo, Lajos
2016-12-07
When quantum computing becomes a wide-spread commercial reality, Quantum Search Algorithms (QSA) and especially Grover's QSA will inevitably be one of their main applications, constituting their cornerstone. Most of the literature assumes that the quantum circuits are free from decoherence. Practically, decoherence will remain unavoidable as is the Gaussian noise of classic circuits imposed by the Brownian motion of electrons, hence it may have to be mitigated. In this contribution, we investigate the effect of quantum noise on the performance of QSAs, in terms of their success probability as a function of the database size to be searched, when decoherence is modelled by depolarizing channels' deleterious effects imposed on the quantum gates. Moreover, we employ quantum error correction codes for limiting the effects of quantum noise and for correcting quantum flips. More specifically, we demonstrate that, when we search for a single solution in a database having 4096 entries using Grover's QSA at an aggressive depolarizing probability of 10(-3), the success probability of the search is 0.22 when no quantum coding is used, which is improved to 0.96 when Steane's quantum error correction code is employed. Finally, apart from Steane's code, the employment of Quantum Bose-Chaudhuri-Hocquenghem (QBCH) codes is also considered.
Quantum Error Correction Protects Quantum Search Algorithms Against Decoherence
Botsinis, Panagiotis; Babar, Zunaira; Alanis, Dimitrios; Chandra, Daryus; Nguyen, Hung; Ng, Soon Xin; Hanzo, Lajos
2016-12-01
When quantum computing becomes a wide-spread commercial reality, Quantum Search Algorithms (QSA) and especially Grover’s QSA will inevitably be one of their main applications, constituting their cornerstone. Most of the literature assumes that the quantum circuits are free from decoherence. Practically, decoherence will remain unavoidable as is the Gaussian noise of classic circuits imposed by the Brownian motion of electrons, hence it may have to be mitigated. In this contribution, we investigate the effect of quantum noise on the performance of QSAs, in terms of their success probability as a function of the database size to be searched, when decoherence is modelled by depolarizing channels’ deleterious effects imposed on the quantum gates. Moreover, we employ quantum error correction codes for limiting the effects of quantum noise and for correcting quantum flips. More specifically, we demonstrate that, when we search for a single solution in a database having 4096 entries using Grover’s QSA at an aggressive depolarizing probability of 10-3, the success probability of the search is 0.22 when no quantum coding is used, which is improved to 0.96 when Steane’s quantum error correction code is employed. Finally, apart from Steane’s code, the employment of Quantum Bose-Chaudhuri-Hocquenghem (QBCH) codes is also considered.
Operational interpretations of quantum discord
Cavalcanti, D; Boixo, S; Modi, K; Piani, M; Winter, A
2010-01-01
Quantum discord is a quantifier of non-classical correlations that goes beyond the standard classification of quantum states into entangled and unentangled ones. Although it has received considerable attention, it still lacks any precise interpretation in terms of some protocol in which quantum features are relevant. Here we give quantum discord its first operational meaning in terms on consumption of entanglement in an extended quantum state merging protocol. We go on to show that the asymmetry of quantum discord is related to the performance imbalance in quantum state merging and dense coding.
Quantum Superdense Coding Scheme Based on High-dimensional Two-particles System%基于高维两粒子纠缠态的超密编码方案
Institute of Scientific and Technical Information of China (English)
黄平武; 周萍; 农亮勤; 何良明; 尹彩流
2011-01-01
基于通信双方预先共享d维二粒子最大纠缠态非定域相关性,信息发送方Bob只需要向信息接收者Alice传送一个粒子,就可以传送log22比特经典信息,为保护信息的安全,方案采用诱骗光子技术,安全性等价于改进后的原始量子密钥分配方案(Bennett-Brassard 1984,BB84).本文讨论了基于高维纯纠缠态超密编码方案.即通过引入一个附加量子比特,信息接收方对手中的纠缠粒子和附加粒子在执行相应的幺正演化,可以获取d|ak|2 logd2 +logd2(ak=min{aj},j ∈ {O,L,d-1})比特经典信息.通信双方采用诱骗光子技术确保量子信道的安全建立.与其他方案相比,该方案具有通信效率较高、实用性较强的优点.%The author presents a generalized superdense coding scheme based on high-dimensional two particles maximally entangled state following some ideas of superdense coding scheme based on fourdimensional two particles. The quantum superdense coding based on noisy quantum channel was discussed. The receiver(Alice)can extract d｜αk｜2 logdj2 + log2d (αk = min {α}, j ∈ {0,L,d-1 } ) bits classic information by introducing one auxiliary two-level particle and perfprming corresponding unitray operation on her particles. All the parties can use some decoy photons to set up their quantum channel securely. The scheme only requires pure entangled state, which makes this scheme more convenient than others in practical application. Moreover, it has the advantage of having high communication efficiency.
Klimov, A. N.; Kulik, S. P.; Molotkov, S. N.; Potapova, T. A.
2017-03-01
In the paper by Gleim et al (2016 Opt. Express 24 2619), it was declared that the system of quantum cryptography, exploiting quantum key distribution (QKD) protocol BB84 with the additional reference state and encoding in a sub-carrier, is able to distribute secret keys at a distance of 210 km. The following shows that a simple attack realized with a beam splitter results in a loss of privacy of the keys over substantially smaller distances. It turns out that the actual length of the secret key transmission for the QKD system encoding in the sub-carrier frequency is ten times less than that declared in Gleim et al (2016 Opt. Express 24 2619). Therefore it is impossible to safely use the keys when distributed at a larger length of the communication channel than shown below. The maximum communication distance does not exceed 22 km, even in the most optimistic scenario.
Quantum Steganography and Quantum Error-Correction
Shaw, Bilal A
2010-01-01
In the current thesis we first talk about the six-qubit quantum error-correcting code and show its connections to entanglement-assisted error-correcting coding theory and then to subsystem codes. This code bridges the gap between the five-qubit (perfect) and Steane codes. We discuss two methods to encode one qubit into six physical qubits. Each of the two examples corrects an arbitrary single-qubit error. The first example is a degenerate six-qubit quantum error-correcting code. We prove that a six-qubit code without entanglement assistance cannot simultaneously possess a Calderbank-Shor-Steane (CSS) stabilizer and correct an arbitrary single-qubit error. A corollary of this result is that the Steane seven-qubit code is the smallest single-error correcting CSS code. Our second example is the construction of a non-degenerate six-qubit CSS entanglement-assisted code. This code uses one bit of entanglement (an ebit) shared between the sender (Alice) and the receiver (Bob) and corrects an arbitrary single-qubit e...
Directory of Open Access Journals (Sweden)
Fabio Burderi
2007-05-01
Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.
A Remote Quantum Adding Machine
Institute of Scientific and Technical Information of China (English)
张圣醒; 龙桂鲁; 刘晓曙
2002-01-01
We design a scheme to perform additions of N remote addends. This adder is useful for some quantum information processing purposes, such as statistics and multi-party quantum game. The quantum remote adder is constructed by using a multi-party superdense coding scheme.
Resource Letter QI-1: Quantum Information
Strauch, Frederick W.
2016-07-01
This Resource Letter surveys the history and modern developments in the field of quantum information. It is written to guide advanced undergraduates, beginning graduate students, and other new researchers to the theoretical and experimental aspects of this field. The topics covered include quantum states and processes, quantum coding and cryptography, quantum computation, the experimental implementation of quantum information processing, and the role of quantum information in the fundamental properties and foundations of physical theories.
Quantum Information Theory - an Invitation
Werner, R. F.
2001-01-01
We give a non-technical introduction of the basic concepts of Quantum Information Theory along the distinction between possible and impossible machines. We then proceed to describe the mathematical framework of Quantum Information Theory. The capacities of a quantum channel for classical and for quantum information are defined in a unified scheme, and a mathematical characterization of all teleportation and dense coding schemes is given.
Superdense Coding Interleaved with Forward Error Correction
Directory of Open Access Journals (Sweden)
Sadlier Ronald J.
2016-01-01
Full Text Available Superdense coding promises increased classical capacity and communication security but this advantage may be undermined by noise in the quantum channel. We present a numerical study of how forward error correction (FEC applied to the encoded classical message can be used to mitigate against quantum channel noise. By studying the bit error rate under different FEC codes, we identify the unique role that burst errors play in superdense coding, and we show how these can be mitigated against by interleaving the FEC codewords prior to transmission. We conclude that classical FEC with interleaving is a useful method to improve the performance in near-term demonstrations of superdense coding.
Kubilius, Jonas
2014-01-01
Sharing code is becoming increasingly important in the wake of Open Science. In this review I describe and compare two popular code-sharing utilities, GitHub and Open Science Framework (OSF). GitHub is a mature, industry-standard tool but lacks focus towards researchers. In comparison, OSF offers a one-stop solution for researchers but a lot of functionality is still under development. I conclude by listing alternative lesser-known tools for code and materials sharing.
Quantum steganography using prior entanglement
Energy Technology Data Exchange (ETDEWEB)
Mihara, Takashi, E-mail: mihara@toyo.jp
2015-06-05
Steganography is the hiding of secret information within innocent-looking information (e.g., text, audio, image, video, etc.). A quantum version of steganography is a method based on quantum physics. In this paper, we propose quantum steganography by combining quantum error-correcting codes with prior entanglement. In many steganographic techniques, embedding secret messages in error-correcting codes may cause damage to them if the embedded part is corrupted. However, our proposed steganography can separately create secret messages and the content of cover messages. The intrinsic form of the cover message does not have to be modified for embedding secret messages. - Highlights: • Our steganography combines quantum error-correcting codes with prior entanglement. • Our steganography can separately create secret messages and the content of cover messages. • Errors in cover messages do not have affect the recovery of secret messages. • We embed a secret message in the Steane code as an example of our steganography.
Toric Codes, Multiplicative Structure and Decoding
DEFF Research Database (Denmark)
Hansen, Johan Peder
2017-01-01
Long linear codes constructed from toric varieties over finite fields, their multiplicative structure and decoding. The main theme is the inherent multiplicative structure on toric codes. The multiplicative structure allows for \\emph{decoding}, resembling the decoding of Reed-Solomon codes...... and aligns with decoding by error correcting pairs. We have used the multiplicative structure on toric codes to construct linear secret sharing schemes with \\emph{strong multiplication} via Massey's construction generalizing the Shamir Linear secret sharing shemes constructed from Reed-Solomon codes. We have...... constructed quantum error correcting codes from toric surfaces by the Calderbank-Shor-Steane method....
Multiplexed CV quantum teleportation for high rates in quantum communication
Christ, Andreas; Silberhorn, Christine
2012-01-01
A major challenge of today's quantum communication systems lies in the transmission of quantum information with high rates over long distances in the presence of unavoidable losses. Thereby the achievable quantum communication rate is fundamentally limited by the amount of energy that can be transmitted per use of the channel. It is hence vital to develop quantum communication protocols which encode quantum information as energy efficiently as possible. To this aim we investigate continuous-variable quantum teleportation as a method of distributing quantum information. We explore the possibility to encode information on multiple optical modes and derive upper and lower bounds on the achievable quantum channel capacities. This analysis enables us to benchmark single-mode vs. multi-mode entanglement resources. Our research reveals that multiplexing does not only feature an enhanced energy efficiency, significantly increasing the achievable quantum communication rates in comparison to single-mode coding, but als...
Evolving Quantum Oracles with Hybrid Quantum-inspired Evolutionary Algorithm
Ding, S; Yang, Q; Ding, Shengchao; Jin, Zhi; Yang, Qing
2006-01-01
Quantum oracles play key roles in the studies of quantum computation and quantum information. But implementing quantum oracles efficiently with universal quantum gates is a hard work. Motivated by genetic programming, this paper proposes a novel approach to evolve quantum oracles with a hybrid quantum-inspired evolutionary algorithm. The approach codes quantum circuits with numerical values and combines the cost and correctness of quantum circuits into the fitness function. To speed up the calculation of matrix multiplication in the evaluation of individuals, a fast algorithm of matrix multiplication with Kronecker product is also presented. The experiments show the validity and the effects of some parameters of the presented approach. And some characteristics of the novel approach are discussed too.
Shaw, Bilal A
2010-01-01
Steganography is the process of hiding secret information by embedding it in an "innocent" message. We present protocols for hiding quantum information in a codeword of a quantum error-correcting code passing through a channel. Using either a shared classical secret key or shared entanglement the sender (Alice) disguises her information as errors in the channel. The receiver (Bob) can retrieve the hidden information, but an eavesdropper (Eve) with the power to monitor the channel, but without the secret key, cannot distinguish the message from channel noise. We analyze how difficult it is for Eve to detect the presence of secret messages, and estimate rates of steganographic communication and secret key consumption for certain protocols.
DEFF Research Database (Denmark)
Cox, Geoff
Speaking Code begins by invoking the “Hello World” convention used by programmers when learning a new language, helping to establish the interplay of text and code that runs through the book. Interweaving the voice of critical writing from the humanities with the tradition of computing and software...
2014-12-01
QPSK Gaussian channels . .......................................................................... 39 vi 1. INTRODUCTION Forward error correction (FEC...Capacity of BSC. 7 Figure 5. Capacity of AWGN channel . 8 4. INTRODUCTION TO POLAR CODES Polar codes were introduced by E. Arikan in [1]. This paper...Under authority of C. A. Wilgenbusch, Head ISR Division EXECUTIVE SUMMARY This report describes the results of the project “More reliable wireless
Code Properties from Holographic Geometries
Pastawski, Fernando; Preskill, John
2017-04-01
Almheiri, Dong, and Harlow [J. High Energy Phys. 04 (2015) 163., 10.1007/JHEP04(2015)163] proposed a highly illuminating connection between the AdS /CFT holographic correspondence and operator algebra quantum error correction (OAQEC). Here, we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes that admit a holographic interpretation. We introduce a new quantity called price, which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit uberholography, meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for quantum gravity in AdS space at distance scales that are small compared to the AdS curvature radius.
Code Properties from Holographic Geometries
Directory of Open Access Journals (Sweden)
Fernando Pastawski
2017-05-01
Full Text Available Almheiri, Dong, and Harlow [J. High Energy Phys. 04 (2015 163.JHEPFG1029-847910.1007/JHEP04(2015163] proposed a highly illuminating connection between the AdS/CFT holographic correspondence and operator algebra quantum error correction (OAQEC. Here, we explore this connection further. We derive some general results about OAQEC, as well as results that apply specifically to quantum codes that admit a holographic interpretation. We introduce a new quantity called price, which characterizes the support of a protected logical system, and find constraints on the price and the distance for logical subalgebras of quantum codes. We show that holographic codes defined on bulk manifolds with asymptotically negative curvature exhibit uberholography, meaning that a bulk logical algebra can be supported on a boundary region with a fractal structure. We argue that, for holographic codes defined on bulk manifolds with asymptotically flat or positive curvature, the boundary physics must be highly nonlocal, an observation with potential implications for black holes and for quantum gravity in AdS space at distance scales that are small compared to the AdS curvature radius.
Wilde, Mark M
2017-01-01
Developing many of the major, exciting, pre- and post-millennium developments from the ground up, this book is an ideal entry point for graduate students into quantum information theory. Significant attention is given to quantum mechanics for quantum information theory, and careful studies of the important protocols of teleportation, superdense coding, and entanglement distribution are presented. In this new edition, readers can expect to find over 100 pages of new material, including detailed discussions of Bell's theorem, the CHSH game, Tsirelson's theorem, the axiomatic approach to quantum channels, the definition of the diamond norm and its interpretation, and a proof of the Choi–Kraus theorem. Discussion of the importance of the quantum dynamic capacity formula has been completely revised, and many new exercises and references have been added. This new edition will be welcomed by the upcoming generation of quantum information theorists and the already established community of classical information theo...
Superdense Coding via Hot Trapped Ions
Institute of Scientific and Technical Information of China (English)
QIN Tao; FENG Mang; GAO Ke-Lin
2004-01-01
Superdense coding plays an important role in quantum information and can be performed with trapped ions. By confining the ions in a linear trap or a trap-cavity setup, we propose schemes to implement a reliable superdense coding by means of bichromatic radiation method. Experimental feasibility and reliability for achieving our schemes is discussed in detail.
Piron, R.; Blenski, T.
2011-02-01
The numerical code VAAQP (variational average atom in quantum plasmas), which is based on a fully variational model of equilibrium dense plasmas, is applied to equation-of-state calculations for aluminum, iron, copper, and lead in the warm-dense-matter regime. VAAQP does not impose the neutrality of the Wigner-Seitz ion sphere; it provides the average-atom structure and the mean ionization self-consistently from the solution of the variational equations. The formula used for the electronic pressure is simple and does not require any numerical differentiation. In this paper, the virial theorem is derived in both nonrelativistic and relativistic versions of the model. This theorem allows one to express the electron pressure as a combination of the electron kinetic and interaction energies. It is shown that the model fulfills automatically the virial theorem in the case of local-density approximations to the exchange-correlation free-energy. Applications of the model to the equation-of-state and Hugoniot shock adiabat of aluminum, iron, copper, and lead in the warm-dense-matter regime are presented. Comparisons with other approaches, including the inferno model, and with available experimental data are given. This work allows one to understand the thermodynamic consistency issues in the existing average-atom models. Starting from the case of aluminum, a comparative study of the thermodynamic consistency of the models is proposed. A preliminary study of the validity domain of the inferno model is also included.
Piron, R; Blenski, T
2011-02-01
The numerical code VAAQP (variational average atom in quantum plasmas), which is based on a fully variational model of equilibrium dense plasmas, is applied to equation-of-state calculations for aluminum, iron, copper, and lead in the warm-dense-matter regime. VAAQP does not impose the neutrality of the Wigner-Seitz ion sphere; it provides the average-atom structure and the mean ionization self-consistently from the solution of the variational equations. The formula used for the electronic pressure is simple and does not require any numerical differentiation. In this paper, the virial theorem is derived in both nonrelativistic and relativistic versions of the model. This theorem allows one to express the electron pressure as a combination of the electron kinetic and interaction energies. It is shown that the model fulfills automatically the virial theorem in the case of local-density approximations to the exchange-correlation free-energy. Applications of the model to the equation-of-state and Hugoniot shock adiabat of aluminum, iron, copper, and lead in the warm-dense-matter regime are presented. Comparisons with other approaches, including the inferno model, and with available experimental data are given. This work allows one to understand the thermodynamic consistency issues in the existing average-atom models. Starting from the case of aluminum, a comparative study of the thermodynamic consistency of the models is proposed. A preliminary study of the validity domain of the inferno model is also included.
Topics in quantum cryptography, quantum error correction, and channel simulation
Luo, Zhicheng
In this thesis, we mainly investigate four different topics: efficiently implementable codes for quantum key expansion [51], quantum error-correcting codes based on privacy amplification [48], private classical capacity of quantum channels [44], and classical channel simulation with quantum side information [49, 50]. For the first topic, we propose an efficiently implementable quantum key expansion protocol, capable of increasing the size of a pre-shared secret key by a constant factor. Previously, the Shor-Preskill proof [64] of the security of the Bennett-Brassard 1984 (BB84) [6] quantum key distribution protocol relied on the theoretical existence of good classical error-correcting codes with the "dual-containing" property. But the explicit and efficiently decodable construction of such codes is unknown. We show that we can lift the dual-containing constraint by employing the non-dual-containing codes with excellent performance and efficient decoding algorithms. For the second topic, we propose a construction of Calderbank-Shor-Steane (CSS) [19, 68] quantum error-correcting codes, which are originally based on pairs of mutually dual-containing classical codes, by combining a classical code with a two-universal hash function. We show, using the results of Renner and Koenig [57], that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. For the third topic, we prove a regularized formula for the secret key assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes the private classical communication without the assisted secret keys as a child protocol. For the fourth topic, we study and solve the problem of classical channel
Optical implementation of a unitarily correctable code
Schreiter, K. M.; Pasieka, A.; Kaltenbaek, R.; Resch, K. J.; Kribs, D. W.
2009-08-01
Noise poses a challenge for any real-world implementation in quantum information science. The theory of quantum error correction deals with this problem via methods to encode and recover quantum information in a way that is resilient against that noise. Unitarily correctable codes are an error correction technique wherein a single unitary recovery operation is applied without the need for an ancilla Hilbert space. Here, we present an optical implementation of a nontrivial unitarily correctable code for a noisy quantum channel with no decoherence-free subspaces or noiseless subsystems. We show that recovery of our initial states is achieved with high fidelity (≥0.97) , quantitatively proving the efficacy of this unitarily correctable code.
Optimal superdense coding over memory channels
Energy Technology Data Exchange (ETDEWEB)
Shadman, Z.; Kampermann, H.; Bruss, D.; Macchiavello, C. [Institute fuer Theoretische Physik III, Heinrich-Heine-Universitaet Duesseldorf, DE-40225 Duesseldorf (Germany); Dipartimento di Fisica ' ' A. Volta' ' and INFM-Unita di Pavia, Via Bassi 6, IT-27100 Pavia (Italy)
2011-10-15
We study the superdense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and nonunitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The superdense coding capacity for some special channels and resource states is derived for unitary encoding. We also provide an example of a memory channel where nonunitary encoding leads to an improvement in the superdense coding capacity.
Computer Code for Nanostructure Simulation
Filikhin, Igor; Vlahovic, Branislav
2009-01-01
Due to their small size, nanostructures can have stress and thermal gradients that are larger than any macroscopic analogue. These gradients can lead to specific regions that are susceptible to failure via processes such as plastic deformation by dislocation emission, chemical debonding, and interfacial alloying. A program has been developed that rigorously simulates and predicts optoelectronic properties of nanostructures of virtually any geometrical complexity and material composition. It can be used in simulations of energy level structure, wave functions, density of states of spatially configured phonon-coupled electrons, excitons in quantum dots, quantum rings, quantum ring complexes, and more. The code can be used to calculate stress distributions and thermal transport properties for a variety of nanostructures and interfaces, transport and scattering at nanoscale interfaces and surfaces under various stress states, and alloy compositional gradients. The code allows users to perform modeling of charge transport processes through quantum-dot (QD) arrays as functions of inter-dot distance, array order versus disorder, QD orientation, shape, size, and chemical composition for applications in photovoltaics and physical properties of QD-based biochemical sensors. The code can be used to study the hot exciton formation/relation dynamics in arrays of QDs of different shapes and sizes at different temperatures. It also can be used to understand the relation among the deposition parameters and inherent stresses, strain deformation, heat flow, and failure of nanostructures.
Quantum Computing over Finite Fields
James, Roshan P; Sabry, Amr
2011-01-01
In recent work, Benjamin Schumacher and Michael~D. Westmoreland investigate a version of quantum mechanics which they call "modal quantum theory" but which we prefer to call "discrete quantum theory". This theory is obtained by instantiating the mathematical framework of Hilbert spaces with a finite field instead of the field of complex numbers. This instantiation collapses much the structure of actual quantum mechanics but retains several of its distinguishing characteristics including the notions of superposition, interference, and entanglement. Furthermore, discrete quantum theory excludes local hidden variable models, has a no-cloning theorem, and can express natural counterparts of quantum information protocols such as superdense coding and teleportation. Our first result is to distill a model of discrete quantum computing from this quantum theory. The model is expressed using a monadic metalanguage built on top of a universal reversible language for finite computations, and hence is directly implementab...
Energy Technology Data Exchange (ETDEWEB)
Ravishankar, C., Hughes Network Systems, Germantown, MD
1998-05-08
Speech is the predominant means of communication between human beings and since the invention of the telephone by Alexander Graham Bell in 1876, speech services have remained to be the core service in almost all telecommunication systems. Original analog methods of telephony had the disadvantage of speech signal getting corrupted by noise, cross-talk and distortion Long haul transmissions which use repeaters to compensate for the loss in signal strength on transmission links also increase the associated noise and distortion. On the other hand digital transmission is relatively immune to noise, cross-talk and distortion primarily because of the capability to faithfully regenerate digital signal at each repeater purely based on a binary decision. Hence end-to-end performance of the digital link essentially becomes independent of the length and operating frequency bands of the link Hence from a transmission point of view digital transmission has been the preferred approach due to its higher immunity to noise. The need to carry digital speech became extremely important from a service provision point of view as well. Modem requirements have introduced the need for robust, flexible and secure services that can carry a multitude of signal types (such as voice, data and video) without a fundamental change in infrastructure. Such a requirement could not have been easily met without the advent of digital transmission systems, thereby requiring speech to be coded digitally. The term Speech Coding is often referred to techniques that represent or code speech signals either directly as a waveform or as a set of parameters by analyzing the speech signal. In either case, the codes are transmitted to the distant end where speech is reconstructed or synthesized using the received set of codes. A more generic term that is applicable to these techniques that is often interchangeably used with speech coding is the term voice coding. This term is more generic in the sense that the
Surface code implementation of block code state distillation
Fowler, Austin G.; Devitt, Simon J.; Jones, Cody
2013-01-01
State distillation is the process of taking a number of imperfect copies of a particular quantum state and producing fewer better copies. Until recently, the lowest overhead method of distilling states produced a single improved |A〉 state given 15 input copies. New block code state distillation methods can produce k improved |A〉 states given 3k + 8 input copies, potentially significantly reducing the overhead associated with state distillation. We construct an explicit surface code implementation of block code state distillation and quantitatively compare the overhead of this approach to the old. We find that, using the best available techniques, for parameters of practical interest, block code state distillation does not always lead to lower overhead, and, when it does, the overhead reduction is typically less than a factor of three. PMID:23736868
Quantum secret sharing with minimized quantum communication
Fortescue, Ben; Gour, Gilad
2013-03-01
Standard techniques for sharing a quantum secret among multiple players (such that certain subsets of the players can recover the secret while others are denied all knowledge of the secret) require a large amount of quantum communication to distribute the secret, which is likely to be the most costly resource in any practical scheme. Two known methods for reducing this cost are the use of imperfect ``ramp'' secret sharing (in which security is sacrificed for efficiency) and classical encryption (in which certain elements of the players' shares consist of classical information only). We demonstrate how one may combine these methods to reduce the required quantum communication below what has been previously achieved, in some cases to a provable minimum, without any loss of security. The techniques involved are closely-related to the properties of stabilizer codes, and thus have strong potential for being adapted to a wide range of quantum secret sharing schemes.
DEFF Research Database (Denmark)
Cox, Geoff
; alternatives to mainstream development, from performances of the live-coding scene to the organizational forms of commons-based peer production; the democratic promise of social media and their paradoxical role in suppressing political expression; and the market’s emptying out of possibilities for free...... development, Speaking Code unfolds an argument to undermine the distinctions between criticism and practice, and to emphasize the aesthetic and political aspects of software studies. Not reducible to its functional aspects, program code mirrors the instability inherent in the relationship of speech...... expression in the public realm. The book’s line of argument defends language against its invasion by economics, arguing that speech continues to underscore the human condition, however paradoxical this may seem in an era of pervasive computing....
Quantum computing and the entanglement frontier
Preskill, John
2012-01-01
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly entangled quantum systems efficiently, and we hope to hasten the day when well controlled quantum systems can perform tasks surpassing what can be done in the classical world. One way to achieve such "quantum supremacy" would be to run an algorithm on a quantum computer which solves a problem with a super-polynomial speedup relative to classical computers, but there may be other ways that can be achieved sooner, such as simulating exotic quantum states of strongly correlated matter. To operate a large scale quantum computer reliably we will need to overcome the debilitating effects of decoherence, which might be done using "standard" quantum hardware protected by quantum error-correcting codes, or by exploiting the nonabelian quantum statistics of anyons realized in solid state sy...
Quantum broadcast communication
Institute of Scientific and Technical Information of China (English)
Wang Jian; Zhang Quan; Tang Chao-Jing
2007-01-01
Broadcast encryption allows the sender to securely distribute his/her secret to a dynamically changing group of users over a broadcast channel. In this paper, we just take account of a simple broadcast communication task in quantum scenario, in which the central party broadcasts his secret to multi-receiver via quantum channel. We present three quantum broadcast communication schemes. The first scheme utilizes entanglement swapping and GreenbergerHorne-Zeilinger state to fulfil a task that the central party broadcasts the secret to a group of receivers who share a group key with him. In the second scheme, based on dense coding, the central party broadcasts the secret to multi-receiver,each of which shares an authentication key with him. The third scheme is a quantum broadcast communication scheme with quantum encryption, in which the central party can broadcast the secret to any subset of the legal receivers.
Quantum information and convex optimization
Energy Technology Data Exchange (ETDEWEB)
Reimpell, Michael
2008-07-01
This thesis is concerned with convex optimization problems in quantum information theory. It features an iterative algorithm for optimal quantum error correcting codes, a postprocessing method for incomplete tomography data, a method to estimate the amount of entanglement in witness experiments, and it gives necessary and sufficient criteria for the existence of retrodiction strategies for a generalized mean king problem. (orig.)
Mastriani, Mario
2017-01-01
This paper presents a number of problems concerning the practical (real) implementation of the techniques known as quantum image processing. The most serious problem is the recovery of the outcomes after the quantum measurement, which will be demonstrated in this work that is equivalent to a noise measurement, and it is not considered in the literature on the subject. It is noteworthy that this is due to several factors: (1) a classical algorithm that uses Dirac's notation and then it is coded in MATLAB does not constitute a quantum algorithm, (2) the literature emphasizes the internal representation of the image but says nothing about the classical-to-quantum and quantum-to-classical interfaces and how these are affected by decoherence, (3) the literature does not mention how to implement in a practical way (at the laboratory) these proposals internal representations, (4) given that quantum image processing works with generic qubits, this requires measurements in all axes of the Bloch sphere, logically, and (5) among others. In return, the technique known as quantum Boolean image processing is mentioned, which works with computational basis states (CBS), exclusively. This methodology allows us to avoid the problem of quantum measurement, which alters the results of the measured except in the case of CBS. Said so far is extended to quantum algorithms outside image processing too.
Li, Shu-Shen; Long, Gui-lu; Bai, Feng-Shan; Feng, Song-Lin; Zheng, Hou-Zhi
2001-01-01
Quantum computing is a quickly growing research field. This article introduces the basic concepts of quantum computing, recent developments in quantum searching, and decoherence in a possible quantum dot realization.
Energy Technology Data Exchange (ETDEWEB)
Delbecq, J.M
1999-07-01
The Aster code is a 2D or 3D finite-element calculation code for structures developed by the R and D direction of Electricite de France (EdF). This dossier presents a complete overview of the characteristics and uses of the Aster code: introduction of version 4; the context of Aster (organisation of the code development, versions, systems and interfaces, development tools, quality assurance, independent validation); static mechanics (linear thermo-elasticity, Euler buckling, cables, Zarka-Casier method); non-linear mechanics (materials behaviour, big deformations, specific loads, unloading and loss of load proportionality indicators, global algorithm, contact and friction); rupture mechanics (G energy restitution level, restitution level in thermo-elasto-plasticity, 3D local energy restitution level, KI and KII stress intensity factors, calculation of limit loads for structures), specific treatments (fatigue, rupture, wear, error estimation); meshes and models (mesh generation, modeling, loads and boundary conditions, links between different modeling processes, resolution of linear systems, display of results etc..); vibration mechanics (modal and harmonic analysis, dynamics with shocks, direct transient dynamics, seismic analysis and aleatory dynamics, non-linear dynamics, dynamical sub-structuring); fluid-structure interactions (internal acoustics, mass, rigidity and damping); linear and non-linear thermal analysis; steels and metal industry (structure transformations); coupled problems (internal chaining, internal thermo-hydro-mechanical coupling, chaining with other codes); products and services. (J.S.)
Optimal codes as Tanner codes with cyclic component codes
DEFF Research Database (Denmark)
Høholdt, Tom; Pinero, Fernando; Zeng, Peng
2014-01-01
In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe...... the codes succinctly using Gröbner bases....
Institute of Scientific and Technical Information of China (English)
孙成发
2013-01-01
Based on optimization design for IIR digital filters being a multi-parameters and non-linear complex function optimization problem,a novel method of IIR digital filters optimization design is proposed,its core is that read-coded quantum evolutionary algorithms(RQEA)is applied on optimizing the interrelated parameters of IIR digital filters.In this paper, firstly,the maths model of IIR digital filter optimization design is proposed;secondly,the process of optimization design for IIR digital filters on the basis of RQEA is described in detail,final y,the validity and effectivenss of the introduced method are demonstrated by experimental results on the lowpass and highpass IIR digital filters.% IIR数字滤波器设计的本质是求解多参数非线性复杂函数优化问题，提出应用实数编码量子进化算法优化IIR数字滤波器的相关参数，进而形成一种新的IIR数字滤波器优化设计方法。文中给出了IIR滤波器优化设计的数学模型，描述了应用实数编码量子进化算法优化设计IIR数字滤波器的具体实现步骤，并通过低通和高通IIR数字滤波器设计的仿真结果表明该方法的有效性和高效性。
Quantum Distinction: Quantum Distinctiones!
Zeps, Dainis
2009-01-01
10 pages; How many distinctions, in Latin, quantum distinctiones. We suggest approach of anthropic principle based on anthropic reference system which should be applied equally both in theoretical physics and in mathematics. We come to principle that within reference system of life subject of mathematics (that of thinking) should be equated with subject of physics (that of nature). For this reason we enter notions of series of distinctions, quantum distinction, and argue that quantum distinct...
Quantum walks on general graphs
Kendon, V
2003-01-01
A scheme for a discrete time quantum walk on a general graph of N vertices with undirected edges is given, and compared with the continuous time quantum walk on a general graph introduced by Farhi and Gutmann [PRA 58 915 (1998)]. Both walks are contrasted with the examples of quantum walks in the literature treating graphs of fixed, small (< log N) degree. This illustrates the way in which extra information about the graph allows more efficient algorithms to be designed. To obtain a quantum speed up over classical for comparable resources it is necessary to code the position space of the quantum walk into a qubit register (or equivalent). The role of the oracle is also discussed and an efficient gate sequence is presented for implementing a discrete quantum walk given one copy of a quantum state encoding the adjacency matrix of the graph.
Simulation of Quantum Algorithms with a Symbolic Programming Language
Nyman, Peter
2007-01-01
This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. The computational language will include formulations such as quantum state, superposition and quantum operator.
Belief propagation decoding of quantum channels by passing quantum messages
Renes, Joseph M.
2017-07-01
The belief propagation (BP) algorithm is a powerful tool in a wide range of disciplines from statistical physics to machine learning to computational biology, and is ubiquitous in decoding classical error-correcting codes. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding of the channel, in some cases even up to the Shannon capacity. Here we construct the first BP algorithm which passes quantum messages on the factor graph and is capable of decoding the classical-quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the code length. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels.
Recent trends in coding theory and its applications
Li, Wen-Ching Winnie
2007-01-01
Coding theory draws on a remarkable selection of mathematical topics, both pure and applied. The various contributions in this volume introduce coding theory and its most recent developments and applications, emphasizing both mathematical and engineering perspectives on the subject. This volume covers four important areas in coding theory: algebraic geometry codes, graph-based codes, space-time codes, and quantum codes. Both students and seasoned researchers will benefit from the extensive and self-contained discussions of the development and recent progress in these areas.
Quantum error correction for beginners.
Devitt, Simon J; Munro, William J; Nemoto, Kae
2013-07-01
Quantum error correction (QEC) and fault-tolerant quantum computation represent one of the most vital theoretical aspects of quantum information processing. It was well known from the early developments of this exciting field that the fragility of coherent quantum systems would be a catastrophic obstacle to the development of large-scale quantum computers. The introduction of quantum error correction in 1995 showed that active techniques could be employed to mitigate this fatal problem. However, quantum error correction and fault-tolerant computation is now a much larger field and many new codes, techniques, and methodologies have been developed to implement error correction for large-scale quantum algorithms. In response, we have attempted to summarize the basic aspects of quantum error correction and fault-tolerance, not as a detailed guide, but rather as a basic introduction. The development in this area has been so pronounced that many in the field of quantum information, specifically researchers who are new to quantum information or people focused on the many other important issues in quantum computation, have found it difficult to keep up with the general formalisms and methodologies employed in this area. Rather than introducing these concepts from a rigorous mathematical and computer science framework, we instead examine error correction and fault-tolerance largely through detailed examples, which are more relevant to experimentalists today and in the near future.
Purifying Quantum States: Quantum and Classical Algorithms
Dennis, E
2005-01-01
I give analytical estimates and numerical simulation results for the performance of Kitaev's 2d topological error-correcting codes. By providing methods for the execution of an encoded three-qubit Toffoli gate, I complete a universal gate set for these codes. I also examine the utility of Bohm's and Bohm-inspired interpretations of quantum mechanics for numerical solution of many-body dynamics and ``mechanism identification'' heuristics in discrete systems. Further, I show an unexpected quantitative correspondence between the previously known continuum of stochastic-Bohm trajectory theories on the one hand and extant path integral Monte Carlo methods on the other hand.
NOVEL BIPHASE CODE -INTEGRATED SIDELOBE SUPPRESSION CODE
Institute of Scientific and Technical Information of China (English)
Wang Feixue; Ou Gang; Zhuang Zhaowen
2004-01-01
A kind of novel binary phase code named sidelobe suppression code is proposed in this paper. It is defined to be the code whose corresponding optimal sidelobe suppression filter outputs the minimum sidelobes. It is shown that there do exist sidelobe suppression codes better than the conventional optimal codes-Barker codes. For example, the sidelobe suppression code of length 11 with filter of length 39 has better sidelobe level up to 17dB than that of Barker code with the same code length and filter length.
Quantum computing in neural networks
Gralewicz, P
2004-01-01
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits. This raises the possibility of a large-scale quantum computing using PMs, especially with neural networks which have the innate capability for probabilistic information processing. Restricting ourselves to a particular model, we construct and numerically examine the performance of neural circuits implementing universal quantum gates. A discussion on the physiological plausibility of proposed coding scheme is also provided.
Multi-Party Quantum Steganography
Mihara, Takashi
2017-02-01
Steganography has been proposed as a data hiding technique. As a derivation, quantum steganography based on quantum physics has also been proposed. In this paper, we extend the results in presented (Mihara, Phys. Lett. 379, 952 2015) and propose a multi-party quantum steganography technique that combines quantum error-correcting codes with entanglement. The proposed protocol shares an entangled state among n +1 parties and sends n secret messages, corresponding to the n parties, to the other party. With no knowledge of the other secret messages, the n parties can construct a stego message by cooperating with each other. Finally, we propose a protocol for sending qubits using the same technique.
From concatenated codes to graph codes
DEFF Research Database (Denmark)
Justesen, Jørn; Høholdt, Tom
2004-01-01
We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...
一种基于量子超密编码的代理盲签名方案的研究%Research on a Proxy Blind Signature Scheme Based on Quantum Superdense Coding
Institute of Scientific and Technical Information of China (English)
王辉; 石润华; 仲红; 汪开婷
2016-01-01
Proxy blind signature is widely applied to electronic voting, electronic commerce, and other network settings, etc. Combined with the situation of electronic bank payment, considering the correlative factors of the communication cost, the quantum operation complexity, and the veriifcation efficiency, etc, the paper proposes a proxy blind signature scheme based on the single particle superdense coding to blind the classical double bits information. The principle of the scheme is that the classical bit information is transmitted to the quantum system using the measurement of single particle in different measurement bases, in which the owner of the message blinds the secret message first and then the proxy signer signs the blinded message after authorized. Under the situation of without considering the particles detection, compared with other current well-known schemes, the biggest advantage of the scheme is to save half of the particles at least. In addition, signature party only needs to measure single particle and the length of the signature is appropriate.The verification party only needs to verify by contrast, and not needs to carry out the particle operation. The efifciencies of the signature ,veriifcation and communication are all improved.%代理盲签名在电子投票系统、电子商务系统和网络环境等方面有着广泛的应用。文章结合当下电子银行支付的情况，综合考虑现实情形下的通信开销、量子操作复杂性、验证效率等相关因素，首次提出一种基于单粒子超密编码来盲化经典双比特信息的量子代理盲签名方案。该方案原理是利用单粒子在不同测量基下的测量，将经典比特信息传送到量子系统中。消息拥有者先将秘密盲化，代理签名者在经过授权后对盲化消息进行有效签名。与现今其他主流方案相比，该方案最大的优势是使用的量子资源大大减少，在不考虑检测粒子的情形下，至少节
Autocompensating Quantum Cryptography
Bethune, D S; Bethune, Donald S.; Risk, William P.
2002-01-01
Quantum cryptographic key distribution (QKD) uses extremely faint light pulses to carry quantum information between two parties (Alice and Bob), allowing them to generate a shared, secret cryptographic key. Autocompensating QKD systems automatically and passively compensate for uncontrolled time dependent variations of the optical fiber properties by coding the information as a differential phase between orthogonally-polarized components of a light pulse sent on a round trip through the fiber, reflected at mid-course using a Faraday mirror. We have built a prototype system based on standard telecom technology that achieves a privacy-amplified bit generation rate of ~1000 bits/s over a 10-km optical fiber link. Quantum cryptography is an example of an application that, by using quantum states of individual particles to represent information, accomplishes a practical task that is impossible using classical means.
Good Codes From Generalised Algebraic Geometry Codes
Jibril, Mubarak; Ahmed, Mohammed Zaki; Tjhai, Cen
2010-01-01
Algebraic geometry codes or Goppa codes are defined with places of degree one. In constructing generalised algebraic geometry codes places of higher degree are used. In this paper we present 41 new codes over GF(16) which improve on the best known codes of the same length and rate. The construction method uses places of small degree with a technique originally published over 10 years ago for the construction of generalised algebraic geometry codes.
Chang, Mou-Hsiung
2015-01-01
The classical probability theory initiated by Kolmogorov and its quantum counterpart, pioneered by von Neumann, were created at about the same time in the 1930s, but development of the quantum theory has trailed far behind. Although highly appealing, the quantum theory has a steep learning curve, requiring tools from both probability and analysis and a facility for combining the two viewpoints. This book is a systematic, self-contained account of the core of quantum probability and quantum stochastic processes for graduate students and researchers. The only assumed background is knowledge of the basic theory of Hilbert spaces, bounded linear operators, and classical Markov processes. From there, the book introduces additional tools from analysis, and then builds the quantum probability framework needed to support applications to quantum control and quantum information and communication. These include quantum noise, quantum stochastic calculus, stochastic quantum differential equations, quantum Markov semigrou...
Gosson, Maurice A. de
2012-01-01
Quantum blobs are the smallest phase space units of phase space compatible with the uncertainty principle of quantum mechanics and having the symplectic group as group of symmetries. Quantum blobs are in a bijective correspondence with the squeezed coherent states from standard quantum mechanics, of which they are a phase space picture. This allows us to propose a substitute for phase space in quantum mechanics. We study the relationship between quantum blobs with a certain class of level set...
Error-correcting codes and phase transitions
Manin, Yuri I
2009-01-01
The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous curve in the space of parameters. The main goal of this paper is to relate the asymptotic bound to phase diagrams of quantum statistical mechanical systems. We first identify the code parameters with Hausdorff and von Neumann dimensions, by considering fractals consisting of infinite sequences of code words. We then construct operator algebras associated to individual codes. These are Toeplitz algebras with a time evolution for which the KMS state at critical temperature gives the Hausdorff measure on the corresponding fractal. We extend this construction to algebras associated to limit points of codes, with non-uniform multi-fractal measures, and to tensor products over varying parameters.
Enhanced sensing and communication via quantum networks
Smith, James F.
2017-05-01
A network based on quantum information has been developed to improve sensing and communications capabilities. Quantum teleportation offers features for communicating information not found in classical procedures. It is fundamental to the quantum network approach. A version of quantum teleportation based on hyper-entanglement is used to bring about these improvements. Recently invented methods of improving sensing and communication via quantum information based on hyper-entanglement are discussed. These techniques offer huge improvements in the SNR, signal to interference ratio, and time-on-target of various sensors including RADAR and LADAR. Hyper-entanglement refers to quantum entanglement in more than one degree of freedom, e.g. polarization, energy-time, orbital angular momentum (OAM), etc. The quantum network makes use of quantum memory located in each node of the network, thus the network forms a quantum repeater. The quantum repeater facilitates the use of quantum teleportation, and superdense coding. Superdense coding refers to the ability to incorporate more than one classical bit into each transmitted qubit. The network of sensors and/or communication devices has an enhanced resistance to interference sources. The repeater has the potential for greatly reducing loss in communications and sensor systems related to the effect of the atmosphere on fragile quantum states. Measures of effectiveness (MOEs) are discussed that show the utility of the network for improving sensing and communications in the presence of loss and noise. The quantum repeater will reduce overall size, weight, power and cost (SWAPC) of fielded components of systems.
Nonlinear Dynamics In Quantum Physics -- Quantum Chaos and Quantum Instantons
Kröger, H.
2003-01-01
We discuss the recently proposed quantum action - its interpretation, its motivation, its mathematical properties and its use in physics: quantum mechanical tunneling, quantum instantons and quantum chaos.
Nonlinear Dynamics In Quantum Physics -- Quantum Chaos and Quantum Instantons
Kröger, H.
2003-01-01
We discuss the recently proposed quantum action - its interpretation, its motivation, its mathematical properties and its use in physics: quantum mechanical tunneling, quantum instantons and quantum chaos.
Institute of Scientific and Technical Information of China (English)
陈思兵; 张凯; 潘率诚; 杨冬卫
2014-01-01
Real-coded quantum evolutionary algorithm and Modal Interval Analysis were combined to solve dififcult problems in Modal Interval Analysis. Used real-coded quantum evolutionary algorithm to solve modal interval liner equations and inverse matrix of modal interval matrix. And then used real-coded quantum evolutionary algorithm and Modal Interval Analysis in overall performance design of aero-engine. Design method of overall performance of aero-engine based on Modal Interval Analysis wass presented , which can analysis design uncertainty. Took a certain type of turbojet engine as an example to calculate and design the results are more in line with the actual situation.%本文将实数编码量子进化算法和模态区间数学相结合用于解决模态区间数学中的某些难以求解的问题。应用量子进化算法进行了模态区间数学方程组的求解和模态区间矩阵的求逆，将量子进化算法和模态区间数学用于航空发动机的设计，给出了基于模态区间数学的航空发动机总体性能设计方法。这种设计方法能够考虑设计的不确定性。并以某型涡喷发动机为例进行计算，设计结果更符合实际情况。
The Quantum Socket: Three-Dimensional Wiring for Extensible Quantum Computing
Béjanin, J H; Rinehart, J R; Earnest, C T; McRae, C R H; Shiri, D; Bateman, J D; Rohanizadegan, Y; Penava, B; Breul, P; Royak, S; Zapatka, M; Fowler, A G; Mariantoni, M
2016-01-01
Quantum computing architectures are on the verge of scalability, a key requirement for the implementation of a universal quantum computer. The next stage in this quest is the realization of quantum error correction codes, which will mitigate the impact of faulty quantum information on a quantum computer. Architectures with ten or more quantum bits (qubits) have been realized using trapped ions and superconducting circuits. While these implementations are potentially scalable, true scalability will require systems engineering to combine quantum and classical hardware. One technology demanding imminent efforts is the realization of a suitable wiring method for the control and measurement of a large number of qubits. In this work, we introduce an interconnect solution for solid-state qubits: The quantum socket. The quantum socket fully exploits the third dimension to connect classical electronics to qubits with higher density and better performance than two-dimensional methods based on wire bonding. The quantum ...
Dennis, E; Landahl, A; Preskill, J; Dennis, Eric; Kitaev, Alexei; Landahl, Andrew; Preskill, John
2002-01-01
We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and encoded quantum operations are associated with nontrivial homology cycles of the surface. We formulate protocols for error recovery, and study the efficacy of these protocols. An order-disorder phase transition occurs in this system at a nonzero critical value of the error rate; if the error rate is below the critical value (the accuracy threshold), encoded information can be protected arbitrarily well in the limit of a large code block. This phase transition can be accurately modeled by a three-dimensional Z_2 lattice gauge theory with quenched disorder. We estimate the accuracy threshold, assuming that all quantum gates are local, that qubits can be measured rapidly, and that polynomial-size classical computations can be executed instantaneously. We also devise a robust recovery procedure that does not require m...
Coding Theory and Applications : 4th International Castle Meeting
Malonek, Paula; Vettori, Paolo
2015-01-01
The topics covered in this book, written by researchers at the forefront of their field, represent some of the most relevant research areas in modern coding theory: codes and combinatorial structures, algebraic geometric codes, group codes, quantum codes, convolutional codes, network coding and cryptography. The book includes a survey paper on the interconnections of coding theory with constrained systems, written by an invited speaker, as well as 37 cutting-edge research communications presented at the 4th International Castle Meeting on Coding Theory and Applications (4ICMCTA), held at the Castle of Palmela in September 2014. The event’s scientific program consisted of four invited talks and 39 regular talks by authors from 24 different countries. This conference provided an ideal opportunity for communicating new results, exchanging ideas, strengthening international cooperation, and introducing young researchers into the coding theory community.
Space Time Codes from Permutation Codes
Henkel, Oliver
2006-01-01
A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms.
Introduction to the theory of quantum information processing
Bergou, János A
2013-01-01
Introduction to the Theory of Quantum Information Processing provides the material for a one-semester graduate level course on quantum information theory and quantum computing for students who have had a one-year graduate course in quantum mechanics. Many standard subjects are treated, such as density matrices, entanglement, quantum maps, quantum cryptography, and quantum codes. Also included are discussions of quantum machines and quantum walks. In addition, the book provides detailed treatments of several underlying fundamental principles of quantum theory, such as quantum measurements, the no-cloning and no-signaling theorems, and their consequences. Problems of various levels of difficulty supplement the text, with the most challenging problems bringing the reader to the forefront of active research. This book provides a compact introduction to the fascinating and rapidly evolving interdisciplinary field of quantum information theory, and it prepares the reader for doing active research in this area.
Fundamentals of convolutional coding
Johannesson, Rolf
2015-01-01
Fundamentals of Convolutional Coding, Second Edition, regarded as a bible of convolutional coding brings you a clear and comprehensive discussion of the basic principles of this field * Two new chapters on low-density parity-check (LDPC) convolutional codes and iterative coding * Viterbi, BCJR, BEAST, list, and sequential decoding of convolutional codes * Distance properties of convolutional codes * Includes a downloadable solutions manual
Quantum information does not exist
Duwell, Armond
Some physicists seem to believe that quantum information theory requires a new concept of information (Jozsa, 1998, Quantum information and its properties. In: Hoi-Kwong Lo, S. Popescu, T. Spiller (Eds.), Introduction to Quantum Computation and Information, World Scientific, Singapore, (pp. 49-75); Deutsch & Hayden, 1999, Information flow in entangled quantum subsystems, preprint quant-ph/9906007). I will argue that no new concept is necessary. Shannon's concept of information is sufficient for quantum information theory. Properties that are cited to contrast quantum information and classical information (i.e., Shannon information) actually point to differences in our ability to manipulate, access, and transfer information depending on whether quantum systems, opposed to classical systems, are used in a communication system. I also demonstrate that conceptually puzzling phenomena in quantum information theory, such as dense coding, teleportation, and Schumacher coding, all of which are cited as evidence that a new concept of information is required, do not have to be regarded as such.
Lanzagorta, Marco
2011-01-01
This book offers a concise review of quantum radar theory. Our approach is pedagogical, making emphasis on the physics behind the operation of a hypothetical quantum radar. We concentrate our discussion on the two major models proposed to date: interferometric quantum radar and quantum illumination. In addition, this book offers some new results, including an analytical study of quantum interferometry in the X-band radar region with a variety of atmospheric conditions, a derivation of a quantum radar equation, and a discussion of quantum radar jamming.This book assumes the reader is familiar w
de Gosson, Maurice A
2011-01-01
Quantum blobs are the smallest phase space units of phase space compatible with the uncertainty principle of quantum mechanics and having the symplectic group as group of symmetries. Quantum blobs are in a bijective correspondence with the squeezed coherent states from standard quantum mechanics, of which they are a phase space picture. This allows us to propose a substitute for phase space in quantum mechanics. We study the relationship between quantum blobs with a certain class of level sets defined by Fermi for the purpose of representing geometrically quantum states.
Wu, L A; Wu, Lian-Ao; Lidar, Daniel
2005-01-01
Quantum computation and communication offer unprecedented advantages compared to classical information processing. Currently, quantum communication is moving from laboratory prototypes into real-life applications. When quantum communication networks become more widespread it is likely that they will be subject to attacks by hackers, virus makers, and other malicious intruders. Here we introduce the concept of "quantum malware" to describe such human-made intrusions. We offer a simple solution for storage of quantum information in a manner which protects quantum networks from quantum malware.
Energy Technology Data Exchange (ETDEWEB)
Dasari, Venkat [U.S. Army Research Laboratory, Aberdeen Proving Ground, MD; Sadlier, Ronald J [ORNL; Geerhart, Mr. Billy [U.S. Army Research Laboratory, Aberdeen Proving Ground, MD; Snow, Nikolai [U.S. Army Research Laboratory, Aberdeen Proving Ground, MD; Williams, Brian P [ORNL; Humble, Travis S [ORNL
2017-01-01
Well-defined and stable quantum networks are essential to realize functional quantum applications. Quantum networks are complex and must use both quantum and classical channels to support quantum applications like QKD, teleportation, and superdense coding. In particular, the no-cloning theorem prevents the reliable copying of quantum signals such that the quantum and classical channels must be highly coordinated using robust and extensible methods. We develop new network abstractions and interfaces for building programmable quantum networks. Our approach leverages new OpenFlow data structures and table type patterns to build programmable quantum networks and to support quantum applications.
Dasari, Venkat R.; Sadlier, Ronald J.; Geerhart, Billy E.; Snow, Nikolai A.; Williams, Brian P.; Humble, Travis S.
2017-05-01
Well-defined and stable quantum networks are essential to realize functional quantum communication applications. Quantum networks are complex and must use both quantum and classical channels to support quantum applications like QKD, teleportation, and superdense coding. In particular, the no-cloning theorem prevents the reliable copying of quantum signals such that the quantum and classical channels must be highly coordinated using robust and extensible methods. In this paper, we describe new network abstractions and interfaces for building programmable quantum networks. Our approach leverages new OpenFlow data structures and table type patterns to build programmable quantum networks and to support quantum applications.
Scarani, Valerio; Iblisdir, Sofyan; Gisin, Nicolas; Acin, Antonio
2005-01-01
The impossibility of perfectly copying (or cloning) an arbitrary quantum state is one of the basic rules governing the physics of quantum systems. The processes that perform the optimal approximate cloning have been found in many cases. These "quantum cloning machines" are important tools for studying a wide variety of tasks, e.g. state estimation and eavesdropping on quantum cryptography. This paper provides a comprehensive review of quantum cloning machines (both for discrete-dimensional an...
Strong Trinucleotide Circular Codes
Directory of Open Access Journals (Sweden)
Christian J. Michel
2011-01-01
Full Text Available Recently, we identified a hierarchy relation between trinucleotide comma-free codes and trinucleotide circular codes (see our previous works. Here, we extend our hierarchy with two new classes of codes, called DLD and LDL codes, which are stronger than the comma-free codes. We also prove that no circular code with 20 trinucleotides is a DLD code and that a circular code with 20 trinucleotides is comma-free if and only if it is a LDL code. Finally, we point out the possible role of the symmetric group ∑4 in the mathematical study of trinucleotide circular codes.
Quantum CPU and Quantum Algorithm
Wang, An Min
1999-01-01
Making use of an universal quantum network -- QCPU proposed by me\\upcite{My1}, it is obtained that the whole quantum network which can implement some the known quantum algorithms including Deutsch algorithm, quantum Fourier transformation, Shor's algorithm and Grover's algorithm.
Quantum Computer Games: Quantum Minesweeper
Gordon, Michal; Gordon, Goren
2010-01-01
The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…
Quantum Computer Games: Quantum Minesweeper
Gordon, Michal; Gordon, Goren
2010-01-01
The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…
Fault-tolerant error correction with the gauge color code
Brown, Benjamin J.; Nickerson, Naomi H.; Browne, Dan E.
2016-07-01
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end, we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a universal set of computational operations with the minimal cost in quantum resources remains an important and ongoing challenge. One proposal of significant recent interest is the gauge color code. Notably, this code may offer a reduced resource cost over other well-studied fault-tolerant architectures by using a new method, known as gauge fixing, for performing the non-Clifford operations that are essential for universal quantum computation. Here we examine the gauge color code when it is subject to noise. Specifically, we make use of single-shot error correction to develop a simple decoding algorithm for the gauge color code, and we numerically analyse its performance. Remarkably, we find threshold error rates comparable to those of other leading proposals. Our results thus provide the first steps of a comparative study between the gauge color code and other promising computational architectures.
Fault-tolerant error correction with the gauge color code.
Brown, Benjamin J; Nickerson, Naomi H; Browne, Dan E
2016-07-29
The constituent parts of a quantum computer are inherently vulnerable to errors. To this end, we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a universal set of computational operations with the minimal cost in quantum resources remains an important and ongoing challenge. One proposal of significant recent interest is the gauge color code. Notably, this code may offer a reduced resource cost over other well-studied fault-tolerant architectures by using a new method, known as gauge fixing, for performing the non-Clifford operations that are essential for universal quantum computation. Here we examine the gauge color code when it is subject to noise. Specifically, we make use of single-shot error correction to develop a simple decoding algorithm for the gauge color code, and we numerically analyse its performance. Remarkably, we find threshold error rates comparable to those of other leading proposals. Our results thus provide the first steps of a comparative study between the gauge color code and other promising computational architectures.
Joint source channel coding using arithmetic codes
Bi, Dongsheng
2009-01-01
Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden symbols. If a limit is imposed on the maximum value of a key parameter in the encoder, this modified arithmetic encoder can also be modeled as a finite state machine and the code generated can be treated as a variable-length trellis code. The number of states used can be reduced and techniques used fo
Quantum election scheme based on anonymous quantum key distribution
Institute of Scientific and Technical Information of China (English)
Zhou Rui-Rui; Yang Li
2012-01-01
An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented,based on which we construct a quantum election scheme without the help of an entanglement state.We show that this election scheme ensures the completeness,soundness,privacy,eligibility,unreusability,fairness,and verifiability of a large-scale election in which the administrator and counter are semi-honest.This election scheme can work even if there exist loss and errors in quantum channels.In addition,any irregularity in this scheme is sensible.
Frahm, K M; Shepelyansky, D L; Fleckinger, Robert; Frahm, Klaus M.; Shepelyansky, Dima L.
2004-01-01
We determine the universal law for fidelity decay in quantum computations of complex dynamics in presence of internal static imperfections in a quantum computer. Our approach is based on random matrix theory applied to quantum computations in presence of imperfections. The theoretical predictions are tested and confirmed in extensive numerical simulations of a quantum algorithm for quantum chaos in the dynamical tent map with up to 18 qubits. The theory developed determines the time scales for reliable quantum computations in absence of the quantum error correction codes. These time scales are related to the Heisenberg time, the Thouless time, and the decay time given by Fermi's golden rule which are well known in the context of mesoscopic systems. The comparison is presented for static imperfection effects and random errors in quantum gates. A new convenient method for the quantum computation of the coarse-grained Wigner function is also proposed.
2008-03-15
Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std. Z39-18 Publications: 1) W. Wasilewski and...K. Banaszek, Protecting an optical qubit against photon loss, Phys. Rev. A 75, 042316 (2007) 2) K. Banaszek and W. Wasilewski , Linear-optics...manipulations of photon-loss codes, Proceedings of NATO Advanced Research Workshop "Quantum Communication and Security" 3) W. Wasilewski , P. Kolenderski
Pfeiffer, P.; Egusquiza, I. L.; di Ventra, M.; Sanz, M.; Solano, E.
2016-07-01
Technology based on memristors, resistors with memory whose resistance depends on the history of the crossing charges, has lately enhanced the classical paradigm of computation with neuromorphic architectures. However, in contrast to the known quantized models of passive circuit elements, such as inductors, capacitors or resistors, the design and realization of a quantum memristor is still missing. Here, we introduce the concept of a quantum memristor as a quantum dissipative device, whose decoherence mechanism is controlled by a continuous-measurement feedback scheme, which accounts for the memory. Indeed, we provide numerical simulations showing that memory effects actually persist in the quantum regime. Our quantization method, specifically designed for superconducting circuits, may be extended to other quantum platforms, allowing for memristor-type constructions in different quantum technologies. The proposed quantum memristor is then a building block for neuromorphic quantum computation and quantum simulations of non-Markovian systems.
Devetak, I; Winter, A
2003-01-01
We introduce two dual, purely quantum protocols: for entanglement distillation assisted by quantum communication (``mother'' protocol) and for entanglement assisted quantum communication (``father'' protocol). We show how a large class of ``children'' protocols (including many previously known ones) can be derived from the two by direct application of teleportation or super-dense coding. Furthermore, the parent may be recovered from most of the children protocols by making them ``coherent''. We also summarize the various resource trade-offs these protocols give rise to.
New Mexico Univ., Albuquerque. American Indian Law Center.
The Model Children's Code was developed to provide a legally correct model code that American Indian tribes can use to enact children's codes that fulfill their legal, cultural and economic needs. Code sections cover the court system, jurisdiction, juvenile offender procedures, minor-in-need-of-care, and termination. Almost every Code section is…
Chattaraj, Pratim Kumar
2010-01-01
The application of quantum mechanics to many-particle systems has been an active area of research in recent years as researchers have looked for ways to tackle difficult problems in this area. The quantum trajectory method provides an efficient computational technique for solving both stationary and time-evolving states, encompassing a large area of quantum mechanics. Quantum Trajectories brings the expertise of an international panel of experts who focus on the epistemological significance of quantum mechanics through the quantum theory of motion.Emphasizing a classical interpretation of quan
A decoupling approach to the quantum capacity
Hayden, P; Yard, J; Winter, A; Hayden, Patrick; Horodecki, Michal; Yard, Jon; Winter, Andreas
2007-01-01
We give a proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to select coding subspaces according to the unitarily invariant measure and then show that provided those subspaces are sufficiently small, any data contained within them will with high probability be decoupled from the noisy channel's environment.
Experimental entanglement distillation of mesoscopic quantum states
DEFF Research Database (Denmark)
Dong, Ruifang; Lassen, Mikael Østergaard; Heersink, Joel
2008-01-01
The distribution of entangled states between distant parties in an optical network is crucial for the successful implementation of various quantum communication protocols such as quantum cryptography, teleportation and dense coding(1-3). However, owing to the unavoidable loss in any real optical...
Quantum Secure Communication by Using GHZ State in High-Dimensional Hilbert Space
Institute of Scientific and Technical Information of China (English)
GAO Gan
2008-01-01
We propose a quantum superdense coding secure communication scheme by using GHZ state. This scheme combines the ideas of quantum superdense coding and sequence transmission. Its distinct advantage is high source capacity. In addition, in checking eavesdropping, we need not to destroy quantum entanglement.
Classifying the Quantum Phases of Matter
2015-01-01
2013), arXiv:1305.2176. [10] J. Haah, Lattice quantum codes and exotic topological phases of matter , arXiv:1305.6973. [11[ M. Hastings and S...CLASSIFYING THE QUANTUM PHASES OF MATTER CALIFORNIA INSTITUTE OF TECHNOLOGY JANUARY 2015 FINAL TECHNICAL REPORT...REPORT 3. DATES COVERED (From - To) JAN 2012 – AUG 2014 4. TITLE AND SUBTITLE CLASSIFYING THE QUANTUM PHASES OF MATTER 5a. CONTRACT NUMBER FA8750-12-2
Robust Quantum Error Correction via Convex Optimization
Kosut, R L; Lidar, D A
2007-01-01
Quantum error correction procedures have traditionally been developed for specific error models, and are not robust against uncertainty in the errors. Using a semidefinite program optimization approach we find high fidelity quantum error correction procedures which present robust encoding and recovery effective against significant uncertainty in the error system. We present numerical examples for 3, 5, and 7-qubit codes. Our approach requires as input a description of the error channel, which can be provided via quantum process tomography.
Enhanced fault-tolerant quantum computing in d-level systems.
Campbell, Earl T
2014-12-05
Error-correcting codes protect quantum information and form the basis of fault-tolerant quantum computing. Leading proposals for fault-tolerant quantum computation require codes with an exceedingly rare property, a transversal non-Clifford gate. Codes with the desired property are presented for d-level qudit systems with prime d. The codes use n=d-1 qudits and can detect up to ∼d/3 errors. We quantify the performance of these codes for one approach to quantum computation known as magic-state distillation. Unlike prior work, we find performance is always enhanced by increasing d.
Quantum robots and quantum computers
Energy Technology Data Exchange (ETDEWEB)
Benioff, P.
1998-07-01
Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and systems that carry out experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with different environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.
Energy Technology Data Exchange (ETDEWEB)
Zurek, Wojciech H [Los Alamos National Laboratory
2008-01-01
Quantum Darwinism - proliferation, in the environment, of multiple records of selected states of the system (its information-theoretic progeny) - explains how quantum fragility of individual state can lead to classical robustness of their multitude.
Putz, Volkmar
2015-01-01
We consider ways of conceptualizing, rendering and perceiving quantum music, and quantum art in general. Thereby we give particular emphasis to its non-classical aspects, such as coherent superposition and entanglement.
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Koike-Akino, Toshiaki; Orlik, Philip
2012-01-01
This paper proposes a concept called rateless feedback coding. We redesign the existing LT and Raptor codes, by introducing new degree distributions for the case when a few feedback opportunities are available. We show that incorporating feedback to LT codes can significantly decrease both...... the coding overhead and the encoding/decoding complexity. Moreover, we show that, at the price of a slight increase in the coding overhead, linear complexity is achieved with Raptor feedback coding....
Cheon, T
2004-01-01
We show that the U(2) family of point interactions on a line can be utilized to provide the U(2) family of qubit operations for quantum information processing. Qubits are realized as localized states in either side of the point interaction which represents a controllable gate. The manipulation of qubits proceeds in a manner analogous to the operation of an abacus. Keywords: quantum computation, quantum contact interaction, quantum wire
Esteban Guevara
2006-01-01
The relationships between game theory and quantum mechanics let us propose certain quantization relationships through which we could describe and understand not only quantum but also classical, evolutionary and the biological systems that were described before through the replicator dynamics. Quantum mechanics could be used to explain more correctly biological and economical processes and even it could encloses theories like games and evolutionary dynamics. This could make quantum mechanics a...
2008-01-01
Quantum Nanomechanics is the emerging field which pertains to the mechanical behavior of nanoscale systems in the quantum domain. Unlike the conventional studies of vibration of molecules and phonons in solids, quantum nanomechanics is defined as the quantum behavior of the entire mechanical structure, including all of its constituents--the atoms, the molecules, the ions, the electrons as well as other excitations. The relevant degrees of freedom of the system are described by macroscopic var...
Abraham, Nikhil
2015-01-01
Hands-on exercises help you learn to code like a pro No coding experience is required for Coding For Dummies,your one-stop guide to building a foundation of knowledge inwriting computer code for web, application, and softwaredevelopment. It doesn't matter if you've dabbled in coding or neverwritten a line of code, this book guides you through the basics.Using foundational web development languages like HTML, CSS, andJavaScript, it explains in plain English how coding works and whyit's needed. Online exercises developed by Codecademy, a leading online codetraining site, help hone coding skill
Gao, Wen
2015-01-01
This comprehensive and accessible text/reference presents an overview of the state of the art in video coding technology. Specifically, the book introduces the tools of the AVS2 standard, describing how AVS2 can help to achieve a significant improvement in coding efficiency for future video networks and applications by incorporating smarter coding tools such as scene video coding. Topics and features: introduces the basic concepts in video coding, and presents a short history of video coding technology and standards; reviews the coding framework, main coding tools, and syntax structure of AV
Energy Technology Data Exchange (ETDEWEB)
Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
Automating quantum experiment control
Stevens, Kelly E.; Amini, Jason M.; Doret, S. Charles; Mohler, Greg; Volin, Curtis; Harter, Alexa W.
2017-03-01
The field of quantum information processing is rapidly advancing. As the control of quantum systems approaches the level needed for useful computation, the physical hardware underlying the quantum systems is becoming increasingly complex. It is already becoming impractical to manually code control for the larger hardware implementations. In this chapter, we will employ an approach to the problem of system control that parallels compiler design for a classical computer. We will start with a candidate quantum computing technology, the surface electrode ion trap, and build a system instruction language which can be generated from a simple machine-independent programming language via compilation. We incorporate compile time generation of ion routing that separates the algorithm description from the physical geometry of the hardware. Extending this approach to automatic routing at run time allows for automated initialization of qubit number and placement and additionally allows for automated recovery after catastrophic events such as qubit loss. To show that these systems can handle real hardware, we present a simple demonstration system that routes two ions around a multi-zone ion trap and handles ion loss and ion placement. While we will mainly use examples from transport-based ion trap quantum computing, many of the issues and solutions are applicable to other architectures.
Fehr, S.
2010-01-01
Quantum cryptography makes use of the quantum-mechanical behavior of nature for the design and analysis of cryptographic schemes. Optimally (but not always), quantum cryptography allows for the design of cryptographic schemes whose security is guaranteed solely by the laws of nature. This is in shar
Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes
Directory of Open Access Journals (Sweden)
Theodore J. Yoder
2016-09-01
Full Text Available It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions including magic state distillation. Widely overlooked, however, is the possibility of nontransversal, yet still fault-tolerant, gates that work directly on small quantum codes. Here, we demonstrate precisely the existence of such gates. In particular, we show how the limits of nontransversality can be overcome by performing rounds of intermediate error correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement. Moreover, the logical gates we construct, the most prominent examples being Toffoli and controlled-controlled-Z, often complete universal gate sets on their codes. We detail such universal constructions for the smallest quantum codes, the 5-qubit and 7-qubit codes, and then proceed to generalize the approach. One remarkable result of this generalization is that any nondegenerate stabilizer code with a complete set of fault-tolerant single-qubit Clifford gates has a universal set of fault-tolerant gates. Another is the interaction of logical qubits across different stabilizer codes, which, for instance, implies a broadly applicable method of code switching.
Gaussian bosonic synergy: quantum communication via realistic channels of zero quantum capacity
Smith, Graeme; Yard, Jon
2011-01-01
As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy: there exist pairs of discrete memoryless quantum channels, each of zero quantum capacity, which acquire positive quantum capacity when used together. Here we show that this "superactivation" phenomenon also occurs in the more realistic setting of optical channels with attenuation and Gaussian noise. This paves the way for its experimental realization and application in real-world communications systems.
Quantum Computing for Quantum Chemistry
2010-09-01
This three-year project consisted on the development and application of quantum computer algorithms for chemical applications. In particular, we developed algorithms for chemical reaction dynamics, electronic structure and protein folding. The first quantum computing for
Quantum Operations as Quantum States
Arrighi, P; Arrighi, Pablo; Patricot, Christophe
2004-01-01
In this article we formalize the correspondence between quantum states and quantum operations, and harness its consequences. This correspondence was already implicit in Choi's proof of the operator sum representation of Completely Positive-preserving linear maps; we go further and show that all of the important theorems concerning quantum operations can be derived as simple corollaries of those concerning quantum states. As we do so the discussion first provides an elegant and original review of the main features of quantum operations. Next (in the second half of the paper) we search for more results to arise from the correspondence. Thus we propose a factorizability condition and an extremal trace-preservedness condition for quantum operations, give two novel Schmidt-type decompositions of bipartite pure states and two interesting composition laws for which the set of quantum operations and quantum states remain stable. The latter enables us to define a group structure upon the set of totally entangled state...
Optimal probabilistic dense coding schemes
Kögler, Roger A.; Neves, Leonardo
2017-04-01
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be perfectly distinguished due to the non-orthogonality of the quantum states carrying them. So far, the decoding process has been approached in two ways: (i) The message is always inferred, but with an associated (minimum) error; (ii) the message is inferred without error, but only sometimes; in case of failure, nothing else is done. Here, we generalize on these approaches and propose novel optimal probabilistic decoding schemes. The first uses quantum-state separation to increase the distinguishability of the messages with an optimal success probability. This scheme is shown to include (i) and (ii) as special cases and continuously interpolate between them, which enables the decoder to trade-off between the level of confidence desired to identify the received messages and the success probability for doing so. The second scheme, called multistage decoding, applies only for qudits ( d-level quantum systems with d>2) and consists of further attempts in the state identification process in case of failure in the first one. We show that this scheme is advantageous over (ii) as it increases the mutual information between the sender and receiver.
On the Codes over a Semilocal Finite Ring
Directory of Open Access Journals (Sweden)
Abdullah Dertli
2015-10-01
Full Text Available In this paper, we study the structure of cyclic, quasi cyclic, constacyclic codes and their skew codes over the finite ring R. The Gray images of cyclic, quasi cyclic, skew cyclic, skew quasi cyclic and skew constacyclic codes over R are obtained. A necessary and sufficient condition for cyclic (negacyclic codes over R that contains its dual has been given. The parameters of quantum error correcting codes are obtained from both cyclic and negacyclic codes over R. Some examples are given. Firstly, quasi constacyclic and skew quasi constacyclic codes are introduced. By giving two inner product, it is investigated their duality. A sufficient condition for 1 generator skew quasi constacyclic codes to be free is determined.
Zurek, Wojciech Hubert
2009-03-01
Quantum Darwinism describes the proliferation, in the environment, of multiple records of selected states of a quantum system. It explains how the quantum fragility of a state of a single quantum system can lead to the classical robustness of states in their correlated multitude; shows how effective `wave-packet collapse' arises as a result of the proliferation throughout the environment of imprints of the state of the system; and provides a framework for the derivation of Born's rule, which relates the probabilities of detecting states to their amplitudes. Taken together, these three advances mark considerable progress towards settling the quantum measurement problem.
Ultracold Quantum Gases and Lattice Systems: Quantum Simulation of Lattice Gauge Theories
Wiese, U -J
2013-01-01
Abelian and non-Abelian gauge theories are of central importance in many areas of physics. In condensed matter physics, Abelian U(1) lattice gauge theories arise in the description of certain quantum spin liquids. In quantum information theory, Kitaev's toric code is a Z(2) lattice gauge theory. In particle physics, Quantum Chromodynamics (QCD), the non-Abelian SU(3) gauge theory of the strong interactions between quarks and gluons, is non-perturbatively regularized on a lattice. Quantum link models extend the concept of lattice gauge theories beyond the Wilson formulation, and are well suited for both digital and analog quantum simulation using ultracold atomic gases in optical lattices. Since quantum simulators do not suffer from the notorious sign problem, they open the door to studies of the real-time evolution of strongly coupled quantum systems, which are impossible with classical simulation methods. A plethora of interesting lattice gauge theories suggests itself for quantum simulation, which should al...
Towards self-correcting quantum memories
Michnicki, Kamil
This thesis presents a model of self-correcting quantum memories where quantum states are encoded using topological stabilizer codes and error correction is done using local measurements and local dynamics. Quantum noise poses a practical barrier to developing quantum memories. This thesis explores two types of models for suppressing noise. One model suppresses thermalizing noise energetically by engineering a Hamiltonian with a high energy barrier between code states. Thermalizing dynamics are modeled phenomenologically as a Markovian quantum master equation with only local generators. The second model suppresses stochastic noise with a cellular automaton that performs error correction using syndrome measurements and a local update rule. Several ways of visualizing and thinking about stabilizer codes are presented in order to design ones that have a high energy barrier: the non-local Ising model, the quasi-particle graph and the theory of welded stabilizer codes. I develop the theory of welded stabilizer codes and use it to construct a code with the highest known energy barrier in 3-d for spin Hamiltonians: the welded solid code. Although the welded solid code is not fully self correcting, it has some self correcting properties. It has an increased memory lifetime for an increased system size up to a temperature dependent maximum. One strategy for increasing the energy barrier is by mediating an interaction with an external system. I prove a no-go theorem for a class of Hamiltonians where the interaction terms are local, of bounded strength and commute with the stabilizer group. Under these conditions the energy barrier can only be increased by a multiplicative constant. I develop cellular automaton to do error correction on a state encoded using the toric code. The numerical evidence indicates that while there is no threshold, the model can extend the memory lifetime significantly. While of less theoretical importance, this could be practical for real
Quantum entanglement and quantum operation
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
It is a simple introduction to quantum entanglement and quantum operations. The authors focus on some applications of quantum entanglement and relations between two-qubit entangled states and unitary operations. It includes remote state preparation by using any pure entangled states, nonlocal operation implementation using entangled states, entanglement capacity of two-qubit gates and two-qubit gates construction.
Weaver, Nik
2010-01-01
We define a "quantum relation" on a von Neumann algebra M \\subset B(H) to be a weak* closed operator bimodule over its commutant M'. Although this definition is framed in terms of a particular representation of M, it is effectively representation independent. Quantum relations on l^\\infty(X) exactly correspond to subsets of X^2, i.e., relations on X. There is also a good definition of a "measurable relation" on a measure space, to which quantum relations partially reduce in the general abelian case. By analogy with the classical setting, we can identify structures such as quantum equivalence relations, quantum partial orders, and quantum graphs, and we can generalize Arveson's fundamental work on weak* closed operator algebras containing a masa to these cases. We are also able to intrinsically characterize the quantum relations on M in terms of families of projections in M \\otimes B(l^2).
Locally Orderless Registration Code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Locally orderless registration code
DEFF Research Database (Denmark)
2012-01-01
This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows.......This is code for the TPAMI paper "Locally Orderless Registration". The code requires intel threadding building blocks installed and is provided for 64 bit on mac, linux and windows....
Arbitrated quantum signature scheme based on cluster states
Yang, Yu-Guang; Lei, He; Liu, Zhi-Chao; Zhou, Yi-Hua; Shi, Wei-Min
2016-06-01
Cluster states can be exploited for some tasks such as topological one-way computation, quantum error correction, teleportation and dense coding. In this paper, we investigate and propose an arbitrated quantum signature scheme with cluster states. The cluster states are used for quantum key distribution and quantum signature. The proposed scheme can achieve an efficiency of 100 %. Finally, we also discuss its security against various attacks.
CALL FOR PAPERS: Quantum control
Mancini, Stefano; Wiseman, Howard M.; Man'ko, Vladimir I.
2004-10-01
(enclosing the electronic code) to: Journal of Optics B: Quantum and Semiclassical Optics, Institute of Physics Publishing, Dirac House, Temple Back, Bristol BS1 6BE, UK. All contributions should be accompanied by a readme file or covering letter, quoting `JOPB Topical Issue - Quantum control', giving the postal and e-mail addresses for correspondence. Any subsequent change of address should be notified to the publishing office. We look forward to receiving your contribution to this topical issue.
Quantum Games and Quantum Discord
Nawaz, Ahmad
2010-01-01
We quantize prisoners dilemma and chicken game by our generalized quantization scheme to explore the role of quantum discord in quantum games. In order to establish this connection we use Werner-like state as an initial state of the game. In this quantization scheme measurement can be performed in entangled as well as in product basis. For the measurement in entangled basis the dilemma in both the games can be resolved by separable states with non-zero quantum discord. Similarly for product basis measurement the payoffs are quantum mechanical only for nonzero values of quantum discord.
Crompton, Helen; LaFrance, Jason; van 't Hooft, Mark
2012-01-01
A QR (quick-response) code is a two-dimensional scannable code, similar in function to a traditional bar code that one might find on a product at the supermarket. The main difference between the two is that, while a traditional bar code can hold a maximum of only 20 digits, a QR code can hold up to 7,089 characters, so it can contain much more…
Error suppression via complementary gauge choices in Reed-Muller codes
Chamberland, Christopher; Jochym-O'Connor, Tomas
2017-09-01
Concatenation of two quantum error-correcting codes with complementary sets of transversal gates can provide a means toward universal fault-tolerant quantum computation. We first show that it is generally preferable to choose the inner code with the higher pseudo-threshold to achieve lower logical failure rates. We then explore the threshold properties of a wide range of concatenation schemes. Notably, we demonstrate that the concatenation of complementary sets of Reed-Muller codes can increase the code capacity threshold under depolarizing noise when compared to extensions of previously proposed concatenation models. We also analyze the properties of logical errors under circuit-level noise, showing that smaller codes perform better for all sampled physical error rates. Our work provides new insights into the performance of universal concatenated quantum codes for both code capacity and circuit-level noise.
Studies in quantum information theory
Menicucci, Nicolas C.
Quantum information theory started as the backdrop for quantum computing and is often considered only in relation to this technology, which is still in its infancy. But quantum information theory is only partly about quantum computing. While much of the interest in this field is spurred by the possible use of quantum computers for code breaking using fast factoring algorithms, to a physicist interested in deeper issues, it presents an entirely new set of questions based on an entirely different way of looking at the quantum world. This thesis is an exploration of several topics in quantum information theory. But it is also more than this. This thesis explores the new paradigm brought about by quantum information theory---that of physics as the flow of information. The thesis consists of three main parts. The first part describes my work on continuous-variable cluster states, a new platform for quantum computation. This begins with background material discussing classical and quantum computation and emphasizing the physical underpinnings of each, followed by a discussion of two recent unorthodox models of quantum computation. These models are combined into an original proposal for quantum computation using continuous-variable cluster states, including a proposed optical implementation. These are followed by a mathematical result radically simplifying the optical construction. Subsequent work simplifies this connection even further and provides a constructive proposal for scalable generation of large-scale cluster states---necessary if there is to be any hope of using this method in practical quantum computation. Experimental implementation is currently underway by my collaborators at The University of Virginia. The second part describes my work related to the physics of trapped ions, starting with an overview of the basic theory of linear ion traps. Although ion traps are often discussed in terms of their potential use for quantum computation, my work looks at their
Turbo Codes Extended with Outer BCH Code
DEFF Research Database (Denmark)
Andersen, Jakob Dahl
1996-01-01
The "error floor" observed in several simulations with the turbo codes is verified by calculation of an upper bound to the bit error rate for the ensemble of all interleavers. Also an easy way to calculate the weight enumerator used in this bound is presented. An extended coding scheme is proposed...
Pirandola, Stefano; Lupo, Cosmo; Giovannetti, Vittorio; Mancini, Stefano; Braunstein, Samuel L.
2011-11-01
The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory (Pirandola 2011 Phys. Rev. Lett. 106 090504). In the case of optical memories, such as CDs and DVDs, this discrimination involves lossy bosonic channels and can be remarkably boosted by the use of nonclassical light (quantum reading). Here we generalize these concepts by extending the model of memory from single-cell to multi-cell encoding. In general, information is stored in a block of cells by using a channel-codeword, i.e. a sequence of channels chosen according to a classical code. Correspondingly, the readout of data is realized by a process of ‘parallel’ channel discrimination, where the entire block of cells is probed simultaneously and decoded via an optimal collective measurement. In the limit of a large block we define the quantum reading capacity of the memory, quantifying the maximum number of readable bits per cell. This notion of capacity is nontrivial when we suitably constrain the physical resources of the decoder. For optical memories (encoding bosonic channels), such a constraint is energetic and corresponds to fixing the mean total number of photons per cell. In this case, we are able to prove a separation between the quantum reading capacity and the maximum information rate achievable by classical transmitters, i.e. arbitrary classical mixtures of coherent states. In fact, we can easily construct nonclassical transmitters that are able to outperform any classical transmitter, thus showing that the advantages of quantum reading persist in the optimal multi-cell scenario.
Hybrid Noncoherent Network Coding
Skachek, Vitaly; Nedic, Angelia
2011-01-01
We describe a novel extension of subspace codes for noncoherent networks, suitable for use when the network is viewed as a communication system that introduces both dimension and symbol errors. We show that when symbol erasures occur in a significantly large number of different basis vectors transmitted through the network and when the min-cut of the networks is much smaller then the length of the transmitted codewords, the new family of codes outperforms their subspace code counterparts. For the proposed coding scheme, termed hybrid network coding, we derive two upper bounds on the size of the codes. These bounds represent a variation of the Singleton and of the sphere-packing bound. We show that a simple concatenated scheme that represents a combination of subspace codes and Reed-Solomon codes is asymptotically optimal with respect to the Singleton bound. Finally, we describe two efficient decoding algorithms for concatenated subspace codes that in certain cases have smaller complexity than subspace decoder...
Concepts of a quantum information theory of many letters
Boström, K J
2000-01-01
A theoretical framework is presented allowing the treatment of quantum messages with components of variable length. To this aim a many-letter space is constructed which turns out to be a natural space for quantum messages of this type, generalizing the usual fixed-length quantum information theory which is fully contained within this framework. An observable is defined measuring the amount of quantum information carried by a particular message, with the "qbit" obtaining a second meaning as its unit. A general characterization of quantum codes is given where compression codes are defined by their property of decreasing the average information content of a given a priori message ensemble. A lossless quantum coding scheme - analog to the classical Huffman scheme but different from the Braunstein scheme - is implemented, which not only ensures perfect fidelity in retrieving the original messages but also provides optimal compression.
Gilbert, Gerald; Hamrick, Michael
2013-01-01
This book provides a detailed account of the theory and practice of quantum cryptography. Suitable as the basis for a course in the subject at the graduate level, it crosses the disciplines of physics, mathematics, computer science and engineering. The theoretical and experimental aspects of the subject are derived from first principles, and attention is devoted to the practical development of realistic quantum communications systems. The book also includes a comprehensive analysis of practical quantum cryptography systems implemented in actual physical environments via either free-space or fiber-optic cable quantum channels. This book will be a valuable resource for graduate students, as well as professional scientists and engineers, who desire an introduction to the field that will enable them to undertake research in quantum cryptography. It will also be a useful reference for researchers who are already active in the field, and for academic faculty members who are teaching courses in quantum information s...
Arrighi, P
2003-01-01
Alice communicates with words drawn uniformly amongst $\\{\\ket{j}\\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\\{\\frac{\\ket{j}+i\\ket{k}}{\\sqrt{2}}\\}$ between her messages. Such pairwise superpositions of possible words cannot be distinguished from the message words. Thus as malevolent Eve observes the quantum channel, she runs the risk of damaging the superpositions (by causing a collapse). At the receiving end honest Bob, whom we assume is warned of the quantum decoys' distribution, checks upon their integrity with a measurement. The present work establishes, in the case of individual attacks, the tradeoff between Eve's information gain (her chances, if a message word was sent, of guessing which) and the disturbance she induces (Bob's chances, if a quantum decoy was sent, to detect tampering). Besides secure channel protocols, quantum decoys seem a powerful primitive for constructing n-dimensional quantum cryptographic applications. Moreover the methods emp...
Busch, Paul; Pellonpää, Juha-Pekka; Ylinen, Kari
2016-01-01
This is a book about the Hilbert space formulation of quantum mechanics and its measurement theory. It contains a synopsis of what became of the Mathematical Foundations of Quantum Mechanics since von Neumann’s classic treatise with this title. Fundamental non-classical features of quantum mechanics—indeterminacy and incompatibility of observables, unavoidable measurement disturbance, entanglement, nonlocality—are explicated and analysed using the tools of operational quantum theory. The book is divided into four parts: 1. Mathematics provides a systematic exposition of the Hilbert space and operator theoretic tools and relevant measure and integration theory leading to the Naimark and Stinespring dilation theorems; 2. Elements develops the basic concepts of quantum mechanics and measurement theory with a focus on the notion of approximate joint measurability; 3. Realisations offers in-depth studies of the fundamental observables of quantum mechanics and some of their measurement implementations; and 4....
2010-03-04
efficient or less costly than their classical counterparts. A large-scale quantum computer is certainly an extremely ambi- tious goal, appearing to us...outperform the largest classical supercomputers in solving some specific problems important for data encryption. In the long term, another application...which the quantum computer depends, causing the quantum mechanically destructive process known as decoherence . Decoherence comes in several forms
Hughes, R J; Dyer, P L; Luther, G G; Morgan, G L; Schauer, M M; Hughes, Richard J; Dyer, P; Luther, G G; Morgan, G L; Schauer, M
1995-01-01
Quantum cryptography is a new method for secret communications offering the ultimate security assurance of the inviolability of a Law of Nature. In this paper we shall describe the theory of quantum cryptography, its potential relevance and the development of a prototype system at Los Alamos, which utilises the phenomenon of single-photon interference to perform quantum cryptography over an optical fiber communications link.
Classical information capacity of superdense coding
Bowen, G H
2001-01-01
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum classical channel capacity for states that are not maximally entangled is derived. Particular schemes are then shown to attain this capacity, firstly for pairs of qubits, and secondly for pairs of qutrits.
Pirandola, Stefano; Giovannetti, Vittorio; Mancini, Stefano; Braunstein, Samuel L
2011-01-01
The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory [S. Pirandola, Phys. Rev. Lett. 106, 090504 (2011)]. In the case of optical memories, such as CDs and DVDs, this discrimination involves lossy bosonic channels and can be remarkably boosted by the use of nonclassical light (quantum reading). Here we generalize these concepts by extending the model of memory from single-cell to multi-cell encoding. In general, information is stored in a block of cells by using a channel-codeword, i.e., a sequence of channels chosen according to a classical code. Correspondingly, the readout of data is realized by a process of "parallel" channel discrimination, where the entire block of cells is probed simultaneously and decoded via an optimal collective measurement. In the limit of an infinite block we define the quantum reading capacity of the memory, quantify...
Energy Technology Data Exchange (ETDEWEB)
Rodgers, P
1998-03-01
There is more to information than a string of ones and zeroes the ability of ''quantum bits'' to be in two states at the same time could revolutionize information technology. In the mid-1930s two influential but seemingly unrelated papers were published. In 1935 Einstein, Podolsky and Rosen proposed the famous EPR paradox that has come to symbolize the mysteries of quantum mechanics. Two years later, Alan Turing introduced the universal Turing machine in an enigmatically titled paper, On computable numbers, and laid the foundations of the computer industry one of the biggest industries in the world today. Although quantum physics is essential to understand the operation of transistors and other solid-state devices in computers, computation itself has remained a resolutely classical process. Indeed it seems only natural that computation and quantum theory should be kept as far apart as possible surely the uncertainty associated with quantum theory is anathema to the reliability expected from computers? Wrong. In 1985 David Deutsch introduced the universal quantum computer and showed that quantum theory can actually allow computers to do more rather than less. The ability of particles to be in a superposition of more than one quantum state naturally introduces a form of parallelism that can, in principle, perform some traditional computing tasks faster than is possible with classical computers. Moreover, quantum computers are capable of other tasks that are not conceivable with their classical counterparts. Similar breakthroughs in cryptography and communication followed. (author)
Quantum Networks for Generating Arbitrary Quantum States
Kaye, Phillip; Mosca, Michele
2004-01-01
Quantum protocols often require the generation of specific quantum states. We describe a quantum algorithm for generating any prescribed quantum state. For an important subclass of states, including pure symmetric states, this algorithm is efficient.
Network coding for computing: Linear codes
Appuswamy, Rathinakumar; Karamchandani, Nikhil; Zeger, Kenneth
2011-01-01
In network coding it is known that linear codes are sufficient to achieve the coding capacity in multicast networks and that they are not sufficient in general to achieve the coding capacity in non-multicast networks. In network computing, Rai, Dey, and Shenvi have recently shown that linear codes are not sufficient in general for solvability of multi-receiver networks with scalar linear target functions. We study single receiver networks where the receiver node demands a target function of the source messages. We show that linear codes may provide a computing capacity advantage over routing only when the receiver demands a `linearly-reducible' target function. % Many known target functions including the arithmetic sum, minimum, and maximum are not linearly-reducible. Thus, the use of non-linear codes is essential in order to obtain a computing capacity advantage over routing if the receiver demands a target function that is not linearly-reducible. We also show that if a target function is linearly-reducible,...
Secret Sharing of a Quantum State.
Lu, He; Zhang, Zhen; Chen, Luo-Kan; Li, Zheng-Da; Liu, Chang; Li, Li; Liu, Nai-Le; Ma, Xiongfeng; Chen, Yu-Ao; Pan, Jian-Wei
2016-07-15
Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share a certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold secret sharing scheme is confidentiality: with less than the designated number of players, no information can be recovered. Furthermore, in a quantum scenario, one additional critical criterion exists: the capability of sharing entangled and unknown quantum information. Here, by employing a six-photon entangled state, we demonstrate a quantum threshold scheme, where the shared quantum secrecy can be efficiently reconstructed with a state fidelity as high as 93%. By observing that any one or two parties cannot recover the secrecy, we show that our scheme meets the confidentiality criterion. Meanwhile, we also demonstrate that entangled quantum information can be shared and recovered via our setting, which shows that our implemented scheme is fully quantum. Moreover, our experimental setup can be treated as a decoding circuit of the five-qubit quantum error-correcting code with two erasure errors.
Efficient self-consistent quantum transport simulator for quantum devices
Energy Technology Data Exchange (ETDEWEB)
Gao, X., E-mail: xngao@sandia.gov; Mamaluy, D.; Nielsen, E.; Young, R. W.; Lilly, M. P.; Bishop, N. C.; Carroll, M. S.; Muller, R. P. [Sandia National Laboratories, 1515 Eubank SE, Albuquerque, New Mexico 87123 (United States); Shirkhorshidian, A. [Sandia National Laboratories, 1515 Eubank SE, Albuquerque, New Mexico 87123 (United States); University of New Mexico, Albuquerque, New Mexico 87131 (United States)
2014-04-07
We present a self-consistent one-dimensional (1D) quantum transport simulator based on the Contact Block Reduction (CBR) method, aiming for very fast and robust transport simulation of 1D quantum devices. Applying the general CBR approach to 1D open systems results in a set of very simple equations that are derived and given in detail for the first time. The charge self-consistency of the coupled CBR-Poisson equations is achieved by using the predictor-corrector iteration scheme with the optional Anderson acceleration. In addition, we introduce a new way to convert an equilibrium electrostatic barrier potential calculated from an external simulator to an effective doping profile, which is then used by the CBR-Poisson code for transport simulation of the barrier under non-zero biases. The code has been applied to simulate the quantum transport in a double barrier structure and across a tunnel barrier in a silicon double quantum dot. Extremely fast self-consistent 1D simulations of the differential conductance across a tunnel barrier in the quantum dot show better qualitative agreement with experiment than non-self-consistent simulations.
Quantum physics without quantum philosophy
Energy Technology Data Exchange (ETDEWEB)
Duerr, Detlef [Muenchen Univ. (Germany). Mathematisches Inst.; Goldstein, Sheldon [Rutgers State Univ., Piscataway, NJ (United States). Dept. of Mathematics; Zanghi, Nino [Genova Univ. (Italy); Istituto Nazionale Fisica Nucleare, Genova (Italy)
2013-02-01
Integrates and comments on the authors' seminal papers in the field. Emphasizes the natural way in which quantum phenomena emerge from the Bohmian picture. Helps to answer many of the objections raised to Bohmian quantum mechanics. Useful overview and summary for newcomers and students. It has often been claimed that without drastic conceptual innovations a genuine explanation of quantum interference effects and quantum randomness is impossible. This book concerns Bohmian mechanics, a simple particle theory that is a counterexample to such claims. The gentle introduction and other contributions collected here show how the phenomena of non-relativistic quantum mechanics, from Heisenberg's uncertainty principle to non-commuting observables, emerge from the Bohmian motion of particles, the natural particle motion associated with Schroedinger's equation. This book will be of value to all students and researchers in physics with an interest in the meaning of quantum theory as well as to philosophers of science.
Quantum entanglement and quantum operation
Institute of Scientific and Technical Information of China (English)
2008-01-01
It is a simple introduction to quantum entanglement and quantum operations.The authors focus on some applications of quantum entanglement and relations between two-qubit entangled states and unitary operations.It includes remote state preparation by using any pure entangled states,nonlocal operation implementation using entangled states,entanglement capacity of two-qubit gates and two-qubit gates construction.
Practices in Code Discoverability
Teuben, Peter; Nemiroff, Robert J; Shamir, Lior
2012-01-01
Much of scientific progress now hinges on the reliability, falsifiability and reproducibility of computer source codes. Astrophysics in particular is a discipline that today leads other sciences in making useful scientific components freely available online, including data, abstracts, preprints, and fully published papers, yet even today many astrophysics source codes remain hidden from public view. We review the importance and history of source codes in astrophysics and previous efforts to develop ways in which information about astrophysics codes can be shared. We also discuss why some scientist coders resist sharing or publishing their codes, the reasons for and importance of overcoming this resistance, and alert the community to a reworking of one of the first attempts for sharing codes, the Astrophysics Source Code Library (ASCL). We discuss the implementation of the ASCL in an accompanying poster paper. We suggest that code could be given a similar level of referencing as data gets in repositories such ...
Djordjevic, Ivan; Vasic, Bane
2010-01-01
This unique book provides a coherent and comprehensive introduction to the fundamentals of optical communications, signal processing and coding for optical channels. It is the first to integrate the fundamentals of coding theory and optical communication.
Quantum biological channel modeling and capacity calculation.
Djordjevic, Ivan B
2012-12-10
Quantum mechanics has an important role in photosynthesis, magnetoreception, and evolution. There were many attempts in an effort to explain the structure of genetic code and transfer of information from DNA to protein by using the concepts of quantum mechanics. The existing biological quantum channel models are not sufficiently general to incorporate all relevant contributions responsible for imperfect protein synthesis. Moreover, the problem of determination of quantum biological channel capacity is still an open problem. To solve these problems, we construct the operator-sum representation of biological channel based on codon basekets (basis vectors), and determine the quantum channel model suitable for study of the quantum biological channel capacity and beyond. The transcription process, DNA point mutations, insertions, deletions, and translation are interpreted as the quantum noise processes. The various types of quantum errors are classified into several broad categories: (i) storage errors that occur in DNA itself as it represents an imperfect storage of genetic information, (ii) replication errors introduced during DNA replication process, (iii) transcription errors introduced during DNA to mRNA transcription, and (iv) translation errors introduced during the translation process. By using this model, we determine the biological quantum channel capacity and compare it against corresponding classical biological channel capacity. We demonstrate that the quantum biological channel capacity is higher than the classical one, for a coherent quantum channel model, suggesting that quantum effects have an important role in biological systems. The proposed model is of crucial importance towards future study of quantum DNA error correction, developing quantum mechanical model of aging, developing the quantum mechanical models for tumors/cancer, and study of intracellular dynamics in general.
Quantum Biological Channel Modeling and Capacity Calculation
Directory of Open Access Journals (Sweden)
Ivan B. Djordjevic
2012-12-01
Full Text Available Quantum mechanics has an important role in photosynthesis, magnetoreception, and evolution. There were many attempts in an effort to explain the structure of genetic code and transfer of information from DNA to protein by using the concepts of quantum mechanics. The existing biological quantum channel models are not sufficiently general to incorporate all relevant contributions responsible for imperfect protein synthesis. Moreover, the problem of determination of quantum biological channel capacity is still an open problem. To solve these problems, we construct the operator-sum representation of biological channel based on codon basekets (basis vectors, and determine the quantum channel model suitable for study of the quantum biological channel capacity and beyond. The transcription process, DNA point mutations, insertions, deletions, and translation are interpreted as the quantum noise processes. The various types of quantum errors are classified into several broad categories: (i storage errors that occur in DNA itself as it represents an imperfect storage of genetic information, (ii replication errors introduced during DNA replication process, (iii transcription errors introduced during DNA to mRNA transcription, and (iv translation errors introduced during the translation process. By using this model, we determine the biological quantum channel capacity and compare it against corresponding classical biological channel capacity. We demonstrate that the quantum biological channel capacity is higher than the classical one, for a coherent quantum channel model, suggesting that quantum effects have an important role in biological systems. The proposed model is of crucial importance towards future study of quantum DNA error correction, developing quantum mechanical model of aging, developing the quantum mechanical models for tumors/cancer, and study of intracellular dynamics in general.
Schrödinger's killer app race to build the world's first quantum computer
Dowling, Jonathan P
2013-01-01
The race is on to construct the first quantum code breaker, as the winner will hold the key to the entire Internet. From international, multibillion-dollar financial transactions to top-secret government communications, all would be vulnerable to the secret-code-breaking ability of the quantum computer. Written by a renowned quantum physicist closely involved in the U.S. government's development of quantum information science, Schrodinger's Killer App: Race to Build the World's First Quantum Computer presents an inside look at the government's quest to build a quantum computer capable of solvi
Quantum Physics Without Quantum Philosophy
Dürr, Detlef; Zanghì, Nino
2013-01-01
It has often been claimed that without drastic conceptual innovations a genuine explanation of quantum interference effects and quantum randomness is impossible. This book concerns Bohmian mechanics, a simple particle theory that is a counterexample to such claims. The gentle introduction and other contributions collected here show how the phenomena of non-relativistic quantum mechanics, from Heisenberg's uncertainty principle to non-commuting observables, emerge from the Bohmian motion of particles, the natural particle motion associated with Schrödinger's equation. This book will be of value to all students and researchers in physics with an interest in the meaning of quantum theory as well as to philosophers of science.
A Hybrid Chaotic Quantum Evolutionary Algorithm
DEFF Research Database (Denmark)
Cai, Y.; Zhang, M.; Cai, H.
2010-01-01
A hybrid chaotic quantum evolutionary algorithm is proposed to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm. The proposed algorithm adopts the chaotic initialization method to generate initial population which will form...... and enhance the global search ability. A large number of tests show that the proposed algorithm has higher convergence speed and better optimizing ability than quantum evolutionary algorithm, real-coded quantum evolutionary algorithm and hybrid quantum genetic algorithm. Tests also show that when chaos...... is introduced to quantum evolutionary algorithm, the hybrid chaotic search strategy is superior to the carrier chaotic strategy, and has better comprehensive performance than the chaotic mutation strategy in most of cases. Especially, the proposed algorithm is the only one that has 100% convergence rate in all...
Zhang, Linfan; Zheng, Shuang
2015-01-01
Quick Response code opens possibility to convey data in a unique way yet insufficient prevention and protection might lead into QR code being exploited on behalf of attackers. This thesis starts by presenting a general introduction of background and stating two problems regarding QR code security, which followed by a comprehensive research on both QR code itself and related issues. From the research a solution taking advantages of cloud and cryptography together with an implementation come af...
A. van Deursen (Arie); L.M.F. Moonen (Leon); A. van den Bergh; G. Kok
2001-01-01
textabstractTwo key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from
Bergstra, Jan A
2010-01-01
General definitions as well as rules of reasoning regarding control code production, distribution, deployment, and usage are described. The role of testing, trust, confidence and risk analysis is considered. A rationale for control code testing is sought and found for the case of safety critical embedded control code.
DEFF Research Database (Denmark)
Bombin Palomo, Hector
2015-01-01
Color codes are topological stabilizer codes with unusual transversality properties. Here I show that their group of transversal gates is optimal and only depends on the spatial dimension, not the local geometry. I also introduce a generalized, subsystem version of color codes. In 3D they allow...
Deursen, A. van; Moonen, L.M.F.; Bergh, A. van den; Kok, G.
2001-01-01
Two key aspects of extreme programming (XP) are unit testing and merciless refactoring. Given the fact that the ideal test code / production code ratio approaches 1:1, it is not surprising that unit tests are being refactored. We found that refactoring test code is different from refactoring product
ARC Code TI: CODE Software Framework
National Aeronautics and Space Administration — CODE is a software framework for control and observation in distributed environments. The basic functionality of the framework allows a user to observe a distributed...
ARC Code TI: ROC Curve Code Augmentation
National Aeronautics and Space Administration — ROC (Receiver Operating Characteristic) curve Code Augmentation was written by Rodney Martin and John Stutz at NASA Ames Research Center and is a modification of ROC...
Fountain Codes: LT And Raptor Codes Implementation
Directory of Open Access Journals (Sweden)
Ali Bazzi, Hiba Harb
2017-01-01
Full Text Available Digital fountain codes are a new class of random error correcting codes designed for efficient and reliable data delivery over erasure channels such as internet. These codes were developed to provide robustness against erasures in a way that resembles a fountain of water. A digital fountain is rateless in a way that sender can send limitless number of encoded packets. The receiver doesn’t care which packets are received or lost as long as the receiver gets enough packets to recover original data. In this paper, the design of the fountain codes is explored with its implementation of the encoding and decoding algorithm so that the performance in terms of encoding/decoding symbols, reception overhead, data length, and failure probability is studied.
Abrams, D.; Williams, C.
1999-01-01
This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.
Manning, Phillip
2011-01-01
The study of quantum theory allowed twentieth-century scientists to examine the world in a new way, one that was filled with uncertainties and probabilities. Further study also led to the development of lasers, the atomic bomb, and the computer. This exciting new book clearly explains quantum theory and its everyday uses in our world.
Sastry, R R
1999-01-01
The infinite dimensional generalization of the quantum mechanics of extended objects, namely, the quantum field theory of extended objects is employed to address the hitherto nonrenormalizable gravitational interaction following which the cosmological constant problem is addressed. The response of an electron to a weak gravitational field (linear approximation) is studied and the order $\\alpha$ correction to the magnetic gravitational moment is computed.
Quantum error correction against photon loss using NOON states
Bergmann, Marcel; van Loock, Peter
2016-07-01
The so-called NOON states are quantum optical resources known to be useful especially for quantum lithography and metrology. At the same time, they are known to be very sensitive to photon losses and rather hard to produce experimentally. Concerning the former, here we present a scheme where NOON states are the elementary resources for building quantum error-correction codes against photon losses, thus demonstrating that such resources can also be useful to suppress the effect of loss. Our NOON code is an exact code that can be systematically extended from one-photon to higher-number losses. Its loss scaling depending on the codeword photon number is the same as for some existing, exact loss codes such as bosonic and quantum parity codes, but its codeword mode number is intermediate between that of the other codes. Another generalization of the NOON code is given for arbitrary logical qudits instead of logical qubits. While, in general, the final codewords are always obtainable from multimode NOON states through application of beam splitters, both codewords for the one-photon-loss qubit NOON code can be simply created from single-photon states with beam splitters. We give various examples and also discuss a potential application of our qudit code for quantum communication.
Moussa, Osama; Ryan, Colm A; Laflamme, Raymond
2011-01-01
We report the implementation of a 3-qubit quantum error correction code (QECC) on a quantum information processor realized by the magnetic resonance of Carbon nuclei in a single crystal of Malonic Acid. The code corrects for phase errors induced on the qubits due to imperfect decoupling of the magnetic environment represented by nearby spins, as well as unwanted evolution under the internal Hamiltonian. We also experimentally demonstrate sufficiently high fidelity control to implement two rounds of quantum error correction. This is a demonstration of state-of-the-art control in solid state nuclear magnetic resonance, a leading test-bed for the implementation of quantum algorithms.
Moussa, Osama; Baugh, Jonathan; Ryan, Colm A; Laflamme, Raymond
2011-10-14
We report the implementation of a 3-qubit quantum error-correction code on a quantum information processor realized by the magnetic resonance of carbon nuclei in a single crystal of malonic acid. The code corrects for phase errors induced on the qubits due to imperfect decoupling of the magnetic environment represented by nearby spins, as well as unwanted evolution under the internal Hamiltonian. We also experimentally demonstrate sufficiently high-fidelity control to implement two rounds of quantum error correction. This is a demonstration of state-of-the-art control in solid state nuclear magnetic resonance, a leading test bed for the implementation of quantum algorithms.
Hadjiivanov, Ludmil
2015-01-01
Expository paper providing a historical survey of the gradual transformation of the "philosophical discussions" between Bohr, Einstein and Schr\\"odinger on foundational issues in quantum mechanics into a quantitative prediction of a new quantum effect, its experimental verification and its proposed (and loudly advertised) applications. The basic idea of the 1935 paper of Einstein-Podolsky-Rosen (EPR) was reformulated by David Bohm for a finite dimensional spin system. This allowed John Bell to derive his inequalities that separate the prediction of quantum entanglement from its possible classical interpretation. We reproduce here their later (1971) version, reviewing on the way the generalization (and mathematical derivation) of Heisenberg's uncertainty relations (due to Weyl and Schr\\"odinger) needed for the passage from EPR to Bell. We also provide an improved derivation of the quantum theoretic violation of Bell's inequalities. Soon after the experimental confirmation of the quantum entanglement (culminati...
Richter, Johannes; Farnell, Damian; Bishop, Raymod
2004-01-01
The investigation of magnetic systems where quantum effects play a dominant role has become a very active branch of solid-state-physics research in its own right. The first three chapters of the "Quantum Magnetism" survey conceptual problems and provide insights into the classes of systems considered, namely one-dimensional, two-dimensional and molecular magnets. The following chapters introduce the methods used in the field of quantum magnetism, including spin wave analysis, exact diagonalization, quantum field theory, coupled cluster methods and the Bethe ansatz. The book closes with a chapter on quantum phase transitions and a contribution that puts the wealth of phenomena into the context of experimental solid-state physics. Closing a gap in the literature, this volume is intended both as an introductory text at postgraduate level and as a modern, comprehensive reference for researchers in the field.
Pearsall, Thomas P
2017-01-01
This textbook employs a pedagogical approach that facilitates access to the fundamentals of Quantum Photonics. It contains an introductory description of the quantum properties of photons through the second quantization of the electromagnetic field, introducing stimulated and spontaneous emission of photons at the quantum level. Schrödinger’s equation is used to describe the behavior of electrons in a one-dimensional potential. Tunneling through a barrier is used to introduce the concept of nonlocality of an electron at the quantum level, which is closely-related to quantum confinement tunneling, resonant tunneling, and the origin of energy bands in both periodic (crystalline) and aperiodic (non-crystalline) materials. Introducing the concepts of reciprocal space, Brillouin zones, and Bloch’s theorem, the determination of electronic band structure using the pseudopotential method is presented, allowing direct computation of the band structures of most group IV, group III-V, and group II-VI semiconducto...
Kiefer, Claus
2012-01-01
The search for a quantum theory of the gravitational field is one of the great open problems in theoretical physics. This book presents a self-contained discussion of the concepts, methods and applications that can be expected in such a theory. The two main approaches to its construction - the direct quantisation of Einstein's general theory of relativity and string theory - are covered. Whereas the first attempts to construct a viable theory for the gravitational field alone, string theory assumes that a quantum theory of gravity will be achieved only through a unification of all the interactions. However, both employ the general method of quantization of constrained systems, which is described together with illustrative examples relevant for quantum gravity. There is a detailed presentation of the main approaches employed in quantum general relativity: path-integral quantization, the background-field method and canonical quantum gravity in the metric, connection and loop formulations. The discussion of stri...
Rae, Alastair I M
2016-01-01
A Thorough Update of One of the Most Highly Regarded Textbooks on Quantum Mechanics Continuing to offer an exceptionally clear, up-to-date treatment of the subject, Quantum Mechanics, Sixth Edition explains the concepts of quantum mechanics for undergraduate students in physics and related disciplines and provides the foundation necessary for other specialized courses. This sixth edition builds on its highly praised predecessors to make the text even more accessible to a wider audience. It is now divided into five parts that separately cover broad topics suitable for any general course on quantum mechanics. New to the Sixth Edition * Three chapters that review prerequisite physics and mathematics, laying out the notation, formalism, and physical basis necessary for the rest of the book * Short descriptions of numerous applications relevant to the physics discussed, giving students a brief look at what quantum mechanics has made possible industrially and scientifically * Additional end-of-chapter problems with...
Universal Rateless Codes From Coupled LT Codes
Aref, Vahid
2011-01-01
It was recently shown that spatial coupling of individual low-density parity-check codes improves the belief-propagation threshold of the coupled ensemble essentially to the maximum a posteriori threshold of the underlying ensemble. We study the performance of spatially coupled low-density generator-matrix ensembles when used for transmission over binary-input memoryless output-symmetric channels. We show by means of density evolution that the threshold saturation phenomenon also takes place in this setting. Our motivation for studying low-density generator-matrix codes is that they can easily be converted into rateless codes. Although there are already several classes of excellent rateless codes known to date, rateless codes constructed via spatial coupling might offer some additional advantages. In particular, by the very nature of the threshold phenomenon one expects that codes constructed on this principle can be made to be universal, i.e., a single construction can uniformly approach capacity over the cl...
Software Certification - Coding, Code, and Coders
Havelund, Klaus; Holzmann, Gerard J.
2011-01-01
We describe a certification approach for software development that has been adopted at our organization. JPL develops robotic spacecraft for the exploration of the solar system. The flight software that controls these spacecraft is considered to be mission critical. We argue that the goal of a software certification process cannot be the development of "perfect" software, i.e., software that can be formally proven to be correct under all imaginable and unimaginable circumstances. More realistically, the goal is to guarantee a software development process that is conducted by knowledgeable engineers, who follow generally accepted procedures to control known risks, while meeting agreed upon standards of workmanship. We target three specific issues that must be addressed in such a certification procedure: the coding process, the code that is developed, and the skills of the coders. The coding process is driven by standards (e.g., a coding standard) and tools. The code is mechanically checked against the standard with the help of state-of-the-art static source code analyzers. The coders, finally, are certified in on-site training courses that include formal exams.
A noise immunity controlled quantum teleportation protocol
Li, Dong-fen; Wang, Rui-jin; Zhang, Feng-li; Baagyere, Edward; Qin, Zhen; Xiong, Hu; Zhan, Huayi
2016-08-01
With the advent of the Internet and information and communication technology, quantum teleportation has become an important field in information security and its application areas. This is because quantum teleportation has the ability to attain a timely secret information delivery and offers unconditional security. And as such, the field of quantum teleportation has become a hot research topic in recent years. However, noise has serious effect on the safety of quantum teleportation within the aspects of information fidelity, channel capacity and information transfer. Therefore, the main purpose of this paper is to address these problems of quantum teleportation. Firstly, in order to resist collective noise, we construct a decoherence-free subspace under different noise scenarios to establish a two-dimensional fidelity quantum teleportation models. And also create quantum teleportation of multiple degree of freedom, and these models ensure the accuracy and availability of the exchange of information and in multiple degree of freedom. Secondly, for easy preparation, measurement and implementation, we use super dense coding features to build an entangled quantum secret exchange channel. To improve the channel utilization and capacity, an efficient super dense coding method based on ultra-entanglement exchange is used. Thirdly, continuous variables of the controlled quantum key distribution were designed for quantum teleportation; in addition, we perform Bell-basis measurement under the collective noise and also prepare the storage technology of quantum states to achieve one-bit key by three-photon encoding to improve its security and efficiency. We use these two methods because they conceal information, resist a third party attack and can detect eavesdropping. Our proposed methods, according to the security analysis, are able to solve the problems associated with the quantum teleportation under various noise environments.
The decoupling approach to quantum information theory
Dupuis, Frédéric
2010-04-01
Quantum information theory studies the fundamental limits that physical laws impose on information processing tasks such as data compression and data transmission on noisy channels. This thesis presents general techniques that allow one to solve many fundamental problems of quantum information theory in a unified framework. The central theorem of this thesis proves the existence of a protocol that transmits quantum data that is partially known to the receiver through a single use of an arbitrary noisy quantum channel. In addition to the intrinsic interest of this problem, this theorem has as immediate corollaries several central theorems of quantum information theory. The following chapters use this theorem to prove the existence of new protocols for two other types of quantum channels, namely quantum broadcast channels and quantum channels with side information at the transmitter. These protocols also involve sending quantum information partially known by the receiver with a single use of the channel, and have as corollaries entanglement-assisted and unassisted asymptotic coding theorems. The entanglement-assisted asymptotic versions can, in both cases, be considered as quantum versions of the best coding theorems known for the classical versions of these problems. The last chapter deals with a purely quantum phenomenon called locking. We demonstrate that it is possible to encode a classical message into a quantum state such that, by removing a subsystem of logarithmic size with respect to its total size, no measurement can have significant correlations with the message. The message is therefore "locked" by a logarithmic-size key. This thesis presents the first locking protocol for which the success criterion is that the trace distance between the joint distribution of the message and the measurement result and the product of their marginals be sufficiently small.
A noise immunity controlled quantum teleportation protocol
Li, Dong-fen; Wang, Rui-jin; Zhang, Feng-li; Baagyere, Edward; Qin, Zhen; Xiong, Hu; Zhan, Huayi
2016-11-01
With the advent of the Internet and information and communication technology, quantum teleportation has become an important field in information security and its application areas. This is because quantum teleportation has the ability to attain a timely secret information delivery and offers unconditional security. And as such, the field of quantum teleportation has become a hot research topic in recent years. However, noise has serious effect on the safety of quantum teleportation within the aspects of information fidelity, channel capacity and information transfer. Therefore, the main purpose of this paper is to address these problems of quantum teleportation. Firstly, in order to resist collective noise, we construct a decoherence-free subspace under different noise scenarios to establish a two-dimensional fidelity quantum teleportation models. And also create quantum teleportation of multiple degree of freedom, and these models ensure the accuracy and availability of the exchange of information and in multiple degree of freedom. Secondly, for easy preparation, measurement and implementation, we use super dense coding features to build an entangled quantum secret exchange channel. To improve the channel utilization and capacity, an efficient super dense coding method based on ultra-entanglement exchange is used. Thirdly, continuous variables of the controlled quantum key distribution were designed for quantum teleportation; in addition, we perform Bell-basis measurement under the collective noise and also prepare the storage technology of quantum states to achieve one-bit key by three-photon encoding to improve its security and efficiency. We use these two methods because they conceal information, resist a third party attack and can detect eavesdropping. Our proposed methods, according to the security analysis, are able to solve the problems associated with the quantum teleportation under various noise environments.
Directory of Open Access Journals (Sweden)
Praveena Murugesan
2014-01-01
Full Text Available Reversible logic gates under ideal conditions produce zero power dissipation. This factor highlights the usage of these gates in optical computing, low power CMOS design, quantum optics and quantum computing. The growth of decimal arithmetic in various applications as stressed the need to propose the study on reversible binary to BCD converter which plays a greater role in decimal multiplication for providing faster results. The different parameters such as gate count,garbage output and constant input are more optimized in the proposed fixed bit binary to binary coded decimal converter than the existing design.
Information transfer through quantum channels
Energy Technology Data Exchange (ETDEWEB)
Kretschmann, D.
2007-03-12
channel. We then explain how all known coding theorems can be generalized from memoryless channels to forgetful memory channels. We also present examples for non-forgetful channels, and derive generic entropic upper bounds on their capacities for (private) classical and quantum information transfer. Ch. 7 provides a brief introduction to quantum information spectrum methods as a promising approach to coding theorems for completely general quantum sources and channels. We present a data compression theorem for general quantum sources and apply these results to ergodic as well as mixed sources. Finally we investigate the continuity of distillable entanglement - another key notion of the field, which characterizes the optimal asymptotic rate at which maximally entangled states can be generated from many copies of a less entangled state. We derive uniform norm bounds for all states with full support, and we extend some of these results to quantum channel capacities. (orig.)
Quantum Computation Toward Quantum Gravity
Zizzi, P. A.
2001-08-01
The aim of this paper is to enlighten the emerging relevance of Quantum Information Theory in the field of Quantum Gravity. As it was suggested by J. A. Wheeler, information theory must play a relevant role in understanding the foundations of Quantum Mechanics (the "It from bit" proposal). Here we suggest that quantum information must play a relevant role in Quantum Gravity (the "It from qubit" proposal). The conjecture is that Quantum Gravity, the theory which will reconcile Quantum Mechanics with General Relativity, can be formulated in terms of quantum bits of information (qubits) stored in space at the Planck scale. This conjecture is based on the following arguments: a) The holographic principle, b) The loop quantum gravity approach and spin networks, c) Quantum geometry and black hole entropy. From the above arguments, as they stand in the literature, it follows that the edges of spin networks pierce the black hole horizon and excite curvature degrees of freedom on the surface. These excitations are micro-states of Chern-Simons theory and account of the black hole entropy which turns out to be a quarter of the area of the horizon, (in units of Planck area), in accordance with the holographic principle. Moreover, the states which dominate the counting correspond to punctures of spin j = 1/2 and one can in fact visualize each micro-state as a bit of information. The obvious generalization of this result is to consider open spin networks with edges labeled by the spin -1/ 2 representation of SU(2) in a superposed state of spin "on" and spin "down." The micro-state corresponding to such a puncture will be a pixel of area which is "on" and "off" at the same time, and it will encode a qubit of information. This picture, when applied to quantum cosmology, describes an early inflationary universe which is a discrete version of the de Sitter universe.
Rice, R. F.; Lee, J. J.
1986-01-01
Scheme for coding facsimile messages promises to reduce data transmission requirements to one-tenth current level. Coding scheme paves way for true electronic mail in which handwritten, typed, or printed messages or diagrams sent virtually instantaneously - between buildings or between continents. Scheme, called Universal System for Efficient Electronic Mail (USEEM), uses unsupervised character recognition and adaptive noiseless coding of text. Image quality of resulting delivered messages improved over messages transmitted by conventional coding. Coding scheme compatible with direct-entry electronic mail as well as facsimile reproduction. Text transmitted in this scheme automatically translated to word-processor form.
Lim, Sung Hoon; Gamal, Abbas El; Chung, Sae-Young
2010-01-01
A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. The scheme involves message repetition coding, relay signal compression, and simultaneous decoding. Unlike previous compress--forward schemes, where independent messages are sent over multiple blocks, the same message is sent multiple times using independent codebooks as in the network coding scheme for cyclic networks. Furthermore, the relays do not use Wyner--Ziv binning as in previous compress-forward sch...
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2009-01-01
Property testing was initially studied from various motivations in 1990's.A code C (∩)GF(r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector's coordinates.The problem of testing codes was firstly studied by Blum,Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs).How to characterize locally testable codes is a complex and challenge problem.The local tests have been studied for Reed-Solomon (RS),Reed-Muller (RM),cyclic,dual of BCH and the trace subcode of algebraicgeometric codes.In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions).We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Institute of Scientific and Technical Information of China (English)
ZHANG Aili; LIU Xiufeng
2006-01-01
Chinese remainder codes are constructed by applying weak block designs and the Chinese remainder theorem of ring theory.The new type of linear codes take the congruence class in the congruence class ring R/I1 ∩ I2 ∩…∩ In for the information bit,embed R/Ji into R/I1 ∩ I2 ∩…∩ In,and assign the cosets of R/Ji as the subring of R/I1 ∩ I2 ∩…∩ In and the cosets of R/Ji in R/I1 ∩ I2 ∩…∩ In as check lines.Many code classes exist in the Chinese remainder codes that have high code rates.Chinese remainder codes are the essential generalization of Sun Zi codes.
Institute of Scientific and Technical Information of China (English)
张爱丽; 刘秀峰; 靳蕃
2004-01-01
Chinese Remainder Codes are constructed by applying weak block designs and Chinese Remainder Theorem of ring theory. The new type of linear codes take the congruence class in the congruence class ring R/I1∩I2∩…∩In for the information bit, embed R/Ji into R/I1∩I2∩…∩In, and asssign the cosets of R/Ji as the subring of R/I1∩I2∩…∩In and the cosets of R/Ji in R/I1∩I2∩…∩In as check lines. There exist many code classes in Chinese Remainder Codes, which have high code rates. Chinese Remainder Codes are the essential generalization of Sun Zi Codes.
DEFF Research Database (Denmark)
Adelstein, Jennifer; Clegg, Stewart
2016-01-01
Ethical codes have been hailed as an explicit vehicle for achieving more sustainable and defensible organizational practice. Nonetheless, when legal compliance and corporate governance codes are conflated, codes can be used to define organizational interests ostentatiously by stipulating norms...... for employee ethics. Such codes have a largely cosmetic and insurance function, acting subtly and strategically to control organizational risk management and protection. In this paper, we conduct a genealogical discourse analysis of a representative code of ethics from an international corporation...... to understand how management frames expectations of compliance. Our contribution is to articulate the problems inherent in codes of ethics, and we make some recommendations to address these to benefit both an organization and its employees. In this way, we show how a code of ethics can provide a foundation...
Defeating the coding monsters.
Colt, Ross
2007-02-01
Accuracy in coding is rapidly becoming a required skill for military health care providers. Clinic staffing, equipment purchase decisions, and even reimbursement will soon be based on the coding data that we provide. Learning the complicated myriad of rules to code accurately can seem overwhelming. However, the majority of clinic visits in a typical outpatient clinic generally fall into two major evaluation and management codes, 99213 and 99214. If health care providers can learn the rules required to code a 99214 visit, then this will provide a 90% solution that can enable them to accurately code the majority of their clinic visits. This article demonstrates a step-by-step method to code a 99214 visit, by viewing each of the three requirements as a monster to be defeated.
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Property testing was initially studied from various motivations in 1990’s. A code C GF (r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector’s coordinates. The problem of testing codes was firstly studied by Blum, Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs). How to characterize locally testable codes is a complex and challenge problem. The local tests have been studied for Reed-Solomon (RS), Reed-Muller (RM), cyclic, dual of BCH and the trace subcode of algebraicgeometric codes. In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions). We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Serially Concatenated IRA Codes
Cheng, Taikun; Belzer, Benjamin J
2007-01-01
We address the error floor problem of low-density parity check (LDPC) codes on the binary-input additive white Gaussian noise (AWGN) channel, by constructing a serially concatenated code consisting of two systematic irregular repeat accumulate (IRA) component codes connected by an interleaver. The interleaver is designed to prevent stopping-set error events in one of the IRA codes from propagating into stopping set events of the other code. Simulations with two 128-bit rate 0.707 IRA component codes show that the proposed architecture achieves a much lower error floor at higher SNRs, compared to a 16384-bit rate 1/2 IRA code, but incurs an SNR penalty of about 2 dB at low to medium SNRs. Experiments indicate that the SNR penalty can be reduced at larger blocklengths.
Realizing Controllable Quantum States
Takayanagi, Hideaki; Nitta, Junsaku
-T[stmbol] superconducting thin films with special arrangements of antidots / R. Wöerdenweber, P. Dymashevski and V. R. Misko. Quantum tunneling of relativistic fluxons / K. Konno et al. -- 6. Quantum information processing in solid states. Qubit decoherence by low-frequency noise / K. Rabenstein, V. A. Sverdlov and D. V. Averin. A critique of two-level approximation / K. Savran and T. Hakioǧlu. Josephson arrays as quantum channels / A. Romito, C. Bruder and R. Fazio. Fighting decoherence in a Josephson qubit circuit / E. Collin et al. Fast switching current detection at low critical currents / J. Walter, S. Corlevi and D. Haviland. Asymmetric flux bias for coupled qubits to observe entangled states / Y. Shimazu. Interaction of Josephson qubits with strong QED cavity modes: dynamical entanglement transfer and navigation / G. Falci et al. Controlling decoherence of transported quantum spin information in semiconductor spintronics / B. Nikolic and S. Souma. Decoherence due to telegraph and 1/f noise in Josephson qubits / E. Paladino et al. Detection of entanglement in NMR quantum information processing / R. Rahimi, K. Takeda and M. Kitagawa. Multiphoton absorption and SQUID switching current behaviors in superconducting flux-qubit experiments / H. Takayanagi et al. -- 7. Quantum information theory. Quantum query complexities / K. Iwama. A construction for non-stabilizer Clifford codes / M. Hagiwara and H. Imai. Quantum pushdown automata that can deterministically solve a certain problem / Y. Murakami et al. Trading classical for quantum computation using indirection / R. van Meter. Intractability of the initial arrangement of input data on qubits / Y. Kawano et al. Reversibility of modular squaring / N. Kunihiro, Y. Takahashi and Y. Kawano. Study of proximity effect at D-wave superconductors in quasiclassical methods / Y. Tanuma, Y. Tanaka and S. Kashiwaya -- 8. Spintronics in band electrons. Triplet superconductors: exploitable basis for scalable quantum computing / K. S. Wood et al. Spin
Random subspaces in quantum information theory
Hayden, Patrick
2005-03-01
The selection of random unitary transformations plays a role in quantum information theory analogous to the role of random hash functions in classical information theory. Recent applications have included protocols achieving the quantum channel capacity and methods for extending superdense coding from bits to qubits. In addition, the corresponding random subspaces have proved useful for studying the structure of bipartite and multipartite entanglement. In quantum information theory, we're fond of saying that Hilbert space is a big place, the implication being that there's room for the unexpected to occur. The goal of this talk is to further bolster this homespun wisdowm. I'm going to present a number of results in quantum information theory that stem from the initially counterintuitive geometry of high-dimensional vector spaces, where subspaces with highly extremal properties are the norm rather than the exception. Peter Shor has shown, for example, that randomly selected subspaces can be used to send quantum information through a noisy quantum channel at the highest possible rate, that is, the quantum channel capacity. More recently, Debbie Leung, Andreas Winter and I demonstrated that a randomly chosen subspace of a bipartite quantum system will likely contain nothing but nearly maximally entangled states, even if the subspace is nearly as large as the original system in qubit terms. This observation has implications for communication, especially superdense coding.
A multi-scale code for flexible hybrid simulations
Leukkunen, L; Lopez-Acevedo, O
2012-01-01
Multi-scale computer simulations combine the computationally efficient classical algorithms with more expensive but also more accurate ab-initio quantum mechanical algorithms. This work describes one implementation of multi-scale computations using the Atomistic Simulation Environment (ASE). This implementation can mix classical codes like LAMMPS and the Density Functional Theory-based GPAW. Any combination of codes linked via the ASE interface however can be mixed. We also introduce a framework to easily add classical force fields calculators for ASE using LAMMPS, which also allows harnessing the full performance of classical-only molecular dynamics. Our work makes it possible to combine different simulation codes, quantum mechanical or classical, with great ease and minimal coding effort.
Cariolaro, Gianfranco
2015-01-01
This book demonstrates that a quantum communication system using the coherent light of a laser can achieve performance orders of magnitude superior to classical optical communications Quantum Communications provides the Masters and PhD signals or communications student with a complete basics-to-applications course in using the principles of quantum mechanics to provide cutting-edge telecommunications. Assuming only knowledge of elementary probability, complex analysis and optics, the book guides its reader through the fundamentals of vector and Hilbert spaces and the necessary quantum-mechanical ideas, simply formulated in four postulates. A turn to practical matters begins with and is then developed by: · development of the concept of quantum decision, emphasizing the optimization of measurements to extract useful information from a quantum system; · general formulation of a transmitter–receiver system · particular treatment of the most popular quantum co...
String localization and delocalization in the disordered toric code
Jouzdani, Pejman; Mucciolo, Eduardo R.
2012-02-01
Topological quantum memories based on the toric code model have the ability to protect quantum information by self correcting a large class of errors. However, excitations such as a string of spin flips, when allowed to perform a quantum walk, can change the logical state encoded in the system every time they wind around the torus. It has been proposed that by adding randomness to the local spin exchange couplings, one can localize these string excitations and avoid logical errors. In our work, we investigate this proposal numerically through the use of an efficient time-dependent numerical quantum evolution method. We determine the dependence of the winding time on the torus size and on the amount of randomness. We study the effect of dephasing in the quantum evolution of the string excitations and show that a transition to delocalization can occur.
Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language
Blaha, Stephen
2002-01-01
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.
Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C
Blaha, Stephen
2002-01-01
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.
Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C
Blaha, Stephen
2002-01-01
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.
Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language
Blaha, Stephen
2002-01-01
We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.
Institute of Scientific and Technical Information of China (English)
ZHOU Nan-run; GONG Li-hua; LIU Ye
2006-01-01
In this letter a cascade quantum teleportation scheme is proposed. The proposed scheme needs less local quantum operations than those of quantum multi-teleportation. A quantum teleportation scheme based on entanglement swapping is presented and compared with the cascade quantum teleportation scheme. Those two schemes can effectively teleport quantum information and extend the distance of quantum communication.
Gudder, Stanley P
2014-01-01
Quantum probability is a subtle blend of quantum mechanics and classical probability theory. Its important ideas can be traced to the pioneering work of Richard Feynman in his path integral formalism.Only recently have the concept and ideas of quantum probability been presented in a rigorous axiomatic framework, and this book provides a coherent and comprehensive exposition of this approach. It gives a unified treatment of operational statistics, generalized measure theory and the path integral formalism that can only be found in scattered research articles.The first two chapters survey the ne
Powell, John L
2015-01-01
Suitable for advanced undergraduates, this thorough text focuses on the role of symmetry operations and the essentially algebraic structure of quantum-mechanical theory. Based on courses in quantum mechanics taught by the authors, the treatment provides numerous problems that require applications of theory and serve to supplement the textual material.Starting with a historical introduction to the origins of quantum theory, the book advances to discussions of the foundations of wave mechanics, wave packets and the uncertainty principle, and an examination of the Schrödinger equation that includ
Garrison, J C
2008-01-01
Quantum optics, i.e. the interaction of individual photons with matter, began with the discoveries of Planck and Einstein, but in recent years it has expanded beyond pure physics to become an important driving force for technological innovation. This book serves the broader readership growing out of this development by starting with an elementary description of the underlying physics and then building up a more advanced treatment. The reader is led from the quantum theory of thesimple harmonic oscillator to the application of entangled states to quantum information processing. An equally impor
Lowe, John P
1993-01-01
Praised for its appealing writing style and clear pedagogy, Lowe's Quantum Chemistry is now available in its Second Edition as a text for senior undergraduate- and graduate-level chemistry students. The book assumes little mathematical or physical sophistication and emphasizes an understanding of the techniques and results of quantum chemistry, thus enabling students to comprehend much of the current chemical literature in which quantum chemical methods or concepts are used as tools. The book begins with a six-chapter introduction of standard one-dimensional systems, the hydrogen atom,
Quantum algorithmic information theory
Svozil, Karl
1995-01-01
The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental atoms processed by quantum computation are the quantum bits which are dealt with in quantum information theory. The theory of quantum computation will be based upon a model of universal quantum computer whose elementary unit is a two-port interferometer capa...
Delayed Commutation in Quantum Computer Networks
García-Escartín, Juan Carlos; Chamorro-Posada, Pedro
2006-09-01
In the same way that classical computer networks connect and enhance the capabilities of classical computers, quantum networks can combine the advantages of quantum information and communication. We propose a nonclassical network element, a delayed commutation switch, that can solve the problem of switching time in packet switching networks. With the help of some local ancillary qubits and superdense codes, we can route a qubit packet after part of it has left the network node.
Delayed commutation in quantum computer networks
Garcia-Escartin, J C; Chamorro-Posada, Pedro; Garcia-Escartin, Juan Carlos
2005-01-01
In the same way that classical computer networks connect and enhance the capabilities of classical computers, quantum networks can combine the advantages of quantum information and communications. We propose a non-classical network element, a delayed commutation switch, that can solve the problem of switching time in packet switching networks. With the help of some local ancillary qubits and superdense codes we can route the information after part of it has left the network node.
SOME ASPECTS OF POST-QUANTUM CRYPTOSYSTEMS*
Directory of Open Access Journals (Sweden)
Avtandil Gagnidze
2017-02-01
Full Text Available The article describes alternatives to RSA system, resistant to quantum attacks. There are described Hash-based Digital Signature Schemes and McEliece system, based on the theory of algebraic coding. We analyzed their advantages and disadvantages, and considered some of the attacks on these systems. It is shown that today we are not prepared to transfer cryptosystems to post-quantum era.
Braid group representation on quantum computation
Energy Technology Data Exchange (ETDEWEB)
Aziz, Ryan Kasyfil, E-mail: kasyfilryan@gmail.com [Department of Computational Sciences, Bandung Institute of Technology (Indonesia); Muchtadi-Alamsyah, Intan, E-mail: ntan@math.itb.ac.id [Algebra Research Group, Bandung Institute of Technology (Indonesia)
2015-09-30
There are many studies about topological representation of quantum computation recently. One of diagram representation of quantum computation is by using ZX-Calculus. In this paper we will make a diagrammatical scheme of Dense Coding. We also proved that ZX-Calculus diagram of maximally entangle state satisfies Yang-Baxter Equation and therefore, we can construct a Braid Group representation of set of maximally entangle state.
Buhrman, H; Watrous, J; De Wolf, R; Buhrman, Harry; Cleve, Richard; Watrous, John; Wolf, Ronald de
2001-01-01
Classical fingerprinting associates with each string a shorter string (its fingerprint), such that, with high probability, any two distinct strings can be distinguished by comparing their fingerprints alone. The fingerprints can be exponentially smaller than the original strings if the parties preparing the fingerprints share a random key, but not if they only have access to uncorrelated random sources. In this paper we show that fingerprints consisting of quantum information can be made exponentially smaller than the original strings without any correlations or entanglement between the parties: we give a scheme where the quantum fingerprints are exponentially shorter than the original strings and we give a test that distinguishes any two unknown quantum fingerprints with high probability. Our scheme implies an exponential quantum/classical gap for the equality problem in the simultaneous message passing model of communication complexity. We optimize several aspects of our scheme.
Ladd, T D; Jelezko, F; Laflamme, R; Nakamura, Y; Monroe, C; O'Brien, J L
2010-03-04
Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future.
Curran, Stephen
2009-01-01
In arXiv:0807.0677, K\\"ostler and Speicher observed that de Finetti's theorem on exchangeable sequences has a free analogue if one replaces exchangeability by the stronger condition of invariance under quantum permutations. In this paper we study sequences of noncommutative random variables whose joint distribution is invariant under quantum orthogonal transformations. We prove a free analogue of Freedman's characterization of conditionally independent Gaussian families, namely an infinite sequence of self-adjoint random variables is quantum orthogonally invariant if and only if they form an operator-valued free centered equivariant semicircular family. Similarly, we show that an infinite sequence of noncommutative random variables is quantum unitarily invariant if and only if they form an operator-valued free centered equivariant circular family. We provide an example to show that, as in the classical case, these results fail for finite sequences. We then give an approximation to how far the distribution of ...
Mershin, A; Skoulakis, E M C
2000-01-01
In order to create a novel model of memory and brain function, we focus our approach on the sub-molecular (electron), molecular (tubulin) and macromolecular (microtubule) components of the neural cytoskeleton. Due to their size and geometry, these systems may be approached using the principles of quantum physics. We identify quantum-physics derived mechanisms conceivably underlying the integrated yet differentiated aspects of memory encoding/recall as well as the molecular basis of the engram. We treat the tubulin molecule as the fundamental computation unit (qubit) in a quantum-computational network that consists of microtubules (MTs), networks of MTs and ultimately entire neurons and neural networks. We derive experimentally testable predictions of our quantum brain hypothesis and perform experiments on these.
Mukai, Takahito; Lajoie, Marc J; Englert, Markus; Söll, Dieter
2017-09-08
The genetic code-the language used by cells to translate their genomes into proteins that perform many cellular functions-is highly conserved throughout natural life. Rewriting the genetic code could lead to new biological functions such as expanding protein chemistries with noncanonical amino acids (ncAAs) and genetically isolating synthetic organisms from natural organisms and viruses. It has long been possible to transiently produce proteins bearing ncAAs, but stabilizing an expanded genetic code for sustained function in vivo requires an integrated approach: creating recoded genomes and introducing new translation machinery that function together without compromising viability or clashing with endogenous pathways. In this review, we discuss design considerations and technologies for expanding the genetic code. The knowledge obtained by rewriting the genetic code will deepen our understanding of how genomes are designed and how the canonical genetic code evolved.
Yu, Jiun-Hung
2012-01-01
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work. We explicitly allow the code symbols to be polynomials of different degrees, which leads to two different notions of weight and distance. Algebraic decoding is studied in detail. If the moduli are not irreducible, the notion of an error locator polynomial is replaced by an error factor polynomial. We then obtain a collection of gcd-based decoding algorithms, some of which are not quite standard even when specialized to Reed-Solomon codes.
CERN Bulletin
2013-01-01
On April Fools' Day, CERN Quantum Diaries blogger Pauline Gagnon held a giveaway of microscopic proportion. Up for grabs? Ten Higgs bosons, courtesy of CERN. Pauline announced the winners last week; let's see what they'll really be getting in the mail... Custom-made Particle Zoo Higgs bosons were sent out to the winners. Read more about the prize in the Quantum Diaries post "Higgs boson lottery: when CERN plays April Fools' jokes".
Haroche, Serge
2013-01-01
Mr Administrator,Dear colleagues,Ladies and gentlemen, “I think I can safely say that nobody understands quantum mechanics”. This statement, made by physicist Richard Feynman, expresses a paradoxical truth about the scientific theory that revolutionised our understanding of Nature and made an extraordinary contribution to our means of acting on and gaining information about the world. In this lecture, I will discuss quantum physics with you by attempting to resolve this paradox. And if I don’...
DEFF Research Database (Denmark)
Andersen, Ulrik Lund
2013-01-01
Further sensitivity improvements are required before advanced optical interferometers will be able to measure gravitational waves. A team has now shown that introducing quantum squeezing of light may help to detect these elusive waves.......Further sensitivity improvements are required before advanced optical interferometers will be able to measure gravitational waves. A team has now shown that introducing quantum squeezing of light may help to detect these elusive waves....
Diego Martin-Cano, Paloma A. Huidobro, Esteban Moreno; Diego Martin-Cano; Huidobro, Paloma A.; Esteban Moreno; Garcia-Vidal, F.J.
2014-01-01
Quantum plasmonics is a rapidly growing field of research that involves the study of the quantum properties of light and its interaction with matter at the nanoscale. Here, surface plasmons - electromagnetic excitations coupled to electron charge density waves on metal-dielectric interfaces or localized on metallic nanostructures - enable the confinement of light to scales far below that of conventional optics. In this article we review recent progress in the experimental and theoretical inve...
DEFF Research Database (Denmark)
Andersen, Ulrik Lund
2013-01-01
Further sensitivity improvements are required before advanced optical interferometers will be able to measure gravitational waves. A team has now shown that introducing quantum squeezing of light may help to detect these elusive waves.......Further sensitivity improvements are required before advanced optical interferometers will be able to measure gravitational waves. A team has now shown that introducing quantum squeezing of light may help to detect these elusive waves....
Generating code adapted for interlinking legacy scalar code and extended vector code
Gschwind, Michael K
2013-06-04
Mechanisms for intermixing code are provided. Source code is received for compilation using an extended Application Binary Interface (ABI) that extends a legacy ABI and uses a different register configuration than the legacy ABI. First compiled code is generated based on the source code, the first compiled code comprising code for accommodating the difference in register configurations used by the extended ABI and the legacy ABI. The first compiled code and second compiled code are intermixed to generate intermixed code, the second compiled code being compiled code that uses the legacy ABI. The intermixed code comprises at least one call instruction that is one of a call from the first compiled code to the second compiled code or a call from the second compiled code to the first compiled code. The code for accommodating the difference in register configurations is associated with the at least one call instruction.
Trade-off capacities of the quantum Hadamard channels
Bradler, Kamil; Touchette, Dave; Wilde, Mark M
2010-01-01
Coding theorems in quantum Shannon theory express the ultimate rates at which a sender can transmit information over a noisy quantum channel. More often than not, the known formulas expressing these transmission rates are intractable, requiring an optimization over an infinite number of uses of the channel. Researchers have rarely found quantum channels with a tractable classical or quantum capacity, but when such a finding occurs, it demonstrates a complete understanding of that channel's capabilities for transmitting classical or quantum information. Here, we show that the three-dimensional capacity region for entanglement-assisted transmission of classical and quantum information is tractable for the Hadamard class of channels. Examples of Hadamard channels include generalized dephasing channels, cloning channels, and the Unruh channel. The generalized dephasing channels and the cloning channels are natural processes that occur in quantum systems through the loss of quantum coherence or stimulated emission...
Energy Technology Data Exchange (ETDEWEB)
Visser, B. [Stork Product Eng., Amsterdam (Netherlands)
1996-09-01
To support the discussion on aeroelastic codes, a description of the code FLEXLAST was given and experiences within benchmarks and measurement programmes were summarized. The code FLEXLAST has been developed since 1982 at Stork Product Engineering (SPE). Since 1992 FLEXLAST has been used by Dutch industries for wind turbine and rotor design. Based on the comparison with measurements, it can be concluded that the main shortcomings of wind turbine modelling lie in the field of aerodynamics, wind field and wake modelling. (au)
DEFF Research Database (Denmark)
Steensig, Jakob; Heinemann, Trine
2015-01-01
We welcome Tanya Stivers’s discussion (Stivers, 2015/this issue) of coding social interaction and find that her descriptions of the processes of coding open up important avenues for discussion, among other things of the precise ad hoc considerations that researchers need to bear in mind, both when....... Instead we propose that the promise of coding-based research lies in its ability to open up new qualitative questions....
Shapiro, Wilbur
1996-01-01
This is an overview of new and updated industrial codes for seal design and testing. GCYLT (gas cylindrical seals -- turbulent), SPIRALI (spiral-groove seals -- incompressible), KTK (knife to knife) Labyrinth Seal Code, and DYSEAL (dynamic seal analysis) are covered. CGYLT uses G-factors for Poiseuille and Couette turbulence coefficients. SPIRALI is updated to include turbulence and inertia, but maintains the narrow groove theory. KTK labyrinth seal code handles straight or stepped seals. And DYSEAL provides dynamics for the seal geometry.
Quantum correlations and distinguishability of quantum states
Spehner, Dominique
2014-07-01
A survey of various concepts in quantum information is given, with a main emphasis on the distinguishability of quantum states and quantum correlations. Covered topics include generalized and least square measurements, state discrimination, quantum relative entropies, the Bures distance on the set of quantum states, the quantum Fisher information, the quantum Chernoff bound, bipartite entanglement, the quantum discord, and geometrical measures of quantum correlations. The article is intended both for physicists interested not only by collections of results but also by the mathematical methods justifying them, and for mathematicians looking for an up-to-date introductory course on these subjects, which are mainly developed in the physics literature.
Function Optimization Based on Quantum Genetic Algorithm
Directory of Open Access Journals (Sweden)
Ying Sun
2014-01-01
Full Text Available Optimization method is important in engineering design and application. Quantum genetic algorithm has the characteristics of good population diversity, rapid convergence and good global search capability and so on. It combines quantum algorithm with genetic algorithm. A novel quantum genetic algorithm is proposed, which is called Variable-boundary-coded Quantum Genetic Algorithm (vbQGA in which qubit chromosomes are collapsed into variable-boundary-coded chromosomes instead of binary-coded chromosomes. Therefore much shorter chromosome strings can be gained. The method of encoding and decoding of chromosome is first described before a new adaptive selection scheme for angle parameters used for rotation gate is put forward based on the core ideas and principles of quantum computation. Eight typical functions are selected to optimize to evaluate the effectiveness and performance of vbQGA against standard Genetic Algorithm (sGA and Genetic Quantum Algorithm (GQA. The simulation results show that vbQGA is significantly superior to sGA in all aspects and outperforms GQA in robustness and solving velocity, especially for multidimensional and complicated functions.
Fuchs, Christopher A
2009-01-01
This pseudo-paper consists of excerpts drawn from two of my quantum-email samizdats. Section 1 draws a picture of a physical world whose essence is ``Darwinism all the way down.'' Section 2 outlines how quantum theory should be viewed in light of this, i.e., as being an expression of probabilism (in Bruno de Finetti or Richard Jeffrey's sense) all the way back up. Section 3 describes how the idea of ``identical'' quantum measurement outcomes, though sounding atomistic in character, nonetheless meshes well with a Jamesian style ``radical pluralism.'' Sections 4 and 5 further detail how quantum theory should not be viewed so much as a ``theory of the world,'' but rather as a theory of decision-making for agents immersed within a world of a particular character--the quantum world. Finally, Sections 6 and 7 attempt to sketch the very positive sense in which quantum theory is incomplete, but still just as complete is it can be. In total, I hope these heady speculations convey some of the excitement and potential I...
National Aeronautics and Space Administration — ACCEPT consists of an overall software infrastructure framework and two main software components. The software infrastructure framework consists of code written to...
Waters, Joe
2012-01-01
Find out how to effectively create, use, and track QR codes QR (Quick Response) codes are popping up everywhere, and businesses are reaping the rewards. Get in on the action with the no-nonsense advice in this streamlined, portable guide. You'll find out how to get started, plan your strategy, and actually create the codes. Then you'll learn to link codes to mobile-friendly content, track your results, and develop ways to give your customers value that will keep them coming back. It's all presented in the straightforward style you've come to know and love, with a dash of humor thrown
Energy Technology Data Exchange (ETDEWEB)
Reid, R.L.; Barrett, R.J.; Brown, T.G.; Gorker, G.E.; Hooper, R.J.; Kalsi, S.S.; Metzler, D.H.; Peng, Y.K.M.; Roth, K.E.; Spampinato, P.T.
1985-03-01
The FEDC Tokamak Systems Code calculates tokamak performance, cost, and configuration as a function of plasma engineering parameters. This version of the code models experimental tokamaks. It does not currently consider tokamak configurations that generate electrical power or incorporate breeding blankets. The code has a modular (or subroutine) structure to allow independent modeling for each major tokamak component or system. A primary benefit of modularization is that a component module may be updated without disturbing the remainder of the systems code as long as the imput to or output from the module remains unchanged.
Energy Technology Data Exchange (ETDEWEB)
Cramer, S.N.
1984-01-01
The MORSE code is a large general-use multigroup Monte Carlo code system. Although no claims can be made regarding its superiority in either theoretical details or Monte Carlo techniques, MORSE has been, since its inception at ORNL in the late 1960s, the most widely used Monte Carlo radiation transport code. The principal reason for this popularity is that MORSE is relatively easy to use, independent of any installation or distribution center, and it can be easily customized to fit almost any specific need. Features of the MORSE code are described.
Quantum Computation and Quantum Spin Dynamics
Raedt, Hans De; Michielsen, Kristel; Hams, Anthony; Miyashita, Seiji; Saito, Keiji
2001-01-01
We analyze the stability of quantum computations on physically realizable quantum computers by simulating quantum spin models representing quantum computer hardware. Examples of logically identical implementations of the controlled-NOT operation are used to demonstrate that the results of a quantum
Quantum Central Processing Unit and Quantum Algorithm
Institute of Scientific and Technical Information of China (English)
王安民
2002-01-01
Based on a scalable and universal quantum network, quantum central processing unit, proposed in our previous paper [Chin. Phys. Left. 18 (2001)166], the whole quantum network for the known quantum algorithms,including quantum Fourier transformation, Shor's algorithm and Grover's algorithm, is obtained in a unitied way.
Quantum Computation and Quantum Spin Dynamics
Raedt, Hans De; Michielsen, Kristel; Hams, Anthony; Miyashita, Seiji; Saito, Keiji
2001-01-01
We analyze the stability of quantum computations on physically realizable quantum computers by simulating quantum spin models representing quantum computer hardware. Examples of logically identical implementations of the controlled-NOT operation are used to demonstrate that the results of a quantum
Open quantum systems and error correction
Shabani Barzegar, Alireza
Quantum effects can be harnessed to manipulate information in a desired way. Quantum systems which are designed for this purpose are suffering from harming interaction with their surrounding environment or inaccuracy in control forces. Engineering different methods to combat errors in quantum devices are highly demanding. In this thesis, I focus on realistic formulations of quantum error correction methods. A realistic formulation is the one that incorporates experimental challenges. This thesis is presented in two sections of open quantum system and quantum error correction. Chapters 2 and 3 cover the material on open quantum system theory. It is essential to first study a noise process then to contemplate methods to cancel its effect. In the second chapter, I present the non-completely positive formulation of quantum maps. Most of these results are published in [Shabani and Lidar, 2009b,a], except a subsection on geometric characterization of positivity domain of a quantum map. The real-time formulation of the dynamics is the topic of the third chapter. After introducing the concept of Markovian regime, A new post-Markovian quantum master equation is derived, published in [Shabani and Lidar, 2005a]. The section of quantum error correction is presented in three chapters of 4, 5, 6 and 7. In chapter 4, we introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization (published in [Shabani and Lidar, 2005b]). In Chapter 5, we present a semidefinite program optimization approach to quantum error correction that yields codes and recovery procedures that are robust against significant variations in the noise channel. Our approach allows us to optimize the encoding, recovery, or both, and is amenable to approximations that significantly improve computational cost while retaining fidelity (see [Kosut et al., 2008] for a published version). Chapter 6 is devoted to a theory of quantum error correction (QEC
Quantum Error Correction and Higher-Rank Numerical Range
Choi, M D; Zyczkowski, K; Choi, Man-Duen; Kribs, David W.; Zyczkowski, Karol
2005-01-01
We solve the fundamental quantum error correction problem for bi-unitary channels on two-qubit Hilbert space. We construct qubit codes for such channels on arbitrary dimension Hilbert space, and identify correctable codes for Pauli-error models not detected by the stabilizer formalism. This is accomplished through an application of a new tool for error correction in quantum computing called the ``higher-rank numerical range''. We describe its basic properties and discuss possible further applications.
Quantum Secret Sharing Based on Chinese Remainder Theorem
Institute of Scientific and Technical Information of China (English)
SHI Rong-Hua; SU Qian; GUO Ying; LEE Moon Ho
2011-01-01
A novel quantum secret sharing (QSS) scheme is proposed on the basis of Chinese Remainder Theorem (CRT).In the scheme, the classical messages are mapped to secret sequences according to CRT equations, and distributed to different receivers by different dimensional superdense-coding respectively.CRT's secret sharing function, together with high-dimensional superdense-coding, provide convenience, security, and large capability quantum channel for secret distribution and recovering.Analysis shows the security of the scheme.
Abstract algebra, projective geometry and time encoding of quantum information
Planat, M R P; Planat, Michel R. P.; Saniga, Metod
2005-01-01
Algebraic geometrical concepts are playing an increasing role in quantum applications such as coding, cryptography, tomography and computing. We point out here the prominent role played by Galois fields viewed as cyclotomic extensions of the integers modulo a prime characteristic $p$. They can be used to generate efficient cyclic encoding, for transmitting secrete quantum keys, for quantum state recovery and for error correction in quantum computing. Finite projective planes and their generalization are the geometric counterpart to cyclotomic concepts, their coordinatization involves Galois fields, and they have been used repetitively for enciphering and coding. Finally the characters over Galois fields are fundamental for generating complete sets of mutually unbiased bases, a generic concept of quantum information processing and quantum entanglement. Gauss sums over Galois fields ensure minimum uncertainty under such protocols. Some Galois rings which are cyclotomic extensions of the integers modulo 4 are al...
Programmable multi-node quantum network design and simulation
Dasari, Venkat R.; Sadlier, Ronald J.; Prout, Ryan; Williams, Brian P.; Humble, Travis S.
2016-05-01
Software-defined networking offers a device-agnostic programmable framework to encode new network functions. Externally centralized control plane intelligence allows programmers to write network applications and to build functional network designs. OpenFlow is a key protocol widely adopted to build programmable networks because of its programmability, flexibility and ability to interconnect heterogeneous network devices. We simulate the functional topology of a multi-node quantum network that uses programmable network principles to manage quantum metadata for protocols such as teleportation, superdense coding, and quantum key distribution. We first show how the OpenFlow protocol can manage the quantum metadata needed to control the quantum channel. We then use numerical simulation to demonstrate robust programmability of a quantum switch via the OpenFlow network controller while executing an application of superdense coding. We describe the software framework implemented to carry out these simulations and we discuss near-term efforts to realize these applications.
Protocol for multi-party superdense coding by using multi-atom in cavity QED
Institute of Scientific and Technical Information of China (English)
Tan Jia; Fang Mao-Fa
2006-01-01
We present a protocol for multi-party superdense coding by using multi-atom in cavity quantum electrodynamics (QED). It is shown that, with a highly detuned cavity mode and a strong driving field, the protocol is insensitive to both cavity decay and thermal field. It is even certain to identify GHZ states via detecting the atomic states. Therefore we can realize the quantum dense coding in a simple way in the multiparty system.
Three-Dimensional Wiring for Extensible Quantum Computing: The Quantum Socket
Béjanin, J. H.; McConkey, T. G.; Rinehart, J. R.; Earnest, C. T.; McRae, C. R. H.; Shiri, D.; Bateman, J. D.; Rohanizadegan, Y.; Penava, B.; Breul, P.; Royak, S.; Zapatka, M.; Fowler, A. G.; Mariantoni, M.
2016-10-01
Quantum computing architectures are on the verge of scalability, a key requirement for the implementation of a universal quantum computer. The next stage in this quest is the realization of quantum error-correction codes, which will mitigate the impact of faulty quantum information on a quantum computer. Architectures with ten or more quantum bits (qubits) have been realized using trapped ions and superconducting circuits. While these implementations are potentially scalable, true scalability will require systems engineering to combine quantum and classical hardware. One technology demanding imminent efforts is the realization of a suitable wiring method for the control and the measurement of a large number of qubits. In this work, we introduce an interconnect solution for solid-state qubits: the quantum socket. The quantum socket fully exploits the third dimension to connect classical electronics to qubits with higher density and better performance than two-dimensional methods based on wire bonding. The quantum socket is based on spring-mounted microwires—the three-dimensional wires—that push directly on a microfabricated chip, making electrical contact. A small wire cross section (approximately 1 mm), nearly nonmagnetic components, and functionality at low temperatures make the quantum socket ideal for operating solid-state qubits. The wires have a coaxial geometry and operate over a frequency range from dc to 8 GHz, with a contact resistance of approximately 150 m Ω , an impedance mismatch of approximately 10 Ω , and minimal cross talk. As a proof of principle, we fabricate and use a quantum socket to measure high-quality superconducting resonators at a temperature of approximately 10 mK. Quantum error-correction codes such as the surface code will largely benefit from the quantum socket, which will make it possible to address qubits located on a two-dimensional lattice. The present implementation of the socket could be readily extended to accommodate a
Quantum nonlinear optics without photons
Stassi, Roberto; Macrı, Vincenzo; Kockum, Anton Frisk; Di Stefano, Omar; Miranowicz, Adam; Savasta, Salvatore; Nori, Franco
2017-08-01
Spontaneous parametric down-conversion is a well-known process in quantum nonlinear optics in which a photon incident on a nonlinear crystal spontaneously splits into two photons. Here we propose an analogous physical process where one excited atom directly transfers its excitation to a pair of spatially separated atoms with probability approaching 1. The interaction is mediated by the exchange of virtual rather than real photons. This nonlinear atomic process is coherent and reversible, so the pair of excited atoms can transfer the excitation back to the first one: the atomic analog of sum-frequency generation of light. The parameters used to investigate this process correspond to experimentally demonstrated values in ultrastrong circuit quantum electrodynamics. This approach can be extended to realize other nonlinear interatomic processes, such as four-atom mixing, and is an attractive architecture for the realization of quantum devices on a chip. We show that four-qubit mixing can efficiently implement quantum repetition codes and, thus, can be used for error-correction codes.
Research on universal combinatorial coding.
Lu, Jun; Zhang, Zhuo; Mo, Juan
2014-01-01
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics theory. The combinational and exhaustive property make it closely related with the existing code methods. Universal combinatorial coding does not depend on the probability statistic characteristic of information source, and it has the characteristics across three coding branches. It has analyzed the relationship between the universal combinatorial coding and the variety of coding method and has researched many applications technologies of this coding method. In addition, the efficiency of universal combinatorial coding is analyzed theoretically. The multicharacteristic and multiapplication of universal combinatorial coding are unique in the existing coding methods. Universal combinatorial coding has theoretical research and practical application value.
Random Oracles in a Quantum World
Dagdelen, Özgür; Lehmann, Anja; Schaffner, Christian
2010-01-01
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, schemes which are more likely to resist quantum attacks like lattice-based systems or code-based primitives have recently gained significant attention. Interestingly, a vast number of such schemes also deploy random oracles, which have mainly be analyzed in the classical setting. Here we revisit the random oracle model in cryptography in light of quantum attackers. We show that there are protocols using quantum-immune primitives and random oracles, such that the protocols are secure in the classical world, but insecure if a quantum attacker can access the random oracle via quantum states. We discuss that most of the proof techniques related to the random oracle model in the classical case cannot be transferred immediately to the quantum case. Yet, we show that ``quantum random oracles'' can nonetheless be used to show for example that th...
Quantum Physics for Beginners.
Strand, J.
1981-01-01
Suggests a new approach for teaching secondary school quantum physics. Reviews traditional approaches and presents some characteristics of the three-part "Quantum Physics for Beginners" project, including: quantum physics, quantum mechanics, and a short historical survey. (SK)
Quantum Transmemetic Intelligence
Piotrowski, Edward W.; Sładkowski, Jan
The following sections are included: * Introduction * A Quantum Model of Free Will * Quantum Acquisition of Knowledge * Thinking as a Quantum Algorithm * Counterfactual Measurement as a Model of Intuition * Quantum Modification of Freud's Model of Consciousness * Conclusion * Acknowledgements * References
Quantum Physics for Beginners.
Strand, J.
1981-01-01
Suggests a new approach for teaching secondary school quantum physics. Reviews traditional approaches and presents some characteristics of the three-part "Quantum Physics for Beginners" project, including: quantum physics, quantum mechanics, and a short historical survey. (SK)
Mandl, F.
1992-07-01
The Manchester Physics Series General Editors: D. J. Sandiford; F. Mandl; A. C. Phillips Department of Physics and Astronomy, University of Manchester Properties of Matter B. H. Flowers and E. Mendoza Optics Second Edition F. G. Smith and J. H. Thomson Statistical Physics Second Edition F. Mandl Electromagnetism Second Edition I. S. Grant and W. R. Phillips Statistics R. J. Barlow Solid State Physics Second Edition J. R. Hook and H. E. Hall Quantum Mechanics F. Mandl Particle Physics Second Edition B. R. Martin and G. Shaw The Physics of Stars Second Edition A. C. Phillips Computing for Scientists R. J. Barlow and A. R. Barnett Quantum Mechanics aims to teach those parts of the subject which every physicist should know. The object is to display the inherent structure of quantum mechanics, concentrating on general principles and on methods of wide applicability without taking them to their full generality. This book will equip students to follow quantum-mechanical arguments in books and scientific papers, and to cope with simple cases. To bring the subject to life, the theory is applied to the all-important field of atomic physics. No prior knowledge of quantum mechanics is assumed. However, it would help most readers to have met some elementary wave mechanics before. Primarily written for students, it should also be of interest to experimental research workers who require a good grasp of quantum mechanics without the full formalism needed by the professional theorist. Quantum Mechanics features: A flow diagram allowing topics to be studied in different orders or omitted altogether. Optional "starred" and highlighted sections containing more advanced and specialized material for the more ambitious reader. Sets of problems at the end of each chapter to help student understanding. Hints and solutions to the problems are given at the end of the book.
Robust quantum data locking from phase modulation
Lupo, Cosmo; Wilde, Mark M.; Lloyd, Seth
2014-08-01
Quantum data locking is a uniquely quantum phenomenon that allows a relatively short key of constant size to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key has essentially no information about the message. The application of quantum data locking in cryptography would allow one to overcome the limitations of the one-time pad encryption, which requires the key to have the same length as the message. However, it is known that the strength of quantum data locking is also its Achilles heel, as the leakage of a few bits of the key or the message may in principle allow the eavesdropper to unlock a disproportionate amount of information. In this paper we show that there exist quantum data locking schemes that can be made robust against information leakage by increasing the length of the key by a proportionate amount. This implies that a constant size key can still lock an arbitrarily long message as long as a fraction of it remains secret to the eavesdropper. Moreover, we greatly simplify the structure of the protocol by proving that phase modulation suffices to generate strong locking schemes, paving the way to optical experimental realizations. Also, we show that successful data locking protocols can be constructed using random code words, which very well could be helpful in discovering random codes for data locking over noisy quantum channels.
Coherent communication with continuous quantum variables
Wilde, Mark M.; Krovi, Hari; Brun, Todd A.
2007-06-01
The coherent bit (cobit) channel is a resource intermediate between classical and quantum communication. It produces coherent versions of teleportation and superdense coding. We extend the cobit channel to continuous variables by providing a definition of the coherent nat (conat) channel. We construct several coherent protocols that use both a position-quadrature and a momentum-quadrature conat channel with finite squeezing. Finally, we show that the quality of squeezing diminishes through successive compositions of coherent teleportation and superdense coding.
SC Secretariat
2005-01-01
Please note that the Safety Code A12 (Code A12) entitled "THE SAFETY COMMISSION (SC)" is available on the web at the following url: https://edms.cern.ch/document/479423/LAST_RELEASED Paper copies can also be obtained from the SC Unit Secretariat, e-mail: sc.secretariat@cern.ch SC Secretariat
Million, June
2004-01-01
In this article, the author discusses an e-mail survey of principals from across the country regarding whether or not their school had a formal staff dress code. The results indicate that most did not have a formal dress code, but agreed that professional dress for teachers was not only necessary, but showed respect for the school and had a…
Thieren, Michel; Mauron, Alex
2007-01-01
This month marks sixty years since the Nuremberg code – the basic text of modern medical ethics – was issued. The principles in this code were articulated in the context of the Nuremberg trials in 1947. We would like to use this anniversary to examine its ability to address the ethical challenges of our time.
Pseudonoise code tracking loop
Laflame, D. T. (Inventor)
1980-01-01
A delay-locked loop is presented for tracking a pseudonoise (PN) reference code in an incoming communication signal. The loop is less sensitive to gain imbalances, which can otherwise introduce timing errors in the PN reference code formed by the loop.
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
DEFF Research Database (Denmark)
Pries-Heje, Jan; Pries-Heje, Lene; Dahlgaard, Bente
2013-01-01
is required. In this paper we present the design of such a new approach, the Scrum Code Camp, which can be used to assess agile team capability in a transparent and consistent way. A design science research approach is used to analyze properties of two instances of the Scrum Code Camp where seven agile teams...
BIALEK, W; RIEKE, F; VANSTEVENINCK, RRD; WARLAND, D
1991-01-01
Traditional approaches to neural coding characterize the encoding of known stimuli in average neural responses. Organisms face nearly the opposite task - extracting information about an unknown time-dependent stimulus from short segments of a spike train. Here the neural code was characterized from
DEFF Research Database (Denmark)
Soon, Winnie
2014-01-01
, Twitter and Facebook). The focus is not to investigate the functionalities and efficiencies of the code, but to study and interpret the program level of code in order to trace the use of various technological methods such as third-party libraries and platforms’ interfaces. These are important...
an Efficient Blind Signature Scheme based on Error Correcting Codes
Directory of Open Access Journals (Sweden)
Junyao Ye
Full Text Available Cryptography based on the theory of error correcting codes and lattices has received a wide attention in the last years. Shor`s algorithm showed that in a world where quantum computers are assumed to exist, number theoretic cryptosystems are insecure. The ...
Zero-error source-channel coding with entanglement.
Briët, J.; Buhrman, H.; Laurent, M.; Piovesan, T.; Scarpa, G.
2013-01-01
We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Alice's input while using the channel as little as po
Zero-error source-channel coding with entanglement.
Briët, J.; Buhrman, H.; Laurent, M.; Piovesan, T.; Scarpa, G.
2014-01-01
We study the use of quantum entanglement in the zero-error source-channel coding problem. Here, Alice and Bob are connected by a noisy classical one-way channel, and are given correlated inputs from a random source. Their goal is for Bob to learn Alice's input while using the channel as little as po
Transformation invariant sparse coding
DEFF Research Database (Denmark)
Mørup, Morten; Schmidt, Mikkel Nørgaard
2011-01-01
Sparse coding is a well established principle for unsupervised learning. Traditionally, features are extracted in sparse coding in specific locations, however, often we would prefer invariant representation. This paper introduces a general transformation invariant sparse coding (TISC) model....... The model decomposes images into features invariant to location and general transformation by a set of specified operators as well as a sparse coding matrix indicating where and to what degree in the original image these features are present. The TISC model is in general overcomplete and we therefore invoke...... sparse coding to estimate its parameters. We demonstrate how the model can correctly identify components of non-trivial artificial as well as real image data. Thus, the model is capable of reducing feature redundancies in terms of pre-specified transformations improving the component identification....
1983-01-01
The specification of Software Implemented Fault Tolerance (SIFT) consists of two parts, the specifications of the SIFT models and the specifications of the SIFT PASCAL program which actually implements the SIFT system. The code specifications are the last of a hierarchy of models describing the operation of the SIFT system and are related to the SIFT models as well as the PASCAL program. These Specifications serve to link the SIFT models to the running program. The specifications are very large and detailed and closely follow the form and organization of the PASCAL code. In addition to describing each of the components of the SIFT code, the code specifications describe the assumptions of the upper SIFT models which are required to actually prove that the code will work as specified. These constraints are imposed primarily on the schedule tables.