A new approach to codeword stabilized quantum codes using the algebraic structure of modules
Santiago, Douglas Frederico Guimarães; Otoni, Geraldo Samuel Sena
2015-01-01
In this work, we study the Codeword Stabilized Quantum Codes (CWS codes) a generalization of the stabilizers quantum codes using a new approach, the algebraic structure of modules, a generalization of linear spaces. We show then a new result that relates CWS codes with stabilizer codes generalizing results in the literature.
Entanglement-assisted codeword-stabilized quantum codes with imperfect ebits
Directory of Open Access Journals (Sweden)
Byungkyu Ahn
2016-06-01
Full Text Available In quantum communication systems, quantum error-correcting codes (QECCs are known to exhibit improved performance with the use of error-free entanglement bits (ebits. In practical situations, ebits inevitably suffer from errors, and as a result, the error-correcting capability of the code is diminished. Previous studies have proposed two different schemes as a solution. One study uses only one QECC to correct errors on the receiver side (i.e., Bob and sender side (i.e., Alice. The other uses different QECCs on each side. In this paper, we present a method to correct errors on both sides by using single nonadditive entanglement-assisted codeword stabilized quantum error-correcting code (EACWS QECC. We use the property that the number of effective error patterns decreases as much as the number of ebits. This property results in a greater number of logical codewords using the same number of physical qubits.
Generalized concatenated quantum codes
Grassl, Markus; Shor, Peter; Smith, Graeme; Smolin, John; Zeng, Bei
2009-05-01
We discuss the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we construct families of single-error-correcting nonadditive quantum codes, in both binary and nonbinary cases, which not only outperform any stabilizer codes for finite block length but also asymptotically meet the quantum Hamming bound for large block length.
Holevo, A. S.
1998-12-01
ContentsI. IntroductionII. General considerations § 1. Quantum communication channel § 2. Entropy bound and channel capacity § 3. Formulation of the quantum coding theorem. Weak conversionIII. Proof of the direct statement of the coding theorem § 1. Channels with pure signal states § 2. Reliability function § 3. Quantum binary channel § 4. Case of arbitrary states with bounded entropyIV. c-q channels with input constraints § 1. Coding theorem § 2. Gauss channel with one degree of freedom § 3. Classical signal on quantum background noise Bibliography
Quantum Synchronizable Codes From Quadratic Residue Codes and Their Supercodes
Xie, Yixuan; Yuan, Jinhong; Fujiwara, Yuichiro
2014-01-01
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes that satisfy special properties, only a few classes of cyclic codes have been proved to give promising quantum synchronizable codes. In this paper, using quadratic residue codes and their supercodes, we give a simple construction for quantum synchronizable...
Asymmetric Quantum Codes on Toric Surfaces
DEFF Research Database (Denmark)
Hansen, Johan P.
2017-01-01
Asymmetric quantum error-correcting codes are quantum codes defined over biased quantum channels: qubit-flip and phase-shift errors may have equal or different probabilities. The code construction is the Calderbank-Shor-Steane construction based on two linear codes. We present families of toric...... surfaces, toric codes and associated asymmetric quantum error-correcting codes....
Quantum coding with finite resources
Tomamichel, Marco; Berta, Mario; Renes, Joseph M.
2016-01-01
The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should instead focus on the optimal trade-off between three parameters: the rate of the code, the size of the quantum devices at the encoder and decoder, and the fidelity of the transmission. We find approximate and exact characterizations of this trade-off for various channels of interest, including dephasing, depolarizing and erasure channels. In each case, the trade-off is parameterized by the capacity and a second channel parameter, the quantum channel dispersion. In the process, we develop several bounds that are valid for general quantum channels and can be computed for small instances. PMID:27156995
Quantum Quasi-Cyclic LDPC Codes
Hagiwara, Manabu; Imai, Hideki
2007-01-01
In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our proposed codes have lots of variations for length, code rate. These codes are obtained by a descrete mathematical characterization for model matrices of quasi-cyclic LDPC codes. Our proposed codes achieve a bounded distance decoding (BDD) bound, or known a...
Entanglement-assisted quantum MDS codes constructed from negacyclic codes
Chen, Jianzhang; Huang, Yuanyuan; Feng, Chunhui; Chen, Riqing
2017-12-01
Recently, entanglement-assisted quantum codes have been constructed from cyclic codes by some scholars. However, how to determine the number of shared pairs required to construct entanglement-assisted quantum codes is not an easy work. In this paper, we propose a decomposition of the defining set of negacyclic codes. Based on this method, four families of entanglement-assisted quantum codes constructed in this paper satisfy the entanglement-assisted quantum Singleton bound, where the minimum distance satisfies q+1 ≤ d≤ n+2/2. Furthermore, we construct two families of entanglement-assisted quantum codes with maximal entanglement.
Degenerate quantum codes and the quantum Hamming bound
Sarvepalli, Pradeep; Klappenecker, Andreas
2010-03-01
The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether the parameters of a degenerate quantum code can violate this bound for nondegenerate quantum codes. In this article we show that Calderbank-Shor-Steane (CSS) codes, over a prime power alphabet q⩾5, cannot beat the quantum Hamming bound. We prove a quantum version of the Griesmer bound for the CSS codes, which allows us to strengthen the Rains’ bound that an [[n,k,d
Construction of new quantum MDS codes derived from constacyclic codes
Taneja, Divya; Gupta, Manish; Narula, Rajesh; Bhullar, Jaskaran
Obtaining quantum maximum distance separable (MDS) codes from dual containing classical constacyclic codes using Hermitian construction have paved a path to undertake the challenges related to such constructions. Using the same technique, some new parameters of quantum MDS codes have been constructed here. One set of parameters obtained in this paper has achieved much larger distance than work done earlier. The remaining constructed parameters of quantum MDS codes have large minimum distance and were not explored yet.
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.
Upper bound on quantum stabilizer codes
Li, Zhuo; Xing, Li-Juan
2009-03-01
By studying sets of operators having constant weight, we present an analytical upper bound on the pure quantum stabilizer codes whose underlying quantum system can be of arbitrary dimension, which outperforms the well-known quantum Hamming bound, the optimal analytical upper bound so far for small code length.
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
The Mathematics of Error Correcting Quantum Codes
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 6; Issue 3. The Mathematics of Error Correcting-Quantum Codes - Quantum Probability. K R Parthasarathy. General Article Volume 6 Issue 3 March 2001 pp 34-45. Fulltext. Click here to view fulltext PDF. Permanent link:
Some Families of Asymmetric Quantum MDS Codes Constructed from Constacyclic Codes
Huang, Yuanyuan; Chen, Jianzhang; Feng, Chunhui; Chen, Riqing
2017-10-01
Quantum maximal-distance-separable (MDS) codes that satisfy quantum Singleton bound with different lengths have been constructed by some researchers. In this paper, seven families of asymmetric quantum MDS codes are constructed by using constacyclic codes. We weaken the case of Hermitian-dual containing codes that can be applied to construct asymmetric quantum MDS codes with parameters [[n,k,dz/dx
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...
Classical codes in quantum state space
Howard, Mark
2015-12-01
We present a construction of Hermitian operators and quantum states labelled by strings from a finite field. The distance between these operators or states is then simply related (typically, proportional) to the Hamming distance between their corresponding strings. This allows a straightforward application of classical coding theory to find arrangements of operators or states with a given distance distribution. Using the simplex or extended Reed-Solomon code in our construction recovers the discrete Wigner function, which has important applications in quantum information theory.
Concatenated codes for fault tolerant quantum computing
Energy Technology Data Exchange (ETDEWEB)
Knill, E.; Laflamme, R.; Zurek, W.
1995-05-01
The application of concatenated codes to fault tolerant quantum computing is discussed. We have previously shown that for quantum memories and quantum communication, a state can be transmitted with error {epsilon} provided each gate has error at most c{epsilon}. We show how this can be used with Shor`s fault tolerant operations to reduce the accuracy requirements when maintaining states not currently participating in the computation. Viewing Shor`s fault tolerant operations as a method for reducing the error of operations, we give a concatenated implementation which promises to propagate the reduction hierarchically. This has the potential of reducing the accuracy requirements in long computations.
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-01-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. PMID:26601310
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.
A Construction of MDS Quantum Convolutional Codes
Zhang, Guanghui; Chen, Bocong; Li, Liangchen
2015-09-01
In this paper, two new families of MDS quantum convolutional codes are constructed. The first one can be regarded as a generalization of [36, Theorem 6.5], in the sense that we do not assume that q≡1 (mod 4). More specifically, we obtain two classes of MDS quantum convolutional codes with parameters: (i) [( q 2+1, q 2-4 i+3,1;2,2 i+2)] q , where q≥5 is an odd prime power and 2≤ i≤( q-1)/2; (ii) , where q is an odd prime power with the form q=10 m+3 or 10 m+7 ( m≥2), and 2≤ i≤2 m-1.
Self-orthogonal codes with dual distance three and quantum codes with distance three over
Liang, Fangchi
2013-12-01
Self-orthogonal codes with dual distance three and quantum codes with distance three constructed from self-orthogonal codes over are discussed in this paper. Firstly, for given code length , a self-orthogonal code with minimal dimension and dual distance three is constructed. Secondly, for each , two nested self-orthogonal codes with dual distance two and three are constructed, and consequently quantum code of length and distance three is constructed via Steane construction. All of these quantum codes constructed via Steane construction are optimal or near optimal according to the quantum Hamming bound.
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.
Repetition versus noiseless quantum codes for correlated errors
Energy Technology Data Exchange (ETDEWEB)
Cafaro, Carlo, E-mail: carlo.cafaro@unicam.i [Dipartimento di Fisica, Universita di Camerino, I-62032 Camerino (Italy); Mancini, Stefano, E-mail: stefano.mancini@unicam.i [Dipartimento di Fisica, Universita di Camerino, I-62032 Camerino (Italy)
2010-06-07
We study the performance of simple quantum error correcting codes with respect to correlated noise errors characterized by a finite correlation strength {mu}. Specifically, we consider bit flip (phase flip) noisy quantum memory channels and use repetition and noiseless quantum codes. We characterize the performance of the codes by means of the entanglement fidelity F({mu},p) as function of the error probability p and degree of memory {mu}. Finally, comparing the entanglement fidelities of repetition and noiseless quantum codes, we find a threshold {mu}{sup *}(p) for the correlation strength that allows to select the code with better performance.
Energy Technology Data Exchange (ETDEWEB)
Xiao, Hailin [Wenzhou University, College of Physics and Electronic Information Engineering, Wenzhou (China); Southeast University, National Mobile Communications Research Laboratory, Nanjing (China); Guilin University of Electronic Technology, Ministry of Education, Key Laboratory of Cognitive Radio and Information Processing, Guilin (China); Zhang, Zhongshan [University of Science and Technology Beijing, Beijing Engineering and Technology Research Center for Convergence Networks and Ubiquitous Services, Beijing (China); Chronopoulos, Anthony Theodore [University of Texas at San Antonio, Department of Computer Science, San Antonio, TX (United States)
2017-10-15
In quantum computing, nice error bases as generalization of the Pauli basis were introduced by Knill. These bases are known to be projective representations of finite groups. In this paper, we propose a group representation approach to the study of quantum stabilizer codes. We utilize this approach to define decoherence-free subspaces (DFSs). Unlike previous studies of DFSs, this type of DFSs does not involve any spatial symmetry assumptions on the system-environment interaction. Thus, it can be used to construct quantum error-avoiding codes (QEACs) that are fault tolerant automatically. We also propose a new simple construction of QEACs and subsequently develop several classes of QEACs. Finally, we present numerical simulation results encoding the logical error rate over physical error rate on the fidelity performance of these QEACs. Our study demonstrates that DFSs-based QEACs are capable of providing a generalized and unified framework for error-avoiding methods. (orig.)
Xiao, Hailin; Zhang, Zhongshan; Chronopoulos, Anthony Theodore
2017-10-01
In quantum computing, nice error bases as generalization of the Pauli basis were introduced by Knill. These bases are known to be projective representations of finite groups. In this paper, we propose a group representation approach to the study of quantum stabilizer codes. We utilize this approach to define decoherence-free subspaces (DFSs). Unlike previous studies of DFSs, this type of DFSs does not involve any spatial symmetry assumptions on the system-environment interaction. Thus, it can be used to construct quantum error-avoiding codes (QEACs) that are fault tolerant automatically. We also propose a new simple construction of QEACs and subsequently develop several classes of QEACs. Finally, we present numerical simulation results encoding the logical error rate over physical error rate on the fidelity performance of these QEACs. Our study demonstrates that DFSs-based QEACs are capable of providing a generalized and unified framework for error-avoiding methods.
Maximal entanglement entanglement-assisted quantum codes of distance three
Guo, Luobin; Fu, Qiang; Li, Ruihu; Lu, Liangdong
2015-02-01
Entanglement-assisted quantum error correcting code (EAQECC) is a generalization of standard stabilizer quantum code. Maximal entanglement EAQECCs can achieve the EA-hashing bound asymptotically. In this work, we give elementary recursive constructions of quaternary zero radical codes with dual distance three for all n ≥ 4. Consequently, good maximal entanglement EAQECCs of minimum distance three for such length n are obtained. Almost all of these EAQECCs are optimal or near optimal according to the EA-quantum Hamming bound.
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.......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...
Improved classical and quantum random access codes
Liabøtrø, O.
2017-05-01
A (quantum) random access code ((Q)RAC) is a scheme that encodes n bits into m (qu)bits such that any of the n bits can be recovered with a worst case probability p >1/2 . We generalize (Q)RACs to a scheme encoding n d -levels into m (quantum) d -levels such that any d -level can be recovered with the probability for every wrong outcome value being less than 1/d . We construct explicit solutions for all n ≤d/2m-1 d -1 . For d =2 , the constructions coincide with those previously known. We show that the (Q)RACs are d -parity oblivious, generalizing ordinary parity obliviousness. We further investigate optimization of the success probabilities. For d =2 , we use the measure operators of the previously best-known solutions, but improve the encoding states to give a higher success probability. We conjecture that for maximal (n =4m-1 ,m ,p ) QRACs, p =1/2 {1 +[(√{3}+1)m-1 ] -1} is possible, and show that it is an upper bound for the measure operators that we use. We then compare (n ,m ,pq) QRACs with classical (n ,2 m ,pc) RACs. We can always find pq≥pc , but the classical code gives information about every input bit simultaneously, while the QRAC only gives information about a subset. For several different (n ,2 ,p ) QRACs, we see the same trade-off, as the best p values are obtained when the number of bits that can be obtained simultaneously is as small as possible. The trade-off is connected to parity obliviousness, since high certainty information about several bits can be used to calculate probabilities for parities of subsets.
Superdense coding facilitated by hyper-entanglement and quantum networks
Smith, James F.
2017-05-01
A method of generating superdense coding based on quantum hyper-entanglement and facilitated by quantum networks is discussed. Superdense coding refers to the coding of more than one classical bit into each qubit. Quantum hyperentanglement refers to quantum entanglement in more than one degree of freedom, e.g. polarization, energy-time, and orbital angular momentum (OAM). The new superdense coding scheme permits 2L bits to be encoded into each qubit where L is the number of degrees of freedom used for quantum hyper-entanglement. The superdense coding procedure is based on a generalization of the Bell state for L degrees of freedom. Theory describing the structure, generation/transmission, and detection of the generalized Bell state is developed. Circuit models are provided describing the generation/transmission process and detection process. Detection processes are represented mathematically as projection operators. A mathematical proof that that the detection scheme permits the generalized Bell states to be distinguished with 100% probability is provided. Measures of effectiveness (MOEs) are derived for the superdense coding scheme based on open systems theory represented in terms of density operators. Noise and loss related to generation/transmission, detection and propagation are included. The MOEs include various probabilities, quantum Chernoff bound, a measure of the number of message photons that must be transmitted to successfully send and receive a message, SNR and the quantum Cramer Rao' lower bound. Quantum networks with quantum memory are used to increase the efficiency of the superdense coding scheme.
Quantum algorithms and the genetic code
Indian Academy of Sciences (India)
Home; Journals; Pramana – Journal of Physics; Volume 56; Issue 2-3. Quantum ... Quantum information processing Volume 56 Issue 2-3 February-March 2001 pp 367-381 ... Quantum mechanics; computation; database search; genetic information; DNA; nucleotide base; protein; amino acid; enzyme; quantum coherence.
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.
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.)
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 ...
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.
Entanglement-enhanced quantum error-correcting codes
Dong, Ying; Deng, Xiuhao; Jiang, Mingming; Chen, Qing; Yu, Sixia
2009-04-01
Via explicit examples we show that the pre-existing entanglement can really enhance (not only behave as an assistance for) the efficiency of the quantum error-correcting codes (QECCs) in a single block of encoding or decoding as well as help in beating the quantum Hamming bound. A systematic approach to constructing entanglement-assisted (or enhanced) quantum error-correcting codes (EAQECCs) via graph states is also presented, and an infinite family of entanglement-enhanced codes has been constructed. Furthermore we generalize the EAQECCs to the case of not-so-perfectly protected qubit and introduce the quantity infidelity as a figure of merit and show that the EAQECCs also outperform the ordinary QECCs.
Nonuniform code concatenation for universal fault-tolerant quantum computing
Nikahd, Eesa; Sedighi, Mehdi; Saheb Zamani, Morteza
2017-09-01
Using transversal gates is a straightforward and efficient technique for fault-tolerant quantum computing. Since transversal gates alone cannot be computationally universal, they must be combined with other approaches such as magic state distillation, code switching, or code concatenation to achieve universality. In this paper we propose an alternative approach for universal fault-tolerant quantum computing, mainly based on the code concatenation approach proposed in [T. Jochym-O'Connor and R. Laflamme, Phys. Rev. Lett. 112, 010505 (2014), 10.1103/PhysRevLett.112.010505], but in a nonuniform fashion. The proposed approach is described based on nonuniform concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code, as well as the 5-qubit code with the 15-qubit Reed-Muller code, which lead to two 49-qubit and 47-qubit codes, respectively. These codes can correct any arbitrary single physical error with the ability to perform a universal set of fault-tolerant gates, without using magic state distillation.
Superconducting quantum simulator for topological order and the toric code
Sameti, Mahdi; Potočnik, Anton; Browne, Dan E.; Wallraff, Andreas; Hartmann, Michael J.
2017-04-01
Topological order is now being established as a central criterion for characterizing and classifying ground states of condensed matter systems and complements categorizations based on symmetries. Fractional quantum Hall systems and quantum spin liquids are receiving substantial interest because of their intriguing quantum correlations, their exotic excitations, and prospects for protecting stored quantum information against errors. Here, we show that the Hamiltonian of the central model of this class of systems, the toric code, can be directly implemented as an analog quantum simulator in lattices of superconducting circuits. The four-body interactions, which lie at its heart, are in our concept realized via superconducting quantum interference devices (SQUIDs) that are driven by a suitably oscillating flux bias. All physical qubits and coupling SQUIDs can be individually controlled with high precision. Topologically ordered states can be prepared via an adiabatic ramp of the stabilizer interactions. Strings of qubit operators, including the stabilizers and correlations along noncontractible loops, can be read out via a capacitive coupling to read-out resonators. Moreover, the available single-qubit operations allow to create and propagate elementary excitations of the toric code and to verify their fractional statistics. The architecture we propose allows to implement a large variety of many-body interactions and thus provides a versatile analog quantum simulator for topological order and lattice gauge theories.
Channel representation of quantum error-correcting codes
Energy Technology Data Exchange (ETDEWEB)
Guetschow, Johannes; Vogts, Holger; Werner, Reinhard [Institut fuer Mathematische Physik, TU Braunschweig (Germany)
2008-07-01
Quantum error-correcting codes (qeccs) are essential for most of the proposed realizations of quantum computation to correct errors due to decoherence. Quantum convolutional codes (qccs) are a promising candidate for on line encoding and decoding of a flow of quantum information thus enabling the sending party to begin with the transmission of quantum information before the end of the flow (or a block) is reached. Analogously the decoding process can begin before the end of the transmission. Until now, only the noise and interaction with the environment were described in the channel formalism. We investigate qeccs and describe their encoders as channels. Block encoders are represented by memoryless channels, whereas convolutional encoders are described by memory channels. Convolutional encoders need to be 'non-catastrophic', meaning an error on a single source qubit should only affect a finite number of target qubits. We investigate the relation between this condition and the 'forgetfulness'-property of quantum memory channels.
Tartarus: A relativistic Green's function quantum average atom code
Gill, N. M.; Starrett, C. E.
2017-09-01
A relativistic Green's Function quantum average atom model is implemented in the Tartarus code for the calculation of equation of state data in dense plasmas. We first present the relativistic extension of the quantum Green's Function average atom model described by Starrett [1]. The Green's Function approach addresses the numerical challenges arising from resonances in the continuum density of states without the need for resonance tracking algorithms or adaptive meshes, though there are still numerical challenges inherent to this algorithm. We discuss how these challenges are addressed in the Tartarus algorithm. The outputs of the calculation are shown in comparison to PIMC/DFT-MD simulations of the Principal Shock Hugoniot in Silicon. We also present the calculation of the Hugoniot for Silver coming from both the relativistic and nonrelativistic modes of the Tartarus code.
Effect of quantum fluctuation in error-correcting codes.
Otsubo, Yosuke; Inoue, Jun-ichi; Nagata, Kenji; Okada, Masato
2012-11-01
We discuss the decoding performance of error-correcting codes based on a model in which quantum fluctuations are introduced by means of a transverse field. The essential issue in this paper is whether quantum fluctuations improve the decoding quality compared with the conventional estimation based on thermal fluctuations, which is called finite-temperature decoding. We found that an estimation incorporating quantum fluctuations approaches the optimal performance of finite-temperature decoding. The results are illustrated by numerically solving saddle-point equations and performing a Monte Carlo simulation. We also evaluated the upper bound of the overlap between the original sequence and the decoded sequence derived from the equations of state for the order parameters, which is a measure of the decoding performance.
Linear Plotkin bound for entanglement-assisted quantum codes
Guo, Luobin; Li, Ruihu
2013-03-01
The entanglement-assisted (EA) formalism is a generalization of the standard stabilizer formalism, and it can transform arbitrary quaternary classical linear codes into entanglement-assisted quantum error correcting codes (EAQECCs) by using of shared entanglement between the sender and the receiver. Using the special structure of linear EAQECCs, we derive an EA-Plotkin bound for linear EAQECCs, which strengthens the previous known EA-Plotkin bound. This linear EA-Plotkin bound is tighter then the EA-Singleton bound, and matches the EA-Hamming bound and the EA-linear programming bound in some cases. We also construct three families of EAQECCs with good parameters. Some of these EAQECCs saturate this linear EA-Plotkin bound and the others are near optimal according to this bound; almost all of these linear EAQECCs are degenerate codes.
Optimal quantum error correcting codes from absolutely maximally entangled states
Raissi, Zahra; Gogolin, Christian; Riera, Arnau; Acín, Antonio
2018-02-01
Absolutely maximally entangled (AME) states are pure multi-partite generalizations of the bipartite maximally entangled states with the property that all reduced states of at most half the system size are in the maximally mixed state. AME states are of interest for multipartite teleportation and quantum secret sharing and have recently found new applications in the context of high-energy physics in toy models realizing the AdS/CFT-correspondence. We work out in detail the connection between AME states of minimal support and classical maximum distance separable (MDS) error correcting codes and, in particular, provide explicit closed form expressions for AME states of n parties with local dimension \
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
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.
Scalable Quantum Circuit and Control for a Superconducting Surface Code
Versluis, R.; Poletto, S.; Khammassi, N.; Tarasinski, B.; Haider, N.; Michalak, D. J.; Bruno, A.; Bertels, K.; DiCarlo, L.
2017-09-01
We present a scalable scheme for executing the error-correction cycle of a monolithic surface-code fabric composed of fast-flux-tunable transmon qubits with nearest-neighbor coupling. An eight-qubit unit cell forms the basis for repeating both the quantum hardware and coherent control, enabling spatial multiplexing. This control uses three fixed frequencies for all single-qubit gates and a unique frequency-detuning pattern for each qubit in the cell. By pipelining the interaction and readout steps of ancilla-based X - and Z -type stabilizer measurements, we can engineer detuning patterns that avoid all second-order transmon-transmon interactions except those exploited in controlled-phase gates, regardless of fabric size. Our scheme is applicable to defect-based and planar logical qubits, including lattice surgery.
FPGA based digital phase-coding quantum key distribution system
Lu, XiaoMing; Zhang, LiJun; Wang, YongGang; Chen, Wei; Huang, DaJun; Li, Deng; Wang, Shuang; He, DeYong; Yin, ZhenQiang; Zhou, Yu; Hui, Cong; Han, ZhengFu
2015-12-01
Quantum key distribution (QKD) is a technology with the potential capability to achieve information-theoretic security. Phasecoding is an important approach to develop practical QKD systems in fiber channel. In order to improve the phase-coding modulation rate, we proposed a new digital-modulation method in this paper and constructed a compact and robust prototype of QKD system using currently available components in our lab to demonstrate the effectiveness of the method. The system was deployed in laboratory environment over a 50 km fiber and continuously operated during 87 h without manual interaction. The quantum bit error rate (QBER) of the system was stable with an average value of 3.22% and the secure key generation rate is 8.91 kbps. Although the modulation rate of the photon in the demo system was only 200 MHz, which was limited by the Faraday-Michelson interferometer (FMI) structure, the proposed method and the field programmable gate array (FPGA) based electronics scheme have a great potential for high speed QKD systems with Giga-bits/second modulation rate.
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.
New Class of Quantum Error-Correcting Codes for a Bosonic Mode
Directory of Open Access Journals (Sweden)
Marios H. Michael
2016-07-01
Full Text Available 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.
Single-shot secure quantum network coding on butterfly network with free public communication
Owari, Masaki; Kato, Go; Hayashi, Masahito
2018-01-01
Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose a secure quantum network code for the butterfly network with free public classical communication in the multiple unicast setting under restricted eavesdropper’s power. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy with shared randomness as additional resource when the eavesdropper wiretaps one of the channels in the butterfly network and also derives the information sending through public classical communication. Our protocol does not require verification process, which ensures single-shot security.
Perfect quantum multiple-unicast network coding protocol
Li, Dan-Dan; Gao, Fei; Qin, Su-Juan; Wen, Qiao-Yan
2018-01-01
In order to realize long-distance and large-scale quantum communication, it is natural to utilize quantum repeater. For a general quantum multiple-unicast network, it is still puzzling how to complete communication tasks perfectly with less resources such as registers. In this paper, we solve this problem. By applying quantum repeaters to multiple-unicast communication problem, we give encoding-decoding schemes for source nodes, internal ones and target ones, respectively. Source-target nodes share EPR pairs by using our encoding-decoding schemes over quantum multiple-unicast network. Furthermore, quantum communication can be accomplished perfectly via teleportation. Compared with existed schemes, our schemes can reduce resource consumption and realize long-distance transmission of quantum information.
The two-qubit amplitude damping channel: Characterization using quantum stabilizer codes
Energy Technology Data Exchange (ETDEWEB)
Omkar, S. [School of Physics, IISER TVM, CET Campus, Thiruvananthapuram 695016, Kerala (India); Srikanth, R., E-mail: srik@poornaprajna.org [Poornaprajna Institute of Scientific Research, Sadashivnagar, Bengaluru- 560080 (India); Banerjee, Subhashish [Indian Institute of Technology Rajasthan, Jodhpur- 342011 (India); Shaji, Anil [School of Physics, IISER TVM, CET Campus, Thiruvananthapuram 695016, Kerala (India)
2016-10-15
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.
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.
Decoy state method for quantum cryptography based on phase coding into faint laser pulses
Kulik, S. P.; Molotkov, S. N.
2017-12-01
We discuss the photon number splitting attack (PNS) in systems of quantum cryptography with phase coding. It is shown that this attack, as well as the structural equations for the PNS attack for phase encoding, differs physically from the analogous attack applied to the polarization coding. As far as we know, in practice, in all works to date processing of experimental data has been done for phase coding, but using formulas for polarization coding. This can lead to inadequate results for the length of the secret key. These calculations are important for the correct interpretation of the results, especially if it concerns the criterion of secrecy in quantum cryptography.
Frames, designs, and spherical codes in quantum information theory
Renes, Joseph M.
Frame theory offers a lens through which to view a large portion of quantum information theory, providing an organizational principle to those topics in its purview. In this thesis, I cut a trail from foundational questions to practical applications, from the origin of the quantum probability rule to quantum cryptography, by way of a standard quantum measurement helpful in quantum tomography and representation of quantum theory. Before embarking, preparations are undertaken by outlining the relevant aspects of frame theory, particularly the characterization of generalized orthonormal bases in terms of physical quantum measurements, as well as several aesthetically appealing families of measurements, each possessing a high degree of symmetry. Much more than just elegant, though, these quantum measurements are found to be useful in many aspects of quantum information theory. I first consider the foundational question of justifying the quantum probability rule, showing that putting a probability valuation on generalized quantum measurements leads directly to the Born rule. Moreover, for qubits, the case neglected in the traditional formulation of Gleason's theorem, a symmetric three-outcome measurement called the trine is sufficient to impel the desired form. Keeping with foundational questions, I then turn to the problem of establishing a symmetric measurement capable of effortlessly rendering quantum theory in terms of classical probability theory. Numerical results provide an almost utterly convincing amount of evidence for this, justifying the subsequent study of its use in quantum tomography and detailed account of the properties of the reduction to probabilistic terms. Saving perhaps the most exciting topic for last, I make use of these aesthetic ensembles in the applied field of quantum cryptography. A large class of streamlined key distribution protocols may be cut from the cloth of these ensembles, and their symmetry affords them improved tolerance to
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.
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
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.
Quantum image pseudocolor coding based on the density-stratified method
Jiang, Nan; Wu, Wenya; Wang, Luo; Zhao, Na
2015-05-01
Pseudocolor processing is a branch of image enhancement. It dyes grayscale images to color images to make the images more beautiful or to highlight some parts on the images. This paper proposes a quantum image pseudocolor coding scheme based on the density-stratified method which defines a colormap and changes the density value from gray to color parallel according to the colormap. Firstly, two data structures: quantum image GQIR and quantum colormap QCR are reviewed or proposed. Then, the quantum density-stratified algorithm is presented. Based on them, the quantum realization in the form of circuits is given. The main advantages of the quantum version for pseudocolor processing over the classical approach are that it needs less memory and can speed up the computation. Two kinds of examples help us to describe the scheme further. Finally, the future work are analyzed.
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.
Construction of quantum caps in projective space PG( r, 4) and quantum codes of distance 4
Li, Ruihu; Fu, Qiang; Guo, Luobin; Li, Xueliang
2016-02-01
Constructions of quantum caps in projective space PG( r, 4) by recursive methods and computer search are discussed. For each even n satisfying n≥282 and each odd z satisfying z≥275, a quantum n-cap and a quantum z-cap in PG(k-1, 4) with suitable k are constructed, and [[n,n-2k,4
Naghipour, Avaz; Jafarizadeh, Mohammad Ali
2017-12-01
This paper presents four classes of binary quantum codes with minimum distance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the complete graphs K_{4r+1} and K_{4s} and by current graphs and rotation schemes. The parameters of two classes of quantum codes are [[2r(4r+1),2r(4r-3),3
Gao, Jian; Wang, Yongkang
2018-01-01
Structural properties of u-constacyclic codes over the ring F_p+u{F}_p are given, where p is an odd prime and u^2=1. Under a special Gray map from F_p+u{F}_p to F_p^2, some new non-binary quantum codes are obtained by this class of constacyclic codes.
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...
Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes
Jing, Lin; Brun, Todd; Quantum Research Team
Quasi-cyclic LDPC codes can approach the Shannon capacity and have efficient decoders. Manabu Hagiwara et al., 2007 presented a method to calculate parity check matrices with high girth. Two distinct, orthogonal matrices Hc and Hd are used. Using submatrices obtained from Hc and Hd by deleting rows, we can alter the code rate. The submatrix of Hc is used to correct Pauli X errors, and the submatrix of Hd to correct Pauli Z errors. We simulated this system for depolarizing noise on USC's High Performance Computing Cluster, and obtained the block error rate (BER) as a function of the error weight and code rate. From the rates of uncorrectable errors under different error weights we can extrapolate the BER to any small error probability. Our results show that this code family can perform reasonably well even at high code rates, thus considerably reducing the overhead compared to concatenated and surface codes. This makes these codes promising as storage blocks in fault-tolerant quantum computation. Error Correction using Quantum Quasi-Cyclic Low-Density Parity-Check(LDPC) Codes.
(Submitted) Scalable quantum circuit and control for a superconducting surface code
Versluis, R.; Poletto, S.; Khammassi, N.; Haider, N.; Michalak, D.J.; Bruno, A.; Bertels, K.; DiCarlo, L.
2016-01-01
We present a scalable scheme for executing the error-correction cycle of a monolithic surface-code fabric composed of fast-flux-tuneable transmon qubits with nearest-neighbor coupling. An eight-qubit unit cell forms the basis for repeating both the quantum hardware and coherent control, enabling
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.
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.
Analysis of a Quantum Error Correcting Code using Quantum Process Calculus
Directory of Open Access Journals (Sweden)
Timothy A. S. Davidson
2012-10-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. The key idea is to define two systems, one modelling a protocol and one expressing a specification, and prove that they are behaviourally equivalent. We summarize the necessary theory in the process calculus CQP, including the crucial result that equivalence is a congruence, meaning that it is preserved by embedding in any context. We illustrate the approach by analyzing two versions of a quantum error correction system.
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.
Percolation bounds for decoding thresholds with correlated erasures in quantum LDPC codes
Hamilton, Kathleen; Pryadko, Leonid
Correlations between errors can dramatically affect decoding thresholds, in some cases eliminating the threshold altogether. We analyze the existence of a threshold for quantum low-density parity-check (LDPC) codes in the case of correlated erasures. When erasures are positively correlated, the corresponding multi-variate Bernoulli distribution can be modeled in terms of cluster errors, where qubits in clusters of various size can be marked all at once. In a code family with distance scaling as a power law of the code length, erasures can be always corrected below percolation on a qubit adjacency graph associated with the code. We bound this correlated percolation transition by weighted (uncorrelated) percolation on a specially constructed cluster connectivity graph, and apply our recent results to construct several bounds for the latter. This research was supported in part by the NSF Grant PHY-1416578 and by the ARO Grant W911NF-14-1-0272.
A New Quantum Key Distribution Scheme based on Frequency and Time Coding
Zhu, Chang-hua; Pei, Chang-xing; Quan, Dong-xiao; 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 at the sender. The central frequency of the single photon pulse is set as omega1 for bit "0" and set as omega2 for bit "1" when frequency coding is selected. While, the single photon pulse is not delayed for bit ...
Complementarity between entanglement-assisted and quantum distributed random access code
Hameedi, Alley; Saha, Debashis; Mironowicz, Piotr; Pawłowski, Marcin; Bourennane, Mohamed
2017-05-01
Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of RACs, namely, quantum random access code (QRAC) and the entanglement-assisted random access code (EARAC), have demonstrated equal prowess for a number of tasks. However, there do exist specific cases where one outperforms the other. In this article, we study a family of 3 →1 distributed RACs [J. Bowles, N. Brunner, and M. Pawłowski, Phys. Rev. A 92, 022351 (2015), 10.1103/PhysRevA.92.022351] and present its general construction of both the QRAC and the EARAC. We demonstrate that, depending on the function of inputs that is sought, if QRAC achieves the maximal success probability then EARAC fails to do so and vice versa. Moreover, a tripartite Bell-type inequality associated with the EARAC variants reveals the genuine multipartite nonlocality exhibited by our protocol. We conclude with an experimental realization of the 3 →1 distributed QRAC that achieves higher success probabilities than the maximum possible with EARACs for a number of tasks.
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.
Position-based coding and convex splitting for private communication over quantum channels
Wilde, Mark M.
2017-10-01
The classical-input quantum-output (cq) wiretap channel is a communication model involving a classical sender X, a legitimate quantum receiver B, and a quantum eavesdropper E. The goal of a private communication protocol that uses such a channel is for the sender X to transmit a message in such a way that the legitimate receiver B can decode it reliably, while the eavesdropper E learns essentially nothing about which message was transmitted. The ɛ -one-shot private capacity of a cq wiretap channel is equal to the maximum number of bits that can be transmitted over the channel, such that the privacy error is no larger than ɛ \\in (0,1). The present paper provides a lower bound on the ɛ -one-shot private classical capacity, by exploiting the recently developed techniques of Anshu, Devabathini, Jain, and Warsi, called position-based coding and convex splitting. The lower bound is equal to a difference of the hypothesis testing mutual information between X and B and the "alternate" smooth max-information between X and E. The one-shot lower bound then leads to a non-trivial lower bound on the second-order coding rate for private classical communication over a memoryless cq wiretap channel.
Directory of Open Access Journals (Sweden)
Jian Li
2015-09-01
Full Text Available A novel quantum secure direct communication protocol based on four-particle genuine entangled state and quantum dense coding is proposed. In this protocol, the four-particle genuine entangled state is used to detect eavesdroppers, and quantum dense coding is used to encode the message. Finally, the security of the proposed protocol is discussed. During the security analysis, the method of entropy theory is introduced, and two detection strategies are compared quantitatively by comparing the relationship between the maximal information that the eavesdroppers (Eve can obtain, and the probability of being detected. Through the analysis we can state that our scheme is feasible and secure.
High performance reconciliation for continuous-variable quantum key distribution with LDPC code
Lin, Dakai; Huang, Duan; Huang, Peng; Peng, Jinye; Zeng, Guihua
2015-03-01
Reconciliation is a significant procedure in a continuous-variable quantum key distribution (CV-QKD) system. It is employed to extract secure secret key from the resulted string through quantum channel between two users. However, the efficiency and the speed of previous reconciliation algorithms are low. These problems limit the secure communication distance and the secure key rate of CV-QKD systems. In this paper, we proposed a high-speed reconciliation algorithm through employing a well-structured decoding scheme based on low density parity-check (LDPC) code. The complexity of the proposed algorithm is reduced obviously. By using a graphics processing unit (GPU) device, our method may reach a reconciliation speed of 25 Mb/s for a CV-QKD system, which is currently the highest level and paves the way to high-speed CV-QKD.
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.
Directory of Open Access Journals (Sweden)
Duc Manh Nguyen
2017-07-01
Full Text Available In this paper, new construction methods of entanglement-assisted quantum error correction code (EAQECC from circulant matrices are proposed. We first construct the matrices from two vectors of constraint size, and determine the isotropic subgroup. Then, we also propose a method for calculation of the entanglement subgroup based on standard forms of binary matrices to satisfy the constraint conditions of EAQECC. With isotropic and entanglement subgroups, we determine all the parameters and the minimum distance of the EAQECC. The proposed EAQECC with small lengths are presented to explain the practicality of this construction of EAQECC. Comparison with some earlier constructions of EAQECC shows that the proposed EAQECC is better.
Magic-State Distillation in All Prime Dimensions Using Quantum Reed-Muller Codes
Directory of Open Access Journals (Sweden)
Earl T. Campbell
2012-12-01
Full Text Available We propose families of protocols for magic-state distillation—important components of fault-tolerance schemes—for systems of odd prime dimension. Our protocols utilize quantum Reed-Muller codes with transversal non-Clifford gates. We find that, in higher dimensions, small and effective codes can be used that have no direct analogue in qubit (two-dimensional systems. We present several concrete protocols, including schemes for three-dimensional (qutrit and five-dimensional (ququint systems. The five-dimensional protocol is, by many measures, the best magic-state-distillation scheme yet discovered. It excels both in terms of error threshold with respect to depolarizing noise (36.3% and the efficiency measure known as yield, where, for a large region of parameters, it outperforms its qubit counterpart by many orders of magnitude.
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.
Jiang, Xue-Qin; Huang, Peng; Huang, Duan; Lin, Dakai; Zeng, Guihua
2017-02-01
Achieving information theoretic security with practical complexity is of great interest to continuous-variable quantum key distribution in the postprocessing procedure. In this paper, we propose a reconciliation scheme based on the punctured low-density parity-check (LDPC) codes. Compared to the well-known multidimensional reconciliation scheme, the present scheme has lower time complexity. Especially when the chosen punctured LDPC code achieves the Shannon capacity, the proposed reconciliation scheme can remove the information that has been leaked to an eavesdropper in the quantum transmission phase. Therefore, there is no information leaked to the eavesdropper after the reconciliation stage. This indicates that the privacy amplification algorithm of the postprocessing procedure is no more needed after the reconciliation process. These features lead to a higher secret key rate, optimal performance, and availability for the involved quantum key distribution scheme.
Optical coding of fusion genes using multicolor quantum dots for prostate cancer diagnosis.
Lee, Hyojin; Kim, Chloe; Lee, Dongjin; Park, Jea Ho; Searson, Peter C; Lee, Kwan Hyi
2017-01-01
Recent studies have found that prostate cancer expresses abnormal genetic markers including multiple types of TMPRSS2-ERG fusion genes. The expression level of different TMPRSS2-ERG fusion genes is correlated to pathologic variables of aggressive prostate cancer and disease progression. State-of-the-art methods for detection of TMPRSS2-ERG fusion genes include reverse transcription polymerase chain reaction (RT-PCR) with a detection limit of 1 fmol at urinary condition. RT-PCR is time consuming, costly, and inapplicable for multiplexing. Ability to identify multiple fusion genes in a single sample has become important for diagnostic and clinical purposes. There is a need for a sensitive diagnostic test to detect multiple TMPRSS2-ERG fusion genes for an early diagnosis and prognosis of prostate cancer. Here, we propose to develop an assay for prostate cancer diagnosis using oligonucleotide-functionalized quantum dot and magnetic microparticle for optical detection of rearranged TMPRSS2-ERG fusion genes at a low concentration in urine. We found that our assay was able to identify three different types of fusion gene with a wide detection range and detection limit of 1 fmol (almost the same level of the RT-PCR result reported). Here, we show detection of multiple TMPRSS2-ERG fusion genes using color-coded oligonucleotides in cell lysate and urine.
Directory of Open Access Journals (Sweden)
Martin Bercx, Florian Goth, Johannes S. Hofmann, Fakher F. Assaad
2017-08-01
Full Text Available The Algorithms for Lattice Fermions package provides a general code for the finite temperature auxiliary field quantum Monte Carlo algorithm. The code is engineered to be able to simulate any model that can be written in terms of sums of single-body operators, of squares of single-body operators and single-body operators coupled to an Ising field with given dynamics. We provide predefined types that allow the user to specify the model, the Bravais lattice as well as equal time and time displaced observables. The code supports an MPI implementation. Examples such as the Hubbard model on the honeycomb lattice and the Hubbard model on the square lattice coupled to a transverse Ising field are provided and discussed in the documentation. We furthermore discuss how to use the package to implement the Kondo lattice model and the $SU(N$-Hubbard-Heisenberg model. One can download the code from our Git instance at https://alf.physik.uni-wuerzburg.de and sign in to file issues.
Quantum Phase Transitions of the Majorana Toric Code in the Presence of Finite Cooper-Pair Tunneling
Roy, Ananda; Terhal, Barbara M.; Hassler, Fabian
2017-11-01
The toric code based on Majorana fermions on mesoscopic superconducting islands is a promising candidate for quantum information processing. In the limit of vanishing Cooper-pair tunneling, it has been argued that the phase transition separating the topologically ordered phase of the toric code from the trivial one is in the universality class of the (2 +1 )D X Y model. On the other hand, in the limit of infinitely large Cooper-pair tunneling, the phase transition is in the universality class of the (2 +1 )D Ising model. In this work, we treat the case of finite Cooper-pair tunneling and address the question of how the continuous X Y symmetry breaking phase transition turns into a discrete Z2 symmetry breaking one when the Cooper-pair tunneling rate is increased. We show that this happens through a couple of tricritical points and first order phase transitions. Using a Jordan-Wigner transformation, we map the problem to that of spins coupled to quantum rotors and subsequently, propose a Landau field theory for this model that matches the known results in the respective limits. We calculate the effective field theories and provide the relevant critical exponents for the different phase transitions. Our results are relevant for predicting the stability of the topological phase in realistic experimental implementations.
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.
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.
Zarei, Mohammad Hossein
2017-10-01
Graphs and recently hypergraphs have been known as an important tool for considering different properties of quantum many-body systems. In this paper, we study a mapping between an important class of quantum systems, namely quantum Calderbank-Shor-Steane (CSS) codes, and Ising-like systems by using hypergraphs. We show that the Hamiltonian corresponding to a CSS code on a hypergraph H which is perturbed by a uniform magnetic field is mapped to Hamiltonian of a Ising-like system on dual hypergraph H ˜ in a transverse field. Interestingly, we show that a strong regime of couplings in one of the systems is mapped to a weak regime of couplings in another one. We also give some applications for such a mapping where we study robustness of different topological CSS codes against a uniform magnetic field including Kitaev's toric codes defined on graphs and color codes in different dimensions. We show that a perturbed Kitaev's toric code on an arbitrary graph is mapped to an Ising model in a transverse field on the same graph and a perturbed color code on a D colex is mapped to a Ising-like model on a D -simplicial lattice in a transverse field. In particular, we use these results to explicitly compare the robustness of toric codes to uniform magnetic-field perturbations on different graphs. Interestingly, our results show that the robustness of such topological codes defined on graphs decreases with increasing dimension. Furthermore, we also use the duality mapping for some self-dual models where we exactly derive the point of phase transition.
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.
The complementarity relations of quantum coherence in quantum information processing.
Pan, Fei; Qiu, Liang; Liu, Zhi
2017-03-08
We establish two complementarity relations for the relative entropy of coherence in quantum information processing, i.e., quantum dense coding and teleportation. We first give an uncertainty-like expression relating local quantum coherence to the capacity of optimal dense coding for bipartite system. The relation can also be applied to the case of dense coding by using unital memoryless noisy quantum channels. Further, the relation between local quantum coherence and teleportation fidelity for two-qubit system is given.
Garcia-Escartin, Juan Carlos; Chamorro-Posada, Pedro
2011-01-01
Quantum algorithms and protocols are often presented as quantum circuits for a better understanding. We give a list of equivalence rules which can help in the analysis and design of quantum circuits. As example applications we study quantum teleportation and dense coding protocols in terms of a simple XOR swapping circuit and give an intuitive picture of a basic gate teleportation circuit.
Introduction to quantum information science
Hayashi, Masahito; Kawachi, Akinori; Kimura, Gen; Ogawa, Tomohiro
2015-01-01
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 teleport...
Quantum information processing
National Research Council Canada - National Science Library
Leuchs, Gerd; Beth, Thomas
2003-01-01
... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.5 SimulationofHamiltonians... References... 1 1 1 3 5 8 10 2 Quantum Information Processing and Error Correction with Jump Codes (G. Alber, M. Mussinger...
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...
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.
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.
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
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 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.
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...
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...
Fault-tolerant interface between quantum memories and quantum processors.
Poulsen Nautrup, Hendrik; Friis, Nicolai; Briegel, Hans J
2017-11-06
Topological error correction codes are promising candidates to protect quantum computations from the deteriorating effects of noise. While some codes provide high noise thresholds suitable for robust quantum memories, others allow straightforward gate implementation needed for data processing. To exploit the particular advantages of different topological codes for fault-tolerant quantum computation, it is necessary to be able to switch between them. Here we propose a practical solution, subsystem lattice surgery, which requires only two-body nearest-neighbor interactions in a fixed layout in addition to the indispensable error correction. This method can be used for the fault-tolerant transfer of quantum information between arbitrary topological subsystem codes in two dimensions and beyond. In particular, it can be employed to create a simple interface, a quantum bus, between noise resilient surface code memories and flexible color code processors.
Podt, M.; Weenink, J.; Weenink, J.; Flokstra, Jakob; Rogalla, Horst
2001-01-01
We report on a superconducting quantum interference device (SQUID) system to read out large arrays of cryogenic detectors. In order to reduce the number of SQUIDs required for an array of these detectors, we used code-division multiplexing. This simplifies the electronics because of a significantly
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-01-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. PMID:27924865
Scaffold: Quantum Programming Language
2012-07-24
modules that the pro- grammer specifies using purely classical data, but calls with appropriately sized quantum registers as inputs. Tools within our...set of gates. Then line 2 is where the main module begins. Every free -standing program must contain 5 Gate Prototypes Module (classical/quantum code...definitions and example usages, and emphasizes the distinctions between classical and quantum data and operations. We discuss the context of the
Capacity of quantum Gaussian channels
Holevo, A. S.; Sohma, M.; Hirota, O.
1999-03-01
The aim of this paper is to give explicit calculation of the classical capacity of quantum Gaussian channels, in particular, involving squeezed states. The calculation is based on a general formula for the entropy of a quantum Gaussian state, which is of independent interest, and on the recently proved coding theorem for quantum communication channels.
Layered Architecture for Quantum Computing
Directory of Open Access Journals (Sweden)
N. Cody Jones
2012-07-01
Full Text Available We develop a layered quantum-computer architecture, which is a systematic framework for tackling the individual challenges of developing a quantum computer while constructing a cohesive device design. 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. In doing so, we propose a new quantum-computer architecture based on optical control of quantum dots. The time scales of physical-hardware operations and logical, error-corrected quantum gates differ by several orders of magnitude. By dividing functionality into layers, we can design and analyze subsystems independently, demonstrating the value of our layered architectural approach. Using this concrete hardware platform, we provide resource analysis for executing fault-tolerant quantum algorithms for integer factoring and quantum simulation, finding that the quantum-dot architecture we study could solve such problems on the time scale of days.
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…
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 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.
Quantum Erasure: Quantum Interference Revisited
Walborn, Stephen P.; Cunha, Marcelo O. Terra; Pádua, Sebastião; Monken, Carlos H.
2005-01-01
Recent experiments in quantum optics have shed light on the foundations of quantum physics. Quantum erasers - modified quantum interference experiments - show that quantum entanglement is responsible for the complementarity principle.
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...
Schindelhauer, Christian; Jakoby, Andreas; Köhler, Sven
2016-01-01
We introduce Cyclone codes which are rateless erasure resilient codes. They combine Pair codes with Luby Transform (LT) codes by computing a code symbol from a random set of data symbols using bitwise XOR and cyclic shift operations. The number of data symbols is chosen according to the Robust Soliton distribution. XOR and cyclic shift operations establish a unitary commutative ring if data symbols have a length of $p-1$ bits, for some prime number $p$. We consider the graph given by code sym...
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.
DEFF Research Database (Denmark)
Ejsing-Duun, Stine; Hansbøl, Mikala
Sammenfatning af de mest væsentlige pointer fra hovedrapporten: Dokumentation og evaluering af Coding Class......Sammenfatning af de mest væsentlige pointer fra hovedrapporten: Dokumentation og evaluering af Coding Class...
Directory of Open Access Journals (Sweden)
Ishac Bertran
2012-08-01
Full Text Available "Exploring the potential of code to communicate at the level of poetry," the code {poems} project solicited submissions from codewriters in response to the notion of a poem, written in a software language which is semantically valid. These selections reveal the inner workings, constitutive elements, and styles of both a particular software and its authors.
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.
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
Toric Codes, Multiplicative Structure and Decoding
DEFF Research Database (Denmark)
Hansen, Johan Peder
2017-01-01
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.......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...
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.)
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...
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.
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.
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.
CODING, ANALOG SYSTEMS), INFORMATION THEORY, DATA TRANSMISSION SYSTEMS , TRANSMITTER RECEIVERS, WHITE NOISE, PROBABILITY, ERRORS, PROBABILITY DENSITY FUNCTIONS, DIFFERENTIAL EQUATIONS, SET THEORY, COMPUTER PROGRAMS
The Mathematics of Error Correcting Quan tum Codes
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 6; Issue 4. The Mathematics of Error Correcting Quantum Codes - Quantum Coding. K R Parthasarathy. General Article Volume 6 Issue 4 April 2001 pp 38-51. Fulltext. Click here to view fulltext PDF. Permanent link:
Divergence coding for convolutional codes
Directory of Open Access Journals (Sweden)
Valery Zolotarev
2017-01-01
Full Text Available In the paper we propose a new coding/decoding on the divergence principle. A new divergent multithreshold decoder (MTD for convolutional self-orthogonal codes contains two threshold elements. The second threshold element decodes the code with the code distance one greater than for the first threshold element. Errorcorrecting possibility of the new MTD modification have been higher than traditional MTD. Simulation results show that the performance of the divergent schemes allow to approach area of its effective work to channel capacity approximately on 0,5 dB. Note that we include the enough effective Viterbi decoder instead of the first threshold element, the divergence principle can reach more. Index Terms — error-correcting coding, convolutional code, decoder, multithreshold decoder, Viterbi algorithm.
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...... 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......; 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...
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.
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.
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.
Hartle, James B.
2018-01-01
A quantum theory of the universe consists of a theory of its quantum dynamics and a theory of its quantum state The theory predicts quantum multiverses in the form of decoherent sets of alternative histories describing the evolution of the universe's spacetime geometry and matter content. These consequences follow: (a) The universe generally exhibits different quantum multiverses at different levels and kinds of coarse graining. (b) Quantum multiverses are not a choice or an assumption but ar...
Traub, Joseph F.
2014-01-01
The aim of this thesis was to explain what quantum computing is. The information for the thesis was gathered from books, scientific publications, and news articles. The analysis of the information revealed that quantum computing can be broken down to three areas: theories behind quantum computing explaining the structure of a quantum computer, known quantum algorithms, and the actual physical realizations of a quantum computer. The thesis reveals that moving from classical memor...
Directory of Open Access Journals (Sweden)
Anthony McCosker
2014-03-01
Full Text Available As well as introducing the Coding Labour section, the authors explore the diffusion of code across the material contexts of everyday life, through the objects and tools of mediation, the systems and practices of cultural production and organisational management, and in the material conditions of labour. Taking code beyond computation and software, their specific focus is on the increasingly familiar connections between code and labour with a focus on the codification and modulation of affect through technologies and practices of management within the contemporary work organisation. In the grey literature of spreadsheets, minutes, workload models, email and the like they identify a violence of forms through which workplace affect, in its constant flux of crisis and ‘prodromal’ modes, is regulated and governed.
National Research Council Canada - National Science Library
McCosker, Anthony; Milne, Esther
2014-01-01
... software. Code encompasses the laws that regulate human affairs and the operation of capital, behavioural mores and accepted ways of acting, but it also defines the building blocks of life as DNA...
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.
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
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.
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
Achieving the Heisenberg limit in quantum metrology using quantum error correction.
Zhou, Sisi; Zhang, Mengzhen; Preskill, John; Jiang, Liang
2018-01-08
Quantum metrology has many important applications in science and technology, ranging from frequency spectroscopy to gravitational wave detection. Quantum mechanics imposes a fundamental limit on measurement precision, called the Heisenberg limit, which can be achieved for noiseless quantum systems, but is not achievable in general for systems subject to noise. Here we study how measurement precision can be enhanced through quantum error correction, a general method for protecting a quantum system from the damaging effects of noise. We find a necessary and sufficient condition for achieving the Heisenberg limit using quantum probes subject to Markovian noise, assuming that noiseless ancilla systems are available, and that fast, accurate quantum processing can be performed. When the sufficient condition is satisfied, a quantum error-correcting code can be constructed that suppresses the noise without obscuring the signal; the optimal code, achieving the best possible precision, can be found by solving a semidefinite program.
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.
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
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.)
Indian Academy of Sciences (India)
Network coding is a technique to increase the amount of information °ow in a network by mak- ing the key observation that information °ow is fundamentally different from commodity °ow. Whereas, under traditional methods of opera- tion of data networks, intermediate nodes are restricted to simply forwarding their incoming.
DEFF Research Database (Denmark)
Ejsing-Duun, Stine; Hansbøl, Mikala
Denne rapport rummer evaluering og dokumentation af Coding Class projektet1. Coding Class projektet blev igangsat i skoleåret 2016/2017 af IT-Branchen i samarbejde med en række medlemsvirksomheder, Københavns kommune, Vejle Kommune, Styrelsen for IT- og Læring (STIL) og den frivillige forening...... Coding Pirates2. Rapporten er forfattet af Docent i digitale læringsressourcer og forskningskoordinator for forsknings- og udviklingsmiljøet Digitalisering i Skolen (DiS), Mikala Hansbøl, fra Institut for Skole og Læring ved Professionshøjskolen Metropol; og Lektor i læringsteknologi, interaktionsdesign......, design tænkning og design-pædagogik, Stine Ejsing-Duun fra Forskningslab: It og Læringsdesign (ILD-LAB) ved Institut for kommunikation og psykologi, Aalborg Universitet i København. Vi har fulgt og gennemført evaluering og dokumentation af Coding Class projektet i perioden november 2016 til maj 2017...
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 15; Issue 7. Network Coding. K V Rashmi Nihar B Shah P Vijay Kumar. General Article Volume 15 Issue 7 July 2010 pp 604-621. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/015/07/0604-0621. Keywords.
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 10; Issue 1. Expander Codes - The Sipser–Spielman Construction. Priti Shankar. General Article Volume 10 ... Author Affiliations. Priti Shankar1. Department of Computer Science and Automation, Indian Institute of Science Bangalore 560 012, India.
Quantum CPU and Quantum Simulating
Wang, An Min
1999-01-01
Making use of an universal quantum network or QCPU proposed by me [6], some special quantum networks for simulating some quantum systems are given out. Specially, it is obtained that the quantum network for the time evolution operator which can simulate, in general, Schr\\"odinger equation.
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…
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.
Proposal for a minimal surface code experiment
Wootton, James R.; Peter, Andreas; Winkler, János R.; Loss, Daniel
2017-09-01
Current quantum technology is approaching the system sizes and fidelities required for quantum error correction. It is therefore important to determine exactly what is needed for proof-of-principle experiments, which will be a major step towards fault-tolerant quantum computation. Here we propose a surface code based experiment that is the smallest, both in terms of code size and circuit depth, that would allow errors to be detected and corrected for both the X and Z bases of a qubit. This requires 17 physical qubits initially prepared in a product state, on which 16 two-qubit entangling gates are applied before a final measurement of all qubits. A platform agnostic error model is applied to give some idea of the noise levels required for success. It is found that a true demonstration of quantum error correction will require fidelities for the preparation and measurement of qubits and the entangling gates to be above 99 % .
Moderate Deviation Analysis for Classical Communication over Quantum Channels
Chubb, Christopher T.; Tan, Vincent Y. F.; Tomamichel, Marco
2017-11-01
We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff between decoding error, code rate and code length for such codes we introduce a quantum generalisation of the moderate deviation analysis proposed by Altŭg and Wagner as well as Polyanskiy and Verdú. We derive such a tradeoff for classical-quantum (as well as image-additive) channels in terms of the channel capacity and the channel dispersion, giving further evidence that the latter quantity characterises the necessary backoff from capacity when transmitting finite blocks of classical data. To derive these results we also study asymmetric binary quantum hypothesis testing in the moderate deviations regime. Due to the central importance of the latter task, we expect that our techniques will find further applications in the analysis of other quantum information processing tasks.
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.
2014-12-01
added by the decoder is K/ρ+Td. By the last assumption, Td and Te are both ≤ K/ρ, so the total latency added is between 2K/ρ and 4K /ρ. For example...better resolution near the decision point. Reference [12] showed that in decoding a (1024, 512) polar code, using 6-bit LLRs resulted in per- formance
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
Bialynicki-Birula, I; Ter Haar, D
1975-01-01
Quantum Electrodynamics focuses on the formulation of quantum electrodynamics (QED) in its most general and most abstract form: relativistic quantum field theory. It describes QED as a program, rather than a closed theory, that rests on the theory of the quantum Maxwellian field interacting with given (external) classical sources of radiation and on the relativistic quantum mechanics of electrons interacting with a given (external) classical electromagnetic field.Comprised of eight chapters, this volume begins with an introduction to the fundamental principles of quantum theory formulated in a
Blaise, Paul
2011-01-01
An invaluable reference for an overall but simple approach to the complexity of quantum mechanics viewed through quantum oscillators Quantum oscillators play a fundamental role in many areas of physics; for instance, in chemical physics with molecular normal modes, in solid state physics with phonons, and in quantum theory of light with photons. Quantum Oscillators is a timely and visionary book which presents these intricate topics, broadly covering the properties of quantum oscillators which are usually dispersed in the literature at varying levels of detail and often combined with other p
Quantum circuits for cryptanalysis
Amento, Brittanney Jaclyn
Finite fields of the form F2 m play an important role in coding theory and cryptography. We show that the choice of how to represent the elements of these fields can have a significant impact on the resource requirements for quantum arithmetic. In particular, we show how the Gaussian normal basis representations and "ghost-bit basis" representations can be used to implement inverters with a quantum circuit of depth O(mlog(m)). To the best of our knowledge, this is the first construction with subquadratic depth reported in the literature. Our quantum circuit for the computation of multiplicative inverses is based on the Itoh-Tsujii algorithm which exploits the property that, in a normal basis representation, squaring corresponds to a permutation of the coefficients. We give resource estimates for the resulting quantum circuit for inversion over binary fields F2 m based on an elementary gate set that is useful for fault-tolerant implementation. Elliptic curves over finite fields F2 m play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in combination with affine or projective coordinates. In this thesis we show that changing the curve representation allows a substantial reduction in the number of T-gates needed to implement the curve arithmetic. As a tool, we present a quantum circuit for computing multiplicative inverses in F2m in depth O(m log m) using a polynomial basis representation, which may be of independent interest. Finally, we change our focus from the design of circuits which aim at attacking computational assumptions on asymmetric cryptographic algorithms to the design of a circuit attacking a symmetric cryptographic algorithm. We consider a block cipher, SERPENT, and our design of a quantum circuit implementing this cipher to be used for a key attack using Grover's algorithm as in [18]. This quantum circuit is essential for understanding the complexity of Grover's algorithm.
Cat Codes with Optimal Decoherence Suppression for a Lossy Bosonic Channel
Li, Linshu; Zou, Chang-Ling; Albert, Victor V.; Muralidharan, Sreraman; Girvin, S. M.; Jiang, Liang
2017-07-01
We investigate cat codes that can correct multiple excitation losses and identify two types of logical errors: bit-flip errors due to excessive excitation loss and dephasing errors due to quantum backaction from the environment. We show that selected choices of logical subspace and coherent amplitude significantly reduce dephasing errors. The trade-off between the two major errors enables optimized performance of cat codes in terms of minimized decoherence. With high coupling efficiency, we show that one-way quantum repeaters with cat codes feature a boosted secure communication rate per mode when compared to conventional encoding schemes, showcasing the promising potential of quantum information processing with continuous variable quantum codes.
Implementing the quantum von Neumann architecture with superconducting circuits.
Mariantoni, Matteo; Wang, H; Yamamoto, T; Neeley, M; Bialczak, Radoslaw C; Chen, Y; Lenander, M; Lucero, Erik; O'Connell, A D; Sank, D; Weides, M; Wenner, J; Yin, Y; Zhao, J; Korotkov, A N; Cleland, A N; Martinis, John M
2011-10-07
The von Neumann architecture for a classical computer comprises a central processing unit and a memory holding instructions and data. We demonstrate a quantum central processing unit that exchanges data with a quantum random-access memory integrated on a chip, with instructions stored on a classical computer. We test our quantum machine by executing codes that involve seven quantum elements: Two superconducting qubits coupled through a quantum bus, two quantum memories, and two zeroing registers. Two vital algorithms for quantum computing are demonstrated, the quantum Fourier transform, with 66% process fidelity, and the three-qubit Toffoli-class OR phase gate, with 98% phase fidelity. Our results, in combination especially with longer qubit coherence, illustrate a potentially viable approach to factoring numbers and implementing simple quantum error correction codes.
Some Aspects of Post-Quantum Cryptosystems
National Research Council Canada - National Science Library
Gagnidze, Avtandil; Iavich, Maksim; Iashvili, Giorgi
2017-01-01
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...
Convolutional-Code-Specific CRC Code Design
Lou, Chung-Yu; Daneshrad, Babak; Wesel, Richard D.
2015-01-01
Cyclic redundancy check (CRC) codes check if a codeword is correctly received. This paper presents an algorithm to design CRC codes that are optimized for the code-specific error behavior of a specified feedforward convolutional code. The algorithm utilizes two distinct approaches to computing undetected error probability of a CRC code used with a specific convolutional code. The first approach enumerates the error patterns of the convolutional code and tests if each of them is detectable. Th...
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.
Gisin, Nicolas; Ribordy, Grégoire; Tittel, Wolfgang; Zbinden, Hugo
2002-01-01
Quantum cryptography could well be the first application of quantum mechanics at the individual quanta level. The very fast progress in both theory and experiments over the recent years are reviewed, with emphasis on open questions and technological issues.
Esteban Guevara Hidalgo
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...
S. Fehr (Serge)
2010-01-01
textabstractQuantum 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.
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...
Concatenated codes with convolutional inner codes
DEFF Research Database (Denmark)
Justesen, Jørn; Thommesen, Christian; Zyablov, Viktor
1988-01-01
The minimum distance of concatenated codes with Reed-Solomon outer codes and convolutional inner codes is studied. For suitable combinations of parameters the minimum distance can be lower-bounded by the product of the minimum distances of the inner and outer codes. For a randomized ensemble...... of concatenated codes a lower bound of the Gilbert-Varshamov type is proved...
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.
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.
Moulick, Subhayan Roy; Panigrahi, Prasanta K.
2016-06-01
We propose the idea of a quantum cheque scheme, a cryptographic protocol in which any legitimate client of a trusted bank can issue a cheque, that cannot be counterfeited or altered in anyway, and can be verified by a bank or any of its branches. We formally define a quantum cheque and present the first unconditionally secure quantum cheque scheme and show it to be secure against any no-signalling adversary. The proposed quantum cheque scheme can been perceived as the quantum analog of Electronic Data Interchange, as an alternate for current e-Payment Gateways.
2017-08-01
TECHNICAL REPORT 3073 August 2017 Silicon Carbide Defect Qubits/Quantum Memory with Field-tuning: OSD Quantum Science and Engineering Program ...Higa SSC Pacific Lance Lerum Hector Romero Naval Research Enterprise Internship Program Mohammed Fahem San Diego State University Research...Quantum Science and Engineering Program ) by the Advanced Concepts and Applied Research Branch (Code 71730), the Energy and Environmental Sustainability
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.
Dissipative quantum error correction and application to quantum sensing with trapped ions.
Reiter, F; Sørensen, A S; Zoller, P; Muschik, C A
2017-11-28
Quantum-enhanced measurements hold the promise to improve high-precision sensing ranging from the definition of time standards to the determination of fundamental constants of nature. However, quantum sensors lose their sensitivity in the presence of noise. To protect them, the use of quantum error-correcting codes has been proposed. Trapped ions are an excellent technological platform for both quantum sensing and quantum error correction. Here we present a quantum error correction scheme that harnesses dissipation to stabilize a trapped-ion qubit. In our approach, always-on couplings to an engineered environment protect the qubit against spin-flips or phase-flips. Our dissipative error correction scheme operates in a continuous manner without the need to perform measurements or feedback operations. We show that the resulting enhanced coherence time translates into a significantly enhanced precision for quantum measurements. Our work constitutes a stepping stone towards the paradigm of self-correcting quantum information processing.
Philosophy of quantum information and entanglement
Jaeger, Gregg
2010-01-01
Recent work in quantum information science has produced a revolution in our understanding of quantum entanglement. Scientists now view entanglement as a physical resource with many important applications. These range from quantum computers, which would be able to compute exponentially faster than classical computers, to quantum cryptographic techniques, which could provide unbreakable codes for the transfer of secret information over public channels. These important advances in the study of quantum entanglement and information touch on deep foundational issues in both physics and philosophy. This interdisciplinary volume brings together fourteen of the world's leading physicists and philosophers of physics to address the most important developments and debates in this exciting area of research. It offers a broad spectrum of approaches to resolving deep foundational challenges - philosophical, mathematical, and physical - raised by quantum information, quantum processing, and entanglement. This book is ideal f...
High-threshold decoding algorithms for the gauge color code
Zeng, William; Brown, Benjamin
Gauge color codes are topological quantum error correcting codes on three dimensional lattices. They have garnered recent interest due to two important properties: (1) they admit a universal transversal gate set, and (2) their structure allows reliable error correction using syndrome data obtained from a measurement circuit of constant depth. Both of these properties make gauge color codes intriguing candidates for low overhead fault-tolerant quantum computation. Recent work by Brown et al. calculated a threshold of 0.31% for a particular gauge color code lattice using a simple clustering decoder and phenomenological noise. We show that we can achieve improved threshold error rates using the efficient Wootton and Loss Markov-chain Monte Carlo (MCMC) decoding. In the case of the surface code, the MCMC decoder produced a threshold close to that code's upper bound. While no upper bound is known for gauge color codes, the thresholds we present here may give a better estimate.
George Gamow and the Genetic Code
Indian Academy of Sciences (India)
and most famous, paper, "A Structure for Deoxyribose Nucleic. Acid". In it they ... quantum mechanics and nuclear physics, especially for a bril- liant explanation of ... a Genetic Code, that would relate the hereditary information carried in DNA to the stuff that built bodies, proteins. Schrodinger used the explicit example of the.
Quantum coherence versus quantum uncertainty
Luo, Shunlong; Sun, Yuan
2017-08-01
The notion of measurement is of both foundational and instrumental significance in quantum mechanics, and coherence destroyed by measurements (decoherence) lies at the very heart of quantum to classical transition. Qualitative aspects of this spirit have been widely recognized and analyzed ever since the inception of quantum theory. However, axiomatic and quantitative investigations of coherence are attracting great interest only recently with several figures of merit for coherence introduced [Baumgratz, Cramer, and Plenio, Phys. Rev. Lett. 113, 140401 (2014), 10.1103/PhysRevLett.113.140401]. While these resource theoretic approaches have many appealing and intuitive features, they rely crucially on various notions of incoherent operations which are sophisticated, subtle, and not uniquely defined, as have been critically assessed [Chitambar and Gour, Phys. Rev. Lett. 117, 030401 (2016), 10.1103/PhysRevLett.117.030401]. In this paper, we elaborate on the idea that coherence and quantum uncertainty are dual viewpoints of the same quantum substrate, and address coherence quantification by identifying coherence of a state (with respect to a measurement) with quantum uncertainty of a measurement (with respect to a state). Consequently, coherence measures may be set into correspondence with measures of quantum uncertainty. In particular, we take average quantum Fisher information as a measure of quantum uncertainty, and introduce the corresponding measure of coherence, which is demonstrated to exhibit desirable properties. Implications for interpreting quantum purity as maximal coherence, and quantum discord as minimal coherence, are illustrated.
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.
Quantum games as quantum types
Delbecque, Yannick
In this thesis, we present a new model for higher-order quantum programming languages. The proposed model is an adaptation of the probabilistic game semantics developed by Danos and Harmer [DH02]: we expand it with quantum strategies which enable one to represent quantum states and quantum operations. Some of the basic properties of these strategies are established and then used to construct denotational semantics for three quantum programming languages. The first of these languages is a formalisation of the measurement calculus proposed by Danos et al. [DKP07]. The other two are new: they are higher-order quantum programming languages. Previous attempts to define a denotational semantics for higher-order quantum programming languages have failed. We identify some of the key reasons for this and base the design of our higher-order languages on these observations. The game semantics proposed in this thesis is the first denotational semantics for a lambda-calculus equipped with quantum types and with extra operations which allow one to program quantum algorithms. The results presented validate the two different approaches used in the design of these two new higher-order languages: a first one where quantum states are used through references and a second one where they are introduced as constants in the language. The quantum strategies presented in this thesis allow one to understand the constraints that must be imposed on quantum type systems with higher-order types. The most significant constraint is the fact that abstraction over part of the tensor product of many unknown quantum states must not be allowed. Quantum strategies are a new mathematical model which describes the interaction between classical and quantum data using system-environment dialogues. The interactions between the different parts of a quantum system are described using the rich structure generated by composition of strategies. This approach has enough generality to be put in relation with other
Levy, Amikam; Diósi, Lajos; Kosloff, Ronnie
2016-05-01
In this work we present the concept of a quantum flywheel coupled to a quantum heat engine. The flywheel stores useful work in its energy levels, while additional power is extracted continuously from the device. Generally, the energy exchange between a quantum engine and a quantized work repository is accompanied by heat, which degrades the charging efficiency. Specifically when the quantum harmonic oscillator acts as a work repository, quantum and thermal fluctuations dominate the dynamics. Quantum monitoring and feedback control are applied to the flywheel in order to reach steady state and regulate its operation. To maximize the charging efficiency one needs a balance between the information gained by measuring the system and the information fed back to the system. The dynamics of the flywheel are described by a stochastic master equation that accounts for the engine, the external driving, the measurement, and the feedback operations.
Braun, Daniel; Giraud, Olivier; Braun, Peter A.
2010-03-01
We introduce and study a measure of ``quantumness'' of a quantum state based on its Hilbert-Schmidt distance from the set of classical states. ``Classical states'' were defined earlier as states for which a positive P-function exists, i.e. they are mixtures of coherent states [1]. We study invariance properties of the measure, upper bounds, and its relation to entanglement measures. We evaluate the quantumness of a number of physically interesting states and show that for any physical system in thermal equilibrium there is a finite critical temperature above which quantumness vanishes. We then use the measure for identifying the ``most quantum'' states. Such states are expected to be potentially most useful for quantum information theoretical applications. We find these states explicitly for low-dimensional spin-systems, and show that they possess beautiful, highly symmetric Majorana representations. [4pt] [1] Classicality of spin states, Olivier Giraud, Petr Braun, and Daniel Braun, Phys. Rev. A 78, 042112 (2008)
Khan, Shabbir A
2013-01-01
Quantum plasma physics is a rapidly evolving research field with a very inter-disciplinary scope of potential applications, ranging from nano-scale science in condensed matter to the vast scales of astrophysical objects. The theoretical description of quantum plasmas relies on various approaches, microscopic or macroscopic, some of which have obvious relation to classical plasma models. The appropriate model should, in principle, incorporate the quantum mechanical effects such as diffraction, spin statistics and correlations, operative on the relevant scales. However, first-principle approaches such as quantum Monte Carlo and density functional theory or quantum-statistical methods such as quantum kinetic theory or non-equilibrium Green's functions require substantial theoretical and computational efforts. Therefore, for selected problems, alternative simpler methods have been put forward. In particular, the collective behavior of many-body systems is usually described within a self-consistent scheme of parti...
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...
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....
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
Stapp, Henry
2009-01-01
Robert Griffiths has recently addressed, within the framework of a 'consistent quantum theory' that he has developed, the issue of whether, as is often claimed, quantum mechanics entails a need for faster-than-light transfers of information over long distances. He argues that the putative proofs of this property that involve hidden variables include in their premises some essentially classical-physics-type assumptions that are fundamentally incompatible with the precepts of quantum physics. O...
Peguiron, J.
1997-01-01
In this thesis, ratchet systems operating in the quantum regime are investigated. Ratchet systems, also known as Brownian motors, are periodic systems presenting an intrinsic asymmetry which can be exploited to extract work out of unbiased forces. As a model for ratchet systems, we consider the motion of a particle in a one-dimensional periodic and asymmetric potential, interacting with a thermal environment, and subject to an unbiased driving force. In quantum ratchets, intrinsic quantum flu...
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 and computation
Bub, Jeffrey
2005-01-01
This article deals with theoretical developments in the subject of quantum information and quantum computation, and includes an overview of classical information and some relevant quantum mechanics. The discussion covers topics in quantum communication, quantum cryptography, and quantum computation, and concludes by considering whether a perspective in terms of quantum information sheds new light on the conceptual problems of quantum mechanics.
Barnett, Stephen M
2009-01-01
Quantum information- the subject- is a new and exciting area of science, which brings together physics, information theory, computer science and mathematics. "Quantum Information"- the book- is based on two successful lecture courses given to advanced undergraduate and beginning postgraduate students in physics. The intention is to introduce readers at this level to the fundamental, but offer rather simple, ideas behind ground-breaking developments including quantum cryptography,teleportation and quantum computing. The text is necessarily rather mathematical in style, but the mathema
Vogel, Werner
2006-01-01
This is the third, revised and extended edition of the acknowledged "Lectures on Quantum Optics" by W. Vogel and D.-G. Welsch.It offers theoretical concepts of quantum optics, with special emphasis on current research trends. A unified concept of measurement-based nonclassicality and entanglement criteria and a unified approach to medium-assisted electromagnetic vacuum effects including Van der Waals and Casimir Forces are the main new topics that are included in the revised edition. The rigorous development of quantum optics in the context of quantum field theory and the attention to details makes the book valuable to graduate students as well as to researchers
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.
Directory of Open Access Journals (Sweden)
Sadiq Muhammad
2014-06-01
Full Text Available Quantum methods allow us to reduce communication complexity of some computational tasks, with several separated partners, beyond classical constraints. Nevertheless, experimental demonstrations of this have thus far been limited to some abstract problems, far away from real-life tasks. We show here, and demonstrate experimentally, that the power of reduction of communication complexity can be harnessed to gain an advantage in a famous, immensely popular, card game—bridge. The essence of a winning strategy in bridge is efficient communication between the partners. The rules of the game allow only a specific form of communication, of very low complexity (effectively, one has strong limitations on the number of exchanged bits. Surprisingly, our quantum technique does not violate the existing rules of the game (as there is no increase in information flow. We show that our quantum bridge auction corresponds to a biased nonlocal Clauser-Horne-Shimony-Holt game, which is equivalent to a 2→1 quantum random access code. Thus, our experiment is also a realization of such protocols. However, this correspondence is not complete, which enables the bridge players to have efficient strategies regardless of the quality of their detectors.
Quantum computer games: quantum minesweeper
Gordon, Michal; Gordon, Goren
2010-07-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 minesweeper the goal of the game is to discover all the mines laid out on a board without triggering them, in the quantum version there are several classical boards in superposition. The goal is to know the exact quantum state, i.e. the precise layout of all the mines in all the superposed classical boards. The player can perform three types of measurement: a classical measurement that probabilistically collapses the superposition; a quantum interaction-free measurement that can detect a mine without triggering it; and an entanglement measurement that provides non-local information. The application of the concepts taught by quantum minesweeper to one-way quantum computing are also presented.
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.
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.
Steffen, Matthias
Solving computational problems require resources such as time, memory, and space. In the classical model of computation, computational complexity theory has categorized problems according to how difficult it is to solve them as the problem size increases. Remarkably, a quantum computer could solve certain problems using fundamentally fewer resources compared to a conventional computer, and therefore has garnered significant attention. Yet because of the delicate nature of entangled quantum states, the construction of a quantum computer poses an enormous challenge for experimental and theoretical scientists across multi-disciplinary areas including physics, engineering, materials science, and mathematics. While the field of quantum computing still has a long way to grow before reaching full maturity, state-of-the-art experiments on the order of 10 qubits are beginning to reach a fascinating stage at which they can no longer be emulated using even the fastest supercomputer. This raises the hope that small quantum computer demonstrations could be capable of approximately simulating or solving problems that also have practical applications. In this talk I will review the concepts behind quantum computing, and focus on the status of superconducting qubits which includes steps towards quantum error correction and quantum simulations.
Baaquie, Belal E.
2004-11-01
Financial mathematics is currently almost completely dominated by stochastic calculus. Presenting a completely independent approach, this book applies the mathematical and conceptual formalism of quantum mechanics and quantum field theory (with particular emphasis on the path integral) to the theory of options and to the modeling of interest rates. Many new results, accordingly, emerge from the author's perspective.
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...
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...
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...
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.)
DEFF Research Database (Denmark)
Høholdt, Tom; Beelen, Peter; Ghorpade, Sudhir Ramakant
2010-01-01
We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes.We determine the length, dimension, and the minimum distance of any affine Grassmann code. Moreover, we show...
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
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.
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.
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...
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.
Coecke, Bob; Kissinger, Aleks
2017-03-01
Preface; 1. Introduction; 2. Guide to reading this textbook; 3. Processes as diagrams; 4. String diagrams; 5. Hilbert space from diagrams; 6. Quantum processes; 7. Quantum measurement; 8. Picturing classical-quantum processes; 9. Picturing phases and complementarity; 10. Quantum theory: the full picture; 11. Quantum foundations; 12. Quantum computation; 13. Quantum resources; 14. Quantomatic; Appendix A. Some notations; References; Index.
Quantum Cryptography Beyond Quantum Key Distribution
Broadbent, A.; Schaffner, C
2015-01-01
textabstractQuantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation, secure two- and multi-party computation and delegated quantum computation. Quantum cryptography also studies the limitations and challenges resulting from quantum adversaries—including the ...
Quantum simulations with circuit quantum electrodynamics
Romero, G.; Solano, E.; Lamata, L.
2016-01-01
Superconducting circuits have become a leading quantum technology for testing fundamentals of quantum mechanics and for the implementation of advanced quantum information protocols. In this chapter, we revise the basic concepts of circuit network theory and circuit quantum electrodynamics for the sake of digital and analog quantum simulations of quantum field theories, relativistic quantum mechanics, and many-body physics, involving fermions and bosons. Based on recent improvements in scalabi...
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
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,
Chowdhury, Sujaul
2014-01-01
This book presents comprehensive account of the course for undergraduate students with thorough and complete calculations. The book has been written with the notion that a wave is associated with a material particle i.e. wave and particle coexist. Heisenberg's uncertainty principle has been described in light of this. A chapter is dedicated to mathematical structure of Quantum Mechanics followed by applications to one-dimensional (1D) problems. Orbital and general angular momentum are treated in two separate chapters, the latter also treats addition of angular momentum. Quantum theory of scattering, matrix formulation of Quantum Mechanics variational method and WKB approximation method have also been discussed.
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...
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 propose...... including an outer BCH code correcting a few bit errors.......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...
Synchronization in Quantum Key Distribution Systems
Directory of Open Access Journals (Sweden)
Anton Pljonkin
2017-10-01
Full Text Available In the description of quantum key distribution systems, much attention is paid to the operation of quantum cryptography protocols. The main problem is the insufficient study of the synchronization process of quantum key distribution systems. This paper contains a general description of quantum cryptography principles. A two-line fiber-optic quantum key distribution system with phase coding of photon states in transceiver and coding station synchronization mode was examined. A quantum key distribution system was built on the basis of the scheme with automatic compensation of polarization mode distortions. Single-photon avalanche diodes were used as optical radiation detecting devices. It was estimated how the parameters used in quantum key distribution systems of optical detectors affect the detection of the time frame with attenuated optical pulse in synchronization mode with respect to its probabilistic and time-domain characteristics. A design method was given for the process that detects the time frame that includes an optical pulse during synchronization. This paper describes the main quantum communication channel attack methods by removing a portion of optical emission. This paper describes the developed synchronization algorithm that takes into account the time required to restore the photodetector’s operation state after the photon has been registered during synchronization. The computer simulation results of the developed synchronization algorithm were analyzed. The efficiency of the developed algorithm with respect to synchronization process protection from unauthorized gathering of optical emission is demonstrated herein.
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....
Directory of Open Access Journals (Sweden)
Austin G. Fowler
2012-10-01
Full Text Available Many quantum systems are being investigated in the hope of building a large-scale quantum computer. All of these systems suffer from decoherence, resulting in errors during the execution of quantum gates. Quantum error correction enables reliable quantum computation given unreliable hardware. Unoptimized topological quantum error correction (TQEC, while still effective, performs very suboptimally, especially at low error rates. Hand optimizing the classical processing associated with a TQEC scheme for a specific system to achieve better error tolerance can be extremely laborious. We describe a tool, Autotune, capable of performing this optimization automatically, and give two highly distinct examples of its use and extreme outperformance of unoptimized TQEC. Autotune is designed to facilitate the precise study of real hardware running TQEC, with every quantum gate having a realistic, physics-based error model.
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
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
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.
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 16; Issue 9. Quantum Computation - Particle and Wave Aspects of Algorithms. Apoorva Patel. General Article Volume 16 ... Keywords. Boolean logic; computation; computational complexity; digital language; Hilbert space; qubit; superposition; Feynman.
Quantum correlations and distinguishability of quantum states
Energy Technology Data Exchange (ETDEWEB)
Spehner, Dominique [Université Grenoble Alpes and CNRS, Institut Fourier, F-38000 Grenoble, France and Laboratoire de Physique et Modélisation des Milieux Condensés, F-38000 Grenoble (France)
2014-07-15
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.
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....
Schwarz, Albert
2014-01-01
One says that a pair (P,Q) of ordinary differential operators specify a quantum curve if [P,Q]=const. If a pair of difference operators (K,L) obey the relation KL=const LK we say that they specify a discrete quantum curve. This terminology is prompted by well known results about commuting differential and difference operators, relating pairs of such operators with pairs of meromorphic functions on algebraic curves obeying some conditions. ...
Grunspan, C.
2002-01-01
This text gives some results about quantum torsors. Our starting point is an old reformulation of torsors recalled recently by Kontsevich. We propose an unification of the definitions of torsors in algebraic geometry and in Poisson geometry. Any quantum torsor is equipped with two comodule-algebra structures over Hopf algebras and these structures commute with each other. In the finite dimensional case, these two Hopf algebras share the same finite dimension. We show that any Galois extension...
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".
Quantum entanglement and quantum computational algorithms
Indian Academy of Sciences (India)
Home; Journals; Pramana – Journal of Physics; Volume 56; Issue 2-3. Quantum entanglement ... Arvind. Quantum information processing Volume 56 Issue 2-3 February-March 2001 pp 357-365 ... The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum ...
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
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.
Controlled Dense Coding with the W State
Yang, Xue; Bai, Ming-qiang; Mo, Zhi-wen
2017-11-01
The average amount of information is an important factor in implementing dense coding. Based on this, we propose two schemes for controlled dense coding by using the three-qubit entangled W state as the quantum channel in this paper. In these schemes, the controller (Charlie) can adjust the local measurement angle 𝜃 to modulate the entanglement, and consequently the average amount of information transmitted from the sender (Alice) to the receiver (Bob). Although the results for the average amounts of information are the same from the different two schemes, the second scheme has advantage over the first scheme.
Quantum computing: Quantum advantage deferred
Childs, Andrew M.
2017-12-01
A type of optics experiment called a boson sampler could be among the easiest routes to demonstrating the power of quantum computers. But recent work shows that super-classical boson sampling may be a long way off.
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.
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.
Discussion on LDPC Codes and Uplink Coding
Andrews, Ken; Divsalar, Dariush; Dolinar, Sam; Moision, Bruce; Hamkins, Jon; Pollara, Fabrizio
2007-01-01
This slide presentation reviews the progress that the workgroup on Low-Density Parity-Check (LDPC) for space link coding. The workgroup is tasked with developing and recommending new error correcting codes for near-Earth, Lunar, and deep space applications. Included in the presentation is a summary of the technical progress of the workgroup. Charts that show the LDPC decoder sensitivity to symbol scaling errors are reviewed, as well as a chart showing the performance of several frame synchronizer algorithms compared to that of some good codes and LDPC decoder tests at ESTL. Also reviewed is a study on Coding, Modulation, and Link Protocol (CMLP), and the recommended codes. A design for the Pseudo-Randomizer with LDPC Decoder and CRC is also reviewed. A chart that summarizes the three proposed coding systems is also presented.
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
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....
Quantum Phase Transitions in Quantum Dots
Rau, I. G.; Amasha, S.; Oreg, Y.; Goldhaber-Gordon, D.
2013-01-01
This review article describes theoretical and experimental advances in using quantum dots as a system for studying impurity quantum phase transitions and the non-Fermi liquid behavior at the quantum critical point.
Quantum Communication and Quantum Multivariate Polynomial Interpolation
Diep, Do Ngoc; Giang, Do Hoang
2017-09-01
The paper is devoted to the problem of multivariate polynomial interpolation and its application to quantum secret sharing. We show that using quantum Fourier transform one can produce the protocol for quantum secret sharing distribution.
Shahshahani, M.
1991-01-01
The performance characteristics are discussed of certain algebraic geometric codes. Algebraic geometric codes have good minimum distance properties. On many channels they outperform other comparable block codes; therefore, one would expect them eventually to replace some of the block codes used in communications systems. It is suggested that it is unlikely that they will become useful substitutes for the Reed-Solomon codes used by the Deep Space Network in the near future. However, they may be applicable to systems where the signal to noise ratio is sufficiently high so that block codes would be more suitable than convolutional or concatenated codes.
Long distance quantum teleportation
Xia, Xiu-Xiu; Sun, Qi-Chao; Zhang, Qiang; Pan, Jian-Wei
2018-01-01
Quantum teleportation is a core protocol in quantum information science. Besides revealing the fascinating feature of quantum entanglement, quantum teleportation provides an ultimate way to distribute quantum state over extremely long distance, which is crucial for global quantum communication and future quantum networks. In this review, we focus on the long distance quantum teleportation experiments, especially those employing photonic qubits. From the viewpoint of real-world application, both the technical advantages and disadvantages of these experiments are discussed.
Martinez-Moro, Edgar; Ozbudak, Ferruh; Szabo, Steve
2010-01-01
As a generalization of cyclic codes of length p^s over F_{p^a}, we study n-dimensional cyclic codes of length p^{s_1} X ... X p^{s_n} over F_{p^a} generated by a single "monomial". Namely, we study multi-variable cyclic codes of the form in F_{p^a}[x_1...x_n] / . We call such codes monomial-like codes. We show that these codes arise from the product of certain single variable codes and we determine their minimum Hamming distance. We determine the dual of monomial-like codes yielding a parity check matrix. We also present an alternative way of constructing a parity check matrix using the Hasse derivative. We study the weight hierarchy of certain monomial like codes. We simplify an expression that gives us the weight hierarchy of these codes.
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…
Ghosh, P K
2014-01-01
Quantum mechanics, designed for advanced undergraduate and graduate students of physics, mathematics and chemistry, provides a concise yet self-contained introduction to the formal framework of quantum mechanics, its application to physical problems and the interpretation of the theory. Starting with a review of some of the necessary mathematics, the basic concepts are carefully developed in the text. After building a general formalism, detailed treatment of the standard material - the harmonic oscillator, the hydrogen atom, angular momentum theory, symmetry transformations, approximation methods, identical particle and many-particle systems, and scattering theory - is presented. The concluding chapter discusses the interpretation of quantum mechanics. Some of the important topics discussed in the book are the rigged Hilbert space, deformation quantization, path integrals, coherent states, geometric phases, decoherene, etc. This book is characterized by clarity and coherence of presentation.
Bény, Cédric
2018-02-01
We propose a method for stably removing noise from measurements of a quantum many-body system. The question is cast to a linear inverse problem by using a quantum Fischer information metric as figure of merit. This requires the ability to compute the adjoint of the noise channel with respect to the metric, which can be done analytically when the metric is evaluated at a Gaussian (quasi-free) state. This approach can be applied effectively to n-point functions of a quantum field theory. For translation invariant noise, this yields a stable deconvolution method on the first moments of the field which differs from what one would obtain from a purely classical analysis.
Exner, Pavel
2015-01-01
This monograph explains the theory of quantum waveguides, that is, dynamics of quantum particles confined to regions in the form of tubes, layers, networks, etc. The focus is on relations between the confinement geometry on the one hand and the spectral and scattering properties of the corresponding quantum Hamiltonians on the other. Perturbations of such operators, in particular, by external fields are also considered. The volume provides a unique summary of twenty five years of research activity in this area and indicates ways in which the theory can develop further. The book is fairly self-contained. While it requires some broader mathematical physics background, all the basic concepts are properly explained and proofs of most theorems are given in detail, so there is no need for additional sources. Without a parallel in the literature, the monograph by Exner and Kovarik guides the reader through this new and exciting field.
Mullin, William J
2017-01-01
Quantum mechanics allows a remarkably accurate description of nature and powerful predictive capabilities. The analyses of quantum systems and their interpretation lead to many surprises, for example, the ability to detect the characteristics of an object without ever touching it in any way, via "interaction-free measurement," or the teleportation of an atomic state over large distances. The results can become downright bizarre. Quantum mechanics is a subtle subject that usually involves complicated mathematics -- calculus, partial differential equations, etc., for complete understanding. Most texts for general audiences avoid all mathematics. The result is that the reader misses almost all deep understanding of the subject, much of which can be probed with just high-school level algebra and trigonometry. Thus, readers with that level of mathematics can learn so much more about this fundamental science. The book starts with a discussion of the basic physics of waves (an appendix reviews some necessary class...
Blind Quantum Signature with Blind Quantum Computation
Li, Wei; Shi, Ronghua; Guo, Ying
2017-04-01
Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.
Closed-shell variational quantum Monte Carlo simulation for the ...
African Journals Online (AJOL)
Closed-shell variational quantum Monte Carlo simulation for the electric dipole moment calculation of hydrazine molecule using casino-code. ... Nigeria Journal of Pure and Applied Physics ... The variational quantum Monte Carlo (VQMC) technique used in this work employed the restricted Hartree-Fock (RHF) scheme.
Rae, Alastair I M
2007-01-01
PREFACESINTRODUCTION The Photoelectric Effect The Compton Effect Line Spectra and Atomic Structure De Broglie Waves Wave-Particle Duality The Rest of This Book THE ONE-DIMENSIONAL SCHRÖDINGER EQUATIONS The Time-Dependent Schrödinger Equation The Time-Independent Schrödinger Equation Boundary ConditionsThe Infinite Square Well The Finite Square Well Quantum Mechanical Tunneling The Harmonic Oscillator THE THREE-DIMENSIONAL SCHRÖDINGER EQUATIONS The Wave Equations Separation in Cartesian Coordinates Separation in Spherical Polar Coordinates The Hydrogenic Atom THE BASIC POSTULATES OF QUANTUM MEC
Kottos, T.
2007-01-01
We review quantum chaos on graphs. We construct a unitary operator which represents the quantum evolution on the graph and study its spectral and wave function statistics. This operator is the analogue of the classical evolution operator on the graph. It allows us to establish a connection between the corresponding periodic orbits and the statistical properties of eigenvalues and eigenfunctions. Specifically, for the energy-averaged spectral form factor we derived an exact combinatorial expression which illustrate the role of correlations between families of isometric orbits. We also show that enhanced wave function localization due to the presence of short unstable periodic orbits and strong scarring can rely on completely different mechanisms
Bojowald, Martin
2006-01-01
A complete model of the universe needs at least three parts: (1) a complete set of physical variables and dynamical laws for them, (2) the correct solution of the dynamical laws, and (3) the connection with conscious experience. In quantum cosmology, item (2) is the quantum state of the cosmos. Hartle and Hawking have made the `no-boundary' proposal, that the wavefunction of the universe is given by a path integral over all compact Euclidean 4-dimensional geometries and matter fields that hav...
Buhrman, Harry
2006-01-01
École thématique; Quantum Information, Computation and Complexity * Programme at the Institut Henri Poincaré, January 4th – April 7th, 2006 * Organizers: Ph.Grangier, M.Santha and D.L.Shepelyansky * Lectures have been filmed by Peter Rapcan and Michal Sedlak from Bratislava with the support of the Marie Curie RTN "CONQUEST" A trimester at the Centre Emile Borel - Institut Henri Poincaré is devoted to modern developments in a rapidly growing field of quantum information and communication, quan...
Zagoskin, Alexandre
2015-01-01
Written by Dr Alexandre Zagoskin, who is a Reader at Loughborough University, Quantum Mechanics: A Complete Introduction is designed to give you everything you need to succeed, all in one place. It covers the key areas that students are expected to be confident in, outlining the basics in clear jargon-free English, and then providing added-value features like summaries of key ideas, and even lists of questions you might be asked in your exam. The book uses a structure that is designed to make quantum physics as accessible as possible - by starting with its similarities to Newtonian physics, ra
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.
Quantum gravity and quantum cosmology
Papantonopoulos, Lefteris; Siopsis, George; Tsamis, Nikos
2013-01-01
Quantum gravity has developed into a fast-growing subject in physics and it is expected that probing the high-energy and high-curvature regimes of gravitating systems will shed some light on how to eventually achieve an ultraviolet complete quantum theory of gravity. Such a theory would provide the much needed information about fundamental problems of classical gravity, such as the initial big-bang singularity, the cosmological constant problem, Planck scale physics and the early-time inflationary evolution of our Universe. While in the first part of this book concepts of quantum gravity are introduced and approached from different angles, the second part discusses these theories in connection with cosmological models and observations, thereby exploring which types of signatures of modern and mathematically rigorous frameworks can be detected by experiments. The third and final part briefly reviews the observational status of dark matter and dark energy, and introduces alternative cosmological models. ...
Quantum biological information theory
Djordjevic, Ivan B
2016-01-01
This book is a self-contained, tutorial-based introduction to quantum information theory and quantum biology. It serves as a single-source reference to the topic for researchers in bioengineering, communications engineering, electrical engineering, applied mathematics, biology, computer science, and physics. The book provides all the essential principles of the quantum biological information theory required to describe the quantum information transfer from DNA to proteins, the sources of genetic noise and genetic errors as well as their effects. Integrates quantum information and quantum biology concepts; Assumes only knowledge of basic concepts of vector algebra at undergraduate level; Provides a thorough introduction to basic concepts of quantum information processing, quantum information theory, and quantum biology; Includes in-depth discussion of the quantum biological channel modelling, quantum biological channel capacity calculation, quantum models of aging, quantum models of evolution, quantum models o...
2010-03-04
be required. In 2001, a breakthrough known as the KLM (Knill–Laflamme– Milburn13) scheme showed that scalable quantum computing is possible using only...and single-photon detection to induce interactions nondeterministically. In the past five years, the KLM scheme has moved from a mathematical proof
Raedt, Hans De; Binder, K; Ciccotti, G
1996-01-01
The purpose of this set of lectures is to introduce the general concepts that are at the basis of the computer simulation algorithms that are used to study the behavior of condensed matter quantum systems. The emphasis is on the underlying concepts rather than on specific applications. Topics
Energy Technology Data Exchange (ETDEWEB)
Sassoli de Bianchi, Massimiliano, E-mail: autoricerca@gmail.com
2013-09-15
In a letter to Born, Einstein wrote [42]: “Quantum mechanics is certainly imposing. But an inner voice tells me that it is not yet the real thing. The theory says a lot, but does not really bring us any closer to the secret of the ‘old one.’ I, at any rate, am convinced that He does not throw dice.” In this paper we take seriously Einstein’s famous metaphor, and show that we can gain considerable insight into quantum mechanics by doing something as simple as rolling dice. More precisely, we show how to perform measurements on a single die, to create typical quantum interference effects, and how to connect (entangle) two identical dice, to maximally violate Bell’s inequality. -- Highlights: •Rolling a die is a quantum process admitting a Hilbert space representation. •Rolling experiments with a single die can produce interference effects. •Two connected dice can violate Bell’s inequality. •Correlations need to be created by the measurement, to violate Bell’s inequality.
2016-03-24
semiconductors. Personnel Graduate students supported by this grant: Michael Gehl (Graduated with PhD in October 2015, now at Sandia... Ell , O. B. Shchekin, and D. G. Deppe, “Vacuum Rabi splitting with a single quantum dot in a photonic crystal nanocavity.” Nature 432, 200-203 (2004
Directory of Open Access Journals (Sweden)
Alessandro Sergi
2009-06-01
Full Text Available A critical assessment of the recent developmentsof molecular biology is presented.The thesis that they do not lead to a conceptualunderstanding of life and biological systems is defended.Maturana and Varela's concept of autopoiesis is briefly sketchedand its logical circularity avoided by postulatingthe existence of underlying living processes,entailing amplification from the microscopic to the macroscopic scale,with increasing complexity in the passage from one scale to the other.Following such a line of thought, the currently accepted model of condensed matter, which is based on electrostatics and short-ranged forces,is criticized. It is suggested that the correct interpretationof quantum dispersion forces (van der Waals, hydrogen bonding, and so onas quantum coherence effects hints at the necessity of includinglong-ranged forces (or mechanisms for them incondensed matter theories of biological processes.Some quantum effects in biology are reviewedand quantum mechanics is acknowledged as conceptually important to biology since withoutit most (if not all of the biological structuresand signalling processes would not even exist. Moreover, it is suggested that long-rangequantum coherent dynamics, including electron polarization,may be invoked to explain signal amplificationprocess in biological systems in general.
Indian Academy of Sciences (India)
start-up company at liT. Mumbai. Part 1. Building Blocks of Quan- tum Computers, Resonance, ..... by modeling the errors caused by decoherence. The interaction of a quantum system with the environment obstructs the unitary evolution of the system and causes dissipation of information, reducing coherence of information.
Quantum cryptography beyond quantum key distribution
Broadbent, A.; Schaffner, C.
2016-01-01
Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness generation,
Quantum cryptography beyond quantum key distribution
A. Broadbent (Anne); C. Schaffner (Christian)
2016-01-01
textabstractQuantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other applications such as quantum money, randomness
National Oceanic and Atmospheric Administration, Department of Commerce — Coded items are entered in the tiponline data entry program. The codes and their explanations are necessary in order to use the data
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.
Efficient quantum walk on a quantum processor
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L.; Wang, Jingbo B.; Matthews, Jonathan C. F.
2016-01-01
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor. PMID:27146471
Efficient quantum walk on a quantum processor.
Qiang, Xiaogang; Loke, Thomas; Montanaro, Ashley; Aungskunsiri, Kanin; Zhou, Xiaoqi; O'Brien, Jeremy L; Wang, Jingbo B; Matthews, Jonathan C F
2016-05-05
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.
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...
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...
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
The Procions` code; Le code Procions
Energy Technology Data Exchange (ETDEWEB)
Deck, D.; Samba, G.
1994-12-19
This paper presents a new code to simulate plasmas generated by inertial confinement. This multi-kinds kinetic code is done with no angular approximation concerning ions and will work in plan and spherical geometry. First, the physical model is presented, using Fokker-Plank. Then, the numerical model is introduced in order to solve the Fokker-Plank operator under the Rosenbluth form. At the end, several numerical tests are proposed. (TEC). 17 refs., 27 figs.
Huo, Ming-Xia; Li, Ying
2017-12-01
Quantum error correction is important to quantum information processing, which allows us to reliably process information encoded in quantum error correction codes. Efficient quantum error correction benefits from the knowledge of error rates. We propose a protocol for monitoring error rates in real time without interrupting the quantum error correction. Any adaptation of the quantum error correction code or its implementation circuit is not required. The protocol can be directly applied to the most advanced quantum error correction techniques, e.g. surface code. A Gaussian processes algorithm is used to estimate and predict error rates based on error correction data in the past. We find that using these estimated error rates, the probability of error correction failures can be significantly reduced by a factor increasing with the code distance.
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...... to understand the socio-technical side of a changing network environment. Through the study of code, including but not limited to source code, technical specifications and other materials in relation to the artwork production, I would like to explore the materiality of code that goes beyond technical...
Bojowald, Martin
The universe, ultimately, is to be described by quantum theory. Quantum aspects of all there is, including space and time, may not be significant for many purposes, but are crucial for some. And so a quantum description of cosmology is required for a complete and consistent worldview. At any rate, even if we were not directly interested in regimes where quantum cosmology plays a role, a complete physical description could not stop at a stage before the whole universe is reached. Quantum theory is essential in the microphysics of particles, atoms, molecules, solids, white dwarfs and neutron stars. Why should one expect this ladder of scales to end at a certain size? If regimes are sufficiently violent and energetic, quantum effects are non-negligible even on scales of the whole cosmos; this is realized at least once in the history of the universe: at the big bang where the classical theory of general relativity would make energy densities diverge. 1.Lachieze-Rey, M., Luminet, J.P.: Phys. Rept. 254,135 (1995), gr-qc/9605010 2.BSDeWitt1967Phys. Rev.160511131967PhRv..160.1113D0158.4650410.1103/PhysRev.160.1113DeWitt, B.S.: Phys. Rev. 160(5), 1113 (1967) 3.Wiltshire, D.L.: In: Robson B., Visvanathan N., Woolcock W.S. (eds.) Cosmology: The Physics of the Universe, pp. 473-531. World Scientific, Singapore (1996). gr-qc/0101003 4.Isham C.J.: In: DeWitt, B.S., Stora, R. (eds.) Relativity, Groups and Topology II. Lectures Given at the 1983 Les Houches Summer School on Relativity, Groups and Topology, Elsevier Science Publishing Company (1986) 5.Klauder, J.: Int. J. Mod. Phys. D 12, 1769 (2003), gr-qc/0305067 6.Klauder, J.: Int. J. Geom. Meth. Mod. Phys. 3, 81 (2006), gr-qc/0507113 7.DGiulini1995Phys. Rev. D5110563013381161995PhRvD..51.5630G10.1103/PhysRevD.51.5630Giulini, D.: Phys. Rev. D 51(10), 5630 (1995) 8.Kiefer, C., Zeh, H.D.: Phys. Rev. D 51, 4145 (1995), gr-qc/9402036 9.WFBlythCJIsham1975Phys. Rev. D117684086991975PhRvD..11..768B10.1103/PhysRevD.11.768Blyth, W
Finite-block-length analysis in classical and quantum information theory
HAYASHI, Masahito
2017-01-01
Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately obey quantum mechanics, we need to choose the type of coding depending on the kind of information device, classical or quantum, that is being used. In both branches of information theory, there are many elegant theoretical results under the ideal assumption that an infinitely large system is available. In a realistic situation, we need to account for finite size effects. The present paper reviews finite size effects in classical and quantum information theory with respect to various topics, including applied aspects. PMID:28302962
Finite-block-length analysis in classical and quantum information theory.
Hayashi, Masahito
2017-01-01
Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately obey quantum mechanics, we need to choose the type of coding depending on the kind of information device, classical or quantum, that is being used. In both branches of information theory, there are many elegant theoretical results under the ideal assumption that an infinitely large system is available. In a realistic situation, we need to account for finite size effects. The present paper reviews finite size effects in classical and quantum information theory with respect to various topics, including applied aspects.
Energy Technology Data Exchange (ETDEWEB)
2014-05-14
DLLExternalCode is the a general dynamic-link library (DLL) interface for linking GoldSim (www.goldsim.com) with external codes. The overall concept is to use GoldSim as top level modeling software with interfaces to external codes for specific calculations. The DLLExternalCode DLL that performs the linking function is designed to take a list of code inputs from GoldSim, create an input file for the external application, run the external code, and return a list of outputs, read from files created by the external application, back to GoldSim. Instructions for creating the input file, running the external code, and reading the output are contained in an instructions file that is read and interpreted by the DLL.
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...
Energy Technology Data Exchange (ETDEWEB)
Goernitz, T.; Weizsaecker, C.F.V.
1987-10-01
Four interpretations of quantum theory are compared: the Copenhagen interpretation (C.I.) with the additional assumption that the quantum description also applies to the mental states of the observer, and three recent ones, by Kochen, Deutsch, and Cramer. Since they interpret the same mathematical structure with the same empirical predictions, it is assumed that they formulate only different linguistic expressions of one identical theory. C.I. as a theory on human knowledge rests on a phenomenological description of time. It can be reconstructed from simple assumptions on predictions. Kochen shows that mathematically every composite system can be split into an object and an observer. Deutsch, with the same decomposition, describes futuric possibilities under the Everett term worlds. Cramer, using four-dimensional action at a distance (Wheeler-Feynman), describes all future events like past facts. All three can be described in the C.I. frame. The role of abstract nonlocality is discussed.
Baaquie, Belal E; Demongeot, J; Galli-Carminati, Giuliana; Martin, F; Teodorani, Massimo
2015-01-01
At the end of the 19th century Sigmund Freud discovered that our acts and choices are not only decisions of our consciousness, but that they are also deeply determined by our unconscious (the so-called "Freudian unconscious"). During a long correspondence between them (1932-1958) Wolfgang Pauli and Carl Gustav Jung speculated that the unconscious could be a quantum system. This book is addressed both to all those interested in the new developments of the age-old enquiry in the relations between mind and matter, and also to the experts in quantum physics that are interested in a formalisation of this new approach. The description of the "Bilbao experiment" adds a very interesting experimental inquiry into the synchronicity effect in a group situation, linking theory to a quantifiable verification of these subtle effects. Cover design: "Entangled Minds". Riccardo Carminati Galli, 2014.
Weber, Timothy
1995-01-01
For extra credit or just for the fun of it-why not try a brainteaser? This collection brings together the first 100 brainteasers from Quantum magazine, published by the National Science Teachers Association in collaboration with the Russian magazine Kvant. Through its pages, you'll find number rebuses, geometry ticklers, logic puzzles, and quirky questions with a physics twist. Students and teachers alike will enjoy these fun quandaries.
Quantum Secure Direct Communication with Quantum Memory.
Zhang, Wei; Ding, Dong-Sheng; Sheng, Yu-Bo; Zhou, Lan; Shi, Bao-Sen; Guo, Guang-Can
2017-06-02
Quantum communication provides an absolute security advantage, and it has been widely developed over the past 30 years. As an important branch of quantum communication, quantum secure direct communication (QSDC) promotes high security and instantaneousness in communication through directly transmitting messages over a quantum channel. The full implementation of a quantum protocol always requires the ability to control the transfer of a message effectively in the time domain; thus, it is essential to combine QSDC with quantum memory to accomplish the communication task. In this Letter, we report the experimental demonstration of QSDC with state-of-the-art atomic quantum memory for the first time in principle. We use the polarization degrees of freedom of photons as the information carrier, and the fidelity of entanglement decoding is verified as approximately 90%. Our work completes a fundamental step toward practical QSDC and demonstrates a potential application for long-distance quantum communication in a quantum network.
Quantum Secure Direct Communication with Quantum Memory
Zhang, Wei; Ding, Dong-Sheng; Sheng, Yu-Bo; Zhou, Lan; Shi, Bao-Sen; Guo, Guang-Can
2017-06-01
Quantum communication provides an absolute security advantage, and it has been widely developed over the past 30 years. As an important branch of quantum communication, quantum secure direct communication (QSDC) promotes high security and instantaneousness in communication through directly transmitting messages over a quantum channel. The full implementation of a quantum protocol always requires the ability to control the transfer of a message effectively in the time domain; thus, it is essential to combine QSDC with quantum memory to accomplish the communication task. In this Letter, we report the experimental demonstration of QSDC with state-of-the-art atomic quantum memory for the first time in principle. We use the polarization degrees of freedom of photons as the information carrier, and the fidelity of entanglement decoding is verified as approximately 90%. Our work completes a fundamental step toward practical QSDC and demonstrates a potential application for long-distance quantum communication in a quantum network.
Experimental quantum forgery of quantum optical money
Bartkiewicz, Karol; Černoch, Antonín; Chimczak, Grzegorz; Lemr, Karel; Miranowicz, Adam; Nori, Franco
2017-03-01
Unknown quantum information cannot be perfectly copied (cloned). This statement is the bedrock of quantum technologies and quantum cryptography, including the seminal scheme of Wiesner's quantum money, which was the first quantum-cryptographic proposal. Surprisingly, to our knowledge, quantum money has not been tested experimentally yet. Here, we experimentally revisit the Wiesner idea, assuming a banknote to be an image encoded in the polarization states of single photons. We demonstrate that it is possible to use quantum states to prepare a banknote that cannot be ideally copied without making the owner aware of only unauthorized actions. We provide the security conditions for quantum money by investigating the physically-achievable limits on the fidelity of 1-to-2 copying of arbitrary sequences of qubits. These results can be applied as a security measure in quantum digital right management.
Quantum Monte Carlo tunneling from quantum chemistry to quantum annealing
Mazzola, Guglielmo; Smelyanskiy, Vadim N.; Troyer, Matthias
2017-10-01
Quantum tunneling is ubiquitous across different fields, from quantum chemical reactions and magnetic materials to quantum simulators and quantum computers. While simulating the real-time quantum dynamics of tunneling is infeasible for high-dimensional systems, quantum tunneling also shows up in quantum Monte Carlo (QMC) simulations, which aim to simulate quantum statistics with resources growing only polynomially with the system size. Here we extend the recent results obtained for quantum spin models [Phys. Rev. Lett. 117, 180402 (2016), 10.1103/PhysRevLett.117.180402], and we study continuous-variable models for proton transfer reactions. We demonstrate that QMC simulations efficiently recover the scaling of ground-state tunneling rates due to the existence of an instanton path, which always connects the reactant state with the product. We discuss the implications of our results in the context of quantum chemical reactions and quantum annealing, where quantum tunneling is expected to be a valuable resource for solving combinatorial optimization problems.
Energy Technology Data Exchange (ETDEWEB)
Stapp, Henry
2011-11-10
Robert Griffiths has recently addressed, within the framework of a ‘consistent quantum theory’ (CQT) that he has developed, the issue of whether, as is often claimed, quantum mechanics entails a need for faster-than-light transfers of information over long distances. He argues, on the basis of his examination of certain arguments that claim to demonstrate the existence of such nonlocal influences, that such influences do not exist. However, his examination was restricted mainly to hidden-variable-based arguments that include in their premises some essentially classical-physics-type assumptions that are fundamentally incompatible with the precepts of quantum physics. One cannot logically prove properties of a system by attributing to the system properties alien to that system. Hence Griffiths’ rejection of hidden-variable-based proofs is logically warranted. Griffiths mentions the existence of a certain alternative proof that does not involve hidden variables, and that uses only macroscopically described observable properties. He notes that he had examined in his book proofs of this general kind, and concluded that they provide no evidence for nonlocal influences. But he did not examine the particular proof that he cites. An examination of that particular proof by the method specified by his ‘consistent quantum theory’ shows that the cited proof is valid within that restrictive framework. This necessary existence, within the ‘consistent’ framework, of long range essentially instantaneous influences refutes the claim made by Griffiths that his ‘consistent’ framework is superior to the orthodox quantum theory of von Neumann because it does not entail instantaneous influences. An added section responds to Griffiths’ reply, which cites a litany of ambiguities that seem to restrict, devastatingly, the scope of his CQT formalism, apparently to buttress his claim that my use of that formalism to validate the nonlocality theorem is flawed. But the
Pilar, Frank L
2003-01-01
Useful introductory course and reference covers origins of quantum theory, Schrödinger wave equation, quantum mechanics of simple systems, electron spin, quantum states of atoms, Hartree-Fock self-consistent field method, more. 1990 edition.
Quantum conductance in silicon quantum wires
Bagraev, N T; Klyachkin, L E; Malyarenko, A M; Gehlhoff, W; Ivanov, V K; Shelykh, I A
2002-01-01
The results of investigations of electron and hole quantum conductance staircase in silicon quantum wires are presented. The characteristics of self-ordering quantum wells of n- and p-types, which from on the silicon (100) surface in the nonequilibrium boron diffusion process, are analyzed. The results of investigations of the quantum conductance as the function of temperature, carrier concentration and modulation degree of silicon quantum wires are given. It is found out, that the quantum conductance of the one-dimensional channels is observed, for the first time, at an elevated temperature (T >= 77 K)
Quantum coherence and correlations in quantum system
Xi, Zhengjun; Li, Yongming; Fan, Heng
2015-01-01
Criteria of measure quantifying quantum coherence, a unique property of quantum system, are proposed recently. In this paper, we first give an uncertainty-like expression relating the coherence and the entropy of quantum system. This finding allows us to discuss the relations between the entanglement and the coherence. Further, we discuss in detail the relations among the coherence, the discord and the deficit in the bipartite quantum system. We show that, the one-way quantum deficit is equal to the sum between quantum discord and the relative entropy of coherence of measured subsystem. PMID:26094795
Multiparty Zero-Error Classical Channel Coding With Entanglement
Piovesan, T.; Scarpa, G.; Schaffner, C.
2015-01-01
We study the effects of quantum entanglement on the performance of two classical zero-error communication tasks among multiple parties. Both tasks are generalizations of the two-party zero-error channel-coding problem, where a sender and a receiver want to perfectly communicate messages through a
Quantum photonic network and physical layer security.
Sasaki, Masahide; Endo, Hiroyuki; Fujiwara, Mikio; Kitamura, Mitsuo; Ito, Toshiyuki; Shimizu, Ryosuke; Toyoshima, Morio
2017-08-06
Quantum communication and quantum cryptography are expected to enhance the transmission rate and the security (confidentiality of data transmission), respectively. We study a new scheme which can potentially bridge an intermediate region covered by these two schemes, which is referred to as quantum photonic network. The basic framework is information theoretically secure communications in a free space optical (FSO) wiretap channel, in which an eavesdropper has physically limited access to the main channel between the legitimate sender and receiver. We first review a theoretical framework to quantify the optimal balance of the transmission efficiency and the security level under power constraint and at finite code length. We then present experimental results on channel characterization based on 10 MHz on-off keying transmission in a 7.8 km terrestrial FSO wiretap channel.This article is part of the themed issue 'Quantum technology for the 21st century'. © 2017 The Author(s).
Universal Quantum Computation with Gapped Boundaries
Cong, Iris; Cheng, Meng; Wang, Zhenghan
2017-10-01
This Letter discusses topological quantum computation with gapped boundaries of two-dimensional topological phases. Systematic methods are presented to encode quantum information topologically using gapped boundaries, and to perform topologically protected operations on this encoding. In particular, we introduce a new and general computational primitive of topological charge measurement and present a symmetry-protected implementation of this primitive. Throughout the Letter, a concrete physical example, the Z3 toric code [D (Z3)], is discussed. For this example, we have a qutrit encoding and an abstract universal gate set. Physically, gapped boundaries of D (Z3) can be realized in bilayer fractional quantum Hall 1 /3 systems. If a practical implementation is found for the required topological charge measurement, these boundaries will give rise to a direct physical realization of a universal quantum computer based on a purely Abelian topological phase.
Quantum photonic network and physical layer security
Sasaki, Masahide; Endo, Hiroyuki; Fujiwara, Mikio; Kitamura, Mitsuo; Ito, Toshiyuki; Shimizu, Ryosuke; Toyoshima, Morio
2017-06-01
Quantum communication and quantum cryptography are expected to enhance the transmission rate and the security (confidentiality of data transmission), respectively. We study a new scheme which can potentially bridge an intermediate region covered by these two schemes, which is referred to as quantum photonic network. The basic framework is information theoretically secure communications in a free space optical (FSO) wiretap channel, in which an eavesdropper has physically limited access to the main channel between the legitimate sender and receiver. We first review a theoretical framework to quantify the optimal balance of the transmission efficiency and the security level under power constraint and at finite code length. We then present experimental results on channel characterization based on 10 MHz on-off keying transmission in a 7.8 km terrestrial FSO wiretap channel. This article is part of the themed issue 'Quantum technology for the 21st century'.
Automata and Quantum Computing
Ambainis, Andris; Yakaryilmaz, Abuzer
2015-01-01
Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted models such as quantum versions of finite automata have been studied. In this paper, we survey various models of quantum finite automata and their properties. We also provide some open questions and new directions for researchers.
Quantum gravity and quantum cosmology
Energy Technology Data Exchange (ETDEWEB)
Calcagni, Gianluca [Consejo Superior de Investigaciones Cientificas (CSIC), Madrid (Spain). Inst. de Estructura de la Materia; Papantonopoulos, Lefteris [National Technical Univ. of Athens (Greece). Dept. of Physics; Siopsis, George [Tennessee Univ., Knoxville, TN (United States). Dept. of Physics and Astronomy; Tsamis, Nikos (eds.) [Crete Univ, Heraklion (Greece). Dept. of Physics
2013-02-01
With contributions by leading researcher in the field. Chapters written as both tutorial and state-of-the-art surveys. Can be used both as advanced course material and for self study. Quantum gravity has developed into a fast-growing subject in physics and it is expected that probing the high-energy and high-curvature regimes of gravitating systems will shed some light on how to eventually achieve an ultraviolet complete quantum theory of gravity. Such a theory would provide the much needed information about fundamental problems of classical gravity, such as the initial big-bang singularity, the cosmological constant problem, Planck scale physics and the early-time inflationary evolution of our Universe. While in the first part of this book concepts of quantum gravity are introduced and approached from different angles, the second part discusses these theories in connection with cosmological models and observations, thereby exploring which types of signatures of modern and mathematically rigorous frameworks can be detected by experiments. The third and final part briefly reviews the observational status of dark matter and dark energy, and introduces alternative cosmological models.
Quantum Correlations Evolution Asymmetry in Quantum Channels
Li, Meng; Huang, Yun-Feng; Guo, Guang-Can
2017-03-01
It was demonstrated that the entanglement evolution of a specially designed quantum state in the bistochastic channel is asymmetric. In this work, we generalize the study of the quantum correlations, including entanglement and quantum discord, evolution asymmetry to various quantum channels. We found that the asymmetry of entanglement and quantum discord only occurs in some special quantum channels, and the behavior of the entanglement evolution may be quite different from the behavior of the quantum discord evolution. To quantum entanglement, in some channels it decreases monotonously with the increase of the quantum channel intensity. In some other channels, when we increase the intensity of the quantum channel, it decreases at first, then keeps zero for some time, and then rises up. To quantum discord, the evolution becomes more complex and you may find that it evolutes unsmoothly at some points. These results illustrate the strong dependence of the quantum correlations evolution on the property of the quantum channels. Supported by the National Natural Science Foundation of China under Grant Nos. 61327901, 61490711, 61225025, 11474268, and the Fundamental Research Funds for the Central Universities under Grant No. WK2470000018
DEFF Research Database (Denmark)
Andersen, Christian Ulrik
2007-01-01
Computer art is often associated with computer-generated expressions (digitally manipulated audio/images in music, video, stage design, media facades, etc.). In recent computer art, however, the code-text itself – not the generated output – has become the artwork (Perl Poetry, ASCII Art, obfuscated...... code, etc.). The presentation relates this artistic fascination of code to a media critique expressed by Florian Cramer, claiming that the graphical interface represents a media separation (of text/code and image) causing alienation to the computer’s materiality. Cramer is thus the voice of a new ‘code...... avant-garde’. In line with Cramer, the artists Alex McLean and Adrian Ward (aka Slub) declare: “art-oriented programming needs to acknowledge the conditions of its own making – its poesis.” By analysing the Live Coding performances of Slub (where they program computer music live), the presentation...
DEFF Research Database (Denmark)
Steensig, Jakob; Heinemann, Trine
2015-01-01
doing formal coding and when doing more “traditional” conversation analysis research based on collections. We are more wary, however, of the implication that coding-based research is the end result of a process that starts with qualitative investigations and ends with categories that can be coded......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....
1983-01-01
The verified code for the SIFT Executive is not the code that executes on the SIFT system as delivered. The running versions of the SIFT Executive contain optimizations and special code relating to the messy interface to the hardware broadcast interface and to packing of data to conserve space in the store of the BDX930 processors. The running code was in fact developed prior to and without consideration of any mechanical verification. This was regarded as necessary experimentation with the SIFT hardware and special purpose Pascal compiler. The Pascal code sections cover: the selection of a schedule from the global executive broadcast, scheduling, dispatching, three way voting, and error reporting actions of the SIFT Executive. Not included in these sections of Pascal code are: the global executive, five way voting, clock synchronization, interactive consistency, low level broadcasting, and program loading, initialization, and schedule construction.
Schürmann, Michael
2008-01-01
This volume contains the revised and completed notes of lectures given at the school "Quantum Potential Theory: Structure and Applications to Physics," held at the Alfried-Krupp-Wissenschaftskolleg in Greifswald from February 26 to March 10, 2007. Quantum potential theory studies noncommutative (or quantum) analogs of classical potential theory. These lectures provide an introduction to this theory, concentrating on probabilistic potential theory and it quantum analogs, i.e. quantum Markov processes and semigroups, quantum random walks, Dirichlet forms on C* and von Neumann algebras, and boundary theory. Applications to quantum physics, in particular the filtering problem in quantum optics, are also presented.
Strong Resilience of Topological Codes to Depolarization
Directory of Open Access Journals (Sweden)
H. Bombin
2012-04-01
Full Text Available The inevitable presence of decoherence effects in systems suitable for quantum computation necessitates effective error-correction schemes to protect information from noise. We compute the stability of the toric code to depolarization by mapping the quantum problem onto a classical disordered eight-vertex Ising model. By studying the stability of the related ferromagnetic phase via both large-scale Monte Carlo simulations and the duality method, we are able to demonstrate an increased error threshold of 18.9(3% when noise correlations are taken into account. Remarkably, this result agrees within error bars with the result for a different class of codes—topological color codes—where the mapping yields interesting new types of interacting eight-vertex models.
Phonological coding during reading
Leinenger, Mallorie
2014-01-01
The exact role that phonological coding (the recoding of written, orthographic information into a sound based code) plays during silent reading has been extensively studied for more than a century. Despite the large body of research surrounding the topic, varying theories as to the time course and function of this recoding still exist. The present review synthesizes this body of research, addressing the topics of time course and function in tandem. The varying theories surrounding the function of phonological coding (e.g., that phonological codes aid lexical access, that phonological codes aid comprehension and bolster short-term memory, or that phonological codes are largely epiphenomenal in skilled readers) are first outlined, and the time courses that each maps onto (e.g., that phonological codes come online early (pre-lexical) or that phonological codes come online late (post-lexical)) are discussed. Next the research relevant to each of these proposed functions is reviewed, discussing the varying methodologies that have been used to investigate phonological coding (e.g., response time methods, reading while eyetracking or recording EEG and MEG, concurrent articulation) and highlighting the advantages and limitations of each with respect to the study of phonological coding. In response to the view that phonological coding is largely epiphenomenal in skilled readers, research on the use of phonological codes in prelingually, profoundly deaf readers is reviewed. Finally, implications for current models of word identification (activation-verification model (Van Order, 1987), dual-route model (e.g., Coltheart, Rastle, Perry, Langdon, & Ziegler, 2001), parallel distributed processing model (Seidenberg & McClelland, 1989)) are discussed. PMID:25150679
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)
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.
INFORMATION THEORY, *DECODING), (* DATA TRANSMISSION SYSTEMS , DECODING), STATISTICAL ANALYSIS, STOCHASTIC PROCESSES, CODING, WHITE NOISE, NUMBER THEORY, CORRECTIONS, BINARY ARITHMETIC, SHIFT REGISTERS, CONTROL SYSTEMS, USSR
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...
Horak, Peter
2011-01-01
Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch conjecture on the existence of perfect error-correcting Lee codes. In this paper we deal with the existence and enumeration of diameter perfect Lee codes. As main results we determine all q for which there exists a linear diameter-4 perfect Lee code of word length n over Z_{q}, and prove that for each n\\geq3 there are unaccountably many diameter-4 perfect Lee codes of word length n over Z. This is in a strict contrast with perfect error-correcting Lee codes of word length n over Z as there is a unique such code for n=3, and its is conjectured that this is always the case when 2n+1 is a prime. Diameter perfect Lee codes will be constructed by an algebraic construction that is based on a group homomorphism. This will allow us to design an efficient algorithm for their decoding.
Tang, Bin; Yang, Shenghao; Ye, Baoliu; Yin, Yitong; Lu, Sanglu
2015-12-01
Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks and derive some basic properties of the model to facilitate the performance analysis. We then focus on the design of overlapped chunked codes, a class of chunked codes whose chunks are non-disjoint subsets of input packets, which are of special interest since they can be encoded with negligible computational cost and in a causal fashion. We propose expander chunked (EC) codes, the first class of overlapped chunked codes that have an analyzable performance, where the construction of the chunks makes use of regular graphs. Numerical and simulation results show that in some practical settings, EC codes can achieve rates within 91 to 97 % of the optimum and outperform the state-of-the-art overlapped chunked codes significantly.
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
Quantum information processing in nanostructures Quantum optics; Quantum computing
Reina-Estupinan, J H
2002-01-01
Since information has been regarded os a physical entity, the field of quantum information theory has blossomed. This brings novel applications, such as quantum computation. This field has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineering, to the physical sciences. Thus, we now have an interdisciplinary field where great efforts are being made in order to build devices that should allow for the processing of information at a quantum level, and also in the understanding of the complex structure of some physical processes at a more basic level. This thesis is devoted to the theoretical study of structures at the nanometer-scale, 'nanostructures', through physical processes that mainly involve the solid-state and quantum optics, in order to propose reliable schemes for the processing of quantum information. Initially, the main results of quantum information theory and quantum computation are briefly reviewed. Next, the state-of-the-art of ...
Carlet, Claude; Mesnager, Sihem; Tang, Chunming; Qi, Yanfeng
2017-01-01
Linear complementary pairs (LCP) of codes play an important role in armoring implementations against side-channel attacks and fault injection attacks. One of the most common ways to construct LCP of codes is to use Euclidean linear complementary dual (LCD) codes. In this paper, we first introduce the concept of linear codes with $\\sigma$ complementary dual ($\\sigma$-LCD), which includes known Euclidean LCD codes, Hermitian LCD codes, and Galois LCD codes. As Euclidean LCD codes, $\\sigma$-LCD ...
1990-01-01
Quantum electrodynamics is an essential building block and an integral part of the gauge theory of unified electromagnetic, weak, and strong interactions, the so-called standard model. Its failure or breakdown at some level would have a most profound impact on the theoretical foundations of elementary particle physics as a whole. Thus the validity of QED has been the subject of intense experimental tests over more than 40 years of its history. This volume presents an up-to-date review of high precision experimental tests of QED together with comprehensive discussion of required theoretical wor
Jitrik, Oliverio; Lanzagorta, Marco; Uhlmann, Jeffrey; Venegas-Andraca, Salvador E.
2017-05-01
The study of plate tectonic motion is important to generate theoretical models of the structure and dynamics of the Earth. In turn, understanding tectonic motion provides insight to develop sophisticated models that can be used for earthquake early warning systems and for nuclear forensics. Tectonic geodesy uses the position of a network of points on the surface of earth to determine the motion of tectonic plates and the deformation of the earths crust. GPS and interferometric synthetic aperture radar are commonly used techniques used in tectonic geodesy. In this paper we will describe the feasibility of interferometric synthetic aperture quantum radar and its theoretical performance for tectonic geodesy.
Neubert, Matthias
1996-01-01
Quantum chromodynamics (QCD) is the fundamental theory of the strong interactions. It is local, non-abelian gauge theory descripting the interactions between quarks and gluons, the constituents of hadrons. In these lectures, the basic concepts and ph will be introduced in a pedagogical way. Topics will include : asymptotically free partons, colour and confinement ; non-abelian gauge invariance and quantization ; the running coupling constant ; deep-inelastic scattering and scaling violations ; th chiral and heavy-quark symmetries. Some elementary knowledge of field theory, abelian gauge invariance and Feynman diagrams will be helpful in following the course.
Mandl, Franz
1992-01-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 Scient
Quantum Cybernetics and Complex Quantum Systems Science - A Quantum Connectionist Exploration
Gonçalves, Carlos Pedro
2014-01-01
Quantum cybernetics and its connections to complex quantum systems science is addressed from the perspective of complex quantum computing systems. In this way, the notion of an autonomous quantum computing system is introduced in regards to quantum artificial intelligence, and applied to quantum artificial neural networks, considered as autonomous quantum computing systems, which leads to a quantum connectionist framework within quantum cybernetics for complex quantum computing systems. Sever...
Quantum entanglement and quantum computational algorithms
Indian Academy of Sciences (India)
Abstract. The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We demonstrate that the one- and the two-bit Deutsch-Jozsa algorithm does not require entanglement and can be mapped ...
Energy Technology Data Exchange (ETDEWEB)
Levy, James E; Carroll, Malcolm S; Ganti, Anand; Phillips, Cynthia A; Landahl, Andrew J; Gurrieri, Thomas M; Carr, Robert D; Stalford, Harold L; Nielsen, Erik, E-mail: jelevy@sandia.gov [Sandia National Laboratories, Albuquerque, NM 87185 (United States)
2011-08-15
In this paper we present the impact of classical electronics constraints on a solid-state quantum dot logical qubit architecture. Constraints due to routing density, bandwidth allocation, signal timing and thermally aware placement of classical supporting electronics significantly affect the quantum error correction circuit's error rate (by a factor of {approx}3-4 in our specific analysis). We analyze one level of a quantum error correction circuit using nine data qubits in a Bacon-Shor code configured as a quantum memory. A hypothetical silicon double quantum dot quantum bit (qubit) is used as the fundamental element. A pessimistic estimate of the error probability of the quantum circuit is calculated using the total number of gates and idle time using a provably optimal schedule for the circuit operations obtained with an integer program methodology. The micro-architecture analysis provides insight about the different ways the electronics impact the circuit performance (e.g. extra idle time in the schedule), which can significantly limit the ultimate performance of any quantum circuit and therefore is a critical foundation for any future larger scale architecture analysis.
The degeneracy of the genetic code and Hadamard matrices
Petoukhov, Sergey V
2008-01-01
The matrix form of the presentation of the genetic code is described as the cognitive form to analyze structures of the genetic code. A similar matrix form is utilized in the theory of signal processing. The Kronecker family of the genetic matrices is investigated, which is based on the genetic matrix [C A; U G], where C, A, U, G are the letters of the genetic alphabet. This matrix in the third Kronecker power is the (8*8)-matrix, which contains 64 triplets. Peculiarities of the degeneracy of the vertebrate mitochondria genetic code are reflected in the symmetrical black-and-white mosaic of this genetic (8*8)-matrix. This mosaic matrix is connected algorithmically with Hadamard matrices unexpectedly, which are famous in the theory of signal processing, quantum mechanics and quantum computers.
A quantum memory for orbital angular momentum photonic qubits
Nicolas, A.; Veissier, L.; Giner, L.; Giacobino, E.; Maxein, D.; Laurat, J.
2014-03-01
Among the optical degrees of freedom, the orbital angular momentum of light provides unique properties, including mechanical torque action, which has applications for light manipulation, enhanced sensitivity in imaging techniques and potential high-density information coding for optical communication systems. Recent years have also seen a tremendous interest in exploiting orbital angular momentum at the single-photon level in quantum information technologies. In pursuing this endeavour, we demonstrate here the implementation of a quantum memory for quantum bits encoded in this optical degree of freedom. We generate various qubits with computer-controlled holograms, store and retrieve them on demand using a dynamic electromagnetically induced transparency protocol. We further analyse the retrieved states by quantum tomography and thereby demonstrate fidelities exceeding the classical benchmark, confirming the quantum functioning of our storage process. Our results provide an essential capability for future networks exploring the promises of orbital angular momentum of photons for quantum information applications.
Electrical Conductivity Calculations from the Purgatorio Code
Energy Technology Data Exchange (ETDEWEB)
Hansen, S B; Isaacs, W A; Sterne, P A; Wilson, B G; Sonnad, V; Young, D A
2006-01-09
The Purgatorio code [Wilson et al., JQSRT 99, 658-679 (2006)] is a new implementation of the Inferno model describing a spherically symmetric average atom embedded in a uniform plasma. Bound and continuum electrons are treated using a fully relativistic quantum mechanical description, giving the electron-thermal contribution to the equation of state (EOS). The free-electron density of states can also be used to calculate scattering cross sections for electron transport. Using the extended Ziman formulation, electrical conductivities are then obtained by convolving these transport cross sections with externally-imposed ion-ion structure factors.
Soliton coding for secured optical communication link
Amiri, Iraj Sadegh; Idrus, Sevia Mahdaliza
2015-01-01
Nonlinear behavior of light such as chaos can be observed during propagation of a laser beam inside the microring resonator (MRR) systems. This Brief highlights the design of a system of MRRs to generate a series of logic codes. An optical soliton is used to generate an entangled photon. The ultra-short soliton pulses provide the required communication signals to generate a pair of polarization entangled photons required for quantum keys. In the frequency domain, MRRs can be used to generate optical millimetre-wave solitons with a broadband frequency of 0?100 GHz. The soliton signals are multi
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...
Indian Academy of Sciences (India)
be fixed to define codes over such domains). New decoding schemes that take advantage of such connections can be devised. These may soon show up in a technique called code division multiple access (CDMA) which is proposed as a basis for digital cellular communication. CDMA provides a facility for many users to ...
Million, June
2004-01-01
Most schools have a code of conduct, pledge, or behavioral standards, set by the district or school board with the school community. In this article, the author features some schools that created a new vision of instilling code of conducts to students based on work quality, respect, safety and courtesy. She suggests that communicating the code…
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 3. Error Correcting Codes - Reed Solomon Codes. Priti Shankar. Series Article Volume 2 Issue 3 March 1997 pp 33-47. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/002/03/0033-0047 ...
Nymeyer, Albert; Katoen, Joost P.; Westra, Ymte; Alblas, H.; Gyimóthy, Tibor
1996-01-01
A system called BURS that is based on term rewrite systems and a search algorithm A* are combined to produce a code generator that generates optimal code. The theory underlying BURS is re-developed, formalised and explained in this work. The search algorithm uses a cost heuristic that is derived
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…
Bergstra, J.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
Interleaved Product LDPC Codes
Baldi, Marco; Cancellieri, Giovanni; Chiaraluce, Franco
2011-01-01
Product LDPC codes take advantage of LDPC decoding algorithms and the high minimum distance of product codes. We propose to add suitable interleavers to improve the waterfall performance of LDPC decoding. Interleaving also reduces the number of low weight codewords, that gives a further advantage in the error floor region.
Thieren, Michel; Mauron, Alexandre
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.
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 1. Error Correcting Codes The Hamming Codes. Priti Shankar. Series Article Volume 2 Issue 1 January ... Author Affiliations. Priti Shankar1. Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560 012, India ...
Controlled Alternate Quantum Walks based Quantum Hash Function.
Li, Dan; Yang, Yu-Guang; Bi, Jing-Lin; Yuan, Jia-Bin; Xu, Juan
2018-01-09
Through introducing controlled alternate quantum walks, we present controlled alternate quantum walks (CAQW) based quantum hash function. CAQW based quantum hash function have excellent security, outstanding statistical performance and splendid expansibility. Furthermore, due to the structure of alternate quantum walks, implementing CAQW based quantum hash function significantly reduces the resources necessary for its feasible experimental realization than implementing other quantum hash functions.
Evaluation Codes from an Affine Veriety Code Perspective
DEFF Research Database (Denmark)
Geil, Hans Olav
2008-01-01
Evaluation codes (also called order domain codes) are traditionally introduced as generalized one-point geometric Goppa codes. In the present paper we will give a new point of view on evaluation codes by introducing them instead as particular nice examples of affine variety codes. Our study...... . . . . . . . . . . . . . . . . . . . . . . . 171 4.9 Codes form order domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173 4.10 One-point geometric Goppa codes . . . . . . . . . . . . . . . . . . . . . . . . 176 4.11 Bibliographical Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178 References...
De Raedt, H. A.; Hams, A. H.; Michielsen, K. F. L.; De Raedt, K.
2000-01-01
We describe a quantum computer emulator for a generic, general purpose quantum computer. This emulator consists of a simulator of the physical realization of the quantum computer and a graphical user interface to program and control the simulator. We illustrate the use of the quantum computer emulator through various implementations of the Deutsch-Jozsa and Grover's database search algorithm.
Quantum Entanglement and Teleportation
Yates, Brent R.
2011-01-01
Even Einstein has to be wrong sometimes. However, when Einstein was wrong he created a 70 year debate about the strange behavior of quantum mechanics. His debate helped prove topics such as the indeterminacy of particle states, quantum entanglement, and a rather clever use of quantum entanglement known as quantum teleportation.
On Quantum Microcanonical Equilibrium
Dorje C. Brody; Hook, Daniel W.; Hughston, Lane P.
2007-01-01
A quantum microcanonical postulate is proposed as a basis for the equilibrium properties of small quantum systems. Expressions for the corresponding density of states are derived, and are used to establish the existence of phase transitions for finite quantum systems. A grand microcanonical ensemble is introduced, which can be used to obtain new rigorous results in quantum statistical mechanics. Accepted version
On quantum microcanonical equilibrium
Energy Technology Data Exchange (ETDEWEB)
Brody, Dorje C [Department of Mathematics, Imperial College, London SW7 2BZ (United Kingdom); Hook, Daniel W [Blackett Laboratory, Imperial College, London SW7 2BZ (United Kingdom); Hughston, Lane P [Department of Mathematics, King' s College London, The Strand, London WC2R 2LS (United Kingdom)
2007-05-15
A quantum microcanonical postulate is proposed as a basis for the equilibrium properties of small quantum systems. Expressions for the corresponding density of states are derived, and are used to establish the existence of phase transitions for finite quantum systems. A grand microcanonical ensemble is introduced, which can be used to obtain new rigorous results in quantum statistical mechanics.
Quantum Closures and Disclosures
African Journals Online (AJOL)
denise
thought that a living, quantum dynamically functioning brain is a unique locus where both the existence of a world and our experience of it are created. Globus takes from QBD the idea that there are two quantum universes, both of them unpresent. One of these is the quantum universe familiar from quantum mechanics (“our” ...
Calmet, Xavier; Winstanley, Elizabeth
2014-01-01
Written by foremost experts, this short book gives a clear description of the physics of quantum black holes. The reader will learn about quantum black holes in four and higher dimensions, primordial black holes, the production of black holes in high energy particle collisions, Hawking radiation, black holes in models of low scale quantum gravity and quantum gravitational aspects of black holes.
Quantum computational supremacy
Harrow, Aram W.; Montanaro, Ashley
2017-09-01
The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is beyond the capability of any classical computer, an event known as quantum supremacy. This would be easier to achieve experimentally than full-scale quantum computing, but involves new theoretical challenges. Here we present the leading proposals to achieve quantum supremacy, and discuss how we can reliably compare the power of a classical computer to the power of a quantum computer.
Bohmian quantum mechanics with quantum trajectories
Jeong, Yeuncheol
The quantum trajectory method in the hydrodynamical formulation of Madelung-Bohm-Takabayasi quantum mechanics is an example of showing the cognitive importance of scientific illustrations and metaphors, especially, in this case, in computational quantum chemistry and electrical engineering. The method involves several numerical schemes of solving a set of hydrodynamical equations of motion for probability density fluids, based on the propagation of those probability density trajectories. The quantum trajectory method gives rise to, for example, an authentic quantum electron transport theory of motion to, among others, classically-minded applied scientists who probably have less of a commitment to traditional quantum mechanics. They were not the usual audience of quantum mechanics and simply choose to use a non-Copenhagen type interpretation to their advantage. Thus, the metaphysical issues physicists had a trouble with are not the main concern of the scientists. With the advantages of a visual and illustrative trajectory, the quantum theory of motion by Bohm effectively bridges quantum and classical physics, especially, in the mesoscale domain. Without having an abrupt shift in actions and beliefs from the classical to the quantum world, scientists and engineers are able to enjoy human cognitive capacities extended into the quantum mechanical domain.
Quantum Chess: Making Quantum Phenomena Accessible
Cantwell, Christopher
Quantum phenomena have remained largely inaccessible to the general public. There tends to be a scare factor associated with the word ``Quantum''. This is in large part due to the alien nature of phenomena such as superposition and entanglement. However, Quantum Computing is a very active area of research and one day we will have games that run on those quantum computers. Quantum phenomena such as superposition and entanglement will seem as normal as gravity. Is it possible to create such games today? Can we make games that are built on top of a realistic quantum simulation and introduce players of any background to quantum concepts in a fun and mentally stimulating way? One of the difficulties with any quantum simulation run on a classical computer is that the Hilbert space grows exponentially, making simulations of an appreciable size physically impossible due largely to memory restrictions. Here we will discuss the conception and development of Quantum Chess, and how to overcome some of the difficulties faced. We can then ask the question, ``What's next?'' What are some of the difficulties Quantum Chess still faces, and what is the future of quantum games?
Optimal blind quantum computation.
Mantri, Atul; Pérez-Delgado, Carlos A; Fitzsimons, Joseph F
2013-12-06
Blind quantum computation allows a client with limited quantum capabilities to interact with a remote quantum computer to perform an arbitrary quantum computation, while keeping the description of that computation hidden from the remote quantum computer. While a number of protocols have been proposed in recent years, little is currently understood about the resources necessary to accomplish the task. Here, we present general techniques for upper and lower bounding the quantum communication necessary to perform blind quantum computation, and use these techniques to establish concrete bounds for common choices of the client's quantum capabilities. Our results show that the universal blind quantum computation protocol of Broadbent, Fitzsimons, and Kashefi, comes within a factor of 8/3 of optimal when the client is restricted to preparing single qubits. However, we describe a generalization of this protocol which requires exponentially less quantum communication when the client has a more sophisticated device.
Energy Technology Data Exchange (ETDEWEB)
Hughes, Richard John; Thrasher, James Thomas; Nordholt, Jane Elizabeth
2016-11-29
Innovations for quantum key management harness quantum communications to form a cryptography system within a public key infrastructure framework. In example implementations, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a Merkle signature scheme (using Winternitz one-time digital signatures or other one-time digital signatures, and Merkle hash trees) to constitute a cryptography system. More generally, the quantum key management innovations combine quantum key distribution and a quantum identification protocol with a hash-based signature scheme. This provides a secure way to identify, authenticate, verify, and exchange secret cryptographic keys. Features of the quantum key management innovations further include secure enrollment of users with a registration authority, as well as credential checking and revocation with a certificate authority, where the registration authority and/or certificate authority can be part of the same system as a trusted authority for quantum key distribution.
Introduction to topological quantum matter & quantum computation
Stanescu, Tudor D
2017-01-01
What is -topological- about topological quantum states? How many types of topological quantum phases are there? What is a zero-energy Majorana mode, how can it be realized in a solid state system, and how can it be used as a platform for topological quantum computation? What is quantum computation and what makes it different from classical computation? Addressing these and other related questions, Introduction to Topological Quantum Matter & Quantum Computation provides an introduction to and a synthesis of a fascinating and rapidly expanding research field emerging at the crossroads of condensed matter physics, mathematics, and computer science. Providing the big picture, this book is ideal for graduate students and researchers entering this field as it allows for the fruitful transfer of paradigms and ideas amongst different areas, and includes many specific examples to help the reader understand abstract and sometimes challenging concepts. It explores the topological quantum world beyond the well-know...
Quantum-dot based photonic quantum networks
Lodahl, Peter
2018-01-01
Quantum dots (QDs) embedded in photonic nanostructures have in recent years proven to be a very powerful solid-state platform for quantum optics experiments. The combination of near-unity radiative coupling of a single QD to a photonic mode and the ability to eliminate decoherence processes imply that an unprecedent light–matter interface can be obtained. As a result, high-cooperativity photon-emitter quantum interfaces can be constructed opening a path-way to deterministic photonic quantum gates for quantum-information processing applications. In the present manuscript, I review current state-of-the-art on QD devices and their applications for quantum technology. The overarching long-term goal of the research field is to construct photonic quantum networks where remote entanglement can be distributed over long distances by photons.
Quantum engineering of continuous variable quantum states
Energy Technology Data Exchange (ETDEWEB)
Sabuncu, Metin
2009-10-29
Quantum information with continuous variables is a field attracting increasing attention recently. In continuous variable quantum information one makes use of the continuous information encoded into the quadrature of a quantized light field instead of binary quantities such as the polarization state of a single photon. This brand new research area is witnessing exciting theoretical and experimental achievements such as teleportation, quantum computation and quantum error correction. The rapid development of the field is mainly due higher optical data rates and the availability of simple and efficient manipulation tools in continuous-variable quantum information processing. We in this thesis extend the work in continuous variable quantum information processing and report on novel experiments on amplification, cloning, minimal disturbance and noise erasure protocols. The promising results we obtain in these pioneering experiments indicate that the future of continuous variable quantum information is bright and many advances can be foreseen. (orig.)
Watson, Andrew B.
1990-01-01
All vision systems, both human and machine, transform the spatial image into a coded representation. Particular codes may be optimized for efficiency or to extract useful image features. Researchers explored image codes based on primary visual cortex in man and other primates. Understanding these codes will advance the art in image coding, autonomous vision, and computational human factors. In cortex, imagery is coded by features that vary in size, orientation, and position. Researchers have devised a mathematical model of this transformation, called the Hexagonal oriented Orthogonal quadrature Pyramid (HOP). In a pyramid code, features are segregated by size into layers, with fewer features in the layers devoted to large features. Pyramid schemes provide scale invariance, and are useful for coarse-to-fine searching and for progressive transmission of images. The HOP Pyramid is novel in three respects: (1) it uses a hexagonal pixel lattice, (2) it uses oriented features, and (3) it accurately models most of the prominent aspects of primary visual cortex. The transform uses seven basic features (kernels), which may be regarded as three oriented edges, three oriented bars, and one non-oriented blob. Application of these kernels to non-overlapping seven-pixel neighborhoods yields six oriented, high-pass pyramid layers, and one low-pass (blob) layer.
Energy Technology Data Exchange (ETDEWEB)
Nelson, R.N. (ed.)
1985-05-01
This publication lists all report number codes processed by the Office of Scientific and Technical Information. The report codes are substantially based on the American National Standards Institute, Standard Technical Report Number (STRN)-Format and Creation Z39.23-1983. The Standard Technical Report Number (STRN) provides one of the primary methods of identifying a specific technical report. The STRN consists of two parts: The report code and the sequential number. The report code identifies the issuing organization, a specific program, or a type of document. The sequential number, which is assigned in sequence by each report issuing entity, is not included in this publication. Part I of this compilation is alphabetized by report codes followed by issuing installations. Part II lists the issuing organization followed by the assigned report code(s). In both Parts I and II, the names of issuing organizations appear for the most part in the form used at the time the reports were issued. However, for some of the more prolific installations which have had name changes, all entries have been merged under the current name.
DEFF Research Database (Denmark)
Jørgensen, Jacob Lykkebo; Gagliardi, Alessio; Pecchia, Alessandro
2014-01-01
Destructive quantum interference in single molecule electronics is an intriguing phenomenon; however, distinguishing quantum interference effects from generically low transmission is not trivial. In this paper, we discuss how quantum interference effects in the transmission lead to either low...... suppressed when quantum interference effects dominate. That is, we expand the understanding of propensity rules in inelastic electron tunneling spectroscopy to molecules with destructive quantum interference....
Quantum cosmology for pedestrians
Atkatz, David
1994-07-01
The application of quantum theory to the description of the universe as a whole is known as quantum cosmology. A brief, self-contained introduction to this field, accessible to an upper-level undergraduate physics student is presented. Perhaps the most remarkable quantum-cosmological idea-that the universe originated ex nihilo via a quantum-mechanical tunneling process-is discussed, and the probability for such a quantum cosmogenesis is calculated.
Matsui, Fumihiro; Yamada, Hiroaki S.; Ikeda, Kensuke S.
2017-01-01
As an application of the classically decayable correlation in a quantum chaos system maintained over an extremely long time-scale (Matsui et al, Europhys.Lett. 113(2016),40008), we propose a minimal model of quantum damper composed of a quantum harmonic oscillator (HO) weakly interacting with a bounded quantum chaos system. Although the whole system obeys unitary evolution dynamics of only three quantum degrees of freedom, the mechanical work applied to the HO is stationary converted into the...
Broadband Quantum Cryptography
Rogers, Daniel
2010-01-01
Quantum cryptography is a rapidly developing field that draws from a number of disciplines, from quantum optics to information theory to electrical engineering. By combining some fundamental quantum mechanical principles of single photons with various aspects of information theory, quantum cryptography represents a fundamental shift in the basis for security from numerical complexity to the fundamental physical nature of the communications channel. As such, it promises the holy grail of data security: theoretically unbreakable encryption. Of course, implementing quantum cryptography in real br
Quantum information technology
Timothy P Spiller
2003-01-01
A new quantum information technology (QIT) could emerge in the future, based on current research in the fields of quantum information processing and communication1–3 (QIPC). In contrast to conventional IT, where quantum mechanics plays a support role in improving the building blocks, fundamental quantum phenomena play a central role in QIPC — information is stored, processed, and communicated according to the laws of quantum physics. This additional freedom could enable future QIT to perform ...
Diagrammatic quantum mechanics
Kauffman, Louis H.; Lomonaco, Samuel J.
2015-05-01
This paper explores how diagrams of quantum processes can be used for modeling and for quantum epistemology. The paper is a continuation of the discussion where we began this formulation. Here we give examples of quantum networks that represent unitary transformations by dint of coherence conditions that constitute a new form of non-locality. Local quantum devices interconnected in space can form a global quantum system when appropriate coherence conditions are maintained.
Ficek, Zbigniew
2016-01-01
The textbook introduces students to the main ideas of quantum physics and the basic mathematical methods and techniques used in the fields of advanced quantum physics, atomic physics, laser physics, nanotechnology, quantum chemistry, and theoretical mathematics. The textbook explains how microscopic objects (particles) behave in unusual ways, giving rise to what's called quantum effects. It contains a wide range of tutorial problems from simple confidence-builders to fairly challenging exercises that provide adequate understanding of the basic concepts of quantum physics.
2014-01-01
While cracking a code might seem like something few of us would encounter in our daily lives, it is actually far more prevalent than we may realize. Anyone who has had personal information taken because of a hacked email account can understand the need for cryptography and the importance of encryption-essentially the need to code information to keep it safe. This detailed volume examines the logic and science behind various ciphers, their real world uses, how codes can be broken, and the use of technology in this oft-overlooked field.
Silicon CMOS architecture for a spin-based quantum computer.
Veldhorst, M; Eenink, H G J; Yang, C H; Dzurak, A S
2017-12-15
Recent advances in quantum error correction codes for fault-tolerant quantum computing and physical realizations of high-fidelity qubits in multiple platforms give promise for the construction of a quantum computer based on millions of interacting qubits. However, the classical-quantum interface remains a nascent field of exploration. Here, we propose an architecture for a silicon-based quantum computer processor based on complementary metal-oxide-semiconductor (CMOS) technology. We show how a transistor-based control circuit together with charge-storage electrodes can be used to operate a dense and scalable two-dimensional qubit system. The qubits are defined by the spin state of a single electron confined in quantum dots, coupled via exchange interactions, controlled using a microwave cavity, and measured via gate-based dispersive readout. We implement a spin qubit surface code, showing the prospects for universal quantum computation. We discuss the challenges and focus areas that need to be addressed, providing a path for large-scale quantum computing.
Bacon-Shor code with continuous measurement of non-commuting operators
Korotkov, Alexander N.; Atalaya, Juan; Bahrami, Mohammad; Pryadko, Leonid P.
We analyze the four-qubit Bacon-Shor code with simultaneous continuous measurement of non-commuting gauge operators. Error syndrome in this case is monitored via time-averaged cross-correlators of the output signals. We find the logical error rate and the termination rate for this quantum error detecting code for several models of decoherence. The code operation is comparable to that of the four-qubit Bacon-Shor code using conventional projective measurements. An advantage of the continuous-measurement implementation is the absence of time dependence in the code operation, with passive continuous monitoring of the error syndrome.
A Quantum Non-Demolition Parity measurement in a mixed-species trapped-ion quantum processor
Marinelli, Matteo; Negnevitsky, Vlad; Lo, Hsiang-Yu; Flühmann, Christa; Mehta, Karan; Home, Jonathan
2017-04-01
Quantum non-demolition measurements of multi-qubit systems are an important tool in quantum information processing, in particular for syndrome extraction in quantum error correction. We have recently demonstrated a protocol for quantum non-demolition measurement of the parity of two beryllium ions by detection of a co-trapped calcium ion. The measurement requires a sequence of quantum gates between the three ions, using mixed-species gates between beryllium hyperfine qubits and a calcium optical qubit. Our work takes place in a multi-zone segmented trap setup in which we have demonstrated high fidelity control of both species and multi-well ion shuttling. The advantage of using two species of ion is that we can individually manipulate and read out the state of each ion species without disturbing the internal state of the other. The methods demonstrated here can be used for quantum error correcting codes as well as quantum metrology and are key ingredients for realizing a hybrid universal quantum computer based on trapped ions. Mixed-species control may also enable the investigation of new avenues in quantum simulation and quantum state control. left the group and working in a company now.
QUANTUM ESPRESSO: a modular and open-source software project for quantum simulations of materials.
Giannozzi, Paolo; Baroni, Stefano; Bonini, Nicola; Calandra, Matteo; Car, Roberto; Cavazzoni, Carlo; Ceresoli, Davide; Chiarotti, Guido L; Cococcioni, Matteo; Dabo, Ismaila; Dal Corso, Andrea; de Gironcoli, Stefano; Fabris, Stefano; Fratesi, Guido; Gebauer, Ralph; Gerstmann, Uwe; Gougoussis, Christos; Kokalj, Anton; Lazzeri, Michele; Martin-Samos, Layla; Marzari, Nicola; Mauri, Francesco; Mazzarello, Riccardo; Paolini, Stefano; Pasquarello, Alfredo; Paulatto, Lorenzo; Sbraccia, Carlo; Scandolo, Sandro; Sclauzero, Gabriele; Seitsonen, Ari P; Smogunov, Alexander; Umari, Paolo; Wentzcovitch, Renata M
2009-09-30
QUANTUM ESPRESSO is an integrated suite of computer codes for electronic-structure calculations and materials modeling, based on density-functional theory, plane waves, and pseudopotentials (norm-conserving, ultrasoft, and projector-augmented wave). The acronym ESPRESSO stands for opEn Source Package for Research in Electronic Structure, Simulation, and Optimization. It is freely available to researchers around the world under the terms of the GNU General Public License. QUANTUM ESPRESSO builds upon newly-restructured electronic-structure codes that have been developed and tested by some of the original authors of novel electronic-structure algorithms and applied in the last twenty years by some of the leading materials modeling groups worldwide. Innovation and efficiency are still its main focus, with special attention paid to massively parallel architectures, and a great effort being devoted to user friendliness. QUANTUM ESPRESSO is evolving towards a distribution of independent and interoperable codes in the spirit of an open-source project, where researchers active in the field of electronic-structure calculations are encouraged to participate in the project by contributing their own codes or by implementing their own ideas into existing codes.
QUANTUM ESPRESSO: a modular and open-source software project for quantum simulations of materials
Energy Technology Data Exchange (ETDEWEB)
Giannozzi, Paolo; Baroni, Stefano; Dal Corso, Andrea; De Gironcoli, Stefano; Fabris, Stefano; Gebauer, Ralph; Kokalj, Anton; Martin-Samos, Layla [CNR-INFM Democritos National Simulation Center, 34100 Trieste (Italy); Bonini, Nicola; Ceresoli, Davide [Department of Materials Science and Engineering, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States); Calandra, Matteo; Gougoussis, Christos; Lazzeri, Michele [Institut de Mineralogie et de Physique des Milieux Condenses, Universite Pierre et Marie Curie, CNRS, IPGP, 140 rue de Lourmel, 75015 Paris (France); Car, Roberto [Department of Chemistry, Princeton University, Princeton, NJ 08544 (United States); Cavazzoni, Carlo [CINECA National Supercomputing Center, Casalecchio di Reno, 40033 Bologna (Italy); Chiarotti, Guido L [SPIN s.r.l., via del Follatoio 12, 34148 Trieste (Italy); Cococcioni, Matteo [Department of Chemical Engineering and Materials Science, University of Minnesota, 151 Amundson Hall, 421 Washington Avenue SE, Minneapolis, MN 55455 (United States); Dabo, Ismaila [Universite Paris-Est, CERMICS, Projet Micmac ENPC-INRIA, 6-8 avenue Blaise Pascal, 77455 Marne-la-Vallee Cedex 2 (France); Fratesi, Guido [Dipartimento di Scienza dei Materiali, Universita degli Studi di Milano-Bicocca, via Cozzi 53, 20125 Milano (Italy); Gerstmann, Uwe [Theoretische Physik, Universitaet Paderborn, D-33098 Paderborn (Germany)
2009-09-30
QUANTUM ESPRESSO is an integrated suite of computer codes for electronic-structure calculations and materials modeling, based on density-functional theory, plane waves, and pseudopotentials (norm-conserving, ultrasoft, and projector-augmented wave). The acronym ESPRESSO stands for opEn Source Package for Research in Electronic Structure, Simulation, and Optimization. It is freely available to researchers around the world under the terms of the GNU General Public License. QUANTUM ESPRESSO builds upon newly-restructured electronic-structure codes that have been developed and tested by some of the original authors of novel electronic-structure algorithms and applied in the last twenty years by some of the leading materials modeling groups worldwide. Innovation and efficiency are still its main focus, with special attention paid to massively parallel architectures, and a great effort being devoted to user friendliness. QUANTUM ESPRESSO is evolving towards a distribution of independent and interoperable codes in the spirit of an open-source project, where researchers active in the field of electronic-structure calculations are encouraged to participate in the project by contributing their own codes or by implementing their own ideas into existing codes.
DEFF Research Database (Denmark)
2015-01-01
Fulcrum network codes, which are a network coding framework, achieve three objectives: (i) to reduce the overhead per coded packet to almost 1 bit per source packet; (ii) to operate the network using only low field size operations at intermediate nodes, dramatically reducing complexity...... in the network; and (iii) to deliver an end-to-end performance that is close to that of a high field size network coding system for high-end receivers while simultaneously catering to low-end ones that can only decode in a lower field size. Sources may encode using a high field size expansion to increase...... the number of dimensions seen by the network using a linear mapping. Receivers can tradeoff computational effort with network delay, decoding in the high field size, the low field size, or a combination thereof....
Vermont Center for Geographic Information — (Link to Metadata) A ZIP Code Tabulation Area (ZCTA) is a statistical geographic entity that approximates the delivery area for a U.S. Postal Service five-digit...
Anderson, John B
2017-01-01
Bandwidth Efficient Coding addresses the major challenge in communication engineering today: how to communicate more bits of information in the same radio spectrum. Energy and bandwidth are needed to transmit bits, and bandwidth affects capacity the most. Methods have been developed that are ten times as energy efficient at a given bandwidth consumption as simple methods. These employ signals with very complex patterns and are called "coding" solutions. The book begins with classical theory before introducing new techniques that combine older methods of error correction coding and radio transmission in order to create narrowband methods that are as efficient in both spectrum and energy as nature allows. Other topics covered include modulation techniques such as CPM, coded QAM and pulse design.
Montgomery County of Maryland — The Office of the County Attorney (OCA) processes Code Violation Citations issued by County agencies. The citations can be viewed by issued department, issued date...
DEFF Research Database (Denmark)
Paolini, Enrico; Stefanovic, Cedomir; Liva, Gianluigi
2015-01-01
, in which the structure of the access protocol can be mapped to a structure of an erasure-correcting code defined on graph. This opens the possibility to use coding theory and tools for designing efficient random access protocols, offering markedly better performance than ALOHA. Several instances of coded......The rise of machine-to-machine communications has rekindled the interest in random access protocols as a support for a massive number of uncoordinatedly transmitting devices. The legacy ALOHA approach is developed under a collision model, where slots containing collided packets are considered...... as waste. However, if the common receiver (e.g., base station) is capable to store the collision slots and use them in a transmission recovery process based on successive interference cancellation, the design space for access protocols is radically expanded. We present the paradigm of coded random access...
Code Disentanglement: Initial Plan
Energy Technology Data Exchange (ETDEWEB)
Wohlbier, John Greaton [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kelley, Timothy M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Rockefeller, Gabriel M. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Calef, Matthew Thomas [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-01-27
The first step to making more ambitious changes in the EAP code base is to disentangle the code into a set of independent, levelized packages. We define a package as a collection of code, most often across a set of files, that provides a defined set of functionality; a package a) can be built and tested as an entity and b) fits within an overall levelization design. Each package contributes one or more libraries, or an application that uses the other libraries. A package set is levelized if the relationships between packages form a directed, acyclic graph and each package uses only packages at lower levels of the diagram (in Fortran this relationship is often describable by the use relationship between modules). Independent packages permit independent- and therefore parallel|development. The packages form separable units for the purposes of development and testing. This is a proven path for enabling finer-grained changes to a complex code.
Energy Technology Data Exchange (ETDEWEB)
Freeman, L.N.; Wilson, R.E. [Oregon State Univ., Dept. of Mechanical Engineering, Corvallis, OR (United States)
1996-09-01
The FAST Code which is capable of determining structural loads on a flexible, teetering, horizontal axis wind turbine is described and comparisons of calculated loads with test data are given at two wind speeds for the ESI-80. The FAST Code models a two-bladed HAWT with degrees of freedom for blade bending, teeter, drive train flexibility, yaw, and windwise and crosswind tower motion. The code allows blade dimensions, stiffnesses, and weights to differ and models tower shadow, wind shear, and turbulence. Additionally, dynamic stall is included as are delta-3 and an underslung rotor. Load comparisons are made with ESI-80 test data in the form of power spectral density, rainflow counting, occurrence histograms, and azimuth averaged bin plots. It is concluded that agreement between the FAST Code and test results is good. (au)
Accardi, Luigi; Freudenberg, Wolfgang; Ohya, Masanori
2011-01-01
.Use of cryptographic ideas to interpret biological phenomena (and vice versa) / M. Regoli -- Discrete approximation to operators in white noise analysis / Si Si -- Bogoliubov type equations via infinite-dimensional equations for measures / V. V. Kozlov and O. G. Smolyanov -- Analysis of several categorical data using measure of proportional reduction in variation / K. Yamamoto ... [et al.] -- The electron reservoir hypothesis for two-dimensional electron systems / K. Yamada ... [et al.] -- On the correspondence between Newtonian and functional mechanics / E. V. Piskovskiy and I. V. Volovich -- Quantile-quantile plots: An approach for the inter-species comparison of promoter architecture in eukaryotes / K. Feldmeier ... [et al.] -- Entropy type complexities in quantum dynamical processes / N. Watanabe -- A fair sampling test for Ekert protocol / G. Adenier, A. Yu. Khrennikov and N. Watanabe -- Brownian dynamics simulation of macromolecule diffusion in a protocell / T. Ando and J. Skolnick -- Signaling network of environmental sensing and adaptation in plants: Key roles of calcium ion / K. Kuchitsu and T. Kurusu -- NetzCope: A tool for displaying and analyzing complex networks / M. J. Barber, L. Streit and O. Strogan -- Study of HIV-1 evolution by coding theory and entropic chaos degree / K. Sato -- The prediction of botulinum toxin structure based on in silico and in vitro analysis / T. Suzuki and S. Miyazaki -- On the mechanism of D-wave high T[symbol] superconductivity by the interplay of Jahn-Teller physics and Mott physics / H. Ushio, S. Matsuno and H. Kamimura.
Coded Splitting Tree Protocols
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar
2013-01-01
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... as possible. Evaluations show that the proposed protocol provides considerable gains over the standard tree splitting protocol applying SIC. The improvement comes at the expense of an increased feedback and receiver complexity....
International Development Research Centre (IDRC) Digital Library (Canada)
irocca
son point de vue, dans un esprit d'accueil et de respect. NOTRE CODE DE CONDUITE. Le CRDI s'engage à adopter un comportement conforme aux normes d'éthique les plus strictes dans toutes ses activités. Le Code de conduite reflète notre mission, notre philosophie en matière d'emploi et les résultats des discussions ...
Directory of Open Access Journals (Sweden)
Barney G. Glaser, PhD, Hon PhD
2016-12-01
Full Text Available Open coding is a big source of descriptions that must be managed and controlled when doing GT research. The goal of generating a GT is to generate an emergent set of concepts and their properties that fit and work with relevancy to be integrated into a theory. To achieve this goal, the researcher begins his research with open coding, that is coding all his data in every possible way. The consequence of this open coding is a multitude of descriptions for possible concepts that often do not fit in the emerging theory. Thus in this case the researcher ends up with many irrelevant descriptions for concepts that do not apply. To dwell on descriptions for inapplicable concepts ruins the GT theory as it starts. It is hard to stop. Confusion easily sets in. Switching the study to a QDA is a simple rescue. Rigorous focusing on emerging concepts is vital before being lost in open coding descriptions. It is important, no matter how interesting the description may become. Once a core is possible, selective coding can start which will help control against being lost in multiple descriptions.
Performance analysis of simultaneous dense coding protocol under decoherence
Huang, Zhiming; Zhang, Cai; Situ, Haozhen
2017-09-01
The simultaneous dense coding (SDC) protocol is useful in designing quantum protocols. We analyze the performance of the SDC protocol under the influence of noisy quantum channels. Six kinds of paradigmatic Markovian noise along with one kind of non-Markovian noise are considered. The joint success probability of both receivers and the success probabilities of one receiver are calculated for three different locking operators. Some interesting properties have been found, such as invariance and symmetry. Among the three locking operators we consider, the SWAP gate is most resistant to noise and results in the same success probabilities for both receivers.
Long-distance quantum communication. Decoherence-avoiding mechanisms
Energy Technology Data Exchange (ETDEWEB)
Kolb Bernardes, Nadja
2012-12-17
combating photon losses in the channel using repetition codes, as well as for suppressing the e ect of finite memory decoherence times and imperfect two-qubit gates. In the latter case, we shall also use codes more complex than the repetition codes, namely, the Calderbank-Shor-Steane codes. Finally, in the context of Quantum Key Distribution, we analyze the secret key rates obtainable by the hybrid repeater utilizing the formalism derived for the entanglement generation rate analysis.
Nesvizhevsky, Valery
2015-01-01
This unique book demonstrates the undivided unity and infinite diversity of quantum mechanics using a single phenomenon: quantum bounces of ultra-cold particles. Various examples of such "quantum bounces" are: gravitational quantum states of ultra-cold neutrons (the first observed quantum states of matter in a gravitational field), the neutron whispering gallery (an observed matter-wave analog of the whispering gallery effect well known in acoustics and for electromagnetic waves), and gravitational and whispering gallery states for anti-matter atoms that remain to be observed. These quantum states are an invaluable tool in the search for additional fundamental short-range forces, for exploring the gravitational interaction and quantum effects of gravity, for probing physics beyond the standard model, and for furthering studies into the foundations of quantum mechanics, quantum optics, and surface science.
Quantum information and coherence
Öhberg, Patrik
2014-01-01
This book offers an introduction to ten key topics in quantum information science and quantum coherent phenomena, aimed at graduate-student level. The chapters cover some of the most recent developments in this dynamic research field where theoretical and experimental physics, combined with computer science, provide a fascinating arena for groundbreaking new concepts in information processing. The book addresses both the theoretical and experimental aspects of the subject, and clearly demonstrates how progress in experimental techniques has stimulated a great deal of theoretical effort and vice versa. Experiments are shifting from simply preparing and measuring quantum states to controlling and manipulating them, and the book outlines how the first real applications, notably quantum key distribution for secure communication, are starting to emerge. The chapters cover quantum retrodiction, ultracold quantum gases in optical lattices, optomechanics, quantum algorithms, quantum key distribution, quantum cont...
Interfacing external quantum devices to a universal quantum computer.
Directory of Open Access Journals (Sweden)
Antonio A Lagana
Full Text Available We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer.
Interfacing external quantum devices to a universal quantum computer.
Lagana, Antonio A; Lohe, Max A; von Smekal, Lorenz
2011-01-01
We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer. © 2011 Lagana et al.
Tang, Jiang
2012-09-12
Colloidal quantum dot solids combine convenient solution-processing with quantum size effect tuning, offering avenues to high-efficiency multijunction cells based on a single materials synthesis and processing platform. The highest-performing colloidal quantum dot rectifying devices reported to date have relied on a junction between a quantum-tuned absorber and a bulk material (e.g., TiO 2); however, quantum tuning of the absorber then requires complete redesign of the bulk acceptor, compromising the benefits of facile quantum tuning. Here we report rectifying junctions constructed entirely using inherently band-aligned quantum-tuned materials. Realizing these quantum junction diodes relied upon the creation of an n-type quantum dot solid having a clean bandgap. We combine stable, chemically compatible, high-performance n-type and p-type materials to create the first quantum junction solar cells. We present a family of photovoltaic devices having widely tuned bandgaps of 0.6-1.6 eV that excel where conventional quantum-to-bulk devices fail to perform. Devices having optimal single-junction bandgaps exhibit certified AM1.5 solar power conversion efficiencies of 5.4%. Control over doping in quantum solids, and the successful integration of these materials to form stable quantum junctions, offers a powerful new degree of freedom to colloidal quantum dot optoelectronics. © 2012 American Chemical Society.
TRIQS: A toolbox for research on interacting quantum systems
Parcollet, Olivier; Ferrero, Michel; Ayral, Thomas; Hafermann, Hartmut; Krivenko, Igor; Messio, Laura; Seth, Priyanka
2015-11-01
We present the TRIQS library, a Toolbox for Research on Interacting Quantum Systems. It is an open-source, computational physics library providing a framework for the quick development of applications in the field of many-body quantum physics, and in particular, strongly-correlated electronic systems. It supplies components to develop codes in a modern, concise and efficient way: e.g. Green's function containers, a generic Monte Carlo class, and simple interfaces to HDF5. TRIQS is a C++/Python library that can be used from either language. It is distributed under the GNU General Public License (GPLv3). State-of-the-art applications based on the library, such as modern quantum many-body solvers and interfaces between density-functional-theory codes and dynamical mean-field theory (DMFT) codes are distributed along with it.
Quantum thermodynamics of general quantum processes.
Binder, Felix; Vinjanampathy, Sai; Modi, Kavan; Goold, John
2015-03-01
Accurately describing work extraction from a quantum system is a central objective for the extension of thermodynamics to individual quantum systems. The concepts of work and heat are surprisingly subtle when generalizations are made to arbitrary quantum states. We formulate an operational thermodynamics suitable for application to an open quantum system undergoing quantum evolution under a general quantum process by which we mean a completely positive and trace-preserving map. We derive an operational first law of thermodynamics for such processes and show consistency with the second law. We show that heat, from the first law, is positive when the input state of the map majorizes the output state. Moreover, the change in entropy is also positive for the same majorization condition. This makes a strong connection between the two operational laws of thermodynamics.
Quantum teleportation of propagating quantum microwaves
Energy Technology Data Exchange (ETDEWEB)
Di Candia, R.; Felicetti, S.; Sanz, M. [University of the Basque Country UPV/EHU, Department of Physical Chemistry, Bilbao (Spain); Fedorov, K.G.; Menzel, E.P. [Bayerische Akademie der Wissenschaften, Walther-Meissner-Institut, Garching (Germany); Technische Universitaet Muenchen, Physik-Department, Garching (Germany); Zhong, L.; Deppe, F.; Gross, R. [Bayerische Akademie der Wissenschaften, Walther-Meissner-Institut, Garching (Germany); Technische Universitaet Muenchen, Physik-Department, Garching (Germany); Nanosystems Initiative Munich (NIM), Muenchen (Germany); Marx, A. [Bayerische Akademie der Wissenschaften, Walther-Meissner-Institut, Garching (Germany); Solano, E. [University of the Basque Country UPV/EHU, Department of Physical Chemistry, Bilbao (Spain); Basque Foundation for Science, IKERBASQUE, Bilbao (Spain)
2015-12-15
Propagating quantum microwaves have been proposed and successfully implemented to generate entanglement, thereby establishing a promising platform for the realisation of a quantum communication channel. However, the implementation of quantum teleportation with photons in the microwave regime is still absent. At the same time, recent developments in the field show that this key protocol could be feasible with current technology, which would pave the way to boost the field of microwave quantum communication. Here, we discuss the feasibility of a possible implementation of microwave quantum teleportation in a realistic scenario with losses. Furthermore, we propose how to implement quantum repeaters in the microwave regime without using photodetection, a key prerequisite to achieve long distance entanglement distribution. (orig.)
Scan Quantum Mechanics: Quantum Inertia Stops Superposition
Gato-Rivera, Beatriz
2015-01-01
A novel interpretation of the quantum mechanical superposition is put forward. Quantum systems scan all possible available states and switch randomly and very rapidly among them. The longer they remain in a given state, the larger the probability of the system to be found in that state during a measurement. A crucial property that we postulate is quantum inertia, that increases whenever a constituent is added, or the system is perturbed with all kinds of interactions. Once the quantum inertia $I_q$ reaches a critical value $I_{cr}$ for an observable, the switching among the different eigenvalues of that observable stops and the corresponding superposition comes to an end. Consequently, increasing the mass, temperature, gravitational force, etc. of a quantum system increases its quantum inertia until the superposition of states disappears for all the observables and the system transmutes into a classical one. The process could be reversible decreasing the size, temperature, gravitational force, etc. leading to...
Transcending binary logic by gating three coupled quantum dots.
Klein, Michael; Rogge, S; Remacle, F; Levine, R D
2007-09-01
Physical considerations supported by numerical solution of the quantum dynamics including electron repulsion show that three weakly coupled quantum dots can robustly execute a complete set of logic gates for computing using three valued inputs and outputs. Input is coded as gating (up, unchanged, or down) of the terminal dots. A nanosecond time scale switching of the gate voltage requires careful numerical propagation of the dynamics. Readout is the charge (0, 1, or 2 electrons) on the central dot.
A simple quantum channel having superadditivity of channel capacity
Sasaki, Masahide; Kato, Kentaro; Izutsu, Masayuki; Hirota, Osamu
1997-01-01
When classical information is sent through a quantum channel of nonorthogonal states, there is a possibility that transmittable classical information exceeds a channel capacity in a single use of the initial channel by extending it into multi-product channel. In this paper, it is shown that this remarkable feature of a quantum channel, so-called superadditivity, appears even in as low as the third extended coding of the simplest binary input channel. A physical implementation of this channel ...
What is really "quantum" in quantum theory?
Khrennikov, Andrei
2003-01-01
By analysing probabilistic foundations of quantum theory we understood that the so called quantum calculus of probabilities (including Born's rule) is not the main distinguishing feature of "quantum". This calculus is just a special variant of a contextual probabilistic calculus. In particular, we analysed the EPR-Bohm-Bell approach by using contextual probabilistic models (e.g., the frequency von Mises model). It is demonstrated that the EPR-Bohm-Bell consideration are not so much about "qua...
Bernstein, Daniel J.; Lange, Tanja
2017-09-01
Cryptography is essential for the security of online communication, cars and implanted medical devices. However, many commonly used cryptosystems will be completely broken once large quantum computers exist. Post-quantum cryptography is cryptography under the assumption that the attacker has a large quantum computer; post-quantum cryptosystems strive to remain secure even in this scenario. This relatively young research area has seen some successes in identifying mathematical operations for which quantum algorithms offer little advantage in speed, and then building cryptographic systems around those. The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence.
Counterfactual quantum cryptography.
Noh, Tae-Gon
2009-12-04
Quantum cryptography allows one to distribute a secret key between two remote parties using the fundamental principles of quantum mechanics. The well-known established paradigm for the quantum key distribution relies on the actual transmission of signal particle through a quantum channel. In this Letter, we show that the task of a secret key distribution can be accomplished even though a particle carrying secret information is not in fact transmitted through the quantum channel. The proposed protocols can be implemented with current technologies and provide practical security advantages by eliminating the possibility that an eavesdropper can directly access the entire quantum system of each signal particle.
Dür, Wolfgang; Lamprecht, Raphael; Heusler, Stefan
2017-07-01
A long-range quantum communication network is among the most promising applications of emerging quantum technologies. We discuss the potential of such a quantum internet for the secure transmission of classical and quantum information, as well as theoretical and experimental approaches and recent advances to realize them. We illustrate the involved concepts such as error correction, teleportation or quantum repeaters and consider an approach to this topic based on catchy visualizations as a context-based, modern treatment of quantum theory at high school.
DEFF Research Database (Denmark)
Leosson, Kristjan
1999-01-01
Semiconductor quantum dots ("solid state atoms") are promising candidates for quantum computers and future electronic and optoelectronic devices. Quantum dots are zero-dimensional electronic systems and therefore have discrete energy levels, similar to atoms or molecules. The size distribution...... of quantum dots, however, results in a large inhomogeneous broadening of quantum dot spectra.Work on self-assembled InGaAs/GaAs quantum dots will be presented. Properties of atom-like single-dots states are investigated optically using high spatial and spectral resolution. Single-dot spectra can be used...
DEFF Research Database (Denmark)
Leosson, Kristjan
Semiconductor quantum dots ("solid-state atoms") are promising candidates for quantum computers and future electronic and optoelectronic devices. Quantum dots are zero-dimensional electronic systems and therefore have discrete energy levels, similar to atoms or molecules. The size distribution...... of quantum dots, however, results in a large inhomogeneous broadening of quantum dot spectra. Work on self-assembled InGaAs/GaAs quantum dots will be presented. Properties of atom-like single-dot states are investigated optically using high spatial and spectral resolution. Single-dot spectra can be used...
Weisz, E; Choi, H K; Sivan, I; Heiblum, M; Gefen, Y; Mahalu, D; Umansky, V
2014-06-20
The quantum eraser is a device that illustrates the quantum principle of complementarity and shows how a dephased system can regain its lost quantum behavior by erasing the "which-path" information already obtained about it. Thus far, quantum erasers were constructed predominantly in optical systems. Here, we present a realization of a quantum eraser in a mesoscopic electronic device. The use of interacting electrons, instead of noninteracting photons, allows control over the extracted information and a smooth variation of the degree of quantum erasure. The demonstrated system can serve as a first step toward a variety of more complex setups. Copyright © 2014, American Association for the Advancement of Science.
Principles of quantum chemistry
George, David V
2013-01-01
Principles of Quantum Chemistry focuses on the application of quantum mechanics in physical models and experiments of chemical systems.This book describes chemical bonding and its two specific problems - bonding in complexes and in conjugated organic molecules. The very basic theory of spectroscopy is also considered. Other topics include the early development of quantum theory; particle-in-a-box; general formulation of the theory of quantum mechanics; and treatment of angular momentum in quantum mechanics. The examples of solutions of Schroedinger equations; approximation methods in quantum c
Introduction to quantum computers
Berman, Gennady P; Mainieri, Ronnie; Tsifrinovich, Vladimir I
1998-01-01
Quantum computing promises to solve problems which are intractable on digital computers. Highly parallel quantum algorithms can decrease the computational time for some problems by many orders of magnitude. This important book explains how quantum computers can do these amazing things. Several algorithms are illustrated: the discrete Fourier transform, Shorâ€™s algorithm for prime factorization; algorithms for quantum logic gates; physical implementations of quantum logic gates in ion traps and in spin chains; the simplest schemes for quantum error correction; correction of errors caused by im
Fomin, Vladimir M
2013-01-01
This book deals with a new class of materials, quantum rings. Innovative recent advances in experimental and theoretical physics of quantum rings are based on the most advanced state-of-the-art fabrication and characterization techniques as well as theoretical methods. The experimental efforts allow to obtain a new class of semiconductor quantum rings formed by capping self-organized quantum dots grown by molecular beam epitaxy. Novel optical and magnetic properties of quantum rings are associated with non-trivial topologies at the nanoscale. An adequate characterization of quantum rings is po
Lan, S-Y; Radnaev, A G; Collins, O A; Matsukevich, D N; Kennedy, T A; Kuzmich, A
2009-08-03
A quantum repeater is a system for long-distance quantum communication that employs quantum memory elements to mitigate optical fiber transmission losses. The multiplexed quantum memory (O. A. Collins, S. D. Jenkins, A. Kuzmich, and T. A. B. Kennedy, Phys. Rev. Lett. 98, 060502 (2007)) has been shown theoretically to reduce quantum memory time requirements. We present an initial implementation of a multiplexed quantum memory element in a cold rubidium gas. We show that it is possible to create atomic excitations in arbitrary memory element pairs and demonstrate the violation of Bell's inequality for light fields generated during the write and read processes.
Schaden, Martin
2002-12-01
Quantum theory is used to model secondary financial markets. Contrary to stochastic descriptions, the formalism emphasizes the importance of trading in determining the value of a security. All possible realizations of investors holding securities and cash is taken as the basis of the Hilbert space of market states. The temporal evolution of an isolated market is unitary in this space. Linear operators representing basic financial transactions such as cash transfer and the buying or selling of securities are constructed and simple model Hamiltonians that generate the temporal evolution due to cash flows and the trading of securities are proposed. The Hamiltonian describing financial transactions becomes local when the profit/loss from trading is small compared to the turnover. This approximation may describe a highly liquid and efficient stock market. The lognormal probability distribution for the price of a stock with a variance that is proportional to the elapsed time is reproduced for an equilibrium market. The asymptotic volatility of a stock in this case is related to the long-term probability that it is traded.
CERN Bulletin
2010-01-01
The turn of the XXth century witnessed a revolution in physics comparable to Isaac Newton’s discovery of the universal laws of mechanics and of gravitation three centuries earlier. The world required to be described in novel terms, as the immutable, deterministic view of our familiar universe had given way to a new world picture, one which featured chance, flux, and an incessant upsurge of waves of matter. Such a worldview was so radically new and counterintuitive that it gave rise to strong debates, to the effect that Albert Einstein himself tried to oppose it on the grounds that “God does not play dice”. In spite of the intense debates that accompanied its emergence, quantum mechanics quickly proved an incredibly efficacious new tool to understand and to predict a wide array of new phenomena. It was so successful that in no time it broke free from the environment of research labs to become part of daily life, making it possible, for example, to understand why some materials...
Quantum arithmetic with the quantum Fourier transform
Ruiz-Perez, Lidia; Garcia-Escartin, Juan Carlos
2017-06-01
The quantum Fourier transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing quantum Fourier transform adders and multipliers and comment some simple variations that extend their capabilities. These modified circuits can perform modular and non-modular arithmetic operations and work with signed integers. Among the operations, we discuss a quantum method to compute the weighted average of a series of inputs in the transform domain. One of the circuits, the controlled weighted sum, can be interpreted as a circuit to compute the inner product of two data vectors.
Aggregating quantum repeaters for the quantum internet
Azuma, Koji; Kato, Go
2017-09-01
The quantum internet holds promise for accomplishing quantum teleportation and unconditionally secure communication freely between arbitrary clients all over the globe, as well as the simulation of quantum many-body systems. For such a quantum internet protocol, a general fundamental upper bound on the obtainable entanglement or secret key has been derived [K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016), 10.1038/ncomms13523]. Here we consider its converse problem. In particular, we present a universal protocol constructible from any given quantum network, which is based on running quantum repeater schemes in parallel over the network. For arbitrary lossy optical channel networks, our protocol has no scaling gap with the upper bound, even based on existing quantum repeater schemes. In an asymptotic limit, our protocol works as an optimal entanglement or secret-key distribution over any quantum network composed of practical channels such as erasure channels, dephasing channels, bosonic quantum amplifier channels, and lossy optical channels.
Quantum Darwinism in Quantum Brownian Motion
Blume-Kohout, Robin; Zurek, Wojciech H.
2008-12-01
Quantum Darwinism—the redundant encoding of information about a decohering system in its environment—was proposed to reconcile the quantum nature of our Universe with apparent classicality. We report the first study of the dynamics of quantum Darwinism in a realistic model of decoherence, quantum Brownian motion. Prepared in a highly squeezed state—a macroscopic superposition—the system leaves records whose redundancy increases rapidly with initial delocalization. Redundancy appears rapidly (on the decoherence time scale) and persists for a long time.
Quantum neuromorphic hardware for quantum artificial intelligence
Prati, Enrico
2017-08-01
The development of machine learning methods based on deep learning boosted the field of artificial intelligence towards unprecedented achievements and application in several fields. Such prominent results were made in parallel with the first successful demonstrations of fault tolerant hardware for quantum information processing. To which extent deep learning can take advantage of the existence of a hardware based on qubits behaving as a universal quantum computer is an open question under investigation. Here I review the convergence between the two fields towards implementation of advanced quantum algorithms, including quantum deep learning.
Quantifying quantum coherence with quantum Fisher information.
Feng, X N; Wei, L F
2017-11-14
Quantum coherence is one of the old but always important concepts in quantum mechanics, and now it has been regarded as a necessary resource for quantum information processing and quantum metrology. However, the question of how to quantify the quantum coherence has just been paid the attention recently (see, e.g., Baumgratz et al. PRL, 113. 140401 (2014)). In this paper we verify that the well-known quantum Fisher information (QFI) can be utilized to quantify the quantum coherence, as it satisfies the monotonicity under the typical incoherent operations and the convexity under the mixing of the quantum states. Differing from most of the pure axiomatic methods, quantifying quantum coherence by QFI could be experimentally testable, as the bound of the QFI is practically measurable. The validity of our proposal is specifically demonstrated with the typical phase-damping and depolarizing evolution processes of a generic single-qubit state, and also by comparing it with the other quantifying methods proposed previously.
Quantum dots for quantum information technologies
2017-01-01
This book highlights the most recent developments in quantum dot spin physics and the generation of deterministic superior non-classical light states with quantum dots. In particular, it addresses single quantum dot spin manipulation, spin-photon entanglement and the generation of single-photon and entangled photon pair states with nearly ideal properties. The role of semiconductor microcavities, nanophotonic interfaces as well as quantum photonic integrated circuits is emphasized. The latest theoretical and experimental studies of phonon-dressed light matter interaction, single-dot lasing and resonance fluorescence in QD cavity systems are also provided. The book is written by the leading experts in the field.
Three new physics realizations of the genetic code and the role of dark matter in bio-systems
Pitkänen, Matti
2010-01-01
TGD inspired quantum biology leads naturally to the idea that several realizations of genetic code exist. Besides the realizations based on temporal patterns of electromagnetic elds I have considered three dierent new physics realizations of the genetic code based the notions of many- sheeted space-time, magnetic body, and the hierarchy of Planck constants explaining dark matter in TGD framework. 1. The rst realization - proposed in the model for DNA as topological quantum comp...
Directory of Open Access Journals (Sweden)
Rumen Daskalov
2017-07-01
Full Text Available Let an $[n,k,d]_q$ code be a linear code of length $n$, dimension $k$ and minimum Hamming distance $d$ over $GF(q$. One of the most important problems in coding theory is to construct codes with optimal minimum distances. In this paper 22 new ternary linear codes are presented. Two of them are optimal. All new codes improve the respective lower bounds in [11].
Black Holes, Holography, and Quantum Error Correction
CERN. Geneva
2017-01-01
How can it be that a local quantum field theory in some number of spacetime dimensions can "fake" a local gravitational theory in a higher number of dimensions? How can the Ryu-Takayanagi Formula say that an entropy is equal to the expectation value of a local operator? Why do such things happen only in gravitational theories? In this talk I will explain how a new interpretation of the AdS/CFT correspondence as a quantum error correcting code provides satisfying answers to these questions, and more generally gives a natural way of generating simple models of the correspondence. No familiarity with AdS/CFT or quantum error correction is assumed, but the former would still be helpful.
Kendon, Vivien M; Nemoto, Kae; Munro, William J
2010-08-13
We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.
Hoerth, Matthew T; Drazkowski, Joseph F; Noe, Katherine H; Sirven, Joseph I
2011-06-01
Eyewitnesses frequently perceive seizures as life threatening. If an event occurs on the hospital premises, a "code blue" can be called which consumes considerable resources. The purpose of this study was to determine the frequency and characteristics of code blue calls for seizures and seizure mimickers. A retrospective review of a code blue log from 2001 through 2008 identified 50 seizure-like events, representing 5.3% of all codes. Twenty-eight (54%) occurred in inpatients; the other 22 (44%) events involved visitors or employees on the hospital premises. Eighty-six percent of the events were epileptic seizures. Seizure mimickers, particularly psychogenic nonepileptic seizures, were more common in the nonhospitalized group. Only five (17.9%) inpatients had a known diagnosis of epilepsy, compared with 17 (77.3%) of the nonhospitalized patients. This retrospective survey provides insights into how code blues are called on hospitalized versus nonhospitalized patients for seizure-like events. Copyright © 2011. Published by Elsevier Inc.
Noble, Viveca K.
1993-11-01
There are various elements such as radio frequency interference (RFI) which may induce errors in data being transmitted via a satellite communication link. When a transmission is affected by interference or other error-causing elements, the transmitted data becomes indecipherable. It becomes necessary to implement techniques to recover from these disturbances. The objective of this research is to develop software which simulates error control circuits and evaluate the performance of these modules in various bit error rate environments. The results of the evaluation provide the engineer with information which helps determine the optimal error control scheme. The Consultative Committee for Space Data Systems (CCSDS) recommends the use of Reed-Solomon (RS) and convolutional encoders and Viterbi and RS decoders for error correction. The use of forward error correction techniques greatly reduces the received signal to noise needed for a certain desired bit error rate. The use of concatenated coding, e.g. inner convolutional code and outer RS code, provides even greater coding gain. The 16-bit cyclic redundancy check (CRC) code is recommended by CCSDS for error detection.
DEFF Research Database (Denmark)
Beelen, Peter; Puchinger, Sven; Rosenkilde ne Nielsen, Johan
2017-01-01
We present a new general construction of MDS codes over a finite field Fq. We describe two explicit subclasses which contain new MDS codes of length at least q/2 for all values of q ≥ 11. Moreover, we show that most of the new codes are not equivalent to a Reed-Solomon code.......We present a new general construction of MDS codes over a finite field Fq. We describe two explicit subclasses which contain new MDS codes of length at least q/2 for all values of q ≥ 11. Moreover, we show that most of the new codes are not equivalent to a Reed-Solomon code....
Optical coding theory with Prime
Kwong, Wing C
2013-01-01
Although several books cover the coding theory of wireless communications and the hardware technologies and coding techniques of optical CDMA, no book has been specifically dedicated to optical coding theory-until now. Written by renowned authorities in the field, Optical Coding Theory with Prime gathers together in one volume the fundamentals and developments of optical coding theory, with a focus on families of prime codes, supplemented with several families of non-prime codes. The book also explores potential applications to coding-based optical systems and networks. Learn How to Construct
Manufacturer Identification Code (MID) - ACE
Department of Homeland Security — The ACE Manufacturer Identification Code (MID) application is used to track and control identifications codes for manufacturers. A manufacturer is identified on an...
Algebraic and stochastic coding theory
Kythe, Dave K
2012-01-01
Using a simple yet rigorous approach, Algebraic and Stochastic Coding Theory makes the subject of coding theory easy to understand for readers with a thorough knowledge of digital arithmetic, Boolean and modern algebra, and probability theory. It explains the underlying principles of coding theory and offers a clear, detailed description of each code. More advanced readers will appreciate its coverage of recent developments in coding theory and stochastic processes. After a brief review of coding history and Boolean algebra, the book introduces linear codes, including Hamming and Golay codes.
Speech coding code- excited linear prediction
Bäckström, Tom
2017-01-01
This book provides scientific understanding of the most central techniques used in speech coding both for advanced students as well as professionals with a background in speech audio and or digital signal processing. It provides a clear connection between the whys hows and whats thus enabling a clear view of the necessity purpose and solutions provided by various tools as well as their strengths and weaknesses in each respect Equivalently this book sheds light on the following perspectives for each technology presented Objective What do we want to achieve and especially why is this goal important Resource Information What information is available and how can it be useful and Resource Platform What kind of platforms are we working with and what are their capabilities restrictions This includes computational memory and acoustic properties and the transmission capacity of devices used. The book goes on to address Solutions Which solutions have been proposed and how can they be used to reach the stated goals and ...
Blueprint for a microwave trapped ion quantum computer
Lekitsch, Bjoern; Weidt, Sebastian; Fowler, Austin G.; Mølmer, Klaus; Devitt, Simon J.; Wunderlich, Christof; Hensinger, Winfried K.
2017-01-01
The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion–based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation–based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error–threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects. PMID:28164154
Blueprint for a microwave trapped ion quantum computer.
Lekitsch, Bjoern; Weidt, Sebastian; Fowler, Austin G; Mølmer, Klaus; Devitt, Simon J; Wunderlich, Christof; Hensinger, Winfried K
2017-02-01
The availability of a universal quantum computer may have a fundamental impact on a vast number of research fields and on society as a whole. An increasingly large scientific and industrial community is working toward the realization of such a device. An arbitrarily large quantum computer may best be constructed using a modular approach. We present a blueprint for a trapped ion-based scalable quantum computer module, making it possible to create a scalable quantum computer architecture based on long-wavelength radiation quantum gates. The modules control all operations as stand-alone units, are constructed using silicon microfabrication techniques, and are within reach of current technology. To perform the required quantum computations, the modules make use of long-wavelength radiation-based quantum gate technology. To scale this microwave quantum computer architecture to a large size, we present a fully scalable design that makes use of ion transport between different modules, thereby allowing arbitrarily many modules to be connected to construct a large-scale device. A high error-threshold surface error correction code can be implemented in the proposed architecture to execute fault-tolerant operations. With appropriate adjustments, the proposed modules are also suitable for alternative trapped ion quantum computer architectures, such as schemes using photonic interconnects.
Bacon-Shor code with continuous measurement of noncommuting operators
Atalaya, Juan; Bahrami, Mohammad; Pryadko, Leonid P.; Korotkov, Alexander N.
2017-03-01
We analyze the operation of a four-qubit Bacon-Shor code with simultaneous continuous measurement of noncommuting gauge operators. The error syndrome in this case is monitored via time-averaged cross-correlators of the output signals. We find the logical error rate for several models of decoherence, and also find the termination rate for this quantum error detecting code. The code operation is comparable to that based on projective measurements when the collapse time scale due to continuous measurements is an order of magnitude less than the time period between the projective measurements. An advantage of the continuous-measurement implementation is the absence of time dependence in the code operation, with passive continuous monitoring of the error syndrome.
A new QMD code for heavy-ion collisions
Kim, Kyungil; Kim, Youngman; Lee, Kang Seog
2017-11-01
We develop a new quantum molecular dynamics (QMD) type nuclear transport code to simulate heavy-ion collisions for RAON, a new accelerator complex under construction in Korea. At RAON, the rare isotope beams with energies from a few MeV/n to a few hundreds MeV/n will be utilized. QMD is one of the widely used theoretical methods and is useful for both theoretical and experimental purposes. We describe our QMD model with the numerical realization. The validity of the code is tested by comparing our simulation results with experimental data and also results from other transport codes in 197Au+197Au collisions at Elab = 90 - 120 MeV/n. Finally, we present a brief discussion on applicability and outlook of our code.
Djordjevic, Ivan B
2010-04-12
The Bell states preparation circuit is a basic circuit required in quantum teleportation. We describe how to implement it in all-fiber technology. The basic building blocks for its implementation are directional couplers and highly nonlinear optical fiber (HNLF). Because the quantum information processing is based on delicate superposition states, it is sensitive to quantum errors. In order to enable fault-tolerant quantum computing the use of quantum error correction is unavoidable. We show how to implement in all-fiber technology encoders and decoders for sparse-graph quantum codes, and provide an illustrative example to demonstrate this implementation. We also show that arbitrary set of universal quantum gates can be implemented based on directional couplers and HNLFs.
Entanglement renormalization, quantum error correction, and bulk causality
Energy Technology Data Exchange (ETDEWEB)
Kim, Isaac H. [IBM T.J. Watson Research Center,1101 Kitchawan Rd., Yorktown Heights, NY (United States); Kastoryano, Michael J. [NBIA, Niels Bohr Institute, University of Copenhagen, Blegdamsvej 17, 2100 Copenhagen (Denmark)
2017-04-07
Entanglement renormalization can be viewed as an encoding circuit for a family of approximate quantum error correcting codes. The logical information becomes progressively more well-protected against erasure errors at larger length scales. In particular, an approximate variant of holographic quantum error correcting code emerges at low energy for critical systems. This implies that two operators that are largely separated in scales behave as if they are spatially separated operators, in the sense that they obey a Lieb-Robinson type locality bound under a time evolution generated by a local Hamiltonian.
Experimental quantum compressed sensing for a seven-qubit system
Riofrío, C. A.; Gross, D.; Flammia, S. T.; Monz, T.; Nigg, D.; Blatt, R.; Eisert, J.
2017-05-01
Well-controlled quantum devices with their increasing system size face a new roadblock hindering further development of quantum technologies. The effort of quantum tomography--the reconstruction of states and processes of a quantum device--scales unfavourably: state-of-the-art systems can no longer be characterized. Quantum compressed sensing mitigates this problem by reconstructing states from incomplete data. Here we present an experimental implementation of compressed tomography of a seven-qubit system--a topological colour code prepared in a trapped ion architecture. We are in the highly incomplete--127 Pauli basis measurement settings--and highly noisy--100 repetitions each--regime. Originally, compressed sensing was advocated for states with few non-zero eigenvalues. We argue that low-rank estimates are appropriate in general since statistical noise enables reliable reconstruction of only the leading eigenvectors. The remaining eigenvectors behave consistently with a random-matrix model that carries no information about the true state.
Classical and quantum computing with C++ and Java simulations
Hardy, Y
2001-01-01
Classical and Quantum computing provides a self-contained, systematic and comprehensive introduction to all the subjects and techniques important in scientific computing. The style and presentation are readily accessible to undergraduates and graduates. A large number of examples, accompanied by complete C++ and Java code wherever possible, cover every topic. Features and benefits: - Comprehensive coverage of the theory with many examples - Topics in classical computing include boolean algebra, gates, circuits, latches, error detection and correction, neural networks, Turing machines, cryptography, genetic algorithms - For the first time, genetic expression programming is presented in a textbook - Topics in quantum computing include mathematical foundations, quantum algorithms, quantum information theory, hardware used in quantum computing This book serves as a textbook for courses in scientific computing and is also very suitable for self-study. Students, professionals and practitioners in computer...
Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates.
Bravyi, Sergey; Gosset, David
2016-06-24
We present a new algorithm for classical simulation of quantum circuits over the Clifford+T gate set. The runtime of the algorithm is polynomial in the number of qubits and the number of Clifford gates in the circuit but exponential in the number of T gates. The exponential scaling is sufficiently mild that the algorithm can be used in practice to simulate medium-sized quantum circuits dominated by Clifford gates. The first demonstrations of fault-tolerant quantum circuits based on 2D topological codes are likely to be dominated by Clifford gates due to a high implementation cost associated with logical T gates. Thus our algorithm may serve as a verification tool for near-term quantum computers which cannot in practice be simulated by other means. To demonstrate the power of the new method, we performed a classical simulation of a hidden shift quantum algorithm with 40 qubits, a few hundred Clifford gates, and nearly 50 T gates.
Vaucouleur, Sebastien
2011-02-01
We introduce code query by example for customisation of evolvable software products in general and of enterprise resource planning systems (ERPs) in particular. The concept is based on an initial empirical study on practices around ERP systems. We motivate our design choices based on those empirical results, and we show how the proposed solution helps with respect to the infamous upgrade problem: the conflict between the need for customisation and the need for upgrade of ERP systems. We further show how code query by example can be used as a form of lightweight static analysis, to detect automatically potential defects in large software products. Code query by example as a form of lightweight static analysis is particularly interesting in the context of ERP systems: it is often the case that programmers working in this field are not computer science specialists but more of domain experts. Hence, they require a simple language to express custom rules.
Synthesis of Arbitrary Quantum Circuits to Topological Assembly.
Paler, Alexandru; Devitt, Simon J; Fowler, Austin G
2016-08-02
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step towards this goal, focusing on generating correct and simple arrangements of topological structures that correspond to a given quantum circuit and largely neglecting their efficiency. We detail the many challenges that will need to be tackled in the pursuit of efficiency. The software source code can be consulted at https://github.com/alexandrupaler/tqec.
Federal Laboratory Consortium — The Joint Quantum Institute (JQI) is pursuing that goal through the work of leading quantum scientists from the Department of Physics of the University of Maryland...
National Research Council Canada - National Science Library
Jeremy L. O'Brien
2007-01-01
In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors...
Meystre, Pierre
2007-01-01
Elements of Quantum Optics gives a self-contained and broad coverage of the basic elements necessary to understand and carry out research in laser physics and quantum optics, including a review of basic quantum mechanics and pedagogical introductions to system-reservoir interactions and to second quantization. The text reveals the close connection between many seemingly unrelated topics, such as probe absorption, four-wave mixing, optical instabilities, resonance fluorescence and squeezing. It also comprises discussions of cavity quantum electrodynamics and atom optics. The 4th edition includes a new chapter on quantum entanglement and quantum information, as well as added discussions of the quantum beam splitter, electromagnetically induced transparency, slow light, and the input-output formalism needed to understand many problems in quantum optics. It also provides an expanded treatment of the minimum-coupling Hamiltonian and a simple derivation of the Gross-Pitaevskii equation, an important gateway to rese...
Quantum engineering: Diamond envy
Nunn, Joshua
2013-03-01
Nitrogen atoms trapped tens of nanometres apart in diamond can now be linked by quantum entanglement. This ability to produce and control entanglement in solid systems could enable powerful quantum computers.
Ahn, Doyeol
2011-01-01
A clear introduction to quantum mechanics concepts Quantum mechanics has become an essential tool for modern engineering, particularly due to the recent developments in quantum computing as well as the rapid progress in optoelectronic devices. Engineering Quantum Mechanics explains the fundamentals of this exciting field, providing broad coverage of both traditional areas such as semiconductor and laser physics as well as relatively new yet fast-growing areas such as quantum computation and quantum information technology. The book begins with basic quantum mechanics, reviewing measurements and probability, Dirac formulation, the uncertainty principle, harmonic oscillator, angular momentum eigenstates, and perturbation theory. Then, quantum statistical mechanics is explored, from second quantization and density operators to coherent and squeezed states, coherent interactions between atoms and fields, and the Jaynes-Cummings model. From there, the book moves into elementary and modern applications, discussing s...
Holzner, Steve
2013-01-01
Quantum Physics For Dummies, Revised Edition helps make quantum physics understandable and accessible. From what quantum physics can do for the world to understanding hydrogen atoms, readers will get complete coverage of the subject, along with numerous examples to help them tackle the tough equations. Compatible with classroom text books and courses, Quantum Physics For Dummies, Revised Edition lets students study at their own paces and helps them prepare for graduate or professional exams. Coverage includes: The Schrodinger Equation and its Applications The Foundations of Quantum Physics Vector Notation Spin Scattering Theory, Angular Momentum, and more From the Back Cover Your plain-English guide to understanding and working with the micro world Quantum physics -- also called quantum mechanics or quantum field theory -- can be daunting for even the most dedicated student or enthusiast of science, math, or physics. This friendly, concise guide makes this challenging subject understandable and accessible, fr...
Comparison of quantum discord and local quantum uncertainty in a vertical quantum dot
Faizi, E.; Eftekhari, H.
2014-01-01
In this paper, we consider quantum correlations (quantum discord and local quantum uncertainty) in a vertical quantum dot. Their dependencies on magnetic field and temperature are presented in detail. It is noticeable that, quantum discord and local quantum uncertainty behavior is similar to a large extent. In addition, the time evolution of quantum discord and local quantum uncertainty under dephasing and amplitude damping channels is investigated. It has been found that, for some Belldiagon...
Graph Codes with Reed-Solomon Component Codes
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn
2006-01-01
We treat a specific case of codes based on bipartite expander graphs coming from finite geometries. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in a Reed-Solomon code. We give results on the parameters of the codes...
Directory of Open Access Journals (Sweden)
. SZD-SZZ
2017-03-01
Full Text Available Te Code was approved on December 12, 1992, at the 3rd regular meeting of the General Assembly of the Medical Chamber of Slovenia and revised on April 24, 1997, at the 27th regular meeting of the General Assembly of the Medical Chamber of Slovenia. The Code was updated and harmonized with the Medical Association of Slovenia and approved on October 6, 2016, at the regular meeting of the General Assembly of the Medical Chamber of Slovenia.
DEFF Research Database (Denmark)
Fukui, Hironori; Yomo, Hironori; Popovski, Petar
2013-01-01
Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause/receive inter......Physical layer network coding (PLNC) has the potential to improve throughput of multi-hop networks. However, most of the works are focused on the simple, three-node model with two-way relaying, not taking into account the fact that there can be other neighboring nodes that can cause...
Ogunfunmi, Tokunbo
2010-01-01
It is becoming increasingly apparent that all forms of communication-including voice-will be transmitted through packet-switched networks based on the Internet Protocol (IP). Therefore, the design of modern devices that rely on speech interfaces, such as cell phones and PDAs, requires a complete and up-to-date understanding of the basics of speech coding. Outlines key signal processing algorithms used to mitigate impairments to speech quality in VoIP networksOffering a detailed yet easily accessible introduction to the field, Principles of Speech Coding provides an in-depth examination of the
Energy Technology Data Exchange (ETDEWEB)
Link, Hamilton E.; Schroeppel, Richard Crabtree; Neumann, William Douglas; Campbell, Philip LaRoche; Beaver, Cheryl Lynn; Pierson, Lyndon George; Anderson, William Erik
2004-10-01
If software is designed so that the software can issue functions that will move that software from one computing platform to another, then the software is said to be 'mobile'. There are two general areas of security problems associated with mobile code. The 'secure host' problem involves protecting the host from malicious mobile code. The 'secure mobile code' problem, on the other hand, involves protecting the code from malicious hosts. This report focuses on the latter problem. We have found three distinct camps of opinions regarding how to secure mobile code. There are those who believe special distributed hardware is necessary, those who believe special distributed software is necessary, and those who believe neither is necessary. We examine all three camps, with a focus on the third. In the distributed software camp we examine some commonly proposed techniques including Java, D'Agents and Flask. For the specialized hardware camp, we propose a cryptographic technique for 'tamper-proofing' code over a large portion of the software/hardware life cycle by careful modification of current architectures. This method culminates by decrypting/authenticating each instruction within a physically protected CPU, thereby protecting against subversion by malicious code. Our main focus is on the camp that believes that neither specialized software nor hardware is necessary. We concentrate on methods of code obfuscation to render an entire program or a data segment on which a program depends incomprehensible. The hope is to prevent or at least slow down reverse engineering efforts and to prevent goal-oriented attacks on the software and execution. The field of obfuscation is still in a state of development with the central problem being the lack of a basis for evaluating the protection schemes. We give a brief introduction to some of the main ideas in the field, followed by an in depth analysis of a technique called &apos
Directory of Open Access Journals (Sweden)
Mark Hillery
2000-07-01
Full Text Available Quantum information is stored in two-level quantum systems known as qubits. The no-cloning theorem states that the state of an unknown qubit cannot be copied. This is in contrast to classical information which can be copied. If one drops the requirement that the copies be perfect it is possible to design quantum copiers. This paper presents a short review of the theory of quantum copying.
Quantum computing and probability.
Ferry, David K
2009-11-25
Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.
Distinguishing Short Quantum Computations
Rosgen, Bill
2008-01-01
Distinguishing logarithmic depth quantum circuits on mixed states is shown to be complete for $QIP$, the class of problems having quantum interactive proof systems. Circuits in this model can represent arbitrary quantum processes, and thus this result has implications for the verification of implementations of quantum algorithms. The distinguishability problem is also complete for $QIP$ on constant depth circuits containing the unbounded fan-out gat...
Testing Nonassociative Quantum Mechanics.
Bojowald, Martin; Brahma, Suddhasattwa; Büyükçam, Umut
2015-11-27
The familiar concepts of state vectors and operators in quantum mechanics rely on associative products of observables. However, these notions do not apply to some exotic systems such as magnetic monopoles, which have long been known to lead to nonassociative algebras. Their quantum physics has remained obscure. This Letter presents the first derivation of potentially testable physical results in nonassociative quantum mechanics, based on effective potentials. They imply new effects which cannot be mimicked in usual quantum mechanics with standard magnetic fields.
1962-01-01
Quantum Theory: A Treatise in Three Volumes, I: Elements focuses on the principles, methodologies, and approaches involved in quantum theory, including quantum mechanics, linear combinations, collisions, and transitions. The selection first elaborates on the fundamental principles of quantum mechanics, exactly soluble bound state problems, and continuum. Discussions focus on delta function normalization, spherically symmetric potentials, rectangular potential wells, harmonic oscillators, spherically symmetrical potentials, Coulomb potential, axiomatic basis, consequences of first three postula
Constantinescu, Florin; Spiers, JA
1971-01-01
International Series in Natural Philosophy, Volume 30: Problems in Quantum Mechanics focuses on the processes, principles, reactions, and methodologies involved in quantum mechanics. The publication first elaborates on the mathematical formalism of quantum mechanics, simple quantum systems, and mean values and uncertainty relations. Discussions focus on mean values of dynamical variables, uncertainty relations, eigenfunctions and the energy spectrum, motion in a central field, matrix representation of vectors and operators, Hubert spaces, and operators in Hilbert space. The text then takes a l
2012-02-01
using volume holograms to construct simple optical quantum gates in centimeter- sized PTR glass. Volume holography is typically used today for 2D image...volume holograms For linear optical quantum computing the overarching advantage of constructing simple quantum gates in volume holograms , as...database (iii) the design of quantum optical gates by means of volume holography in photo-thermal refractive glass, and (iv) an investigation of
Savary, Lucile; Balents, Leon
2016-01-01
Quantum spin liquids may be considered "quantum disordered" ground states of spin systems, in which zero point fluctuations are so strong that they prevent conventional magnetic long range order. More interestingly, quantum spin liquids are prototypical examples of ground states with massive many-body entanglement, of a degree sufficient to render these states distinct phases of matter. Their highly entangled nature imbues quantum spin liquids with unique physical aspects, such as non-local e...
Quantum Hamiltonian Complexity
Gharibian, Sevag; Huang, Yichen; Landau, Zeph; Shin, Seung Woo
2014-01-01
Constraint satisfaction problems are a central pillar of modern computational complexity theory. This survey provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. Over the past decade and a half, this field has witnessed fundamental breakthroughs, ranging from the establishment of a "Quantum Cook-Levin Theorem" to deep insights into the structure of 1D low-temperature quantum systems via s...
Decoding small surface codes with feedforward neural networks
Varsamopoulos, Savvas; Criger, Ben; Bertels, Koen
2018-01-01
Surface codes reach high error thresholds when decoded with known algorithms, but the decoding time will likely exceed the available time budget, especially for near-term implementations. To decrease the decoding time, we reduce the decoding problem to a classification problem that a feedforward neural network can solve. We investigate quantum error correction and fault tolerance at small code distances using neural network-based decoders, demonstrating that the neural network can generalize to inputs that were not provided during training and that they can reach similar or better decoding performance compared to previous algorithms. We conclude by discussing the time required by a feedforward neural network decoder in hardware.
Efficient quantum circuits for Szegedy quantum walks
Loke, T.; Wang, J. B.
2017-07-01
A major advantage in using Szegedy's formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk by quantizing a Markov chain on a directed or weighted graph. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two classes of Markov chains that are amenable to this construction are cyclic permutations and complete bipartite graphs, for which we provide explicit efficient quantum circuit implementations. We also prove that our scheme can be applied to Markov chains formed by a tensor product. We also briefly discuss the implementation of Markov chains based on weighted interdependent networks. In addition, we apply this scheme to construct efficient quantum circuits simulating the Szegedy walks used in the quantum Pagerank algorithm for some classes of non-trivial graphs, providing a necessary tool for experimental demonstration of the quantum Pagerank algorithm.
Are Quantum Models for Order Effects Quantum?
Moreira, Catarina; Wichert, Andreas
2017-12-01
The application of principles of Quantum Mechanics in areas outside of physics has been getting increasing attention in the scientific community in an emergent disciplined called Quantum Cognition. These principles have been applied to explain paradoxical situations that cannot be easily explained through classical theory. In quantum probability, events are characterised by a superposition state, which is represented by a state vector in a N-dimensional vector space. The probability of an event is given by the squared magnitude of the projection of this superposition state into the desired subspace. This geometric approach is very useful to explain paradoxical findings that involve order effects, but do we really need quantum principles for models that only involve projections? This work has two main goals. First, it is still not clear in the literature if a quantum projection model has any advantage towards a classical projection. We compared both models and concluded that the Quantum Projection model achieves the same results as its classical counterpart, because the quantum interference effects play no role in the computation of the probabilities. Second, it intends to propose an alternative relativistic interpretation for rotation parameters that are involved in both classical and quantum models. In the end, instead of interpreting these parameters as a similarity measure between questions, we propose that they emerge due to the lack of knowledge concerned with a personal basis state and also due to uncertainties towards the state of world and towards the context of the questions.
Quantum cobwebs: Universal entangling of quantum states
Indian Academy of Sciences (India)
Center for Philosophy and Foundation of Science, New Delhi, India ... Introduction. Quantum entanglement is generally regarded as a very useful resource for quantum infor- mation processing [1]. It can be used for teleportation [2], ... To achieve this, we introduce a class of entangled states calledzero sum amplitude(ZSA).
A Quantum Space behind Simple Quantum Mechanics
Directory of Open Access Journals (Sweden)
Chuan Sheng Chew
2017-01-01
Full Text Available In physics, experiments ultimately inform us about what constitutes a good theoretical model of any physical concept: physical space should be no exception. The best picture of physical space in Newtonian physics is given by the configuration space of a free particle (or the center of mass of a closed system of particles. This configuration space (as well as phase space can be constructed as a representation space for the relativity symmetry. From the corresponding quantum symmetry, we illustrate the construction of a quantum configuration space, similar to that of quantum phase space, and recover the classical picture as an approximation through a contraction of the (relativity symmetry and its representations. The quantum Hilbert space reduces into a sum of one-dimensional representations for the observable algebra, with the only admissible states given by coherent states and position eigenstates for the phase and configuration space pictures, respectively. This analysis, founded firmly on known physics, provides a quantum picture of physical space beyond that of a finite-dimensional manifold and provides a crucial first link for any theoretical model of quantum space-time at levels beyond simple quantum mechanics. It also suggests looking at quantum physics from a different perspective.
Programmable quantum interference in massively multichannel networks
Wolterink, Tom
2016-01-01
Multiphoton quantum correlations are crucial for quantum information processing and quantum communication protocols in linear optical networks. For large-scale implementation of quantum information processing, such as quantum simulators, boson sampling or programmable quantum logic gates, a
Kerckhoff, Joseph; Nurdin, Hendra I; Pavlichin, Dmitri S; Mabuchi, Hideo
2010-07-23
We propose an approach to quantum error correction based on coding and continuous syndrome readout via scattering of coherent probe fields, in which the usual steps of measurement and discrete restoration are replaced by direct physical processing of the probe beams and coherent feedback to the register qubits. Our approach is well matched to physical implementations that feature solid-state qubits embedded in planar electromagnetic circuits, providing an autonomous and "on-chip" quantum memory design requiring no external clocking or control logic.
Zwanenburg, Floris Arnoud; Dzurak, Andrew S.; Morello, Andrea; Simmons, Michelle Y.; Hollenberg, Lloyd C.L.; Klimeck, Gerhard; Rogge, Sven; Coppersmith, Susan N.; Eriksson, Mark A.
2013-01-01
This review describes recent groundbreaking results in Si, Si=SiGe, and dopant-based quantum dots, and it highlights the remarkable advances in Si-based quantum physics that have occurred in the past few years. This progress has been possible thanks to materials development of Si quantum devices,
Iqbal, A.; Toor, A. H.
2002-03-01
We investigate the role of quantum mechanical effects in the central stability concept of evolutionary game theory, i.e., an evolutionarily stable strategy (ESS). Using two and three-player symmetric quantum games we show how the presence of quantum phenomenon of entanglement can be crucial to decide the course of evolutionary dynamics in a population of interacting individuals.
Directory of Open Access Journals (Sweden)
Hatim eSalih
2016-05-01
Full Text Available The phenomenon of quantum erasure has long intrigued physicists, but has surprisingly found limited practical application. Here, we propose a protocol for quantum key distribution (QKD based on quantum erasure, promising inherent security against detector attacks. We particularly demonstrate its security against a powerful detector-blinding attack.
Fujii, Toshiyuki; Matsuo, Shigemasa; Hatakenaka, Noriyuki
2009-01-01
We propose a fluxon-controlled quantum computer incorporated with three-qubit quantum error correction using special gate operations, i.e., joint-phase and SWAP gate operations, inherent in capacitively coupled superconducting flux qubits. The proposed quantum computer acts exactly like a knitting machine at home.
Simulation of quantum computers
De Raedt, H; Michielsen, K; Hams, AH; Miyashita, S; Saito, K; Landau, DP; Lewis, SP; Schuttler, HB
2001-01-01
We describe a simulation approach to study the functioning of Quantum Computer hardware. The latter is modeled by a collection of interacting spin-1/2 objects. The time evolution of this spin system maps one-to-one to a quantum program carried out by the Quantum Computer. Our simulation software
Maximally incompatible quantum observables
Energy Technology Data Exchange (ETDEWEB)
Heinosaari, Teiko, E-mail: teiko.heinosaari@utu.fi [Turku Centre for Quantum Physics, Department of Physics and Astronomy, University of Turku, FI-20014 Turku (Finland); Schultz, Jussi, E-mail: jussi.schultz@gmail.com [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Toigo, Alessandro, E-mail: alessandro.toigo@polimi.it [Dipartimento di Matematica, Politecnico di Milano, Piazza Leonardo da Vinci 32, I-20133 Milano (Italy); Istituto Nazionale di Fisica Nucleare, Sezione di Milano, Via Celoria 16, I-20133 Milano (Italy); Ziman, Mario, E-mail: ziman@savba.sk [RCQI, Institute of Physics, Slovak Academy of Sciences, Dúbravská cesta 9, 84511 Bratislava (Slovakia); Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno (Czech Republic)
2014-05-01
The existence of maximally incompatible quantum observables in the sense of a minimal joint measurability region is investigated. Employing the universal quantum cloning device it is argued that only infinite dimensional quantum systems can accommodate maximal incompatibility. It is then shown that two of the most common pairs of complementary observables (position and momentum; number and phase) are maximally incompatible.
Hwang, Won Young; Koh, In Gyu; Han, Yeong Deok
1997-01-01
We show that a secure quantum protocol for coin tossing exist. The existence of quantum coin tossing support the conjecture of D.Mayers [Phys.Rev.Lett. 78, 3414(1997)] that only asymmetrical tasks as quantum bit commitment are impossible.
Indian Academy of Sciences (India)
Jyotishman Bhowmick
2015-11-07
Nov 7, 2015 ... NONcommutative spaces. 2. Banica and Bichon defined quantum symmetry groups for finite metric spaces, finite graphs, etc. 3. Lots of examples computed leading to discovery of completely new kinds of quantum groups. Jyotishman Bhowmick (Indian Statistical Institute). Quantum isometry groups. 07.11.
Amelino-Camelia, Giovanni
2003-01-01
Comment: 9 pages, LaTex. These notes were prepared while working on an invited contribution to the November 2003 issue of Physics World, which focused on quantum gravity. They intend to give a non-technical introduction (accessible to readers from outside quantum gravity) to "Quantum Gravity Phenomenology"
Salih, Hatim
2016-05-01
The phenomenon of quantum erasure has long intrigued physicists, but has surprisingly found limited practical application. Here, we propose a protocol for quantum key distribution (QKD) based on quantum erasure, promising inherent security against detector attacks. We particularly demonstrate its security against a powerful detector-blinding attack.
Quantum technology past, present, future: quantum energetics (Conference Presentation)
Choi, Sang H.
2017-04-01
Since the development of quantum physics in the early part of the 1900s, this field of study has made remarkable contributions to our civilization. Some of these advances include lasers, light-emitting diodes (LED), sensors, spectroscopy, quantum dots, quantum gravity and quantum entanglements. In 1998, the NASA Langley Research Center established a quantum technology committee to monitor the progress in this area and initiated research to determine the potential of quantum technology for future NASA missions. The areas of interest in quantum technology at NASA included fundamental quantum-optics materials associated with quantum dots and quantum wells, device-oriented photonic crystals, smart optics, quantum conductors, quantum information and computing, teleportation theorem, and quantum energetics. A brief review of the work performed, the progress made in advancing these technologies, and the potential NASA applications of quantum technology will be presented.
High-efficiency reconciliation for continuous variable quantum key distribution
Bai, Zengliang; Yang, Shenshen; Li, Yongmin
2017-04-01
Quantum key distribution (QKD) is the most mature application of quantum information technology. Information reconciliation is a crucial step in QKD and significantly affects the final secret key rates shared between two legitimate parties. We analyze and compare various construction methods of low-density parity-check (LDPC) codes and design high-performance irregular LDPC codes with a block length of 106. Starting from these good codes and exploiting the slice reconciliation technique based on multilevel coding and multistage decoding, we realize high-efficiency Gaussian key reconciliation with efficiency higher than 95% for signal-to-noise ratios above 1. Our demonstrated method can be readily applied in continuous variable QKD.
Quantum computing. Defining and detecting quantum speedup.
Rønnow, Troels F; Wang, Zhihui; Job, Joshua; Boixo, Sergio; Isakov, Sergei V; Wecker, David; Martinis, John M; Lidar, Daniel A; Troyer, Matthias
2014-07-25
The development of small-scale quantum devices raises the question of how to fairly assess and detect quantum speedup. Here, we show how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup. We illustrate our discussion with data from tests run on a D-Wave Two device with up to 503 qubits. By using random spin glass instances as a benchmark, we found no evidence of quantum speedup when the entire data set is considered and obtained inconclusive results when comparing subsets of instances on an instance-by-instance basis. Our results do not rule out the possibility of speedup for other classes of problems and illustrate the subtle nature of the quantum speedup question. Copyright © 2014, American Association for the Advancement of Science.
Relativistic quantum chemistry on quantum computers
DEFF Research Database (Denmark)
Veis, L.; Visnak, J.; Fleig, T.
2012-01-01
The past few years have witnessed a remarkable interest in the application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very recently, proof-of-principle experimental realizations have been reported. However, so far only...... the nonrelativistic regime (i.e., the Schrodinger equation) has been explored, while it is well known that relativistic effects can be very important in chemistry. We present a quantum algorithm for relativistic computations of molecular energies. We show how to efficiently solve the eigenproblem of the Dirac......-Coulomb Hamiltonian on a quantum computer and demonstrate the functionality of the proposed procedure by numerical simulations of computations of the spin-orbit splitting in the SbH molecule. Finally, we propose quantum circuits with three qubits and nine or ten controlled-NOT (CNOT) gates, which implement a proof...
2014-09-05
because this would combine Ptolemy II with the GPL’d code and thus encumber Ptolemy II with the GPL. Another GNU license is the GNU Library General...permission on the source.eecs.berkeley.edu repositories, then use your local repository. bash-3.2$ svn co svn+ ssh ://source.eecs.berkeley.edu/chess
Indian Academy of Sciences (India)
The images, which came from Oailleo's flyby of the moon on June 26-27. 1996 are reported to be 20 times better than those obtained from the Voyager. Priti Shankar .... a systematic way. Thus was born a brand new field,which has since been ..... mathematically oriented, compact book on coding, containing a few topics not ...
Anaïs Schaeffer
2013-01-01
This summer, CERN took part in the Google Summer of Code programme for the third year in succession. Open to students from all over the world, this programme leads to very successful collaborations for open source software projects. Image: GSoC 2013. Google Summer of Code (GSoC) is a global programme that offers student developers grants to write code for open-source software projects. Since its creation in 2005, the programme has brought together some 6,000 students from over 100 countries worldwide. The students selected by Google are paired with a mentor from one of the participating projects, which can be led by institutes, organisations, companies, etc. This year, CERN PH Department’s SFT (Software Development for Experiments) Group took part in the GSoC programme for the third time, submitting 15 open-source projects. “Once published on the Google Summer for Code website (in April), the projects are open to applications,” says Jakob Blomer, one of the o...
Khina, Anatoly
2016-08-15
We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.
Laëtitia Pedroso
2010-01-01
During his talk to the staff at the beginning of the year, the Director-General mentioned that a new code of conduct was being drawn up. What exactly is it and what is its purpose? Anne-Sylvie Catherin, Head of the Human Resources (HR) Department, talked to us about the whys and wherefores of the project. Drawing by Georges Boixader from the cartoon strip “The World of Particles” by Brian Southworth. A code of conduct is a general framework laying down the behaviour expected of all members of an organisation's personnel. “CERN is one of the very few international organisations that don’t yet have one", explains Anne-Sylvie Catherin. “We have been thinking about introducing a code of conduct for a long time but lacked the necessary resources until now”. The call for a code of conduct has come from different sources within the Laboratory. “The Equal Opportunities Advisory Panel (read also the "Equal opportuni...
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 10. Error Correcting Codes How Numbers Protect Themselves. Priti Shankar. Series Article Volume 1 ... Author Affiliations. Priti Shankar1. Department of Computer Science and Automation, Indian Institute of Science, Bangalore 560 012, India ...
King, Kevin
1992-01-01
Coding tasks, a valuable technique for teaching English as a Second Language, are presented that enable students to look at patterns and structures of marital communication as well as objectively evaluate the degree of happiness or distress in the marriage. (seven references) (JL)
DEFF Research Database (Denmark)
Fukui, Hironori; Popovski, Petar; Yomo, Hiroyuki
2014-01-01
Physical layer network coding (PLNC) has been proposed to improve throughput of the two-way relay channel, where two nodes communicate with each other, being assisted by a relay node. Most of the works related to PLNC are focused on a simple three-node model and they do not take into account...
Indian Academy of Sciences (India)
Computer Science and. Automation, liSe. Their research addresses various aspects of algebraic and combinatorial coding theory. 1 low Density Parity Check ..... lustrating how the variable Xd is decoded. As mentioned earlier, this algorithm runs iteratively. To start with, in the first iteration, only bits in the first level of the ...
DEFF Research Database (Denmark)
Ivanov, Mikhail; Brännström, Frederik; Graell i Amat, Alexandre
2016-01-01
We propose an uncoordinated medium access control (MAC) protocol, called all-to-all broadcast coded slotted ALOHA (B-CSA) for reliable all-to-all broadcast with strict latency constraints. In B-CSA, each user acts as both transmitter and receiver in a half-duplex mode. The half-duplex mode gives...
Uerling, Donald F.
School officials see a need for regulations that prohibit disruptive and inappropriate forms of expression and attire; students see these regulations as unwanted restrictions on their freedom. This paper reviews court litigation involving constitutional limitations on school authority, dress and hair codes, state law constraints, and school…
Lumsden, Linda; Miller, Gabriel
2002-01-01
Students do not always make choices that adults agree with in their choice of school dress. Dress-code issues are explored in this Research Roundup, and guidance is offered to principals seeking to maintain a positive school climate. In "Do School Uniforms Fit?" Kerry White discusses arguments for and against school uniforms and summarizes the…
Zirkel, Perry A.
2000-01-01
As illustrated by two recent decisions, the courts in the past decade have demarcated wide boundaries for school officials considering dress codes, whether in the form of selective prohibitions or required uniforms. Administrators must warn the community, provide legitimate justification and reasonable clarity, and comply with state law. (MLH)
Indian Academy of Sciences (India)
titled 'A Mathematical Theory of Communication' in the Bell Systems Technical Journal in 1948. The paper set up a ... 'existential' result but nota 'constructive' one. The construction of such a code evolved from the work ... several papers on hyperbolic geometry. He shifted to the Department of Pure Mathematics at Calcutta.
Heathcote, Dorothy
1978-01-01
Prescribes an attitude that teachers can take to help students "crack the code" of a dramatic work, combining a flexible teaching strategy, the suspension of beliefs or preconceived notions about the work, focusing on the drams's text, and choosing a reading strategy appropriate to the dramatic work. (RL)
Corporate governance through codes
Haxhi, I.; Aguilera, R.V.; Vodosek, M.; den Hartog, D.; McNett, J.M.
2014-01-01
The UK's 1992 Cadbury Report defines corporate governance (CG) as the system by which businesses are directed and controlled. CG codes are a set of best practices designed to address deficiencies in the formal contracts and institutions by suggesting prescriptions on the preferred role and
Reed-Solomon convolutional codes
Gluesing-Luerssen, H; Schmale, W
2005-01-01
In this paper we will introduce a specific class of cyclic convolutional codes. The construction is based on Reed-Solomon block codes. The algebraic parameters as well as the distance of these codes are determined. This shows that some of these codes are optimal or near optimal.
Quantum Discord for Investigating Quantum Correlations without Entanglement in Solids
Rong, Xing; Wang, Zixiang; Jin, Fangzhou; Geng, Jianpei; Feng, Pengbo; Xu, Nanyang; Wang, Ya; Ju, Chenyong; Shi, Mingjun; Du, Jiangfeng
2012-01-01
Quantum systems unfold diversified correlations which have no classical counterparts. These quantum correlations have various different facets. Quantum entanglement, as the most well known measure of quantum correlations, plays essential roles in quantum information processing. However, it has recently been pointed out that quantum entanglement cannot describe all the nonclassicality in the correlations. Thus the study of quantum correlations in separable states attracts widely attentions. He...
Li, Ying
2016-09-16
Fault-tolerant quantum computing in systems composed of both Majorana fermions and topologically unprotected quantum systems, e.g., superconducting circuits or quantum dots, is studied in this Letter. Errors caused by topologically unprotected quantum systems need to be corrected with error-correction schemes, for instance, the surface code. We find that the error-correction performance of such a hybrid topological quantum computer is not superior to a normal quantum computer unless the topological charge of Majorana fermions is insusceptible to noise. If errors changing the topological charge are rare, the fault-tolerance threshold is much higher than the threshold of a normal quantum computer and a surface-code logical qubit could be encoded in only tens of topological qubits instead of about 1,000 normal qubits.
Causation, constructors and codes.
Hofmeyr, Jan-Hendrik S
2017-09-13
Relational biology relies heavily on the enriched understanding of causal entailment that Robert Rosen's formalisation of Aristotle's four causes has made possible, although to date efficient causes and the rehabilitation of final cause have been its main focus. Formal cause has been paid rather scant attention, but, as this paper demonstrates, is crucial to our understanding of many types of processes, not necessarily biological. The graph-theoretic relational diagram of a mapping has played a key role in relational biology, and the first part of the paper is devoted to developing an explicit representation of formal cause in the diagram and how it acts in combination with efficient cause to form a mapping. I then use these representations to show how Von Neumann's universal constructor can be cast into a relational diagram in a way that avoids the logical paradox that Rosen detected in his own representation of the constructor in terms of sets and mappings. One aspect that was absent from both Von Neumann's and Rosen's treatments was the necessity of a code to translate the description (the formal cause) of the automaton to be constructed into the construction process itself. A formal definition of codes in general, and organic codes in particular, allows the relational diagram to be extended so as to capture this translation of formal cause into process. The extended relational diagram is used to exemplify causal entailment in a diverse range of processes, such as enzyme action, construction of automata, communication through the Morse code, and ribosomal polypeptide synthesis through the genetic code. Copyright © 2017 Elsevier B.V. All rights reserved.