| 1. |
- Lindehammer, Sabina, et al.
(författare)
-
Temporal trends of HLA genotype frequencies of type 1 diabetes patients in Sweden from 1986 to 2005 suggest altered risk
- 2008
-
Ingår i: Acta Diabetologica. - : Springer Science and Business Media LLC. - 0940-5429 .- 1432-5233. ; 45:4, s. 231-5
-
Tidskriftsartikel (refereegranskat)abstract
- The aim of this study was to compare the frequency of human leukocyte antigen (HLA) genotypes in 1-18-year-old patients with type 1 diabetes newly diagnosed in 1986-1987 (n = 430), 1996-2000 (n = 342) and in 2003-2005 (n = 171). We tested the hypothesis that the HLA DQ genotype distribution changes over time. Swedish type 1 diabetes patients and controls were typed for HLA using polymerase chain reaction amplification and allele specific probes for DQ A1* and B1* alleles. The most common type 1 diabetes HLA DQA1*-B1*genotype 0501-0201/0301-0302 was 36% (153/430) in 1986-1987 and 37% (127/342) in 1996-2000, but decreased to 19% (33/171) in 2003-2005 (P \ 0.0001). The 0501-0201/0501-0201 genotype increased from 1% in 1986-1987 to 7% in 1996-2000 (P = 0.0047) and to 5% in 2003-2005 (P > 0.05). This study in 1-18-year-old Swedish type 1 diabetes patients supports the notion that there is a temporal change in HLA risk.
|
|
| 2. |
- Johansson, Niklas, 1987-
(författare)
-
A Resource for Quantum Computation
- 2021
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- In this thesis we address the question, what is the resource, or property, that enables the advantage of quantum computers? The theory of quantum computers dates back to the eighties, so one would think there already is an answer to this question. There are several proposed solutions, but to this date, there is no consensus on an answer. Primarily, the advantage of quantum computers is characterized by a speedup for certain computational problems. This speedup is measured by comparing quantum algorithms with the best-known classical algorithms. For some algorithms we assume access to an object called oracle. The oracle computes a function, and the complexity of the oracle is of no concern. Instead, we count the number of queries to the oracle needed to solve the problem. Informally, the question we ask using an oracle is: if we can compute this function efficiently, what else could we then compute. However, using oracles while measuring a quantum speedup, we assume access to vastly different oracles residing in different models of computation.For our investigation of the speedup, we introduce a classical simulation framework that imitates quantum algorithms. The simulation suggests that the property enabling the potential quantum speedup is the ability to store, process, and retrieve information in an additional degree of freedom. We then theoretically verified that this is true for all problems that can be efficiently solved with a quantum computer.In parallel to this, we also see that quantum oracles sharply specify the information we can retrieve from the additional degree of freedom, while regular oracles do not. A regular oracle does not even allow for an extra degree of freedom. We conclude that comparing quantum with classical oracle query complexity bounds does not provide conclusive evidence for a quantum advantage.
|
|
| 3. |
- Johansson, Niklas, 1987-
(författare)
-
On the Power of Quantum Computation: Oracles
- 2018
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Quantum computation solve some computational problems faster than the best-known alternative in classical computation. The evidence for this consists of examples where a quantum algorithm outperforms the best-known classical algorithm. A large body of these examples relies on oracle query complexity, where the performance (complexity) of the algorithms is measured by the number of times they need to access an oracle. Here, an oracle is usually considered to be a black box that computes a specific function at unit cost.However, the quantum algorithm is given access to an oracle with more structure than the classical algorithm. This thesis argues that the two oracles are so vastly different that comparing quantum and classical query complexity should not be considered evidence, but merely hints for a quantum advantage.The approach used is based on a model that can be seen as an approximation of quantum theory, but can be efficiently simulated on a classical computer. This model solves several oracular problems with the same performance as their quantum counterparts, showing that there is no genuine quantum advantage for these problems. This approach also clarifies the assumptions made in quantum computation, and which properties that can be seen as resources in these algorithms.
|
|
| 4. |
- Abellán, C., et al.
(författare)
-
Challenging Local Realism with Human Choices
- 2018
-
Ingår i: Nature. - : Nature Publishing Group. - 0028-0836 .- 1476-4687. ; 557, s. 212-216
-
Tidskriftsartikel (refereegranskat)abstract
- A Bell test is a randomized trial that compares experimental observations against the philosophical worldview of local realism , in which the properties of the physical world are independent of our observation of them and no signal travels faster than light. A Bell test requires spatially distributed entanglement, fast and high-efficiency detection and unpredictable measurement settings. Although technology can satisfy the first two of these requirements, the use of physical devices to choose settings in a Bell test involves making assumptions about the physics that one aims to test. Bell himself noted this weakness in using physical setting choices and argued that human 'free will' could be used rigorously to ensure unpredictability in Bell tests. Here we report a set of local-realism tests using human choices, which avoids assumptions about predictability in physics. We recruited about 100,000 human participants to play an online video game that incentivizes fast, sustained input of unpredictable selections and illustrates Bell-test methodology. The participants generated 97,347,490 binary choices, which were directed via a scalable web platform to 12 laboratories on five continents, where 13 experiments tested local realism using photons, single atoms, atomic ensembles and superconducting devices. Over a 12-hour period on 30 November 2016, participants worldwide provided a sustained data flow of over 1,000 bits per second to the experiments, which used different human-generated data to choose each measurement setting. The observed correlations strongly contradict local realism and other realistic positions in bi-partite and tri-partite 12 scenarios. Project outcomes include closing the 'freedom-of-choice loophole' (the possibility that the setting choices are influenced by 'hidden variables' to correlate with the particle properties), the utilization of video-game methods for rapid collection of human-generated randomness, and the use of networking techniques for global participation in experimental science.
|
|
| 5. |
|
|
| 6. |
- Aerts, Sven, et al.
(författare)
-
Two-photon Franson-type experiments and local realism
- 1999
-
Ingår i: Physical Review Letters. - : American Physical Society. - 0031-9007 .- 1079-7114. ; 83:15, s. 2872-2876
-
Tidskriftsartikel (refereegranskat)abstract
- The two-photon interferometric experiment proposed by J. D. Franson [Phys. Rev. Lett. 62, 2205 (1989)] is often treated as a “Bell test of local realism.” However, it has been suggested that this is incorrect due to the 50% postselection performed even in the ideal gedanken version of the experiment. Here we present a simple local hidden variable model of the experiment that successfully explains the results obtained in usual realizations of the experiment, even with perfect detectors. Furthermore, we also show that there is no such model if the switching of the local phase settings is done at a rate determined by the internal geometry of the interferometers.
|
|
| 7. |
- Alarcón Cuevas, Alvaro, 1991-
(författare)
-
A Few-Mode-Fiber Platform for Quantum Communication Applications
- 2022
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Society as we know it today would not have been possible without the explosive and astonishing development of telecommunications systems, and optical fibers have been one of the pillars of these technologies.Despite the enormous amount of data being transmitted over optical networks today, the trend is that the demand for higher bandwidths will also increase. Given this context, a central element in the design of telecommunications networks will be data security, since information can often be confidential or private.Quantum information emerges as a solution to encrypt data by quantum key distribution (QKD) between two users. This technique uses the properties of nature as the fundamentals of operation rather than relying on mathematical constructs to provide data protection. A popular alternative to performing QKD is to use the relative phase between two individual photon paths for information encoding. However, this method was not practical over long distances. The time-bin- based scheme was a solution to the previous problem given its practical nature, however, it introduces intrinsic losses due to its design, which increases with the dimension of the encoded quantum system.In this thesis we have designed and tested a fiber-optic platform using spatial-division- multiplexing techniques. The use of few-mode fibers and photonic lanterns are the cornerstone of our proposal, which also allow us to support orbital angular momentum (OAM) modes. The platform builds on the core ideas of the phase-coded quantum communication system and also takes advantage of the benefits proposed by the time-bin scheme. We have experimentally tested our proposal by successfully transmitting phase-coded single-photon states over 500 m few-mode fiber, demonstrating the feasibility of our scheme. We demonstrated the successful creation of OAM states, their propagation and their successful detection in an all in-fiber scheme. Our platform eliminates the post-selection losses of time-bin quantum communication systems and ensures compatibility with next-generation optical networks and opens up new possibilities for quantum communication.
|
|
| 8. |
- Bengtsson, Ingemar, et al.
(författare)
-
Mutually unbiased bases and Hadamard matrices of order six
- 2007
-
Ingår i: Journal of Mathematical Physics. - : American Institute of Physics (AIP). - 0022-2488 .- 1089-7658. ; 48:5, s. 052106-1-052106-21
-
Tidskriftsartikel (refereegranskat)abstract
- We report on a search for mutually unbiased bases (MUBs) in six dimensions. We find only triplets of MUBs, and thus do not come close to the theoretical upper bound 7. However, we point out that the natural habitat for sets of MUBs is the set of all complex Hadamard matrices of the given order, and we introduce a natural notion of distance between bases in Hilbert space. This allows us to draw a detailed map of where in the landscape the MUB triplets are situated. We use available tools, such as the theory of the discrete Fourier transform, to organize our results. Finally, we present some evidence for the conjecture that there exists a four dimensional family of complex Hadamard matrices of order 6. If this conjecture is true the landscape in which one may search for MUBs is much larger than previously thought.
|
|
| 9. |
- Cabello, Adan, et al.
(författare)
-
Minimum Detection Efficiency for a Loophole-Free Atom-Photon Bell Experiment
- 2007
-
Ingår i: Physical Review Letters. - : American Physical Society. - 0031-9007 .- 1079-7114. ; 98, s. 220402-1-220402-4
-
Tidskriftsartikel (refereegranskat)abstract
- In Bell experiments, one problem is to achieve high enough photodetection to ensure that there is no possibility of describing the results via a local hidden-variable model. Using the Clauser-Horne inequality and a two-photon nonmaximally entangled state, a photodetection efficiency higher than 0.67 is necessary. Here we discuss atom-photon Bell experiments. We show that, assuming perfect detection efficiency of the atom, it is possible to perform a loophole-free atom-photon Bell experiment whenever the photodetection efficiency exceeds 0.50.
|
|
| 10. |
- Cederlöf, Jörgen, et al.
(författare)
-
Security aspects of the Authentication used in Quantum Cryptography
- 2008
-
Ingår i: IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers (IEEE). - 0018-9448 .- 1557-9654. ; 54:4, s. 1735-1741
-
Tidskriftsartikel (refereegranskat)abstract
- Unconditionally secure message authentication is an important part of Quantum Cryptography (QC). We analyze security effects of using a key obtained from QC for authentication purposes in later rounds of QC. In particular, the eavesdropper gains partial knowledge on the key in QC that may have an effect on the security of the authentication in the later round. Our initial analysis indicates that this partial knowledge has little effect on the authentication part of the system, in agreement with previous results on the issue. However, when taking the full QC protocol into account, the picture is different. By accessing the quantum channel used in QC, the attacker can change the message to be authenticated. This together with partial knowledge of the key does incur a security weakness of the authentication. The underlying reason for this is that the authentication used, which is insensitive to such message changes when the key is unknown, becomes sensitive when used with a partially known key. We suggest a simple solution to this problem, and stress usage of this or an equivalent extra security measure in QC.
|
|
