... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing最新文献
F. Kaneda, R. Shimizu, Y. Mitsumori, H. Kosaka, K. Edamatsu
For efficient quantum information processing (QIP), pure and strong entanglement in qubits has been thought to be indispensable. However, it was recently pointed out that bound entangled states, which involve undistillable entanglement between qubits, also have great potential for QIP. In this paper, we report the efficient generation of a four-qubit bound entangled state referred to as the Smolin state using photon polarization qubits. We observed the unlockable bound entanglement which is the specific property of the Smolin state.
{"title":"Generation and characterization of bound entanglement in optical qubits","authors":"F. Kaneda, R. Shimizu, Y. Mitsumori, H. Kosaka, K. Edamatsu","doi":"10.2201/NIIPI.2011.8.3","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.3","url":null,"abstract":"For efficient quantum information processing (QIP), pure and strong entanglement in qubits has been thought to be indispensable. However, it was recently pointed out that bound entangled states, which involve undistillable entanglement between qubits, also have great potential for QIP. In this paper, we report the efficient generation of a four-qubit bound entangled state referred to as the Smolin state using photon polarization qubits. We observed the unlockable bound entanglement which is the specific property of the Smolin state.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"5 1","pages":"27"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87375891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a previous work [ArXiv:0909.2530] we proposed a method for accelerating optimization problem search using Bose-Einstein condensation (BEC). The system encodes an optimization problem into an Ising model and cools it down by the process of BEC to find its ground state spin configuration which corresponds to the solution of the problem. The system uses the final state stimulation (FSS) property of bosonic particles, an effect originating from the quantum indistinguishability of bosons, to provide speedups over the classical case. The speedup is typically ∝ N, where N is the number of bosons in the system per site. In this article we firstly review the proposed system, and give a more detailed numerical study of the equilibration time with the boson number and the number of sites M in the Ising model. We find that the equilibration time scales as τ ∼ exp(M)/N in agreement with previous arguments based on simulated annealing. A detailed description of the kinetic Monte Carlo method used for the study of the proposed system is also discussed.
{"title":"Kinetic Monte Carlo study of accelerated optimization problem search using Bose-Einstein condensates","authors":"K. Yan, T. Byrnes, Y. Yamamoto","doi":"10.2201/NIIPI.2011.8.5","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.5","url":null,"abstract":"In a previous work [ArXiv:0909.2530] we proposed a method for accelerating optimization problem search using Bose-Einstein condensation (BEC). The system encodes an optimization problem into an Ising model and cools it down by the process of BEC to find its ground state spin configuration which corresponds to the solution of the problem. The system uses the final state stimulation (FSS) property of bosonic particles, an effect originating from the quantum indistinguishability of bosons, to provide speedups over the classical case. The speedup is typically ∝ N, where N is the number of bosons in the system per site. In this article we firstly review the proposed system, and give a more detailed numerical study of the equilibration time with the boson number and the number of sites M in the Ising model. We find that the equilibration time scales as τ ∼ exp(M)/N in agreement with previous arguments based on simulated annealing. A detailed description of the kinetic Monte Carlo method used for the study of the proposed system is also discussed.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"3 1","pages":"39"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87668034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper introduces a fundamentally new method of finding the conditions for the superactivation of the zero-error capacity of quantum channels. The zero-error capacity of the quantum channel describes the amount of information which can be transmitted perfectly through a noisy quantum channel. The superactivation of the zero-error capacity of quantum channels makes it possible to use two quantum channels, each with zero zero-error capacity, with a positive joint zero-error capacity. Currently we have no theoretical background for describing all possible combinations of superactive quantum channels, hence there should be many other possible combinations. We give an algorithmic solution to the problem. To analyze the superactivation of the zero-error capacity, we introduce a new geometrical representation, called the quantum superball. Our method can be the first efficient algorithmic solution to discover the still unknown combinations to determine the superactivation of the zero-error capacity of quantum channels, without the extremely high computational costs.
{"title":"Information geometric superactivation of classical zero-error capacity of quantum channels","authors":"L. Gyongyosi, S. Imre","doi":"10.2201/NIIPI.2011.8.10","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.10","url":null,"abstract":"This paper introduces a fundamentally new method of finding the conditions for the superactivation of the zero-error capacity of quantum channels. The zero-error capacity of the quantum channel describes the amount of information which can be transmitted perfectly through a noisy quantum channel. The superactivation of the zero-error capacity of quantum channels makes it possible to use two quantum channels, each with zero zero-error capacity, with a positive joint zero-error capacity. Currently we have no theoretical background for describing all possible combinations of superactive quantum channels, hence there should be many other possible combinations. We give an algorithmic solution to the problem. To analyze the superactivation of the zero-error capacity, we introduce a new geometrical representation, called the quantum superball. Our method can be the first efficient algorithmic solution to discover the still unknown combinations to determine the superactivation of the zero-error capacity of quantum channels, without the extremely high computational costs.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"57 1","pages":"89"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73598540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jonas S Neergaard-Nielsen, M. Takeuchi, K. Wakui, Hiroki Takahashi, K. Hayasaka, M. Takeoka, M. Sasaki
We review our most recent results on application of the photon subtraction technique for optical quantum information processing primitives, in particular entanglement distillation and generation of squeezed qubit states. As an introduction we provide a brief summary of other experimental accomplishments in the field.
{"title":"Photon subtraction from traveling fields - recent experimental demonstrations","authors":"Jonas S Neergaard-Nielsen, M. Takeuchi, K. Wakui, Hiroki Takahashi, K. Hayasaka, M. Takeoka, M. Sasaki","doi":"10.2201/NiiPi.2011.8.1","DOIUrl":"https://doi.org/10.2201/NiiPi.2011.8.1","url":null,"abstract":"We review our most recent results on application of the photon subtraction technique for optical quantum information processing primitives, in particular entanglement distillation and generation of squeezed qubit states. As an introduction we provide a brief summary of other experimental accomplishments in the field.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"49 1","pages":"5"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78207372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a typical optical implementation of the Bennett-Brassard 1984 (so-called BB84) quantum key distribution protocol, the sender uses an active source to produce the required signal states. While active state preparation of BB84 signals is a simple and elegant solution in principle, in practice passive state preparation might be desirable in some scenarios, for instance, in those experimental setups operating at high transmission rates. Passive devices usually involve parametric down-conversion. Here we show that coherent light is also suitable for passive generation of BB84 signal states. Our method does not require any externally-driven element, but only linear optical components and photodetectors. The resulting key rate is similar to the one delivered by an active source.
{"title":"Passive preparation of BB84 signal states with coherent light","authors":"M. Curty, Xiongfeng Ma, H. Lo, N. Lütkenhaus","doi":"10.2201/NIIPI.2011.8.7","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.7","url":null,"abstract":"In a typical optical implementation of the Bennett-Brassard 1984 (so-called BB84) quantum key distribution protocol, the sender uses an active source to produce the required signal states. While active state preparation of BB84 signals is a simple and elegant solution in principle, in practice passive state preparation might be desirable in some scenarios, for instance, in those experimental setups operating at high transmission rates. Passive devices usually involve parametric down-conversion. Here we show that coherent light is also suitable for passive generation of BB84 signal states. Our method does not require any externally-driven element, but only linear optical components and photodetectors. The resulting key rate is similar to the one delivered by an active source.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"03 1","pages":"57"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86475138","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
K. Edamatsu, R. Shimizu, W. Ueno, Rui-Bo Jin, F. Kaneda, M. Yabuno, H. Suzuki, S. Nagano, A. Syouji, K. Suizu
Development of efficient and well-controlled nonclassical photon sources is one of the keys in the quantum information and communication technology. We present our recent activities to develop advanced sources of photon pairs having controlled frequency correlation, by use of quasi-phase matching (QPM) and extended phase-matching (EPM). First, we present the generation of polarization and frequency entangled photons using QPM having two poling periods. We also demonstrate the photon pair generation with controlled frequency correlation and its application to making heralded single photons with intrinsically pure spectrotem-
{"title":"Photon pair sources with controlled frequency correlation","authors":"K. Edamatsu, R. Shimizu, W. Ueno, Rui-Bo Jin, F. Kaneda, M. Yabuno, H. Suzuki, S. Nagano, A. Syouji, K. Suizu","doi":"10.2201/NIIPI.2011.8.2","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.2","url":null,"abstract":"Development of efficient and well-controlled nonclassical photon sources is one of the keys in the quantum information and communication technology. We present our recent activities to develop advanced sources of photon pairs having controlled frequency correlation, by use of quasi-phase matching (QPM) and extended phase-matching (EPM). First, we present the generation of polarization and frequency entangled photons using QPM having two poling periods. We also demonstrate the photon pair generation with controlled frequency correlation and its application to making heralded single photons with intrinsically pure spectrotem-","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"36 1","pages":"19"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77247971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of 'recursive networks', extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes, unifies software layering, and virtualizes the addresses of resources to improve information hiding and resource management. Our architecture is useful for building arbitrary distributed states, including fundamental distributed states such as Bell pairs and GHZ, W, and cluster states.
{"title":"Recursive quantum repeater networks","authors":"R. V. Meter, J. Touch, Dominic C. Horsman","doi":"10.2201/NiiPi.2011.8.8","DOIUrl":"https://doi.org/10.2201/NiiPi.2011.8.8","url":null,"abstract":"Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of 'recursive networks', extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes, unifies software layering, and virtualizes the addresses of resources to improve information hiding and resource management. Our architecture is useful for building arbitrary distributed states, including fundamental distributed states such as Bell pairs and GHZ, W, and cluster states.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"88 1","pages":"65-79"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76929659","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Diamond has recently become one of the leading candidates for applications in quantum communication and quantum computing. Diamond color centers are ideal as single photon sources. In this article we give an overview of the various techniques that can be used to improve the collection of photons from these emitters. These range from solid immersion lenses to Purcell-enhancement in microstructures and microcavities.
{"title":"Enhancing photon collection from quantum emitters in diamond","authors":"M. Trupke, W. Munro, K. Nemoto, J. Schmiedmayer","doi":"10.2201/NIIPI.2011.8.4","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.4","url":null,"abstract":"Diamond has recently become one of the leading candidates for applications in quantum communication and quantum computing. Diamond color centers are ideal as single photon sources. In this article we give an overview of the various techniques that can be used to improve the collection of photons from these emitters. These range from solid immersion lenses to Purcell-enhancement in microstructures and microcavities.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"29 1","pages":"33"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84708990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The basic ideas in quantum information processing (QIP) dates from several decades back, however the research development based on these ideas started only a little more than a decade ago. The initial ideas of quantum information processing emerged from the fundamental difference between quantum physics and classical physics. It was, and still is, hard to analyse quantum systems in general, and in particular when a quantum system gets bigger, it soon becomes intractable even with high performance computers. To analyse a quantum system, Feynman suggested that we should use a computer based on quantum physics. This is the initial idea of quantum information processing. By contrast to quantum computers, all non-quantum-physicsbased computers, that is, all the existing ones including high performance computers, are now called “classical computers” indicating computers based on classical physics. The research on quantum information processing did not take off until 1990s. Until then, the technology to manipulate quantum was yet not ready, and more importantly, the theory for QIP was not developed enough to show the way to efficiently use quantum nature to carry out computation. Quantum key distribution (QKD) was one of the first QIP protocols successfully implemented and developed in 1990s. QKD is a protocol to exchange secure key material between authenticated users at a distance. Thanks to a property that overlapping quantum states cannot be cloned without trace of interaction, the protocol can detect an eavesdropper by measuring the quantum states and post-processing the signals via classical communication between the users. As one-time pad using QKD was proven to be secure against an eavesdropper who has unbounded ability, unlike conventional cryptogra-
{"title":"Quantum information technology","authors":"K. Nemoto, Masahide Sasaki, G. J. Milburn","doi":"10.2201/NIIPI.2011.8.0","DOIUrl":"https://doi.org/10.2201/NIIPI.2011.8.0","url":null,"abstract":"The basic ideas in quantum information processing (QIP) dates from several decades back, however the research development based on these ideas started only a little more than a decade ago. The initial ideas of quantum information processing emerged from the fundamental difference between quantum physics and classical physics. It was, and still is, hard to analyse quantum systems in general, and in particular when a quantum system gets bigger, it soon becomes intractable even with high performance computers. To analyse a quantum system, Feynman suggested that we should use a computer based on quantum physics. This is the initial idea of quantum information processing. By contrast to quantum computers, all non-quantum-physicsbased computers, that is, all the existing ones including high performance computers, are now called “classical computers” indicating computers based on classical physics. The research on quantum information processing did not take off until 1990s. Until then, the technology to manipulate quantum was yet not ready, and more importantly, the theory for QIP was not developed enough to show the way to efficiently use quantum nature to carry out computation. Quantum key distribution (QKD) was one of the first QIP protocols successfully implemented and developed in 1990s. QKD is a protocol to exchange secure key material between authenticated users at a distance. Thanks to a property that overlapping quantum states cannot be cloned without trace of interaction, the protocol can detect an eavesdropper by measuring the quantum states and post-processing the signals via classical communication between the users. As one-time pad using QKD was proven to be secure against an eavesdropper who has unbounded ability, unlike conventional cryptogra-","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"123 1","pages":"1-3"},"PeriodicalIF":0.0,"publicationDate":"2011-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86575567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Many researches proposed the use of the noon state as the input state for phase estimation, which is one topic of quantum metrology. This is because the input noon state provides the maximum Fisher information at the specific point. However, the Fisher information does not necessarily give the attainable bound for estimation error. In this paper, we adopt the local asymptotic mini-max criterion as well as the mini-max criterion, and show that the maximum Fisher information does not give the attainable bound for estimation error under these criteria in the phase estimation. We also propose the optimal input state under the constraints for photon number of the input state instead of the noon state.
{"title":"Phase estimation with photon number constraint","authors":"Masahito Hayashi","doi":"10.2201/NiiPi.2011.8.9","DOIUrl":"https://doi.org/10.2201/NiiPi.2011.8.9","url":null,"abstract":"Many researches proposed the use of the noon state as the input state for phase estimation, which is one topic of quantum metrology. This is because the input noon state provides the maximum Fisher information at the specific point. However, the Fisher information does not necessarily give the attainable bound for estimation error. In this paper, we adopt the local asymptotic mini-max criterion as well as the mini-max criterion, and show that the maximum Fisher information does not give the attainable bound for estimation error under these criteria in the phase estimation. We also propose the optimal input state under the constraints for photon number of the input state instead of the noon state.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"57 1","pages":"81"},"PeriodicalIF":0.0,"publicationDate":"2010-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82543114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：