The Quantum Measurement Problem and Physical reality: A Computation Theoretic Perspective

NASA Astrophysics Data System (ADS)

Srikanth, R.

2006-11-01

Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not ruled out. On the other hand, empirical evidence suggests that NP-complete problems are intractable in the physical world. Likewise, computational problems known to be algorithmically uncomputable do not seem to be computable by any physical means. We suggest that this close correspondence between the efficiency and power of abstract algorithms on the one hand, and physical computers on the other, finds a natural explanation if the universe is assumed to be algorithmic; that is, that physical reality is the product of discrete sub-physical information processing equivalent to the actions of a probabilistic Turing machine. This assumption can be reconciled with the observed exponentiality of quantum systems at microscopic scales, and the consequent possibility of implementing Shor's quantum polynomial time algorithm at that scale, provided the degree of superposition is intrinsically, finitely upper-bounded. If this bound is associated with the quantum-classical divide (the Heisenberg cut), a natural resolution to the quantum measurement problem arises. From this viewpoint, macroscopic classicality is an evidence that the universe is in BPP, and both questions raised above receive affirmative answers. A recently proposed computational model of quantum measurement, which relates the Heisenberg cut to the discreteness of Hilbert space, is briefly discussed. A connection to quantum gravity is noted. Our results are compatible with the philosophy that mathematical truths are independent of the laws of physics.

Secure Communication via Key Generation with Quantum Measurement Advantage in the Telecom Band

DTIC Science & Technology

2013-10-30

II: Summary of Project In this basic research program we proposed to investigate the use of keyed communication in quantum noise as a key generation...implement quantum limited detection in our running-code OCDMA experiment to demonstrate (a) quantum measurement advantage creation between two users, (b...neither is adequate against known-plaintext attacks. This is a serious security problem facing the whole field of quantum cryptography in regard to both

Probing for quantum speedup on D-Wave Two

NASA Astrophysics Data System (ADS)

Rønnow, Troels F.; Wang, Zhihui; Job, Joshua; Isakov, Sergei V.; Boixo, Sergio; Lidar, Daniel; Martinis, John; Troyer, Matthias

2014-03-01

Quantum speedup refers to the advantage quantum devices can have over classical ones in solving classes of computational problems. In this talk we show how to correctly define and measure quantum speedup in experimental devices. We show how to avoid issues that might mask or fake quantum speedup.

Verification for measurement-only blind quantum computing

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki

2014-06-01

Blind quantum computing is a new secure quantum computing protocol where a client who does not have any sophisticated quantum technology can delegate her quantum computing to a server without leaking any privacy. It is known that a client who has only a measurement device can perform blind quantum computing [T. Morimae and K. Fujii, Phys. Rev. A 87, 050301(R) (2013), 10.1103/PhysRevA.87.050301]. It has been an open problem whether the protocol can enjoy the verification, i.e., the ability of the client to check the correctness of the computing. In this paper, we propose a protocol of verification for the measurement-only blind quantum computing.

Generalized concurrence in boson sampling.

PubMed

Chin, Seungbeom; Huh, Joonsuk

2018-04-17

A fundamental question in linear optical quantum computing is to understand the origin of the quantum supremacy in the physical system. It is found that the multimode linear optical transition amplitudes are calculated through the permanents of transition operator matrices, which is a hard problem for classical simulations (boson sampling problem). We can understand this problem by considering a quantum measure that directly determines the runtime for computing the transition amplitudes. In this paper, we suggest a quantum measure named "Fock state concurrence sum" C S , which is the summation over all the members of "the generalized Fock state concurrence" (a measure analogous to the generalized concurrences of entanglement and coherence). By introducing generalized algorithms for computing the transition amplitudes of the Fock state boson sampling with an arbitrary number of photons per mode, we show that the minimal classical runtime for all the known algorithms directly depends on C S . Therefore, we can state that the Fock state concurrence sum C S behaves as a collective measure that controls the computational complexity of Fock state BS. We expect that our observation on the role of the Fock state concurrence in the generalized algorithm for permanents would provide a unified viewpoint to interpret the quantum computing power of linear optics.

Device-Independent Tests of Classical and Quantum Dimensions

NASA Astrophysics Data System (ADS)

Gallego, Rodrigo; Brunner, Nicolas; Hadley, Christopher; Acín, Antonio

2010-12-01

We address the problem of testing the dimensionality of classical and quantum systems in a “black-box” scenario. We develop a general formalism for tackling this problem. This allows us to derive lower bounds on the classical dimension necessary to reproduce given measurement data. Furthermore, we generalize the concept of quantum dimension witnesses to arbitrary quantum systems, allowing one to place a lower bound on the Hilbert space dimension necessary to reproduce certain data. Illustrating these ideas, we provide simple examples of classical and quantum dimension witnesses.

Experimental realization of a one-way quantum computer algorithm solving Simon's problem.

PubMed

Tame, M S; Bell, B A; Di Franco, C; Wadsworth, W J; Rarity, J G

2014-11-14

We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's problem-a black-box period-finding problem that has an exponential gap between the classical and quantum runtime. Using an all-optical setup and modifying the bases of single-qubit measurements on a five-qubit cluster state, key representative functions of the logical two-qubit version's black box can be queried and solved. To the best of our knowledge, this work represents the first experimental realization of the quantum algorithm solving Simon's problem. The experimental results are in excellent agreement with the theoretical model, demonstrating the successful performance of the algorithm. With a view to scaling up to larger numbers of qubits, we analyze the resource requirements for an n-qubit version. This work helps highlight how one-way quantum computing provides a practical route to experimentally investigating the quantum-classical gap in the query complexity model.

Characterization of measurements in quantum communication. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Chan, V. W. S.

1975-01-01

A characterization of quantum measurements by operator valued measures is presented. The generalized measurements include simultaneous approximate measurement of noncommuting observables. This characterization is suitable for solving problems in quantum communication. Two realizations of such measurements are discussed. The first is by adjoining an apparatus to the system under observation and performing a measurement corresponding to a self-adjoint operator in the tensor-product Hilbert space of the system and apparatus spaces. The second realization is by performing, on the system alone, sequential measurements that correspond to self-adjoint operators, basing the choice of each measurement on the outcomes of previous measurements. Simultaneous generalized measurements are found to be equivalent to a single finer grain generalized measurement, and hence it is sufficient to consider the set of single measurements. An alternative characterization of generalized measurement is proposed. It is shown to be equivalent to the characterization by operator-values measures, but it is potentially more suitable for the treatment of estimation problems. Finally, a study of the interaction between the information-carrying system and a measurement apparatus provides clues for the physical realizations of abstractly characterized quantum measurements.

Generalized bipartite quantum state discrimination problems with sequential measurements

NASA Astrophysics Data System (ADS)

Nakahira, Kenji; Kato, Kentaro; Usuda, Tsuyoshi Sasaki

2018-02-01

We investigate an optimization problem of finding quantum sequential measurements, which forms a wide class of state discrimination problems with the restriction that only local operations and one-way classical communication are allowed. Sequential measurements from Alice to Bob on a bipartite system are considered. Using the fact that the optimization problem can be formulated as a problem with only Alice's measurement and is convex programming, we derive its dual problem and necessary and sufficient conditions for an optimal solution. Our results are applicable to various practical optimization criteria, including the Bayes criterion, the Neyman-Pearson criterion, and the minimax criterion. In the setting of the problem of finding an optimal global measurement, its dual problem and necessary and sufficient conditions for an optimal solution have been widely used to obtain analytical and numerical expressions for optimal solutions. Similarly, our results are useful to obtain analytical and numerical expressions for optimal sequential measurements. Examples in which our results can be used to obtain an analytical expression for an optimal sequential measurement are provided.

Higher-dimensional communication complexity problems: Classical protocols versus quantum ones based on Bell's theorem or prepare-transmit-measure schemes

NASA Astrophysics Data System (ADS)

Tavakoli, Armin; Żukowski, Marek

2017-04-01

Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that broad classes of Bell inequalities can be mapped to CCPs and that a quantum violation of a Bell inequality is a necessary and sufficient condition for an enhancement of the related CCP beyond its classical limitation. However, one can implement CCPs by transmitting a quantum system, encoding no more information than is allowed in the CCP, and extracting information by performing measurements. We show that for a large class of Bell inequalities, the improvement of the CCP associated with a quantum violation of a Bell inequality can be no greater than the improvement obtained from quantum prepare-transmit-measure strategies.

Measurement-device-independent quantum key distribution.

PubMed

Lo, Hoi-Kwong; Curty, Marcos; Qi, Bing

2012-03-30

How to remove detector side channel attacks has been a notoriously hard problem in quantum cryptography. Here, we propose a simple solution to this problem--measurement-device-independent quantum key distribution (QKD). It not only removes all detector side channels, but also doubles the secure distance with conventional lasers. Our proposal can be implemented with standard optical components with low detection efficiency and highly lossy channels. In contrast to the previous solution of full device independent QKD, the realization of our idea does not require detectors of near unity detection efficiency in combination with a qubit amplifier (based on teleportation) or a quantum nondemolition measurement of the number of photons in a pulse. Furthermore, its key generation rate is many orders of magnitude higher than that based on full device independent QKD. The results show that long-distance quantum cryptography over say 200 km will remain secure even with seriously flawed detectors.

Composition in the Quantum World

NASA Astrophysics Data System (ADS)

Hall, Edward Jonathan

This thesis presents a problem for the foundations of quantum mechanics. It arises from the way that theory describes the composition of larger systems in terms of smaller ones, and renders untenable a wide range of interpretations of quantum mechanics. That quantum mechanics is difficult to interpret is old news, given the well-known Measurement Problem. But the problem I raise is quite different, and in important respects more fundamental. In brief: The physical world exhibits mereological structure: physical objects have parts, which in turn have parts, and so on. A natural way to try to represent this structure is by means of a particle theory, according to which the physical world consists entirely enduring physical objects which themselves have no proper parts, but aggregates of which are, or compose, all physical objects. Elementary, non-relativistic quantum mechanics can be cast in this mold--at least, according to the usual expositions of that theory. But herein lies the problem: the standard attempt to give a systematic particle interpretation to elementary quantum mechanics results in nonsense, thanks to the well-established principle of Permutation Invariance, which constrains the quantum -mechanical description of systems containing identical particles. Specifically, it follows from the most minimal principles of a particle interpretation (much weaker than those needed to generate the Measurement Problem), together with Permutation Invariance, that systems identical in composition must have the same physical state. In other words, systems which merely have the same numbers of the same types of particles are therefore, at all times, perfect physical duplicates. This conclusion is absurd: e.g., it is quite plausible that some of those particles which compose my body make up a system identical in composition to some pepperoni pizza. Yet no part of me is a qualitative physical duplicate of any pepperoni pizza. Perhaps "you are what you eat" --but not in this sense! In what follows I develop the principles needed to explore this problem, contrast it with the Measurement Problem, and consider, finally, how it should influence our judgments of the relative merits of the many extant interpretations of quantum mechanics.

Schroedinger's immortal cat

DOE Office of Scientific and Technical Information (OSTI.GOV)

Peres, A.

1988-01-01

The purpose of this paper is to review and clarify the quantum measurement problem. The latter originates in the ambivalent nature of the observer: Although the observer is not described by the Schroedinger equation, it should nevertheless be possible to quantize him and include him in the wave function if quantum theory is universally valid. The problem is to prove that no contradiction may arise in these two conflicting descriptions. The proof invokes the notion of irreversibility. The validity of the latter is questionable, because the standard rationale for classical irreversibility, namely mixing and coarse graining, does not apply tomore » quantum theory. There is no chaos in a closed, finite quantum system. However, when a system is large enough, it cannot be perfectly isolated from it environment, namely from external (or even internal) degrees of freedom which are not fully accounted for in the Hamiltonian of that system. As a consequence, the long-range evolution of such a quantum system is essentially unpredictable. It follows that the notion of irreversibility is a valid one in quantum theory and the measurement problem can be brought to a satisfactory solution.« less

A Generalization of the Simultaneous Diagonalization of Hermitian Matrices and its Relation to Quantum Estimation Theory

NASA Astrophysics Data System (ADS)

Nagaoka, Hiroshi

We study the problem of minimizing a quadratic quantity defined for given two Hermitian matrices X, Y and a positive-definite Hermitian matrix. This problem is reduced to the simultaneous diagonalization of X, Y when XY = YX. We derive a lower bound for the quantity, and in some special cases solve the problem by showing that the lower bound is achievable. This problem is closely related to a simultaneous measurement of quantum mechanical observables which are not commuting and has an application in the theory of quantum state estimation.

`Counterfactual' interpretation of the quantum measurement process

NASA Astrophysics Data System (ADS)

Nisticò, Giuseppe

1997-08-01

The question of the determination of the state of the system during a measurement experiment is discussed within quantum theory, as a part of the more general measurement’s problem. I propose a counterfactual interpretation of the measurement process which answers the question from a conceptual point of view. This interpretation turns out to be consistent with the predictions of quantum theory, but it presents difficulties from an operational point of view.

Interaction-free measurement as quantum channel discrimination

NASA Astrophysics Data System (ADS)

Zhou, You; Yung, Man-Hong

2017-12-01

Interaction-free measurement is a quantum process where, in the ideal situation, an object can be detected as if no interaction took place with the probing photon. Here we show that the problem of interaction-free measurement can be regarded as a problem of quantum-channel discrimination. In particular, we look for the optimal photonic states that can minimize the detection error and the photon loss in detecting the presence or absence of the object, which is taken to be semitransparent, and the number of the interrogation cycle is assumed to be finite. Furthermore, we also investigated the possibility of minimizing the detection error through the use of entangled photons, which is essentially a setting of quantum illumination. However, our results indicate that entanglement does not exhibit a clear advantage; the same performance can be achieved with unentangled photonic states.

Two Quantum Protocols for Oblivious Set-member Decision Problem

NASA Astrophysics Data System (ADS)

Shi, Run-Hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2015-10-01

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology.

Two Quantum Protocols for Oblivious Set-member Decision Problem

PubMed Central

Shi, Run-hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2015-01-01

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology. PMID:26514668

Two Quantum Protocols for Oblivious Set-member Decision Problem.

PubMed

Shi, Run-Hua; Mu, Yi; Zhong, Hong; Cui, Jie; Zhang, Shun

2015-10-30

In this paper, we defined a new secure multi-party computation problem, called Oblivious Set-member Decision problem, which allows one party to decide whether a secret of another party belongs to his private set in an oblivious manner. There are lots of important applications of Oblivious Set-member Decision problem in fields of the multi-party collaborative computation of protecting the privacy of the users, such as private set intersection and union, anonymous authentication, electronic voting and electronic auction. Furthermore, we presented two quantum protocols to solve the Oblivious Set-member Decision problem. Protocol I takes advantage of powerful quantum oracle operations so that it needs lower costs in both communication and computation complexity; while Protocol II takes photons as quantum resources and only performs simple single-particle projective measurements, thus it is more feasible with the present technology.

The Quantum Logical Challenge: Peter Mittelstaedt's Contributions to Logic and Philosophy of Science

NASA Astrophysics Data System (ADS)

Beltrametti, E.; Dalla Chiara, M. L.; Giuntini, R.

2017-12-01

Peter Mittelstaedt's contributions to quantum logic and to the foundational problems of quantum theory have significantly realized the most authentic spirit of the International Quantum Structures Association: an original research about hard technical problems, which are often "entangled" with the emergence of important changes in our general world-conceptions. During a time where both the logical and the physical community often showed a skeptical attitude towards Birkhoff and von Neumann's quantum logic, Mittelstaedt brought into light the deeply innovating features of a quantum logical thinking that allows us to overcome some strong and unrealistic assumptions of classical logical arguments. Later on his intense research on the unsharp approach to quantum theory and to the measurement problem stimulated the increasing interest for unsharp forms of quantum logic, creating a fruitful interaction between the work of quantum logicians and of many-valued logicians. Mittelstaedt's general views about quantum logic and quantum theory seem to be inspired by a conjecture that is today more and more confirmed: there is something universal in the quantum theoretic formalism that goes beyond the limits of microphysics, giving rise to interesting applications to a number of different fields.

Demonstration of quantum advantage in machine learning

NASA Astrophysics Data System (ADS)

Ristè, Diego; da Silva, Marcus P.; Ryan, Colm A.; Cross, Andrew W.; Córcoles, Antonio D.; Smolin, John A.; Gambetta, Jay M.; Chow, Jerry M.; Johnson, Blake R.

2017-04-01

The main promise of quantum computing is to efficiently solve certain problems that are prohibitively expensive for a classical computer. Most problems with a proven quantum advantage involve the repeated use of a black box, or oracle, whose structure encodes the solution. One measure of the algorithmic performance is the query complexity, i.e., the scaling of the number of oracle calls needed to find the solution with a given probability. Few-qubit demonstrations of quantum algorithms, such as Deutsch-Jozsa and Grover, have been implemented across diverse physical systems such as nuclear magnetic resonance, trapped ions, optical systems, and superconducting circuits. However, at the small scale, these problems can already be solved classically with a few oracle queries, limiting the obtained advantage. Here we solve an oracle-based problem, known as learning parity with noise, on a five-qubit superconducting processor. Executing classical and quantum algorithms using the same oracle, we observe a large gap in query count in favor of quantum processing. We find that this gap grows by orders of magnitude as a function of the error rates and the problem size. This result demonstrates that, while complex fault-tolerant architectures will be required for universal quantum computing, a significant quantum advantage already emerges in existing noisy systems.

Quantum Sensors for the Generating Functional of Interacting Quantum Field Theories

NASA Astrophysics Data System (ADS)

Bermudez, A.; Aarts, G.; Müller, M.

2017-10-01

Difficult problems described in terms of interacting quantum fields evolving in real time or out of equilibrium abound in condensed-matter and high-energy physics. Addressing such problems via controlled experiments in atomic, molecular, and optical physics would be a breakthrough in the field of quantum simulations. In this work, we present a quantum-sensing protocol to measure the generating functional of an interacting quantum field theory and, with it, all the relevant information about its in- or out-of-equilibrium phenomena. Our protocol can be understood as a collective interferometric scheme based on a generalization of the notion of Schwinger sources in quantum field theories, which make it possible to probe the generating functional. We show that our scheme can be realized in crystals of trapped ions acting as analog quantum simulators of self-interacting scalar quantum field theories.

Hybrid Quantum-Classical Approach to Quantum Optimal Control.

PubMed

Li, Jun; Yang, Xiaodong; Peng, Xinhua; Sun, Chang-Pu

2017-04-14

A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal control problem. We show that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator. By posing queries to and receiving answers from the quantum simulator, classical computing devices update the control parameters until an optimal control solution is found. To demonstrate the quantum-classical scheme in experiment, we use a seven-qubit nuclear magnetic resonance system, on which we have succeeded in optimizing state preparation without involving classical computation of the large Hilbert space evolution.

A random walk approach to quantum algorithms.

PubMed

Kendon, Vivien M

2006-12-15

The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial; pure quantum dynamics is deterministic, so randomness only enters during the measurement phase, i.e. when converting the quantum information into classical information. The outcome of a quantum random walk is very different from the corresponding classical random walk owing to the interference between the different possible paths. The upshot is that quantum walkers find themselves further from their starting point than a classical walker on average, and this forms the basis of a quantum speed up, which can be exploited to solve problems faster. Surprisingly, the effect of making the walk slightly less than perfectly quantum can optimize the properties of the quantum walk for algorithmic applications. Looking to the future, even with a small quantum computer available, the development of quantum walk algorithms might proceed more rapidly than it has, especially for solving real problems.

Flexible resources for quantum metrology

NASA Astrophysics Data System (ADS)

Friis, Nicolai; Orsucci, Davide; Skotiniotis, Michalis; Sekatski, Pavel; Dunjko, Vedran; Briegel, Hans J.; Dür, Wolfgang

2017-06-01

Quantum metrology offers a quadratic advantage over classical approaches to parameter estimation problems by utilising entanglement and nonclassicality. However, the hurdle of actually implementing the necessary quantum probe states and measurements, which vary drastically for different metrological scenarios, is usually not taken into account. We show that for a wide range of tasks in metrology, 2D cluster states (a particular family of states useful for measurement-based quantum computation) can serve as flexible resources that allow one to efficiently prepare any required state for sensing, and perform appropriate (entangled) measurements using only single qubit operations. Crucially, the overhead in the number of qubits is less than quadratic, thus preserving the quantum scaling advantage. This is ensured by using a compression to a logarithmically sized space that contains all relevant information for sensing. We specifically demonstrate how our method can be used to obtain optimal scaling for phase and frequency estimation in local estimation problems, as well as for the Bayesian equivalents with Gaussian priors of varying widths. Furthermore, we show that in the paradigmatic case of local phase estimation 1D cluster states are sufficient for optimal state preparation and measurement.

A quantum extended Kalman filter

NASA Astrophysics Data System (ADS)

Emzir, Muhammad F.; Woolley, Matthew J.; Petersen, Ian R.

2017-06-01

In quantum physics, a stochastic master equation (SME) estimates the state (density operator) of a quantum system in the Schrödinger picture based on a record of measurements made on the system. In the Heisenberg picture, the SME is a quantum filter. For a linear quantum system subject to linear measurements and Gaussian noise, the dynamics may be described by quantum stochastic differential equations (QSDEs), also known as quantum Langevin equations, and the quantum filter reduces to a so-called quantum Kalman filter. In this article, we introduce a quantum extended Kalman filter (quantum EKF), which applies a commutative approximation and a time-varying linearization to systems of nonlinear QSDEs. We will show that there are conditions under which a filter similar to a classical EKF can be implemented for quantum systems. The boundedness of estimation errors and the filtering problem with ‘state-dependent’ covariances for process and measurement noises are also discussed. We demonstrate the effectiveness of the quantum EKF by applying it to systems that involve multiple modes, nonlinear Hamiltonians, and simultaneous jump-diffusive measurements.

The quantum Zeno effect in double well tunnelling

NASA Astrophysics Data System (ADS)

Lerner, L.

2018-05-01

Measurement lies at the heart of quantum theory, and introductory textbooks in quantum mechanics cover the measurement problem in topics such as the Schrödinger’s cat thought experiment, the EPR problem, and the quantum Zeno effect (QZE). In this article we present a new treatment of the QZE suitable for undergraduate students, for the case of a particle tunnelling between two wells while being observed in one of the wells. The analysis shows that as the observation rate increases, the tunnelling rate tends towards zero, in accordance with Zeno’s maxim ‘a watched pot never boils’. The method relies on decoherence theory, which replaces aspects of quantum collapse by the Schrödinger evolution of an open system, and its recently simplified treatment for undergraduates. Our presentation uses concepts familiar to undergraduate students, so that calculations involving many-body theory and the formal properties of the density matrix are avoided.

Relativistic quantum cryptography

NASA Astrophysics Data System (ADS)

Molotkov, S. N.; Nazin, S. S.

2003-07-01

The problem of unconditional security of quantum cryptography (i.e. the security which is guaranteed by the fundamental laws of nature rather than by technical limitations) is one of the central points in quantum information theory. We propose a relativistic quantum cryptosystem and prove its unconditional security against any eavesdropping attempts. Relativistitic causality arguments allow to demonstrate the security of the system in a simple way. Since the proposed protocol does not empoly collective measurements and quantum codes, the cryptosystem can be experimentally realized with the present state-of-art in fiber optics technologies. The proposed cryptosystem employs only the individual measurements and classical codes and, in addition, the key distribution problem allows to postpone the choice of the state encoding scheme until after the states are already received instead of choosing it before sending the states into the communication channel (i.e. to employ a sort of "antedate" coding).

Highlighting the Mechanism of the Quantum Speedup by Time-Symmetric and Relational Quantum Mechanics

NASA Astrophysics Data System (ADS)

Castagnoli, Giuseppe

2016-03-01

Bob hides a ball in one of four drawers. Alice is to locate it. Classically she has to open up to three drawers, quantally just one. The fundamental reason for this quantum speedup is not known. The usual representation of the quantum algorithm is limited to the process of solving the problem. We extend it to the process of setting the problem. The number of the drawer with the ball becomes a unitary transformation of the random outcome of the preparation measurement. This extended, time-symmetric, representation brings in relational quantum mechanics. It is with respect to Bob and any external observer and cannot be with respect to Alice. It would tell her the number of the drawer with the ball before she opens any drawer. To Alice, the projection of the quantum state due to the preparation measurement should be retarded at the end of her search; in the input state of the search, the drawer number is determined to Bob and undetermined to Alice. We show that, mathematically, one can ascribe any part of the selection of the random outcome of the preparation measurement to the final Alice's measurement. Ascribing half of it explains the speedup of the present algorithm. This leaves the input state to Bob unaltered and projects that to Alice on a state of lower entropy where she knows half of the number of the drawer with the ball in advance. The quantum algorithm turns out to be a sum over histories in each of which Alice knows in advance that the ball is in a pair of drawers and locates it by opening one of the two. In the sample of quantum algorithms examined, the part of the random outcome of the initial measurement selected by the final measurement is one half or slightly above it. Conversely, given an oracle problem, the assumption it is one half always corresponds to an existing quantum algorithm and gives the order of magnitude of the number of oracle queries required by the optimal one.

An Efficient and Secure Arbitrary N-Party Quantum Key Agreement Protocol Using Bell States

NASA Astrophysics Data System (ADS)

Liu, Wen-Jie; Xu, Yong; Yang, Ching-Nung; Gao, Pei-Pei; Yu, Wen-Bin

2018-01-01

Two quantum key agreement protocols using Bell states and Bell measurement were recently proposed by Shukla et al. (Quantum Inf. Process. 13(11), 2391-2405, 2014). However, Zhu et al. pointed out that there are some security flaws and proposed an improved version (Quantum Inf. Process. 14(11), 4245-4254, 2015). In this study, we will show Zhu et al.'s improvement still exists some security problems, and its efficiency is not high enough. For solving these problems, we utilize four Pauli operations { I, Z, X, Y} to encode two bits instead of the original two operations { I, X} to encode one bit, and then propose an efficient and secure arbitrary N-party quantum key agreement protocol. In the protocol, the channel checking with decoy single photons is introduced to avoid the eavesdropper's flip attack, and a post-measurement mechanism is used to prevent against the collusion attack. The security analysis shows the present protocol can guarantee the correctness, security, privacy and fairness of quantum key agreement.

The measurement problem in quantum mechanics: A phenomenological investigation

NASA Astrophysics Data System (ADS)

Hunter, Joel Brooks

2008-10-01

This dissertation is a phenomenological investigation of the measurement problem in quantum mechanics. The primary subject matter for description and analysis is scientific instruments and their use in experiments which elicit the measurement problem. A methodological critique is mounted against the ontological commitments taken for granted in the canonical interpretations of quantum theory and the scientific activity of measurement as the necessary interface between theoretical interest and perceptual results. I argue that an aesthetic dimension of reality functions as aproto-scientific establishment of sense-making that constantly operates to set integratively all other cognitively neat determinations, including scientifically rendered objects that are intrinsically non-visualizable. The way in which data "key in" to the original and originative register of the sensible in observation is clarified by examining prostheses, measuring apparatuses and instruments that are sense-conveying and -integrative with the human sensorium. Experiments, technology and instrumentation are examined in order to understand how knowing and that which is known is bonded by praxis-aisthesis. Quantum measurement is a praxic-dynamie activity and homologically structured and structur ing functional engagement in terms of instantiation, quantifiability, and spatiotemporal differentiation. The distinctions between a beauty-aesthetic and praxis-aisthesis are delineated. It is argued that a beauty-aesthetic is a construal of the economic dimension of scientific objects and work, and is not the primary manner in which the aesthetic dimension is disclosed. The economic dimension of abstractions reduces to an austere aesthetic of calculative economy. Nature itself, however, is not stingy; it is intrinsically capacious, extravagant, full of surprise, nuance, ambiguity and allusiveness. The capaciousness of Nature and the way in which we are integratively set within Nature in a materiality-phenomenality correlation discloses Nature's constituent potential, a condition more primitive than causal interplay. Finally, the relation between a physical mechanism or process and its functional mathematical representation is clarified. No physical mechanism or process accounts for the empirical effects of measurement outcomes in some quantum mechanical experiments. Within the milieu of ordinary perceptual experience, complete with its horizonal structure of spatiality and temporality, something uncaused is encountered which resists full determination in terms of mathematical representation. Keywords: Quantum Mechanics, Measurement Problem, Phenomenology, Prosthesis, Aesthetic

Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states

DOE Office of Scientific and Technical Information (OSTI.GOV)

McClean, Jarrod R.; Kimchi-Schwartz, Mollie E.; Carter, Jonathan

Using quantum devices supported by classical computational resources is a promising approach to quantum-enabled computation. One powerful example of such a hybrid quantum-classical approach optimized for classically intractable eigenvalue problems is the variational quantum eigensolver, built to utilize quantum resources for the solution of eigenvalue problems and optimizations with minimal coherence time requirements by leveraging classical computational resources. These algorithms have been placed as leaders among the candidates for the first to achieve supremacy over classical computation. Here, we provide evidence for the conjecture that variational approaches can automatically suppress even nonsystematic decoherence errors by introducing an exactly solvable channelmore » model of variational state preparation. Moreover, we develop a more general hierarchy of measurement and classical computation that allows one to obtain increasingly accurate solutions by leveraging additional measurements and classical resources. In conclusion, we demonstrate numerically on a sample electronic system that this method both allows for the accurate determination of excited electronic states as well as reduces the impact of decoherence, without using any additional quantum coherence time or formal error-correction codes.« less

Classical-processing and quantum-processing signal separation methods for qubit uncoupling

NASA Astrophysics Data System (ADS)

Deville, Yannick; Deville, Alain

2012-12-01

The Blind Source Separation problem consists in estimating a set of unknown source signals from their measured combinations. It was only investigated in a non-quantum framework up to now. We propose its first quantum extensions. We thus introduce the Quantum Source Separation field, investigating both its blind and non-blind configurations. More precisely, we show how to retrieve individual quantum bits (qubits) only from the global state resulting from their undesired coupling. We consider cylindrical-symmetry Heisenberg coupling, which e.g. occurs when two electron spins interact through exchange. We first propose several qubit uncoupling methods which typically measure repeatedly the coupled quantum states resulting from individual qubits preparations, and which then statistically process the classical data provided by these measurements. Numerical tests prove the effectiveness of these methods. We then derive a combination of quantum gates for performing qubit uncoupling, thus avoiding repeated qubit preparations and irreversible measurements.

Enter the machine

NASA Astrophysics Data System (ADS)

Palittapongarnpim, Pantita; Sanders, Barry C.

2018-05-01

Quantum tomography infers quantum states from measurement data, but it becomes infeasible for large systems. Machine learning enables tomography of highly entangled many-body states and suggests a new powerful approach to this problem.

Entanglement and the fermion sign problem in auxiliary field quantum Monte Carlo simulations

NASA Astrophysics Data System (ADS)

Broecker, Peter; Trebst, Simon

2016-08-01

Quantum Monte Carlo simulations of fermions are hampered by the notorious sign problem whose most striking manifestation is an exponential growth of sampling errors with the number of particles. With the sign problem known to be an NP-hard problem and any generic solution thus highly elusive, the Monte Carlo sampling of interacting many-fermion systems is commonly thought to be restricted to a small class of model systems for which a sign-free basis has been identified. Here we demonstrate that entanglement measures, in particular the so-called Rényi entropies, can intrinsically exhibit a certain robustness against the sign problem in auxiliary-field quantum Monte Carlo approaches and possibly allow for the identification of global ground-state properties via their scaling behavior even in the presence of a strong sign problem. We corroborate these findings via numerical simulations of fermionic quantum phase transitions of spinless fermions on the honeycomb lattice at and below half filling.

Decodoku: Quantum error rorrection as a simple puzzle game

NASA Astrophysics Data System (ADS)

Wootton, James

To build quantum computers, we need to detect and manage any noise that occurs. This will be done using quantum error correction. At the hardware level, QEC is a multipartite system that stores information non-locally. Certain measurements are made which do not disturb the stored information, but which do allow signatures of errors to be detected. Then there is a software problem. How to take these measurement outcomes and determine: a) The errors that caused them, and (b) how to remove their effects. For qubit error correction, the algorithms required to do this are well known. For qudits, however, current methods are far from optimal. We consider the error correction problem of qubit surface codes. At the most basic level, this is a problem that can be expressed in terms of a grid of numbers. Using this fact, we take the inherent problem at the heart of quantum error correction, remove it from its quantum context, and presented in terms of simple grid based puzzle games. We have developed three versions of these puzzle games, focussing on different aspects of the required algorithms. These have been presented and iOS and Android apps, allowing the public to try their hand at developing good algorithms to solve the puzzles. For more information, see www.decodoku.com. Funding from the NCCR QSIT.

Enhancing quantum annealing performance for the molecular similarity problem

NASA Astrophysics Data System (ADS)

Hernandez, Maritza; Aramon, Maliheh

2017-05-01

Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physical quantum annealer, motivating the study of methods to enhance the efficiency of such a solver. In this work, we present a quantum annealing approach to measure similarity among molecular structures. Implementing real-world problems on a quantum annealer is challenging due to hardware limitations such as sparse connectivity, intrinsic control error, and limited precision. In order to overcome the limited connectivity, a problem must be reformulated using minor-embedding techniques. Using a real data set, we investigate the performance of a quantum annealer in solving the molecular similarity problem. We provide experimental evidence that common practices for embedding can be replaced by new alternatives which mitigate some of the hardware limitations and enhance its performance. Common practices for embedding include minimizing either the number of qubits or the chain length and determining the strength of ferromagnetic couplers empirically. We show that current criteria for selecting an embedding do not improve the hardware's performance for the molecular similarity problem. Furthermore, we use a theoretical approach to determine the strength of ferromagnetic couplers. Such an approach removes the computational burden of the current empirical approaches and also results in hardware solutions that can benefit from simple local classical improvement. Although our results are limited to the problems considered here, they can be generalized to guide future benchmarking studies.

Information-reality complementarity in photonic weak measurements

NASA Astrophysics Data System (ADS)

Mancino, Luca; Sbroscia, Marco; Roccia, Emanuele; Gianani, Ilaria; Cimini, Valeria; Paternostro, Mauro; Barbieri, Marco

2018-06-01

The emergence of realistic properties is a key problem in understanding the quantum-to-classical transition. In this respect, measurements represent a way to interface quantum systems with the macroscopic world: these can be driven in the weak regime, where a reduced back-action can be imparted by choosing meter states able to extract different amounts of information. Here we explore the implications of such weak measurement for the variation of realistic properties of two-level quantum systems pre- and postmeasurement, and extend our investigations to the case of open systems implementing the measurements.

Generalized Galilean transformations and the measurement problem in the entropic dynamics approach to quantum theory

NASA Astrophysics Data System (ADS)

Johnson, David T.

Quantum mechanics is an extremely successful and accurate physical theory, yet since its inception, it has been afflicted with numerous conceptual difficulties. The primary subject of this thesis is the theory of entropic quantum dynamics (EQD), which seeks to avoid these conceptual problems by interpreting quantum theory from an informational perspective. We begin by reviewing Cox's work in describing probability theory as a means of rationally and consistently quantifying uncertainties. We then discuss how probabilities can be updated according to either Bayes' theorem or the extended method of maximum entropy (ME). After that discussion, we review the work of Caticha and Giffin that shows that Bayes' theorem is a special case of ME. This important result demonstrates that the ME method is the general method for updating probabilities. We then review some motivating difficulties in quantum mechanics before discussing Caticha's work in deriving quantum theory from the approach of entropic dynamics, which concludes our review. After entropic dynamics is introduced, we develop the concepts of symmetries and transformations from an informational perspective. The primary result is the formulation of a symmetry condition that any transformation must satisfy in order to qualify as a symmetry in EQD. We then proceed to apply this condition to the extended Galilean transformation. This transformation is of interest as it exhibits features of both special and general relativity. The transformation yields a gravitational potential that arises from an equivalence of information. We conclude the thesis with a discussion of the measurement problem in quantum mechanics. We discuss the difficulties that arise in the standard quantum mechanical approach to measurement before developing our theory of entropic measurement. In entropic dynamics, position is the only observable. We show how a theory built on this one observable can account for the multitude of measurements present in quantum theory. Furthermore, we show that the Born rule need not be postulated, but can be derived in EQD. Finally, we show how the wave function can be updated by the ME method as the phase is constructed purely in terms of probabilities.

Nonlinear dynamics and quantum entanglement in optomechanical systems.

PubMed

Wang, Guanglei; Huang, Liang; Lai, Ying-Cheng; Grebogi, Celso

2014-03-21

To search for and exploit quantum manifestations of classical nonlinear dynamics is one of the most fundamental problems in physics. Using optomechanical systems as a paradigm, we address this problem from the perspective of quantum entanglement. We uncover strong fingerprints in the quantum entanglement of two common types of classical nonlinear dynamical behaviors: periodic oscillations and quasiperiodic motion. There is a transition from the former to the latter as an experimentally adjustable parameter is changed through a critical value. Accompanying this process, except for a small region about the critical value, the degree of quantum entanglement shows a trend of continuous increase. The time evolution of the entanglement measure, e.g., logarithmic negativity, exhibits a strong dependence on the nature of classical nonlinear dynamics, constituting its signature.

Reconstructing high-dimensional two-photon entangled states via compressive sensing

PubMed Central

Tonolini, Francesco; Chan, Susan; Agnew, Megan; Lindsay, Alan; Leach, Jonathan

2014-01-01

Accurately establishing the state of large-scale quantum systems is an important tool in quantum information science; however, the large number of unknown parameters hinders the rapid characterisation of such states, and reconstruction procedures can become prohibitively time-consuming. Compressive sensing, a procedure for solving inverse problems by incorporating prior knowledge about the form of the solution, provides an attractive alternative to the problem of high-dimensional quantum state characterisation. Using a modified version of compressive sensing that incorporates the principles of singular value thresholding, we reconstruct the density matrix of a high-dimensional two-photon entangled system. The dimension of each photon is equal to d = 17, corresponding to a system of 83521 unknown real parameters. Accurate reconstruction is achieved with approximately 2500 measurements, only 3% of the total number of unknown parameters in the state. The algorithm we develop is fast, computationally inexpensive, and applicable to a wide range of quantum states, thus demonstrating compressive sensing as an effective technique for measuring the state of large-scale quantum systems. PMID:25306850

Measurements in Quantum Mechanics and von NEUMANN's Model

NASA Astrophysics Data System (ADS)

Mello, Pier A.; Johansen, Lars M.

2010-12-01

Many textbooks on Quantum Mechanics are not very precise as to the meaning of making a measurement: as a consequence, they frequently make assertions which are not based on a dynamical description of the measurement process. A model proposed by von Neumann allows a dynamical description of measurement in Quantum Mechanics, including the measuring instrument in the formalism. In this article we apply von Neumann's model to illustrate the measurement of an observable by means of a measuring instrument and show how various results, which are sometimens postulated without a dynamical basis, actually emerge. We also investigate the more complex, intriguing and fundamental problem of two successive measurements in Quantum Mechanics, extending von Neumann's model to two measuring instruments. We present a description which allows obtaining, in a unified way, various results that have been given in the literature.

Quantum-Inspired Maximizer

NASA Technical Reports Server (NTRS)

Zak, Michail

2008-01-01

A report discusses an algorithm for a new kind of dynamics based on a quantum- classical hybrid-quantum-inspired maximizer. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen 'computational' potential. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables, using classical methods. Such optimal combination of characteristics is a perfect match for quantum-inspired computing. As an application, an algorithm for global maximum of an arbitrary integrable function is proposed. The idea of the proposed algorithm is very simple: based upon the Quantum-inspired Maximizer (QIM), introduce a positive function to be maximized as the probability density to which the solution is attracted. Then the larger value of this function will have the higher probability to appear. Special attention is paid to simulation of integer programming and NP-complete problems. It is demonstrated that the problem of global maximum of an integrable function can be found in polynomial time by using the proposed quantum- classical hybrid. The result is extended to a constrained maximum with applications to integer programming and TSP (Traveling Salesman Problem).

Multiparameter Estimation in Networked Quantum Sensors

NASA Astrophysics Data System (ADS)

Proctor, Timothy J.; Knott, Paul A.; Dunningham, Jacob A.

2018-02-01

We introduce a general model for a network of quantum sensors, and we use this model to consider the following question: When can entanglement between the sensors, and/or global measurements, enhance the precision with which the network can measure a set of unknown parameters? We rigorously answer this question by presenting precise theorems proving that for a broad class of problems there is, at most, a very limited intrinsic advantage to using entangled states or global measurements. Moreover, for many estimation problems separable states and local measurements are optimal, and can achieve the ultimate quantum limit on the estimation uncertainty. This immediately implies that there are broad conditions under which simultaneous estimation of multiple parameters cannot outperform individual, independent estimations. Our results apply to any situation in which spatially localized sensors are unitarily encoded with independent parameters, such as when estimating multiple linear or nonlinear optical phase shifts in quantum imaging, or when mapping out the spatial profile of an unknown magnetic field. We conclude by showing that entangling the sensors can enhance the estimation precision when the parameters of interest are global properties of the entire network.

Quantum simulation of the integer factorization problem: Bell states in a Penning trap

NASA Astrophysics Data System (ADS)

Rosales, Jose Luis; Martin, Vicente

2018-03-01

The arithmetic problem of factoring an integer N can be translated into the physics of a quantum device, a result that supports Pólya's and Hilbert's conjecture to demonstrate Riemann's hypothesis. The energies of this system, being univocally related to the factors of N , are the eigenvalues of a bounded Hamiltonian. Here we solve the quantum conditions and show that the histogram of the discrete energies, provided by the spectrum of the system, should be interpreted in number theory as the relative probability for a prime to be a factor candidate of N . This is equivalent to a quantum sieve that is shown to require only o (ln√{N}) 3 energy measurements to solve the problem, recovering Shor's complexity result. Hence the outcome can be seen as a probability map that a pair of primes solve the given factorization problem. Furthermore, we show that a possible embodiment of this quantum simulator corresponds to two entangled particles in a Penning trap. The possibility to build the simulator experimentally is studied in detail. The results show that factoring numbers, many orders of magnitude larger than those computed with experimentally available quantum computers, is achievable using typical parameters in Penning traps.

Transforming graph states using single-qubit operations.

PubMed

Dahlberg, Axel; Wehner, Stephanie

2018-07-13

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by single-qubit Clifford operations (LC), single-qubit Pauli measurements (LPM) and classical communication (CC) between sites holding the individual qubits. What is more, we provide a recipe to obtain the sequence of LC+LPM+CC operations which prepare the desired target state from the source state, and show how these operations can be applied in parallel to reach the target state in constant time. Our algorithm has applications in quantum networks, quantum computing, and can also serve as a design tool-for example, to find transformations between quantum error correcting codes. We provide a software implementation of our algorithm that makes this tool easier to apply. A key insight leading to our algorithm is to show that the problem is equivalent to one in graph theory, which is to decide whether some graph G ' is a vertex-minor of another graph G The vertex-minor problem is, in general, [Formula: see text]-Complete, but can be solved efficiently on graphs which are not too complex. A measure of the complexity of a graph is the rank-width which equals the Schmidt-rank width of a subclass of stabilizer states called graph states, and thus intuitively is a measure of entanglement. Here, we show that the vertex-minor problem can be solved in time O (| G | 3 ), where | G | is the size of the graph G , whenever the rank-width of G and the size of G ' are bounded. Our algorithm is based on techniques by Courcelle for solving fixed parameter tractable problems, where here the relevant fixed parameter is the rank width. The second half of this paper serves as an accessible but far from exhausting introduction to these concepts, that could be useful for many other problems in quantum information.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'. © 2018 The Author(s).

Physical theories, eternal inflation, and the quantum universe

NASA Astrophysics Data System (ADS)

Nomura, Yasunori

2011-11-01

Infinities in eternal inflation have long been plaguing cosmology, making any predictions highly sensitive to how they are regulated. The problem exists already at the level of semi-classical general relativity, and has a priori nothing to do with quantum gravity. On the other hand, we know that certain problems in semi-classical gravity, for example physics of black holes and their evaporation, have led to understanding of surprising, quantum natures of spacetime and gravity, such as the holographic principle and horizon complementarity. In this paper, we present a framework in which well-defined predictions are obtained in an eternally inflating multiverse, based on the principles of quantum mechanics. We propose that the entire multiverse is described purely from the viewpoint of a single "observer," who describes the world as a quantum state defined on his/her past light cones bounded by the (stretched) apparent horizons. We find that quantum mechanics plays an essential role in regulating infinities. The framework is "gauge invariant," i.e. predictions do not depend on how spacetime is parametrized, as it should be in a theory of quantum gravity. Our framework provides a fully unified treatment of quantum measurement processes and the multiverse. We conclude that the eternally inflating multiverse and many worlds in quantum mechanics are the same. Other important implications include: global spacetime can be viewed as a derived concept; the multiverse is a transient phenomenon during the world relaxing into a supersymmetric Minkowski state. We also present a model of "initial conditions" for the multiverse. By extrapolating our framework to the extreme, we arrive at a picture that the entire multiverse is a fluctuation in the stationary, fractal "mega-multiverse," in which an infinite sequence of multiverse productions occurs. The framework discussed here does not suffer from problems/paradoxes plaguing other measures proposed earlier, such as the youngness paradox and the Boltzmann brain problem.

Space and time in the quantum universe.

NASA Astrophysics Data System (ADS)

Smolin, L.

This paper is devoted to the problem of constructing a quantum theory that could describe a closed system - a quantum cosmology. The author argues that this problem is an aspect of a much older problem - that of how to eliminate from the physical theories "ideal elements", which are elements of the mathematical structure whose interpretation requires the existence of things outside the dynamical system described by the theory. This discussion is aimed at uncovering criteria that a theory of quantum cosmology must satisfy, if it is to give physically sensible predictions. The author proposes three such criteria and shows that conventional quantum cosmology can only satisfy them, if there is an intrinsic time coordinate on the phase space of the theory. It is shown that approaches based on correlations in the wave function, that do not use an inner product, cannot satisfy these criteria. As example, the author discusses the problem of quantizing a class of relational dynamical models invented by Barbour and Bertotti. The dynamical structure of these theories is closely analogous to general relativity, and the problem of their measurement theory is also similar. It is concluded that these theories can only be sensibly quantized if they contain an intrinsic time.

Almost-Quantum Correlations Violate the No-Restriction Hypothesis

NASA Astrophysics Data System (ADS)

Sainz, Ana Belén; Guryanova, Yelena; Acín, Antonio; Navascués, Miguel

2018-05-01

To identify which principles characterize quantum correlations, it is essential to understand in which sense this set of correlations differs from that of almost-quantum correlations. We solve this problem by invoking the so-called no-restriction hypothesis, an explicit and natural axiom in many reconstructions of quantum theory stating that the set of possible measurements is the dual of the set of states. We prove that, contrary to quantum correlations, no generalized probabilistic theory satisfying the no-restriction hypothesis is able to reproduce the set of almost-quantum correlations. Therefore, any theory whose correlations are exactly, or very close to, the almost-quantum correlations necessarily requires a rule limiting the possible measurements. Our results suggest that the no-restriction hypothesis may play a fundamental role in singling out the set of quantum correlations among other nonsignaling ones.

Almost-Quantum Correlations Violate the No-Restriction Hypothesis.

PubMed

Sainz, Ana Belén; Guryanova, Yelena; Acín, Antonio; Navascués, Miguel

2018-05-18

To identify which principles characterize quantum correlations, it is essential to understand in which sense this set of correlations differs from that of almost-quantum correlations. We solve this problem by invoking the so-called no-restriction hypothesis, an explicit and natural axiom in many reconstructions of quantum theory stating that the set of possible measurements is the dual of the set of states. We prove that, contrary to quantum correlations, no generalized probabilistic theory satisfying the no-restriction hypothesis is able to reproduce the set of almost-quantum correlations. Therefore, any theory whose correlations are exactly, or very close to, the almost-quantum correlations necessarily requires a rule limiting the possible measurements. Our results suggest that the no-restriction hypothesis may play a fundamental role in singling out the set of quantum correlations among other nonsignaling ones.

Universality of measurements on quantum markets

NASA Astrophysics Data System (ADS)

Pakuła, Ireneusz; Piotrowski, Edward W.; Sładkowski, Jan

2007-11-01

Two of the authors have recently discussed financial markets operated by quantum computers-quantum market games. These “new markets” cannot by themselves create opportunity of making extraordinary profits or multiplying goods, but they may cause the dynamism of transaction which would result in more effective markets and capital flow into hands of the most efficient traders. Here we focus upon the problem of universality of measurement in quantum market games offering a possible method of implementation if the necessary technologies would be available. It can be also used to analyse material commitments that elude description in orthodox game-theoretic terms.

Less Decoherence and More Coherence in Quantum Gravity, Inflationary Cosmology and Elsewhere

NASA Astrophysics Data System (ADS)

Okon, Elias; Sudarsky, Daniel

2016-07-01

In Crull (Found Phys 45:1019-1045, 2015) it is argued that, in order to confront outstanding problems in cosmology and quantum gravity, interpretational aspects of quantum theory can by bypassed because decoherence is able to resolve them. As a result, Crull (Found Phys 45:1019-1045, 2015) concludes that our focus on conceptual and interpretational issues, while dealing with such matters in Okon and Sudarsky (Found Phys 44:114-143, 2014), is avoidable and even pernicious. Here we will defend our position by showing in detail why decoherence does not help in the resolution of foundational questions in quantum mechanics, such as the measurement problem or the emergence of classicality.

Semi-quantum Dialogue Based on Single Photons

NASA Astrophysics Data System (ADS)

Ye, Tian-Yu; Ye, Chong-Qiang

2018-02-01

In this paper, we propose two semi-quantum dialogue (SQD) protocols by using single photons as the quantum carriers, where one requires the classical party to possess the measurement capability and the other does not have this requirement. The security toward active attacks from an outside Eve in the first SQD protocol is guaranteed by the complete robustness of present semi-quantum key distribution (SQKD) protocols, the classical one-time pad encryption, the classical party's randomization operation and the decoy photon technology. The information leakage problem of the first SQD protocol is overcome by the classical party' classical basis measurements on the single photons carrying messages which makes him share their initial states with the quantum party. The security toward active attacks from Eve in the second SQD protocol is guaranteed by the classical party's randomization operation, the complete robustness of present SQKD protocol and the classical one-time pad encryption. The information leakage problem of the second SQD protocol is overcome by the quantum party' classical basis measurements on each two adjacent single photons carrying messages which makes her share their initial states with the classical party. Compared with the traditional information leakage resistant QD protocols, the advantage of the proposed SQD protocols lies in that they only require one party to have quantum capabilities. Compared with the existing SQD protocol, the advantage of the proposed SQD protocols lies in that they only employ single photons rather than two-photon entangled states as the quantum carriers. The proposed SQD protocols can be implemented with present quantum technologies.

Quantum neurophysics: From non-living matter to quantum neurobiology and psychopathology.

PubMed

Tarlacı, Sultan; Pregnolato, Massimo

2016-05-01

The concepts of quantum brain, quantum mind and quantum consciousness have been increasingly gaining currency in recent years, both in scientific papers and in the popular press. In fact, the concept of the quantum brain is a general framework. Included in it are basically four main sub-headings. These are often incorrectly used interchangeably. The first of these and the one which started the quantum mind/consciousness debate was the place of consciousness in the problem of measurement in quantum mechanics. Debate on the problem of quantum measurement and about the place of the conscious observer has lasted almost a century. One solution to this problem is that the participation of a conscious observer in the experiment will radically change our understanding of the universe and our relationship with the outside world. The second topic is that of quantum biology. This topic has become a popular field of research, especially in the last decade. It concerns whether or not the rules of quantum physics operate in biological structures. It has been shown in the latest research on photosynthesis, the sense of smell and magnetic direction finding in animals that the laws of quantum physics may operate in warm-wet-noisy biological structures. The third sub-heading is quantum neurobiology. This topic has not yet gained wide acceptance and is still in its early stages. Its primary purpose is directed to understand whether the laws of quantum physics are effective in the biology of the nervous system or not. A further step in brain neurobiology, toward the understanding of consciousness formation, is the research of quantum laws effects upon neural network functions. The fourth and final topic is quantum psychopathology. This topic takes its basis and its support from quantum neurobiology. It comes from the idea that if quantum physics is involved in the normal working of the brain, diseased conditions of the brain such as depression, anxiety, dementia, schizophrenia and hallucinations can be explained by quantum physical pathology. In this article, these topics will be reviewed in a general framework, and for the first time a general classification will be made for the quantum brain theory. Copyright © 2016 Elsevier B.V. All rights reserved.

Computing quantum discord is NP-complete

NASA Astrophysics Data System (ADS)

Huang, Yichen

2014-03-01

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, squashed entanglement, classical squashed entanglement, conditional entanglement of mutual information, and broadcast regularization of mutual information) and constrained Holevo capacity are NP-hard/NP-complete to compute. These complexity-theoretic results are directly applicable in common randomness distillation, quantum state merging, entanglement distillation, superdense coding, and quantum teleportation; they may offer significant insights into quantum information processing. Moreover, we prove the NP-completeness of two typical problems: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically computationally intractable.

Interpretations

NASA Astrophysics Data System (ADS)

Bellac, Michel Le

2014-11-01

Although nobody can question the practical efficiency of quantum mechanics, there remains the serious question of its interpretation. As Valerio Scarani puts it, "We do not feel at ease with the indistinguishability principle (that is, the superposition principle) and some of its consequences." Indeed, this principle which pervades the quantum world is in stark contradiction with our everyday experience. From the very beginning of quantum mechanics, a number of physicists--but not the majority of them!--have asked the question of its "interpretation". One may simply deny that there is a problem: according to proponents of the minimalist interpretation, quantum mechanics is self-sufficient and needs no interpretation. The point of view held by a majority of physicists, that of the Copenhagen interpretation, will be examined in Section 10.1. The crux of the problem lies in the status of the state vector introduced in the preceding chapter to describe a quantum system, which is no more than a symbolic representation for the Copenhagen school of thought. Conversely, one may try to attribute some "external reality" to this state vector, that is, a correspondence between the mathematical description and the physical reality. In this latter case, it is the measurement problem which is brought to the fore. In 1932, von Neumann was first to propose a global approach, in an attempt to build a purely quantum theory of measurement examined in Section 10.2. This theory still underlies modern approaches, among them those grounded on decoherence theory, or on the macroscopic character of the measuring apparatus: see Section 10.3. Finally, there are non-standard interpretations such as Everett's many worlds theory or the hidden variables theory of de Broglie and Bohm (Section 10.4). Note, however, that this variety of interpretations has no bearing whatsoever on the practical use of quantum mechanics. There is no controversy on the way we should use quantum mechanics!

Quantum Steering Inequality with Tolerance for Measurement-Setting Errors: Experimentally Feasible Signature of Unbounded Violation

NASA Astrophysics Data System (ADS)

Rutkowski, Adam; Buraczewski, Adam; Horodecki, Paweł; Stobińska, Magdalena

2017-01-01

Quantum steering is a relatively simple test for proving that the values of quantum-mechanical measurement outcomes come into being only in the act of measurement. By exploiting quantum correlations, Alice can influence—steer—Bob's physical system in a way that is impossible in classical mechanics, as shown by the violation of steering inequalities. Demonstrating this and similar quantum effects for systems of increasing size, approaching even the classical limit, is a long-standing challenging problem. Here, we prove an experimentally feasible unbounded violation of a steering inequality. We derive its universal form where tolerance for measurement-setting errors is explicitly built in by means of the Deutsch-Maassen-Uffink entropic uncertainty relation. Then, generalizing the mutual unbiasedness, we apply the inequality to the multisinglet and multiparticle bipartite Bell state. However, the method is general and opens the possibility of employing multiparticle bipartite steering for randomness certification and development of quantum technologies, e.g., random access codes.

Dynamic pluralism: A pluralist framework for science

NASA Astrophysics Data System (ADS)

Ferret, Juan

The problem of measurement in quantum physics is one of the most recalcitrant problems of science. Part of the problem lies in the fact that several conflicting interpretations that account for how measurement takes place have endured. Most theorists of science assume that one of the available interpretations, or a future variation of one, will prove to be the true interpretation. What I argue in this dissertation is that the proper response to this problem may be to have a framework in which different relevant interpretations can coexist and offer critical examinations of the conceptual issues related to the problem of measurement. This pluralism of interpretations is not the result of some flaw or inadequacy in quantum physics. From this alternative framework, pluralism in the problem of measurement can be understood as an acceptable, even necessary, response to the process of theorizing and experimentation in quantum mechanics. An important claim in this dissertation is that contemporary versions of pluralism in philosophy of science do not provide an account that recognizes the viability of all the interpretations of the problem of measurement. After showing how these versions of pluralism in philosophy of science fall short, as they apply to the problem of measurement, I argue for several conditions that a pluralism needs to satisfy in order to serve as a pluralistic framework for the evaluation of all interpretations of the problem of measurement. I develop an alternative version of pluralism that does account for the existing and future plurality of interpretations of the problem of measurement. My proposal is that a version of pluralism based on the work of William James and Paul Feyerabend will meet these conditions. Specifically, after introducing the complex pluralism of James as a version of pluralism that comes close to accounting for the multiplicity of interpretations of the problem of measurement, I argue that his version of pluralism does not fulfill a few of the necessary conditions. Next, I use the work on pluralism of Feyerabend to fill in the lacunas left in James's account. Finally, I show how the emerging pluralist framework, what I term dynamic pluralism, satisfies the conditions for a pluralism that can serve as a framework for understanding all of the possible interpretations of the problem of measurement.

Schrödinger's immortal cat

NASA Astrophysics Data System (ADS)

Peres, Asher

1988-01-01

The purpose of this paper is to review and clarify the quantum “measurement problem.” The latter originates in the ambivalent nature of the “observer”: Although the observer is not described by the Schrödinger equation, it should nevertheless be possible to “quantize” him and include him in the wave function if quantum theory is universally valid. The problem is to prove that no contradiction may arise in these two conflicting descriptions. The proof invokes the notion of irreversibility. The validity of the latter is questionable, because the standard rationale for classical irreversibility, namely mixing and coarse graining, does not apply to quantum theory. There is no chaos in a closed, finite quantum system. However, when a system is large enough, it cannot be perfectly isolated from its “environment,” namely from external (or even internal) degrees of freedom which are not fully accounted for in the Hamiltonian of that system. As a consequence, the long-range evolution of such a quantum system is essentially unpredictable. It follows that the notion of irreversibility is a valid one in quantum theory and the “measurement problem” can be brought to a satisfactory solution.

Two-party quantum key agreement with five-particle entangled states

NASA Astrophysics Data System (ADS)

He, Ye-Feng; Ma, Wen-Ping

A two-party quantum key agreement protocol is proposed with five-particle entangled states and the delayed measurement technique. According to the measurement correlation property of five-particle entangled states, two participants can deduce the measurement results of each other’s initial quantum states. As a result, two parties can extract the secret keys of each other by using the publicly announced value or by performing the delayed measurement, respectively. Thus, a shared key is fairly established. Since each particle is transmitted only once in quantum channel, the protocol is congenitally free from the Trojan horse attacks. It is shown that the protocol not only is secure against both participant and outsider attacks but also has no information leakage problem. Moreover, it has high qubit efficiency.

Multiparameter Estimation in Networked Quantum Sensors

DOE Office of Scientific and Technical Information (OSTI.GOV)

Proctor, Timothy J.; Knott, Paul A.; Dunningham, Jacob A.

We introduce a general model for a network of quantum sensors, and we use this model to consider the question: When can entanglement between the sensors, and/or global measurements, enhance the precision with which the network can measure a set of unknown parameters? We rigorously answer this question by presenting precise theorems proving that for a broad class of problems there is, at most, a very limited intrinsic advantage to using entangled states or global measurements. Moreover, for many estimation problems separable states and local measurements are optimal, and can achieve the ultimate quantum limit on the estimation uncertainty. Thismore » immediately implies that there are broad conditions under which simultaneous estimation of multiple parameters cannot outperform individual, independent estimations. Our results apply to any situation in which spatially localized sensors are unitarily encoded with independent parameters, such as when estimating multiple linear or non-linear optical phase shifts in quantum imaging, or when mapping out the spatial profile of an unknown magnetic field. We conclude by showing that entangling the sensors can enhance the estimation precision when the parameters of interest are global properties of the entire network.« less

Multiparameter Estimation in Networked Quantum Sensors

DOE PAGES

Proctor, Timothy J.; Knott, Paul A.; Dunningham, Jacob A.

2018-02-21

We introduce a general model for a network of quantum sensors, and we use this model to consider the question: When can entanglement between the sensors, and/or global measurements, enhance the precision with which the network can measure a set of unknown parameters? We rigorously answer this question by presenting precise theorems proving that for a broad class of problems there is, at most, a very limited intrinsic advantage to using entangled states or global measurements. Moreover, for many estimation problems separable states and local measurements are optimal, and can achieve the ultimate quantum limit on the estimation uncertainty. Thismore » immediately implies that there are broad conditions under which simultaneous estimation of multiple parameters cannot outperform individual, independent estimations. Our results apply to any situation in which spatially localized sensors are unitarily encoded with independent parameters, such as when estimating multiple linear or non-linear optical phase shifts in quantum imaging, or when mapping out the spatial profile of an unknown magnetic field. We conclude by showing that entangling the sensors can enhance the estimation precision when the parameters of interest are global properties of the entire network.« less

Quantum Darwinism

NASA Astrophysics Data System (ADS)

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.

A noise immunity controlled quantum teleportation protocol

NASA Astrophysics Data System (ADS)

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.

Beyond Moore's law: towards competitive quantum devices

NASA Astrophysics Data System (ADS)

Troyer, Matthias

2015-05-01

A century after the invention of quantum theory and fifty years after Bell's inequality we see the first quantum devices emerge as products that aim to be competitive with the best classical computing devices. While a universal quantum computer of non-trivial size is still out of reach there exist a number commercial and experimental devices: quantum random number generators, quantum simulators and quantum annealers. In this colloquium I will present some of these devices and validation tests we performed on them. Quantum random number generators use the inherent randomness in quantum measurements to produce true random numbers, unlike classical pseudorandom number generators which are inherently deterministic. Optical lattice emulators use ultracold atomic gases in optical lattices to mimic typical models of condensed matter physics. In my talk I will focus especially on the devices built by Canadian company D-Wave systems, which are special purpose quantum simulators for solving hard classical optimization problems. I will review the controversy around the quantum nature of these devices and will compare them to state of the art classical algorithms. I will end with an outlook towards universal quantum computing and end with the question: which important problems that are intractable even for post-exa-scale classical computers could we expect to solve once we have a universal quantum computer?

Provable classically intractable sampling with measurement-based computation in constant time

NASA Astrophysics Data System (ADS)

Sanders, Stephen; Miller, Jacob; Miyake, Akimasa

We present a constant-time measurement-based quantum computation (MQC) protocol to perform a classically intractable sampling problem. We sample from the output probability distribution of a subclass of the instantaneous quantum polynomial time circuits introduced by Bremner, Montanaro and Shepherd. In contrast with the usual circuit model, our MQC implementation includes additional randomness due to byproduct operators associated with the computation. Despite this additional randomness we show that our sampling task cannot be efficiently simulated by a classical computer. We extend previous results to verify the quantum supremacy of our sampling protocol efficiently using only single-qubit Pauli measurements. Center for Quantum Information and Control, Department of Physics and Astronomy, University of New Mexico, Albuquerque, NM 87131, USA.

Lyapounov variable: Entropy and measurement in quantum mechanics

PubMed Central

Misra, B.; Prigogine, I.; Courbage, M.

1979-01-01

We discuss the question of the dynamical meaning of the second law of thermodynamics in the framework of quantum mechanics. Previous discussion of the problem in the framework of classical dynamics has shown that the second law can be given a dynamical meaning in terms of the existence of so-called Lyapounov variables—i.e., dynamical variables varying monotonically in time without becoming contradictory. It has been found that such variables can exist in an extended framework of classical dynamics, provided that the dynamical motion is suitably unstable. In this paper we begin to extend these results to quantum mechanics. It is found that no dynamical variable with the characteristic properties of nonequilibrium entropy can be defined in the standard formulation of quantum mechanics. However, if the Hamiltonian has certain well-defined spectral properties, such variables can be defined but only as a nonfactorizable superoperator. Necessary nonfactorizability of such entropy operators M has the consequence that they cannot preserve the class of pure states. Physically, this means that the distinguishability between pure states and corresponding mixtures must be lost in the case of a quantal system for which the algebra of observables can be extended to include a new dynamical variable representing nonequilibrium entropy. We discuss how this result leads to a solution of the quantum measurement problem. It is also found that the question of existence of entropy of superoperators M is closely linked to the problem of defining an operator of time in quantum mechanics. PMID:16578757

Quantum State Tomography via Linear Regression Estimation

PubMed Central

Qi, Bo; Hou, Zhibo; Li, Li; Dong, Daoyi; Xiang, Guoyong; Guo, Guangcan

2013-01-01

A simple yet efficient state reconstruction algorithm of linear regression estimation (LRE) is presented for quantum state tomography. In this method, quantum state reconstruction is converted into a parameter estimation problem of a linear regression model and the least-squares method is employed to estimate the unknown parameters. An asymptotic mean squared error (MSE) upper bound for all possible states to be estimated is given analytically, which depends explicitly upon the involved measurement bases. This analytical MSE upper bound can guide one to choose optimal measurement sets. The computational complexity of LRE is O(d4) where d is the dimension of the quantum state. Numerical examples show that LRE is much faster than maximum-likelihood estimation for quantum state tomography. PMID:24336519

The dynamics of stock exchange based on the formalism of weak continuous quantum measurement

NASA Astrophysics Data System (ADS)

Melnyk, S.; Tuluzov, I.

2010-07-01

The problem of measurement in economic models and the possibility of their quantum-mechanical description are considered. It is revealed that the apparent paradox of such a description is associated with a priori requirement of conformity of the model to all the alternatives of free choice of the observer. The measurement of the state of a trader on a stock exchange is formally defined as his responses to the proposals of sale at a fixed price. It is shown that an analogue of Bell's inequalities for this measurement model is violated at the most general assumptions related to the strategy of the trader and requires a quantum-mechanical description of the dynamics of his condition. In the framework of the theory of weak continuous quantum measurements, the equation of stock price dynamics and the quantum-mechanical generalization of the F. Black and M. Scholes model for pricing options are obtained. The fundamental distinctions between the obtained model and the classical one are discussed.

Measuring out-of-time-order correlations and multiple quantum spectra in a trapped-ion quantum magnet

NASA Astrophysics Data System (ADS)

Gärttner, Martin; Bohnet, Justin G.; Safavi-Naini, Arghavan; Wall, Michael L.; Bollinger, John J.; Rey, Ana Maria

2017-08-01

Controllable arrays of ions and ultracold atoms can simulate complex many-body phenomena and may provide insights into unsolved problems in modern science. To this end, experimentally feasible protocols for quantifying the buildup of quantum correlations and coherence are needed, as performing full state tomography does not scale favourably with the number of particles. Here we develop and experimentally demonstrate such a protocol, which uses time reversal of the many-body dynamics to measure out-of-time-order correlation functions (OTOCs) in a long-range Ising spin quantum simulator with more than 100 ions in a Penning trap. By measuring a family of OTOCs as a function of a tunable parameter we obtain fine-grained information about the state of the system encoded in the multiple quantum coherence spectrum, extract the quantum state purity, and demonstrate the buildup of up to 8-body correlations. Future applications of this protocol could enable studies of many-body localization, quantum phase transitions, and tests of the holographic duality between quantum and gravitational systems.

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

The quantum measurement problem.

PubMed

Leggett, A J

2005-02-11

Despite the spectacular success of quantum mechanics (QM) over the last 80 years in explaining phenomena observed at the atomic and subatomic level, the conceptual status of the theory is still a topic of lively controversy. Most of the discussion centers around two famous paradoxes (or, as some would have it, pseudoparadoxes) associated, respectively, with the names of Einstein, Podolsky, and Rosen (EPR) and with Schrodinger's cat. In this Viewpoint, I will concentrate on the paradox of Schrodinger's cat or, as it is often known (to my mind somewhat misleadingly), the quantum measurement paradox.

Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification

NASA Astrophysics Data System (ADS)

Miller, Jacob; Sanders, Stephen; Miyake, Akimasa

2017-12-01

While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable advantage in quantum devices without demanding quantum error correction, which is crucial for prolonging the coherence time of qubits. We propose a model device made of locally interacting multiple qubits, designed such that simultaneous single-qubit measurements on it can output probability distributions whose average-case sampling is classically intractable, under similar assumptions as the sampling of noninteracting bosons and instantaneous quantum circuits. Notably, in contrast to these previous unitary-based realizations, our measurement-based implementation has two distinctive features. (i) Our implementation involves no adaptation of measurement bases, leading output probability distributions to be generated in constant time, independent of the system size. Thus, it could be implemented in principle without quantum error correction. (ii) Verifying the classical intractability of our sampling is done by changing the Pauli measurement bases only at certain output qubits. Our usage of random commuting quantum circuits in place of computationally universal circuits allows a unique unification of sampling and verification, so they require the same physical resource requirements in contrast to the more demanding verification protocols seen elsewhere in the literature.

Speakable and Unspeakable in Quantum Mechanics

NASA Astrophysics Data System (ADS)

Bell, J. S.; Aspect, Introduction by Alain

2004-06-01

List of papers on quantum philosophy by J. S. Bell; Preface; Acknowledgements; Introduction by Alain Aspect; 1. On the problem of hidden variables in quantum mechanics; 2. On the Einstein-Rosen-Podolsky paradox; 3. The moral aspects of quantum mechanics; 4. Introduction to the hidden-variable question; 5. Subject and object; 6. On wave packet reduction in the Coleman-Hepp model; 7. The theory of local beables; 8. Locality in quantum mechanics: reply to critics; 9. How to teach special relativity; 10. Einstein-Podolsky-Rosen experiments; 11. The measurement theory of Everett and de Broglie's pilot wave; 12. Free variables and local causality; 13. Atomic-cascade photons and quantum-mechanical nonlocality; 14. de Broglie-Bohm delayed choice double-slit experiments and density matrix; 15. Quantum mechanics for cosmologists; 16. Bertlmann's socks and the nature of reality; 17. On the impossible pilot wave; 18. Speakable and unspeakable in quantum mechanics; 19. Beables for quantum field theory; 20. Six possible worlds of quantum mechanics; 21. EPR correlations and EPR distributions; 22. Are there quantum jumps?; 23. Against 'measurement'; 24. La Nouvelle cuisine.

Optimal subsystem approach to multi-qubit quantum state discrimination and experimental investigation

NASA Astrophysics Data System (ADS)

Xue, ShiChuan; Wu, JunJie; Xu, Ping; Yang, XueJun

2018-02-01

Quantum computing is a significant computing capability which is superior to classical computing because of its superposition feature. Distinguishing several quantum states from quantum algorithm outputs is often a vital computational task. In most cases, the quantum states tend to be non-orthogonal due to superposition; quantum mechanics has proved that perfect outcomes could not be achieved by measurements, forcing repetitive measurement. Hence, it is important to determine the optimum measuring method which requires fewer repetitions and a lower error rate. However, extending current measurement approaches mainly aiming at quantum cryptography to multi-qubit situations for quantum computing confronts challenges, such as conducting global operations which has considerable costs in the experimental realm. Therefore, in this study, we have proposed an optimum subsystem method to avoid these difficulties. We have provided an analysis of the comparison between the reduced subsystem method and the global minimum error method for two-qubit problems; the conclusions have been verified experimentally. The results showed that the subsystem method could effectively discriminate non-orthogonal two-qubit states, such as separable states, entangled pure states, and mixed states; the cost of the experimental process had been significantly reduced, in most circumstances, with acceptable error rate. We believe the optimal subsystem method is the most valuable and promising approach for multi-qubit quantum computing applications.

Necessary and sufficient optimality conditions for classical simulations of quantum communication processes

NASA Astrophysics Data System (ADS)

Montina, Alberto; Wolf, Stefan

2014-07-01

We consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required for classically simulating it. Recently, we reduced the computation of this quantity to a convex minimization problem with linear constraints. Every solution of the constraints provides an upper bound on the communication complexity. In this paper, we derive the dual maximization problem of the original one. The feasible points of the dual constraints, which are inequalities, give lower bounds on the communication complexity, as illustrated with an example. The optimal values of the two problems turn out to be equal (zero duality gap). By this property, we provide necessary and sufficient conditions for optimality in terms of a set of equalities and inequalities. We use these conditions and two reasonable but unproven hypotheses to derive the lower bound n ×2n -1 for a noiseless quantum channel with capacity equal to n qubits. This lower bound can have interesting consequences in the context of the recent debate on the reality of the quantum state.

What quantum measurements measure

NASA Astrophysics Data System (ADS)

Griffiths, Robert B.

2017-09-01

A solution to the second measurement problem, determining what prior microscopic properties can be inferred from measurement outcomes ("pointer positions"), is worked out for projective and generalized (POVM) measurements, using consistent histories. The result supports the idea that equipment properly designed and calibrated reveals the properties it was designed to measure. Applications include Einstein's hemisphere and Wheeler's delayed choice paradoxes, and a method for analyzing weak measurements without recourse to weak values. Quantum measurements are noncontextual in the original sense employed by Bell and Mermin: if [A ,B ]=[A ,C ]=0 ,[B ,C ]≠0 , the outcome of an A measurement does not depend on whether it is measured with B or with C . An application to Bohm's model of the Einstein-Podolsky-Rosen situation suggests that a faulty understanding of quantum measurements is at the root of this paradox.

Experimental Measurement-Device-Independent Entanglement Detection

NASA Astrophysics Data System (ADS)

Nawareg, Mohamed; Muhammad, Sadiq; Amselem, Elias; Bourennane, Mohamed

2015-02-01

Entanglement is one of the most puzzling features of quantum theory and of great importance for the new field of quantum information. The determination whether a given state is entangled or not is one of the most challenging open problems of the field. Here we report on the experimental demonstration of measurement-device-independent (MDI) entanglement detection using witness method for general two qubits photon polarization systems. In the MDI settings, there is no requirement to assume perfect implementations or neither to trust the measurement devices. This experimental demonstration can be generalized for the investigation of properties of quantum systems and for the realization of cryptography and communication protocols.

Experimental Measurement-Device-Independent Entanglement Detection

PubMed Central

Nawareg, Mohamed; Muhammad, Sadiq; Amselem, Elias; Bourennane, Mohamed

2015-01-01

Entanglement is one of the most puzzling features of quantum theory and of great importance for the new field of quantum information. The determination whether a given state is entangled or not is one of the most challenging open problems of the field. Here we report on the experimental demonstration of measurement-device-independent (MDI) entanglement detection using witness method for general two qubits photon polarization systems. In the MDI settings, there is no requirement to assume perfect implementations or neither to trust the measurement devices. This experimental demonstration can be generalized for the investigation of properties of quantum systems and for the realization of cryptography and communication protocols. PMID:25649664

High-rate measurement-device-independent quantum cryptography

NASA Astrophysics Data System (ADS)

Pirandola, Stefano; Ottaviani, Carlo; Spedalieri, Gaetana; Weedbrook, Christian; Braunstein, Samuel L.; Lloyd, Seth; Gehring, Tobias; Jacobsen, Christian S.; Andersen, Ulrik L.

2015-06-01

Quantum cryptography achieves a formidable task—the remote distribution of secret keys by exploiting the fundamental laws of physics. Quantum cryptography is now headed towards solving the practical problem of constructing scalable and secure quantum networks. A significant step in this direction has been the introduction of measurement-device independence, where the secret key between two parties is established by the measurement of an untrusted relay. Unfortunately, although qubit-implemented protocols can reach long distances, their key rates are typically very low, unsuitable for the demands of a metropolitan network. Here we show, theoretically and experimentally, that a solution can come from the use of continuous-variable systems. We design a coherent-state network protocol able to achieve remarkably high key rates at metropolitan distances, in fact three orders of magnitude higher than those currently achieved. Our protocol could be employed to build high-rate quantum networks where devices securely connect to nearby access points or proxy servers.

Hidden Statistics Approach to Quantum Simulations

NASA Technical Reports Server (NTRS)

Zak, Michail

2010-01-01

Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the transitional potential is to provide a jump from a deterministic state to a random state with prescribed probability density. This jump is triggered by blowup instability due to violation of Lipschitz condition generated by the quantum potential. As a result, the dynamics attains quantum properties on a classical scale. The model can be implemented physically as an analog VLSI-based (very-large-scale integration-based) computer, or numerically on a digital computer. This work opens a way of developing fundamentally new algorithms for quantum simulations of exponentially complex problems that expand NASA capabilities in conducting space activities. It has been illustrated that the complexity of simulations of particle interaction can be reduced from an exponential one to a polynomial one.

Hybrid annealing: Coupling a quantum simulator to a classical computer

NASA Astrophysics Data System (ADS)

Graß, Tobias; Lewenstein, Maciej

2017-05-01

Finding the global minimum in a rugged potential landscape is a computationally hard task, often equivalent to relevant optimization problems. Annealing strategies, either classical or quantum, explore the configuration space by evolving the system under the influence of thermal or quantum fluctuations. The thermal annealing dynamics can rapidly freeze the system into a low-energy configuration, and it can be simulated well on a classical computer, but it easily gets stuck in local minima. Quantum annealing, on the other hand, can be guaranteed to find the true ground state and can be implemented in modern quantum simulators; however, quantum adiabatic schemes become prohibitively slow in the presence of quasidegeneracies. Here, we propose a strategy which combines ideas from simulated annealing and quantum annealing. In such a hybrid algorithm, the outcome of a quantum simulator is processed on a classical device. While the quantum simulator explores the configuration space by repeatedly applying quantum fluctuations and performing projective measurements, the classical computer evaluates each configuration and enforces a lowering of the energy. We have simulated this algorithm for small instances of the random energy model, showing that it potentially outperforms both simulated thermal annealing and adiabatic quantum annealing. It becomes most efficient for problems involving many quasidegenerate ground states.

Optimality of semiquantum nonlocality in the presence of high inconclusive rates

DOE PAGES

Lim, Charles Ci Wen

2016-02-01

Quantum nonlocality is a counterintuitive phenomenon that lies beyond the purview of causal influences. Recently, Bell inequalities have been generalized to the case of quantum inputs, leading to a powerful family of semiquantum Bell inequalities that are capable of detecting any entangled state. We focus on a different problem and investigate how the local indistinguishability of quantum inputs and postselection may affect the requirements to detect semiquantum nonlocality. Moreover, we consider a semiquantum nonlocal game based on locally indistinguishable qubit inputs, and derive its postselected local and quantum bounds by using a connection to the local distinguishability of quantum states.more » Interestingly, we find that the postselected local bound is independent of the measurement efficiency, and the achievable postselected Bell violation increases with decreasing measurement efficiency.« less

Quantum feedback cooling of a mechanical oscillator using variational measurements: tweaking Heisenberg’s microscope

NASA Astrophysics Data System (ADS)

Habibi, Hojat; Zeuthen, Emil; Ghanaatshoar, Majid; Hammerer, Klemens

2016-08-01

We revisit the problem of preparing a mechanical oscillator in the vicinity of its quantum-mechanical ground state by means of feedback cooling based on continuous optical detection of the oscillator position. In the parameter regime relevant to ground-state cooling, the optical back-action and imprecision noise set the bottleneck of achievable cooling and must be carefully balanced. This can be achieved by adapting the phase of the local oscillator in the homodyne detection realizing a so-called variational measurement. The trade-off between accurate position measurement and minimal disturbance can be understood in terms of Heisenberg’s microscope and becomes particularly relevant when the measurement and feedback processes happen to be fast within the quantum coherence time of the system to be cooled. This corresponds to the regime of large quantum cooperativity {C}{{q}}≳ 1, which was achieved in recent experiments on feedback cooling. Our method provides a simple path to further pushing the limits of current state-of-the-art experiments in quantum optomechanics.

Toward a new culture in verified quantum operations

NASA Astrophysics Data System (ADS)

Flammia, Steve

Measuring error rates of quantum operations has become an indispensable component in any aspiring platform for quantum computation. As the quality of controlled quantum operations increases, the demands on the accuracy and precision with which we measure these error rates also grows. However, well-meaning scientists that report these error measures are faced with a sea of non-standardized methodologies and are often asked during publication for only coarse information about how their estimates were obtained. Moreover, there are serious incentives to use methodologies and measures that will continually produce numbers that improve with time to show progress. These problems will only get exacerbated as our typical error rates go from 1 in 100 to 1 in 1000 or less. This talk will survey existing challenges presented by the current paradigm and offer some suggestions for solutions than can help us move toward fair and standardized methods for error metrology in quantum computing experiments, and towards a culture that values full disclose of methodologies and higher standards for data analysis.

The network impact of hijacking a quantum repeater

NASA Astrophysics Data System (ADS)

Satoh, Takahiko; Nagayama, Shota; Oka, Takafumi; Van Meter, Rodney

2018-07-01

In quantum networking, repeater hijacking menaces the security and utility of quantum applications. To deal with this problem, it is important to take a measure of the impact of quantum repeater hijacking. First, we quantify the work of each quantum repeater with regards to each quantum communication. Based on this, we show the costs for repeater hijacking detection using distributed quantum state tomography and the amount of work loss and rerouting penalties caused by hijacking. This quantitative evaluation covers both purification-entanglement swapping and quantum error correction repeater networks. Naive implementation of the checks necessary for correct network operation can be subverted by a single hijacker to bring down an entire network. Fortunately, the simple fix of randomly assigned testing can prevent such an attack.

Conditional quantum entropy power inequality for d-level quantum systems

NASA Astrophysics Data System (ADS)

Jeong, Kabgyun; Lee, Soojoon; Jeong, Hyunseok

2018-04-01

We propose an extension of the quantum entropy power inequality for finite dimensional quantum systems, and prove a conditional quantum entropy power inequality by using the majorization relation as well as the concavity of entropic functions also given by Audenaert et al (2016 J. Math. Phys. 57 052202). Here, we make particular use of the fact that a specific local measurement after a partial swap operation (or partial swap quantum channel) acting only on finite dimensional bipartite subsystems does not affect the majorization relation for the conditional output states when a separable ancillary subsystem is involved. We expect our conditional quantum entropy power inequality to be useful, and applicable in bounding and analyzing several capacity problems for quantum channels.

The New Quantum Logic

NASA Astrophysics Data System (ADS)

Griffiths, Robert B.

2014-06-01

It is shown how all the major conceptual difficulties of standard (textbook) quantum mechanics, including the two measurement problems and the (supposed) nonlocality that conflicts with special relativity, are resolved in the consistent or decoherent histories interpretation of quantum mechanics by using a modified form of quantum logic to discuss quantum properties (subspaces of the quantum Hilbert space), and treating quantum time development as a stochastic process. The histories approach in turn gives rise to some conceptual difficulties, in particular the correct choice of a framework (probabilistic sample space) or family of histories, and these are discussed. The central issue is that the principle of unicity, the idea that there is a unique single true description of the world, is incompatible with our current understanding of quantum mechanics.

Reaching Agreement in Quantum Hybrid Networks.

PubMed

Shi, Guodong; Li, Bo; Miao, Zibo; Dower, Peter M; James, Matthew R

2017-07-20

We consider a basic quantum hybrid network model consisting of a number of nodes each holding a qubit, for which the aim is to drive the network to a consensus in the sense that all qubits reach a common state. Projective measurements are applied serving as control means, and the measurement results are exchanged among the nodes via classical communication channels. In this way the quantum-opeartion/classical-communication nature of hybrid quantum networks is captured, although coherent states and joint operations are not taken into consideration in order to facilitate a clear and explicit analysis. We show how to carry out centralized optimal path planning for this network with all-to-all classical communications, in which case the problem becomes a stochastic optimal control problem with a continuous action space. To overcome the computation and communication obstacles facing the centralized solutions, we also develop a distributed Pairwise Qubit Projection (PQP) algorithm, where pairs of nodes meet at a given time and respectively perform measurements at their geometric average. We show that the qubit states are driven to a consensus almost surely along the proposed PQP algorithm, and that the expected qubit density operators converge to the average of the network's initial values.

High-capacity quantum key distribution via hyperentangled degrees of freedom

NASA Astrophysics Data System (ADS)

Simon, David S.; Sergienko, Alexander V.

2014-06-01

Quantum key distribution (QKD) has long been a promising area for the application of quantum effects in solving real-world problems. However, two major obstacles have stood in the way of its widespread application: low secure key generation rates and short achievable operating distances. In this paper, a new physical mechanism for dealing with the first of these problems is proposed: the interplay between different degrees of freedom in a hyperentangled system (parametric down-conversion) is used to increase the Hilbert space dimension available for key generation while maintaining security. Polarization-based Bell tests provide security checking, while orbital angular momentum (OAM) and total angular momentum (TAM) provide a higher key generation rate. Whether to measure TAM or OAM is decided randomly in each trial. The concurrent noncommutativity of TAM with OAM and polarization provides the physical basis for quantum security. TAM measurements link polarization to OAM, so that if the legitimate participants measure OAM while the eavesdropper measures TAM (or vice-versa), then polarization entanglement is lost, revealing the eavesdropper. In contrast to other OAM-based QKD methods, complex active switching between OAM bases is not required; instead, passive switching by beam splitters combined with much simpler active switching between polarization bases makes implementation at high OAM more practical.

Architectures for Quantum Simulation Showing a Quantum Speedup

NASA Astrophysics Data System (ADS)

Bermejo-Vega, Juan; Hangleiter, Dominik; Schwarz, Martin; Raussendorf, Robert; Eisert, Jens

2018-04-01

One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy," referring to the experimental realization of a quantum device that computationally outperforms classical computers. In this work, we show that one can devise versatile and feasible schemes of two-dimensional, dynamical, quantum simulators showing such a quantum speedup, building on intermediate problems involving nonadaptive, measurement-based, quantum computation. In each of the schemes, an initial product state is prepared, potentially involving an element of randomness as in disordered models, followed by a short-time evolution under a basic translationally invariant Hamiltonian with simple nearest-neighbor interactions and a mere sampling measurement in a fixed basis. The correctness of the final-state preparation in each scheme is fully efficiently certifiable. We discuss experimental necessities and possible physical architectures, inspired by platforms of cold atoms in optical lattices and a number of others, as well as specific assumptions that enter the complexity-theoretic arguments. This work shows that benchmark settings exhibiting a quantum speedup may require little control, in contrast to universal quantum computing. Thus, our proposal puts a convincing experimental demonstration of a quantum speedup within reach in the near term.

Quantum correlations in non-inertial cavity systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Harsij, Zeynab, E-mail: z.harsij@ph.iut.ac.ir; Mirza, Behrouz, E-mail: b.mirza@cc.iut.ac.ir

2016-10-15

Non-inertial cavities are utilized to store and send Quantum Information between mode pairs. A two-cavity system is considered where one is inertial and the other accelerated in a finite time. Maclaurian series are applied to expand the related Bogoliubov coefficients and the problem is treated perturbatively. It is shown that Quantum Discord, which is a measure of quantumness of correlations, is degraded periodically. This is almost in agreement with previous results reached in accelerated systems where increment of acceleration decreases the degree of quantum correlations. As another finding of the study, it is explicitly shown that degradation of Quantum Discordmore » disappears when the state is in a single cavity which is accelerated for a finite time. This feature makes accelerating cavities useful instruments in Quantum Information Theory. - Highlights: • Non-inertial cavities are utilized to store and send information in Quantum Information Theory. • Cavities include boundary conditions which will protect the entanglement once it has been created. • The problem is treated perturbatively and the maclaurian series are applied to expand the related Bogoliubov coefficients. • When two cavities are considered degradation in the degree of quantum correlation happens and it appears periodically. • The interesting issue is when a single cavity is studied and the degradation in quantum correlations disappears.« less

Quantum steering: a review with focus on semidefinite programming.

PubMed

Cavalcanti, D; Skrzypczyk, P

2017-02-01

Quantum steering refers to the non-classical correlations that can be observed between the outcomes of measurements applied on half of an entangled state and the resulting post-measured states that are left with the other party. From an operational point of view, a steering test can be seen as an entanglement test where one of the parties performs uncharacterised measurements. Thus, quantum steering is a form of quantum inseparability that lies in between the well-known notions of Bell nonlocality and entanglement. Moreover, quantum steering is also related to several asymmetric quantum information protocols where some of the parties are considered untrusted. Because of these facts, quantum steering has received a lot of attention both theoretically and experimentally. The main goal of this review is to give an overview of how to characterise quantum steering through semidefinite programming. This characterisation provides efficient numerical methods to address a number of problems, including steering detection, quantification, and applications. We also give a brief overview of some important results that are not directly related to semidefinite programming. Finally, we make available a collection of semidefinite programming codes that can be used to study the topics discussed in this article.

Bell's theorem, the measurement problem, Newton's self-gravitation and its connections to violations of the discrete symmetries C, P, T

NASA Astrophysics Data System (ADS)

Hiesmayr, Beatrix C.

2015-07-01

About 50 years ago John St. Bell published his famous Bell theorem that initiated a new field in physics. This contribution discusses how discrete symmetries relate to the big open questions of quantum mechanics, in particular: (i) how correlations stronger than those predicted by theories sharing randomness (Bell's theorem) relate to the violation of the CP symmetry and the P symmetry; and its relation to the security of quantum cryptography, (ii) how the measurement problem (“why do we observe no tables in superposition?”) can be polled in weakly decaying systems, (iii) how strongly and weakly interacting quantum systems are affected by Newton's self gravitation. These presented preliminary results show that the meson-antimeson systems and the hyperon- antihyperon systems are a unique laboratory to tackle deep fundamental questions and to contribute to the understand what impact the violation of discrete symmetries has.

Probing quantum state space: does one have to learn everything to learn something?

PubMed

Carmeli, Claudio; Heinosaari, Teiko; Schultz, Jussi; Toigo, Alessandro

2017-05-01

Determining the state of a quantum system is a consuming procedure. For this reason, whenever one is interested only in some particular property of a state, it would be desirable to design a measurement set-up that reveals this property with as little effort as possible. Here, we investigate whether, in order to successfully complete a given task of this kind, one needs an informationally complete measurement, or if something less demanding would suffice. The first alternative means that in order to complete the task, one needs a measurement which fully determines the state. We formulate the task as a membership problem related to a partitioning of the quantum state space and, in doing so, connect it to the geometry of the state space. For a general membership problem, we prove various sufficient criteria that force informational completeness, and we explicitly treat several physically relevant examples. For the specific cases that do not require informational completeness, we also determine bounds on the minimal number of measurement outcomes needed to ensure success in the task.

Probing quantum state space: does one have to learn everything to learn something?

PubMed Central

Carmeli, Claudio; Schultz, Jussi; Toigo, Alessandro

2017-01-01

Determining the state of a quantum system is a consuming procedure. For this reason, whenever one is interested only in some particular property of a state, it would be desirable to design a measurement set-up that reveals this property with as little effort as possible. Here, we investigate whether, in order to successfully complete a given task of this kind, one needs an informationally complete measurement, or if something less demanding would suffice. The first alternative means that in order to complete the task, one needs a measurement which fully determines the state. We formulate the task as a membership problem related to a partitioning of the quantum state space and, in doing so, connect it to the geometry of the state space. For a general membership problem, we prove various sufficient criteria that force informational completeness, and we explicitly treat several physically relevant examples. For the specific cases that do not require informational completeness, we also determine bounds on the minimal number of measurement outcomes needed to ensure success in the task. PMID:28588404

Quantum Optics in Phase Space

NASA Astrophysics Data System (ADS)

Schleich, Wolfgang P.

2001-04-01

Quantum Optics in Phase Space provides a concise introduction to the rapidly moving field of quantum optics from the point of view of phase space. Modern in style and didactically skillful, Quantum Optics in Phase Space prepares students for their own research by presenting detailed derivations, many illustrations and a large set of workable problems at the end of each chapter. Often, the theoretical treatments are accompanied by the corresponding experiments. An exhaustive list of references provides a guide to the literature. Quantum Optics in Phase Space also serves advanced researchers as a comprehensive reference book. Starting with an extensive review of the experiments that define quantum optics and a brief summary of the foundations of quantum mechanics the author Wolfgang P. Schleich illustrates the properties of quantum states with the help of the Wigner phase space distribution function. His description of waves ala WKB connects semi-classical phase space with the Berry phase. These semi-classical techniques provide deeper insight into the timely topics of wave packet dynamics, fractional revivals and the Talbot effect. Whereas the first half of the book deals with mechanical oscillators such as ions in a trap or atoms in a standing wave the second half addresses problems where the quantization of the radiation field is of importance. Such topics extensively discussed include optical interferometry, the atom-field interaction, quantum state preparation and measurement, entanglement, decoherence, the one-atom maser and atom optics in quantized light fields. Quantum Optics in Phase Space presents the subject of quantum optics as transparently as possible. Giving wide-ranging references, it enables students to study and solve problems with modern scientific literature. The result is a remarkably concise yet comprehensive and accessible text- and reference book - an inspiring source of information and insight for students, teachers and researchers alike.

Spontaneous collapse: A solution to the measurement problem and a source of the decay in mesonic systems

NASA Astrophysics Data System (ADS)

Simonov, Kyrylo; Hiesmayr, Beatrix C.

2016-11-01

Dynamical reduction models propose a solution to the measurement problem in quantum mechanics: the collapse of the wave function becomes a physical process. We compute the predictions to decaying and flavor-oscillating neutral mesons for the two most promising collapse models, the QMUPL (quantum mechanics with universal position localization) model and the mass-proportional CSL (continuous spontaneous localization) model. Our results are showing (i) a strong sensitivity to the very assumptions of the noise field underlying those two collapse models and (ii) under particular assumptions the CSL case allows one even to recover the decay dynamics. This in turn allows one to predict the effective collapse rates solely based on the measured values for the oscillation (mass differences) and the measured values of the decay constants. The four types of neutral mesons (K meson, D meson, Bd meson, and Bs meson) lead surprisingly to ranges comparable to those put forward by Adler [J. Phys. A: Math. Theor. 40, 2935 (2007), 10.1088/1751-8113/40/12/S03] and Ghirardi, Rimini, and Weber [Phys. Rev. D 34, 470 (1986), 10.1103/PhysRevD.34.470]. Our results show that these systems at high energies are very sensitive to possible modifications of the standard quantum theory, making them a very powerful laboratory to rule out certain collapse scenarios and study the detailed physical processes solving the measurement problem.

Quantum Theory of Three-Dimensional Superresolution Using Rotating-PSF Imagery

NASA Astrophysics Data System (ADS)

Prasad, S.; Yu, Z.

The inverse of the quantum Fisher information (QFI) matrix (and extensions thereof) provides the ultimate lower bound on the variance of any unbiased estimation of a parameter from statistical data, whether of intrinsically quantum mechanical or classical character. We calculate the QFI for Poisson-shot-noise-limited imagery using the rotating PSF that can localize and resolve point sources fully in all three dimensions. We also propose an experimental approach based on the use of computer generated hologram and projective measurements to realize the QFI-limited variance for the problem of super-resolving a closely spaced pair of point sources at a highly reduced photon cost. The paper presents a preliminary analysis of quantum-limited three-dimensional (3D) pair optical super-resolution (OSR) problem with potential applications to astronomical imaging and 3D space-debris localization.

Applications of fidelity measures to complex quantum systems

PubMed Central

2016-01-01

We revisit fidelity as a measure for the stability and the complexity of the quantum motion of single-and many-body systems. Within the context of cold atoms, we present an overview of applications of two fidelities, which we call static and dynamical fidelity, respectively. The static fidelity applies to quantum problems which can be diagonalized since it is defined via the eigenfunctions. In particular, we show that the static fidelity is a highly effective practical detector of avoided crossings characterizing the complexity of the systems and their evolutions. The dynamical fidelity is defined via the time-dependent wave functions. Focusing on the quantum kicked rotor system, we highlight a few practical applications of fidelity measurements in order to better understand the large variety of dynamical regimes of this paradigm of a low-dimensional system with mixed regular–chaotic phase space. PMID:27140967

Density matrix reconstruction of a large angular momentum

NASA Astrophysics Data System (ADS)

Klose, Gerd

2001-10-01

A complete description of the quantum state of a physical system is the fundamental knowledge necessary to statistically predict the outcome of measurements. In turning this statement around, Wolfgang Pauli raised already in 1933 the question, whether an unknown quantum state could be uniquely determined by appropriate measurements-a problem that has gained new relevance in recent years. In order to harness the prospects of quantum computing, secure communication, teleportation, and the like, the development of techniques to accurately control and measure quantum states has now become a matter of practical as well as fundamental interest. However, there is no general answer to Pauli's very basic question, and quantum state reconstruction algorithms have been developed and experimentally demonstrated only for a few systems so far. This thesis presents a novel experimental method to measure the unknown and generally mixed quantum state for an angular momentum of arbitrary magnitude. The (2F + 1) x (2F + 1) density matrix describing the quantum state is hereby completely determined from a set of Stern-Gerlach measurements with (4F + 1) different orientations of the quantization axis. This protocol is implemented for laser cooled Cesium atoms in the 6S1/2(F = 4) hyperfine ground state manifold, and is applied to a number of test states prepared by optical pumping and Larmor precession. A comparison of the input and the measured states shows successful reconstructions with fidelities of about 0.95.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bunakov, V. E., E-mail: bunakov@VB13190.spb.edu

A critical analysis of the present-day concept of chaos in quantum systems as nothing but a “quantum signature” of chaos in classical mechanics is given. In contrast to the existing semi-intuitive guesses, a definition of classical and quantum chaos is proposed on the basis of the Liouville–Arnold theorem: a quantum chaotic system featuring N degrees of freedom should have M < N independent first integrals of motion (good quantum numbers) specified by the symmetry of the Hamiltonian of the system. Quantitative measures of quantum chaos that, in the classical limit, go over to the Lyapunov exponent and the classical stabilitymore » parameter are proposed. The proposed criteria of quantum chaos are applied to solving standard problems of modern dynamical chaos theory.« less

Quantum mechanics: The Bayesian theory generalized to the space of Hermitian matrices

NASA Astrophysics Data System (ADS)

Benavoli, Alessio; Facchini, Alessandro; Zaffalon, Marco

2016-10-01

We consider the problem of gambling on a quantum experiment and enforce rational behavior by a few rules. These rules yield, in the classical case, the Bayesian theory of probability via duality theorems. In our quantum setting, they yield the Bayesian theory generalized to the space of Hermitian matrices. This very theory is quantum mechanics: in fact, we derive all its four postulates from the generalized Bayesian theory. This implies that quantum mechanics is self-consistent. It also leads us to reinterpret the main operations in quantum mechanics as probability rules: Bayes' rule (measurement), marginalization (partial tracing), independence (tensor product). To say it with a slogan, we obtain that quantum mechanics is the Bayesian theory in the complex numbers.

Newtonian semiclassical gravity in three ontological quantum theories that solve the measurement problem: Formalisms and empirical predictions

NASA Astrophysics Data System (ADS)

Derakhshani, Maaneli

In this thesis, we consider the implications of solving the quantum measurement problem for the Newtonian description of semiclassical gravity. First we review the formalism of the Newtonian description of semiclassical gravity based on standard quantum mechanics---the Schroedinger-Newton theory---and two well-established predictions that come out of it, namely, gravitational 'cat states' and gravitationally-induced wavepacket collapse. Then we review three quantum theories with 'primitive ontologies' that are well-known known to solve the measurement problem---Schroedinger's many worlds theory, the GRW collapse theory with matter density ontology, and Nelson's stochastic mechanics. We extend the formalisms of these three quantum theories to Newtonian models of semiclassical gravity and evaluate their implications for gravitational cat states and gravitational wavepacket collapse. We find that (1) Newtonian semiclassical gravity based on Schroedinger's many worlds theory is mathematically equivalent to the Schroedinger-Newton theory and makes the same predictions; (2) Newtonian semiclassical gravity based on the GRW theory differs from Schroedinger-Newton only in the use of a stochastic collapse law, but this law allows it to suppress gravitational cat states so as not to be in contradiction with experiment, while allowing for gravitational wavepacket collapse to happen as well; (3) Newtonian semiclassical gravity based on Nelson's stochastic mechanics differs significantly from Schroedinger-Newton, and does not predict gravitational cat states nor gravitational wavepacket collapse. Considering that gravitational cat states are experimentally ruled out, but gravitational wavepacket collapse is testable in the near future, this implies that only the latter two are viable theories of Newtonian semiclassical gravity and that they can be experimentally tested against each other in future molecular interferometry experiments that are anticipated to be capable of testing the gravitational wavepacket collapse prediction.

Plug-and-play measurement-device-independent quantum key distribution

NASA Astrophysics Data System (ADS)

Choi, Yujun; Kwon, Osung; Woo, Minki; Oh, Kyunghwan; Han, Sang-Wook; Kim, Yong-Su; Moon, Sung

2016-03-01

Quantum key distribution (QKD) guarantees unconditional communication security based on the laws of quantum physics. However, practical QKD suffers from a number of quantum hackings due to the device imperfections. From the security standpoint, measurement-device-independent quantum key distribution (MDI-QKD) is in the limelight since it eliminates all the possible loopholes in detection. Due to active control units for mode matching between the photons from remote parties, however, the implementation of MDI-QKD is highly impractical. In this paper, we propose a method to resolve the mode matching problem while minimizing the use of active control units. By introducing the plug-and-play (P&P) concept into MDI-QKD, the indistinguishability in spectral and polarization modes between photons can naturally be guaranteed. We show the feasibility of P&P MDI-QKD with a proof-of-principle experiment.

Quantum ensembles of quantum classifiers.

PubMed

Schuld, Maria; Petruccione, Francesco

2018-02-09

Quantum machine learning witnesses an increasing amount of quantum algorithms for data-driven decision making, a problem with potential applications ranging from automated image recognition to medical diagnosis. Many of those algorithms are implementations of quantum classifiers, or models for the classification of data inputs with a quantum computer. Following the success of collective decision making with ensembles in classical machine learning, this paper introduces the concept of quantum ensembles of quantum classifiers. Creating the ensemble corresponds to a state preparation routine, after which the quantum classifiers are evaluated in parallel and their combined decision is accessed by a single-qubit measurement. This framework naturally allows for exponentially large ensembles in which - similar to Bayesian learning - the individual classifiers do not have to be trained. As an example, we analyse an exponentially large quantum ensemble in which each classifier is weighed according to its performance in classifying the training data, leading to new results for quantum as well as classical machine learning.

Quantum sensing of the phase-space-displacement parameters using a single trapped ion

NASA Astrophysics Data System (ADS)

Ivanov, Peter A.; Vitanov, Nikolay V.

2018-03-01

We introduce a quantum sensing protocol for detecting the parameters characterizing the phase-space displacement by using a single trapped ion as a quantum probe. We show that, thanks to the laser-induced coupling between the ion's internal states and the motion mode, the estimation of the two conjugated parameters describing the displacement can be efficiently performed by a set of measurements of the atomic state populations. Furthermore, we introduce a three-parameter protocol capable of detecting the magnitude, the transverse direction, and the phase of the displacement. We characterize the uncertainty of the two- and three-parameter problems in terms of the Fisher information and show that state projective measurement saturates the fundamental quantum Cramér-Rao bound.

Wigner's "Polanyian" Epistemology and the Measurement Problem: The Wigner-Polanyi Dialog on Tacit Knowledge

NASA Astrophysics Data System (ADS)

Jha, Stefania

2011-09-01

I analyze the long dialog that Eugene Wigner (1902-1995) and Michael Polanyi (1891-1976) carried out on Polanyi's concept of tacit knowledge and its meaning for the measurement problem in quantum physics, focusing in particular on their ten-year correspondence between 1961 and 1971 on these subjects and the related mind-body problem. They differed in their interpretations, epistemologies, and ontologies, and consequently never resolved their differences on the measurement and mind-body problems. Nonetheless, their long dialog is significant and opens up avenues for exploring these problems further.

Experimental demonstration of a BDCZ quantum repeater node.

PubMed

Yuan, Zhen-Sheng; Chen, Yu-Ao; Zhao, Bo; Chen, Shuai; Schmiedmayer, Jörg; Pan, Jian-Wei

2008-08-28

Quantum communication is a method that offers efficient and secure ways for the exchange of information in a network. Large-scale quantum communication (of the order of 100 km) has been achieved; however, serious problems occur beyond this distance scale, mainly due to inevitable photon loss in the transmission channel. Quantum communication eventually fails when the probability of a dark count in the photon detectors becomes comparable to the probability that a photon is correctly detected. To overcome this problem, Briegel, Dür, Cirac and Zoller (BDCZ) introduced the concept of quantum repeaters, combining entanglement swapping and quantum memory to efficiently extend the achievable distances. Although entanglement swapping has been experimentally demonstrated, the implementation of BDCZ quantum repeaters has proved challenging owing to the difficulty of integrating a quantum memory. Here we realize entanglement swapping with storage and retrieval of light, a building block of the BDCZ quantum repeater. We follow a scheme that incorporates the strategy of BDCZ with atomic quantum memories. Two atomic ensembles, each originally entangled with a single emitted photon, are projected into an entangled state by performing a joint Bell state measurement on the two single photons after they have passed through a 300-m fibre-based communication channel. The entanglement is stored in the atomic ensembles and later verified by converting the atomic excitations into photons. Our method is intrinsically phase insensitive and establishes the essential element needed to realize quantum repeaters with stationary atomic qubits as quantum memories and flying photonic qubits as quantum messengers.

Nonunitary quantum computation in the ground space of local Hamiltonians

NASA Astrophysics Data System (ADS)

Usher, Naïri; Hoban, Matty J.; Browne, Dan E.

2017-09-01

A central result in the study of quantum Hamiltonian complexity is that the k -local Hamiltonian problem is quantum-Merlin-Arthur-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above another, promised one of these is true. Given the ground state of the Hamiltonian, a quantum computer can determine this question, even if the ground state itself may not be efficiently quantum preparable. Kitaev's proof of QMA-completeness encodes a unitary quantum circuit in QMA into the ground space of a Hamiltonian. However, we now have quantum computing models based on measurement instead of unitary evolution; furthermore, we can use postselected measurement as an additional computational tool. In this work, we generalize Kitaev's construction to allow for nonunitary evolution including postselection. Furthermore, we consider a type of postselection under which the construction is consistent, which we call tame postselection. We consider the computational complexity consequences of this construction and then consider how the probability of an event upon which we are postselecting affects the gap between the ground-state energy and the energy of the first excited state of its corresponding Hamiltonian. We provide numerical evidence that the two are not immediately related by giving a family of circuits where the probability of an event upon which we postselect is exponentially small, but the gap in the energy levels of the Hamiltonian decreases as a polynomial.

The Madelung Picture as a Foundation of Geometric Quantum Theory

NASA Astrophysics Data System (ADS)

Reddiger, Maik

2017-10-01

Despite its age, quantum theory still suffers from serious conceptual difficulties. To create clarity, mathematical physicists have been attempting to formulate quantum theory geometrically and to find a rigorous method of quantization, but this has not resolved the problem. In this article we argue that a quantum theory recursing to quantization algorithms is necessarily incomplete. To provide an alternative approach, we show that the Schrödinger equation is a consequence of three partial differential equations governing the time evolution of a given probability density. These equations, discovered by Madelung, naturally ground the Schrödinger theory in Newtonian mechanics and Kolmogorovian probability theory. A variety of far-reaching consequences for the projection postulate, the correspondence principle, the measurement problem, the uncertainty principle, and the modeling of particle creation and annihilation are immediate. We also give a speculative interpretation of the equations following Bohm, Vigier and Tsekov, by claiming that quantum mechanical behavior is possibly caused by gravitational background noise.

EPR, Bell, and quantum locality

NASA Astrophysics Data System (ADS)

Griffiths, Robert B.

2011-09-01

Maudlin has claimed that no local theory can reproduce the predictions of standard quantum mechanics that violate Bell's inequality for Bohm's version (two spin-half particles in a singlet state) of the Einstein-Podolsky-Rosen problem. It is argued that, on the contrary, standard quantum mechanics itself is a counterexample to Maudlin's claim, because it is local in the appropriate sense (measurements at one place do not influence what occurs elsewhere there) when formulated using consistent principles in place of the inconsistent appeals to "measurement" found in current textbooks. This argument sheds light on the claim of Blaylock that counterfactual definiteness is an essential ingredient in derivations of Bell's inequality.

Efficient linear criterion for witnessing Einstein-Podolsky-Rosen nonlocality under many-setting local measurements

NASA Astrophysics Data System (ADS)

Zheng, Yu-Lin; Zhen, Yi-Zheng; Chen, Zeng-Bing; Liu, Nai-Le; Chen, Kai; Pan, Jian-Wei

2017-01-01

The striking and distinctive nonlocal features of quantum mechanics were discovered by Einstein, Podolsky, and Rosen (EPR) beyond classical physics. At the core of the EPR argument, it was "steering" that Schrödinger proposed in 1935. Besides its fundamental significance, quantum steering opens up a novel application for quantum communication. Recent work has precisely characterized its properties; however, witnessing the EPR nonlocality remains a big challenge under arbitrary local measurements. Here we present an alternative linear criterion and complement existing results to efficiently testify steering for high-dimensional system in practice. By developing a novel and analytical method to tackle the maximization problem in deriving the bound of a steering criterion, we show how observed correlations can reveal powerfully the EPR nonlocality in an easily accessed manner. Although the criteria is not necessary and sufficient, it can recover some of the known results under a few settings of local measurements and is applicable even if the size of the system or the number of measurement settings are high. Remarkably, a deep connection is explicitly established between the steering and amount of entanglement. The results promise viable paths for secure communication with an untrusted source, providing optional loophole-free tests of the EPR nonlocality for high-dimensional states, as well as motivating solutions for other related problems in quantum information theory.

A General Symbolic Method with Physical Applications

NASA Astrophysics Data System (ADS)

Smith, Gregory M.

2000-06-01

A solution to the problem of unifying the General Relativistic and Quantum Theoretical formalisms is given which introduces a new non-axiomatic symbolic method and an algebraic generalization of the Calculus to non-finite symbolisms without reference to the concept of a limit. An essential feature of the non-axiomatic method is the inadequacy of any (finite) statements: Identifying this aspect of the theory with the "existence of an external physical reality" both allows for the consistency of the method with the results of experiments and avoids the so-called "measurement problem" of quantum theory.

Hilbert's 17th Problem and the Quantumness of States

NASA Astrophysics Data System (ADS)

Korbicz, J. K.; Cirac, J. I.; Wehr, Jan; Lewenstein, M.

2005-04-01

A state of a quantum system can be regarded as classical (quantum) with respect to measurements of a set of canonical observables if and only if there exists (does not exist) a well defined, positive phase-space distribution, the so called Glauber-Sudarshan P representation. We derive a family of classicality criteria that requires that the averages of positive functions calculated using P representation must be positive. For polynomial functions, these criteria are related to Hilbert’s 17th problem, and have physical meaning of generalized squeezing conditions; alternatively, they may be interpreted as nonclassicality witnesses. We show that every generic nonclassical state can be detected by a polynomial that is a sum-of-squares of other polynomials. We introduce a very natural hierarchy of states regarding their degree of quantumness, which we relate to the minimal degree of a sum-of-squares polynomial that detects them.

Finite-key analysis for measurement-device-independent quantum key distribution.

PubMed

Curty, Marcos; Xu, Feihu; Cui, Wei; Lim, Charles Ci Wen; Tamaki, Kiyoshi; Lo, Hoi-Kwong

2014-04-29

Quantum key distribution promises unconditionally secure communications. However, as practical devices tend to deviate from their specifications, the security of some practical systems is no longer valid. In particular, an adversary can exploit imperfect detectors to learn a large part of the secret key, even though the security proof claims otherwise. Recently, a practical approach--measurement-device-independent quantum key distribution--has been proposed to solve this problem. However, so far its security has only been fully proven under the assumption that the legitimate users of the system have unlimited resources. Here we fill this gap and provide a rigorous security proof against general attacks in the finite-key regime. This is obtained by applying large deviation theory, specifically the Chernoff bound, to perform parameter estimation. For the first time we demonstrate the feasibility of long-distance implementations of measurement-device-independent quantum key distribution within a reasonable time frame of signal transmission.

Problem of quantifying quantum correlations with non-commutative discord

NASA Astrophysics Data System (ADS)

Majtey, A. P.; Bussandri, D. G.; Osán, T. M.; Lamberti, P. W.; Valdés-Hernández, A.

2017-09-01

In this work we analyze a non-commutativity measure of quantum correlations recently proposed by Guo (Sci Rep 6:25241, 2016). By resorting to a systematic survey of a two-qubit system, we detected an undesirable behavior of such a measure related to its representation-dependence. In the case of pure states, this dependence manifests as a non-satisfactory entanglement measure whenever a representation other than the Schmidt's is used. In order to avoid this basis-dependence feature, we argue that a minimization procedure over the set of all possible representations of the quantum state is required. In the case of pure states, this minimization can be analytically performed and the optimal basis turns out to be that of Schmidt's. In addition, the resulting measure inherits the main properties of Guo's measure and, unlike the latter, it reduces to a legitimate entanglement measure in the case of pure states. Some examples involving general mixed states are also analyzed considering such an optimization. The results show that, in most cases of interest, the use of Guo's measure can result in an overestimation of quantum correlations. However, since Guo's measure has the advantage of being easily computable, it might be used as a qualitative estimator of the presence of quantum correlations.

Quantum computing. Defining and detecting quantum speedup.

PubMed

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.

Optimally stopped variational quantum algorithms

NASA Astrophysics Data System (ADS)

Vinci, Walter; Shabani, Alireza

2018-04-01

Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this article, we introduce a benchmark for the variational quantum algorithm (VQA), recently proposed as a heuristic algorithm for small-scale quantum processors. In VQA, a classical optimization algorithm guides the processor's quantum dynamics to yield the best solution for a given problem. A complete assessment of the scalability and competitiveness of VQA should take into account both the quality and the time of dynamics optimization. The method of optimal stopping, employed here, provides such an assessment by explicitly including time as a cost factor. Here, we showcase this measure for benchmarking VQA as a solver for some quadratic unconstrained binary optimization. Moreover, we show that a better choice for the cost function of the classical routine can significantly improve the performance of the VQA algorithm and even improve its scaling properties.

Asymptotic inference in system identification for the atom maser.

PubMed

Catana, Catalin; van Horssen, Merlijn; Guta, Madalin

2012-11-28

System identification is closely related to control theory and plays an increasing role in quantum engineering. In the quantum set-up, system identification is usually equated to process tomography, i.e. estimating a channel by probing it repeatedly with different input states. However, for quantum dynamical systems such as quantum Markov processes, it is more natural to consider the estimation based on continuous measurements of the output, with a given input that may be stationary. We address this problem using asymptotic statistics tools, for the specific example of estimating the Rabi frequency of an atom maser. We compute the Fisher information of different measurement processes as well as the quantum Fisher information of the atom maser, and establish the local asymptotic normality of these statistical models. The statistical notions can be expressed in terms of spectral properties of certain deformed Markov generators, and the connection to large deviations is briefly discussed.

Decoherence and dissipation for a quantum system coupled to a local environment

NASA Technical Reports Server (NTRS)

Gallis, Michael R.

1994-01-01

Decoherence and dissipation in quantum systems has been studied extensively in the context of Quantum Brownian Motion. Effective decoherence in coarse grained quantum systems has been a central issue in recent efforts by Zurek and by Hartle and Gell-Mann to address the Quantum Measurement Problem. Although these models can yield very general classical phenomenology, they are incapable of reproducing relevant characteristics expected of a local environment on a quantum system, such as the characteristic dependence of decoherence on environment spatial correlations. I discuss the characteristics of Quantum Brownian Motion in a local environment by examining aspects of first principle calculations and by the construction of phenomenological models. Effective quantum Langevin equations and master equations are presented in a variety of representations. Comparisons are made with standard results such as the Caldeira-Leggett master equation.

Meaner king uses biased bases

DOE Office of Scientific and Technical Information (OSTI.GOV)

Reimpell, Michael; Werner, Reinhard F.

2007-06-15

The mean king problem is a quantum mechanical retrodiction problem, in which Alice has to name the outcome of an ideal measurement made in one of several different orthonormal bases. Alice is allowed to prepare the state of the system and to do a final measurement, possibly including an entangled copy. However, Alice gains knowledge about which basis was measured only after she no longer has access to the quantum system or its copy. We give a necessary and sufficient condition on the bases, for Alice to have a strategy to solve this problem, without assuming that the bases aremore » mutually unbiased. The condition requires the existence of an overall joint probability distribution for random variables, whose marginal pair distributions are fixed as the transition probability matrices of the given bases. In particular, in the qubit case the problem is decided by Bell's original three variable inequality. In the standard setting of mutually unbiased bases, when they do exist, Alice can always succeed. However, for randomly chosen bases her success probability rapidly goes to zero with increasing dimension.« less

Meaner king uses biased bases

NASA Astrophysics Data System (ADS)

Reimpell, Michael; Werner, Reinhard F.

2007-06-01

The mean king problem is a quantum mechanical retrodiction problem, in which Alice has to name the outcome of an ideal measurement made in one of several different orthonormal bases. Alice is allowed to prepare the state of the system and to do a final measurement, possibly including an entangled copy. However, Alice gains knowledge about which basis was measured only after she no longer has access to the quantum system or its copy. We give a necessary and sufficient condition on the bases, for Alice to have a strategy to solve this problem, without assuming that the bases are mutually unbiased. The condition requires the existence of an overall joint probability distribution for random variables, whose marginal pair distributions are fixed as the transition probability matrices of the given bases. In particular, in the qubit case the problem is decided by Bell’s original three variable inequality. In the standard setting of mutually unbiased bases, when they do exist, Alice can always succeed. However, for randomly chosen bases her success probability rapidly goes to zero with increasing dimension.

Entangled states in quantum mechanics

NASA Astrophysics Data System (ADS)

Ruža, Jānis

2010-01-01

In some circles of quantum physicists, a view is maintained that the nonseparability of quantum systems-i.e., the entanglement-is a characteristic feature of quantum mechanics. According to this view, the entanglement plays a crucial role in the solution of quantum measurement problem, the origin of the “classicality” from the quantum physics, the explanation of the EPR paradox by a nonlocal character of the quantum world. Besides, the entanglement is regarded as a cornerstone of such modern disciplines as quantum computation, quantum cryptography, quantum information, etc. At the same time, entangled states are well known and widely used in various physics areas. In particular, this notion is widely used in nuclear, atomic, molecular, solid state physics, in scattering and decay theories as well as in other disciplines, where one has to deal with many-body quantum systems. One of the methods, how to construct the basis states of a composite many-body quantum system, is the so-called genealogical decomposition method. Genealogical decomposition allows one to construct recurrently by particle number the basis states of a composite quantum system from the basis states of its forming subsystems. These coupled states have a structure typical for entangled states. If a composite system is stable, the internal structure of its forming basis states does not manifest itself in measurements. However, if a composite system is unstable and decays onto its forming subsystems, then the measurables are the quantum numbers, associated with these subsystems. In such a case, the entangled state has a dynamical origin, determined by the Hamiltonian of the corresponding decay process. Possible correlations between the quantum numbers of resulting subsystems are determined by the symmetries-conservation laws of corresponding dynamical variables, and not by the quantum entanglement feature.

Quantum Computing: Solving Complex Problems

ScienceCinema

DiVincenzo, David

2018-05-22

One of the motivating ideas of quantum computation was that there could be a new kind of machine that would solve hard problems in quantum mechanics. There has been significant progress towards the experimental realization of these machines (which I will review), but there are still many questions about how such a machine could solve computational problems of interest in quantum physics. New categorizations of the complexity of computational problems have now been invented to describe quantum simulation. The bad news is that some of these problems are believed to be intractable even on a quantum computer, falling into a quantum analog of the NP class. The good news is that there are many other new classifications of tractability that may apply to several situations of physical interest.

Constructor theory of probability

PubMed Central

2016-01-01

Unitary quantum theory, having no Born Rule, is non-probabilistic. Hence the notorious problem of reconciling it with the unpredictability and appearance of stochasticity in quantum measurements. Generalizing and improving upon the so-called ‘decision-theoretic approach’, I shall recast that problem in the recently proposed constructor theory of information—where quantum theory is represented as one of a class of superinformation theories, which are local, non-probabilistic theories conforming to certain constructor-theoretic conditions. I prove that the unpredictability of measurement outcomes (to which constructor theory gives an exact meaning) necessarily arises in superinformation theories. Then I explain how the appearance of stochasticity in (finitely many) repeated measurements can arise under superinformation theories. And I establish sufficient conditions for a superinformation theory to inform decisions (made under it) as if it were probabilistic, via a Deutsch–Wallace-type argument—thus defining a class of decision-supporting superinformation theories. This broadens the domain of applicability of that argument to cover constructor-theory compliant theories. In addition, in this version some of the argument's assumptions, previously construed as merely decision-theoretic, follow from physical properties expressed by constructor-theoretic principles. PMID:27616914

Existence of equilibria in quantum Bertrand-Edgeworth duopoly game

NASA Astrophysics Data System (ADS)

Sekiguchi, Yohei; Sakahara, Kiri; Sato, Takashi

2012-12-01

Both classical and quantum version of two models of price competition in duopoly market, the one is realistic and the other is idealized, are investigated. The pure strategy Nash equilibria of the realistic model exists under stricter condition than that of the idealized one in the classical form game. This is the problem known as Edgeworth paradox in economics. In the quantum form game, however, the former converges to the latter as the measure of entanglement goes to infinity.

Photo-acoustic spectroscopy and quantum efficiency of Yb{sup 3+} doped alumino silicate glasses

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kuhn, Stefan, E-mail: stefan.kuhn84@googlemail.com; Tiegel, Mirko; Herrmann, Andreas

2015-09-14

In this contribution, we analyze the effect of several preparation methods of Yb{sup 3+} doped alumino silicate glasses on their quantum efficiency by using photo-acoustic measurements in comparison to standard measurement methods including the determination via the fluorescence lifetime and an integrating sphere setup. The preparation methods focused on decreasing the OH concentration by means of fluorine-substitution and/or applying dry melting atmospheres, which led to an increase in the measured fluorescence lifetime. However, it was found that the influence of these methods on radiative properties such as the measured fluorescence lifetime alone does not per se give exact information aboutmore » the actual quantum efficiency of the sample. The determination of the quantum efficiency by means of fluorescence lifetime shows inaccuracies when refractive index changing elements such as fluorine are incorporated into the glass. Since fluorine not only eliminates OH from the glass but also increases the “intrinsic” radiative fluorescence lifetime, which is needed to calculate the quantum efficiency, it is difficult to separate lifetime quenching from purely radiative effects. The approach used in this contribution offers a possibility to disentangle radiative from non-radiative properties which is not possible by using fluorescence lifetime measurements alone and allows an accurate determination of the quantum efficiency of a given sample. The comparative determination by an integrating sphere setup leads to the well-known problem of reabsorption which embodies itself in the measurement of too low quantum efficiencies, especially for samples with small quantum efficiencies.« less

Noise-tolerant parity learning with one quantum bit

NASA Astrophysics Data System (ADS)

Park, Daniel K.; Rhee, June-Koo K.; Lee, Soonchil

2018-03-01

Demonstrating quantum advantage with less powerful but more realistic devices is of great importance in modern quantum information science. Recently, a significant quantum speedup was achieved in the problem of learning a hidden parity function with noise. However, if all data qubits at the query output are completely depolarized, the algorithm fails. In this work, we present a quantum parity learning algorithm that exhibits quantum advantage as long as one qubit is provided with nonzero polarization in each query. In this scenario, the quantum parity learning naturally becomes deterministic quantum computation with one qubit. Then the hidden parity function can be revealed by performing a set of operations that can be interpreted as measuring nonlocal observables on the auxiliary result qubit having nonzero polarization and each data qubit. We also discuss the source of the quantum advantage in our algorithm from the resource-theoretic point of view.

Fisher information and asymptotic normality in system identification for quantum Markov chains

DOE Office of Scientific and Technical Information (OSTI.GOV)

Guta, Madalin

2011-06-15

This paper deals with the problem of estimating the coupling constant {theta} of a mixing quantum Markov chain. For a repeated measurement on the chain's output we show that the outcomes' time average has an asymptotically normal (Gaussian) distribution, and we give the explicit expressions of its mean and variance. In particular, we obtain a simple estimator of {theta} whose classical Fisher information can be optimized over different choices of measured observables. We then show that the quantum state of the output together with the system is itself asymptotically Gaussian and compute its quantum Fisher information, which sets an absolutemore » bound to the estimation error. The classical and quantum Fisher information are compared in a simple example. In the vicinity of {theta}=0 we find that the quantum Fisher information has a quadratic rather than linear scaling in output size, and asymptotically the Fisher information is localized in the system, while the output is independent of the parameter.« less

Quantum decoherence and interlevel relations

NASA Astrophysics Data System (ADS)

Crull, Elise M.

Quantum decoherence is a dynamical process whereby a system's phase relations become delocalized due to interaction and subsequent entanglement with its environment. This delocalization, or decoherence, forces the quantum system into a state that is apparently classical (or apparently an eigenstate) by prodigiously suppressing features that typically give rise to so-called quantum behavior. Thus it has been frequently proposed by physicists and philosophers alike that decoherence explains the dynamical transition from quantum behavior to classical behavior. Statements like this assume the existence of distinct realms, however, and the present thesis is an exploration of the metaphysical consequences of quantum decoherence motivated by the question of the quantum-to-classical transition and interlevel relations: if there are in-principle "classical" and "quantum" levels, what are the relations between them? And if there are no such levels, what follows? Importantly, the following philosophical investigations are carried out by intentionally leaving aside the measurement problem and concerns about particular interpretations of quantum mechanics. Good philosophical work, it is argued, can be done without adopting a specific interpretational framework and without recourse to the measurement problem. After introducing the physics of decoherence and exploring the four canonical models applied to system-environment interactions, it is argued that, ontologically speaking, there exist no levels. This claim---called the "nontological thesis"---exposes as ill-posed questions regarding the transition from the quantum regime to the classical regime and reveals the inappropriateness of interlevel relations (like reduction, supervenience and emergence) operating within metaphysical frameworks. The nontological thesis has further important consequences regarding intralevel relations: not only are there no meaningful ways to carve the world into levels, but there are no meaningful ways to carve the world into parts and wholes either. These conclusions, supported by quantum decoherence and the empirical success of its models, drastically alter the philosophical terrain---not just in physics or in the philosophy of physics, but in traditional metaphysics as well.

Ordering states with various coherence measures

NASA Astrophysics Data System (ADS)

Yang, Long-Mei; Chen, Bin; Fei, Shao-Ming; Wang, Zhi-Xi

2018-04-01

Quantum coherence is one of the most significant theories in quantum physics. Ordering states with various coherence measures is an intriguing task in quantification theory of coherence. In this paper, we study this problem by use of four important coherence measures—the l_1 norm of coherence, the relative entropy of coherence, the geometric measure of coherence and the modified trace distance measure of coherence. We show that each pair of these measures give a different ordering of qudit states when d≥3. However, for single-qubit states, the l_1 norm of coherence and the geometric coherence provide the same ordering. We also show that the relative entropy of coherence and the geometric coherence give a different ordering for single-qubit states. Then we partially answer the open question proposed in Liu et al. (Quantum Inf Process 15:4189, 2016) whether all the coherence measures give a different ordering of states.

A cross-disciplinary introduction to quantum annealing-based algorithms

NASA Astrophysics Data System (ADS)

Venegas-Andraca, Salvador E.; Cruz-Santos, William; McGeoch, Catherine; Lanzagorta, Marco

2018-04-01

A central goal in quantum computing is the development of quantum hardware and quantum algorithms in order to analyse challenging scientific and engineering problems. Research in quantum computation involves contributions from both physics and computer science; hence this article presents a concise introduction to basic concepts from both fields that are used in annealing-based quantum computation, an alternative to the more familiar quantum gate model. We introduce some concepts from computer science required to define difficult computational problems and to realise the potential relevance of quantum algorithms to find novel solutions to those problems. We introduce the structure of quantum annealing-based algorithms as well as two examples of this kind of algorithms for solving instances of the max-SAT and Minimum Multicut problems. An overview of the quantum annealing systems manufactured by D-Wave Systems is also presented.

Applications and error correction for adiabatic quantum optimization

NASA Astrophysics Data System (ADS)

Pudenz, Kristen

Adiabatic quantum optimization (AQO) is a fast-developing subfield of quantum information processing which holds great promise in the relatively near future. Here we develop an application, quantum anomaly detection, and an error correction code, Quantum Annealing Correction (QAC), for use with AQO. The motivation for the anomaly detection algorithm is the problematic nature of classical software verification and validation (V&V). The number of lines of code written for safety-critical applications such as cars and aircraft increases each year, and with it the cost of finding errors grows exponentially (the cost of overlooking errors, which can be measured in human safety, is arguably even higher). We approach the V&V problem by using a quantum machine learning algorithm to identify charateristics of software operations that are implemented outside of specifications, then define an AQO to return these anomalous operations as its result. Our error correction work is the first large-scale experimental demonstration of quantum error correcting codes. We develop QAC and apply it to USC's equipment, the first and second generation of commercially available D-Wave AQO processors. We first show comprehensive experimental results for the code's performance on antiferromagnetic chains, scaling the problem size up to 86 logical qubits (344 physical qubits) and recovering significant encoded success rates even when the unencoded success rates drop to almost nothing. A broader set of randomized benchmarking problems is then introduced, for which we observe similar behavior to the antiferromagnetic chain, specifically that the use of QAC is almost always advantageous for problems of sufficient size and difficulty. Along the way, we develop problem-specific optimizations for the code and gain insight into the various on-chip error mechanisms (most prominently thermal noise, since the hardware operates at finite temperature) and the ways QAC counteracts them. We finish by showing that the scheme is robust to qubit loss on-chip, a significant benefit when considering an implemented system.

Modes of asymmetry: The application of harmonic analysis to symmetric quantum dynamics and quantum reference frames

NASA Astrophysics Data System (ADS)

Marvian, Iman; Spekkens, Robert W.

2014-12-01

Finding the consequences of symmetry for open-system quantum dynamics is a problem with broad applications, including describing thermal relaxation, deriving quantum limits on the performance of amplifiers, and exploring quantum metrology in the presence of noise. The symmetry of the dynamics may reflect a symmetry of the fundamental laws of nature or a symmetry of a low-energy effective theory, or it may describe a practical restriction such as the lack of a reference frame. In this paper, we apply some tools of harmonic analysis together with ideas from quantum information theory to this problem. The central idea is to study the decomposition of quantum operations—in particular, states, measurements, and channels—into different modes, which we call modes of asymmetry. Under symmetric processing, a given mode of the input is mapped to the corresponding mode of the output, implying that one can only generate a given output if the input contains all of the necessary modes. By defining monotones that quantify the asymmetry in a particular mode, we also derive quantitative constraints on the resources of asymmetry that are required to simulate a given asymmetric operation. We present applications of our results for deriving bounds on the probability of success in nondeterministic state transitions, such as quantum amplification, and a simplified formalism for studying the degradation of quantum reference frames.

Quantum walks: The first detected passage time problem

NASA Astrophysics Data System (ADS)

Friedman, H.; Kessler, D. A.; Barkai, E.

2017-03-01

Even after decades of research, the problem of first passage time statistics for quantum dynamics remains a challenging topic of fundamental and practical importance. Using a projective measurement approach, with a sampling time τ , we obtain the statistics of first detection events for quantum dynamics on a lattice, with the detector located at the origin. A quantum renewal equation for a first detection wave function, in terms of which the first detection probability can be calculated, is derived. This formula gives the relation between first detection statistics and the solution of the corresponding Schrödinger equation in the absence of measurement. We illustrate our results with tight-binding quantum walk models. We examine a closed system, i.e., a ring, and reveal the intricate influence of the sampling time τ on the statistics of detection, discussing the quantum Zeno effect, half dark states, revivals, and optimal detection. The initial condition modifies the statistics of a quantum walk on a finite ring in surprising ways. In some cases, the average detection time is independent of the sampling time while in others the average exhibits multiple divergences as the sampling time is modified. For an unbounded one-dimensional quantum walk, the probability of first detection decays like (time)(-3 ) with superimposed oscillations, with exceptional behavior when the sampling period τ times the tunneling rate γ is a multiple of π /2 . The amplitude of the power-law decay is suppressed as τ →0 due to the Zeno effect. Our work, an extended version of our previously published paper, predicts rich physical behaviors compared with classical Brownian motion, for which the first passage probability density decays monotonically like (time)-3 /2, as elucidated by Schrödinger in 1915.

Exploiting Quantum Resonance to Solve Combinatorial Problems

NASA Technical Reports Server (NTRS)

Zak, Michail; Fijany, Amir

2006-01-01

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Revealing missing charges with generalised quantum fluctuation relations.

PubMed

Mur-Petit, J; Relaño, A; Molina, R A; Jaksch, D

2018-05-22

The non-equilibrium dynamics of quantum many-body systems is one of the most fascinating problems in physics. Open questions range from how they relax to equilibrium to how to extract useful work from them. A critical point lies in assessing whether a system has conserved quantities (or 'charges'), as these can drastically influence its dynamics. Here we propose a general protocol to reveal the existence of charges based on a set of exact relations between out-of-equilibrium fluctuations and equilibrium properties of a quantum system. We apply these generalised quantum fluctuation relations to a driven quantum simulator, demonstrating their relevance to obtain unbiased temperature estimates from non-equilibrium measurements. Our findings will help guide research on the interplay of quantum and thermal fluctuations in quantum simulation, in studying the transition from integrability to chaos and in the design of new quantum devices.

Quantum communication complexity using the quantum Zeno effect

NASA Astrophysics Data System (ADS)

Tavakoli, Armin; Anwer, Hammad; Hameedi, Alley; Bourennane, Mohamed

2015-07-01

The quantum Zeno effect (QZE) is the phenomenon in which the unitary evolution of a quantum state is suppressed, e.g., due to frequent measurements. Here, we investigate the use of the QZE in a class of communication complexity problems (CCPs). Quantum entanglement is known to solve certain CCPs beyond classical constraints. However, recent developments have yielded CCPs for which superclassical results can be obtained using only communication of a single d -level quantum state (qudit) as a resource. In the class of CCPs considered here, we show quantum reduction of complexity in three ways: using (i) entanglement and the QZE, (ii) a single qudit and the QZE, and (iii) a single qudit. We have performed a proof of concept experimental demonstrations of three party CCP protocol based on single-qubit communication with and without QZE.

Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms

NASA Astrophysics Data System (ADS)

Johansson, Niklas; Larsson, Jan-Åke

2017-09-01

A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough. Two examples of quantum speed-up are the Deutsch-Jozsa and Simon's problem, both efficiently solvable on a quantum Turing machine, and both believed to lack efficient classical solutions. Here we present a framework that can simulate both quantum algorithms efficiently, solving the Deutsch-Jozsa problem with probability 1 using only one oracle query, and Simon's problem using linearly many oracle queries, just as expected of an ideal quantum computer. The presented simulation framework is in turn efficiently simulatable in a classical probabilistic Turing machine. This shows that the Deutsch-Jozsa and Simon's problem do not require any genuinely quantum resources, and that the quantum algorithms show no speed-up when compared with their corresponding classical simulation. Finally, this gives insight into what properties are needed in the two algorithms and calls for further study of oracle separation between quantum and classical computation.

Itinerant Microwave Photon Detector

NASA Astrophysics Data System (ADS)

Royer, Baptiste; Grimsmo, Arne L.; Choquette-Poitevin, Alexandre; Blais, Alexandre

2018-05-01

The realization of a high-efficiency microwave single photon detector is a long-standing problem in the field of microwave quantum optics. Here, we propose a quantum nondemolition, high-efficiency photon detector that can readily be implemented in present state-of-the-art circuit quantum electrodynamics. This scheme works in a continuous fashion, gaining information about the photon arrival time as well as about its presence. The key insight that allows us to circumvent the usual limitations imposed by measurement backaction is the use of long-lived dark states in a small ensemble of inhomogeneous artificial atoms to increase the interaction time between the photon and the measurement device. Using realistic system parameters, we show that large detection fidelities are possible.

Analysis of the secrecy of the running key in quantum encryption channels using coherent states of light

NASA Astrophysics Data System (ADS)

Nikulin, Vladimir V.; Hughes, David H.; Malowicki, John; Bedi, Vijit

2015-05-01

Free-space optical communication channels offer secure links with low probability of interception and detection. Despite their point-to-point topology, additional security features may be required in privacy-critical applications. Encryption can be achieved at the physical layer by using quantized values of photons, which makes exploitation of such quantum communication links extremely difficult. One example of such technology is keyed communication in quantum noise, a novel quantum modulation protocol that offers ultra-secure communication with competitive performance characteristics. Its utilization relies on specific coherent measurements to decrypt the signal. The process of measurements is complicated by the inherent and irreducible quantum noise of coherent states. This problem is different from traditional laser communication with coherent detection; therefore continuous efforts are being made to improve the measurement techniques. Quantum-based encryption systems that use the phase of the signal as the information carrier impose aggressive requirements on the accuracy of the measurements when an unauthorized party attempts intercepting the data stream. Therefore, analysis of the secrecy of the data becomes extremely important. In this paper, we present the results of a study that had a goal of assessment of potential vulnerability of the running key. Basic results of the laboratory measurements are combined with simulation studies and statistical analysis that can be used for both conceptual improvement of the encryption approach and for quantitative comparison of secrecy of different quantum communication protocols.

From the GKLS Equation to the Theory of Solar and Fuel Cells

NASA Astrophysics Data System (ADS)

Alicki, R.

The mathematically sound theory of quantum open systems, formulated in the ’70s and highlighted by the discovery of Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) equation, found a wide range of applications in various branches of physics and chemistry, notably in the field of quantum information and quantum thermodynamics. However, it took 40 years before this formalism has been applied to explain correctly the operation principles of long existing energy transducers like photovoltaic, thermoelectric and fuel cells. This long path is briefly reviewed from the author’s perspective. Finally, the new, fully quantum model of chemical engine based on GKLS equation and applicable to fuel cells or replicators is outlined. The model illustrates the difficulty with an entirely quantum operational definition of work, comparable to the problem of quantum measurement.

On variational definition of quantum entropy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Belavkin, Roman V.

Entropy of distribution P can be defined in at least three different ways: 1) as the expectation of the Kullback-Leibler (KL) divergence of P from elementary δ-measures (in this case, it is interpreted as expected surprise); 2) as a negative KL-divergence of some reference measure ν from the probability measure P; 3) as the supremum of Shannon’s mutual information taken over all channels such that P is the output probability, in which case it is dual of some transportation problem. In classical (i.e. commutative) probability, all three definitions lead to the same quantity, providing only different interpretations of entropy. Inmore » non-commutative (i.e. quantum) probability, however, these definitions are not equivalent. In particular, the third definition, where the supremum is taken over all entanglements of two quantum systems with P being the output state, leads to the quantity that can be twice the von Neumann entropy. It was proposed originally by V. Belavkin and Ohya [1] and called the proper quantum entropy, because it allows one to define quantum conditional entropy that is always non-negative. Here we extend these ideas to define also quantum counterpart of proper cross-entropy and cross-information. We also show inequality for the values of classical and quantum information.« less

A case study in programming a quantum annealer for hard operational planning problems

NASA Astrophysics Data System (ADS)

Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan; Do, Minh B.; Prystay, Elicia M.; Smelyanskiy, Vadim N.

2015-01-01

We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.

Quantifying entanglement in two-mode Gaussian states

NASA Astrophysics Data System (ADS)

Tserkis, Spyros; Ralph, Timothy C.

2017-12-01

Entangled two-mode Gaussian states are a key resource for quantum information technologies such as teleportation, quantum cryptography, and quantum computation, so quantification of Gaussian entanglement is an important problem. Entanglement of formation is unanimously considered a proper measure of quantum correlations, but for arbitrary two-mode Gaussian states no analytical form is currently known. In contrast, logarithmic negativity is a measure that is straightforward to calculate and so has been adopted by most researchers, even though it is a less faithful quantifier. In this work, we derive an analytical lower bound for entanglement of formation of generic two-mode Gaussian states, which becomes tight for symmetric states and for states with balanced correlations. We define simple expressions for entanglement of formation in physically relevant situations and use these to illustrate the problematic behavior of logarithmic negativity, which can lead to spurious conclusions.

Quantum Heterogeneous Computing for Satellite Positioning Optimization

NASA Astrophysics Data System (ADS)

Bass, G.; Kumar, V.; Dulny, J., III

2016-12-01

Hard optimization problems occur in many fields of academic study and practical situations. We present results in which quantum heterogeneous computing is used to solve a real-world optimization problem: satellite positioning. Optimization problems like this can scale very rapidly with problem size, and become unsolvable with traditional brute-force methods. Typically, such problems have been approximately solved with heuristic approaches; however, these methods can take a long time to calculate and are not guaranteed to find optimal solutions. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. There are now commercially available quantum annealing (QA) devices that are designed to solve difficult optimization problems. These devices have 1000+ quantum bits, but they have significant hardware size and connectivity limitations. We present a novel heterogeneous computing stack that combines QA and classical machine learning and allows the use of QA on problems larger than the quantum hardware could solve in isolation. We begin by analyzing the satellite positioning problem with a heuristic solver, the genetic algorithm. The classical computer's comparatively large available memory can explore the full problem space and converge to a solution relatively close to the true optimum. The QA device can then evolve directly to the optimal solution within this more limited space. Preliminary experiments, using the Quantum Monte Carlo (QMC) algorithm to simulate QA hardware, have produced promising results. Working with problem instances with known global minima, we find a solution within 8% in a matter of seconds, and within 5% in a few minutes. Future studies include replacing QMC with commercially available quantum hardware and exploring more problem sets and model parameters. Our results have important implications for how heterogeneous quantum computing can be used to solve difficult optimization problems in any field.

Advanced Concepts in Quantum Mechanics

NASA Astrophysics Data System (ADS)

Esposito, Giampiero; Marmo, Giuseppe; Miele, Gennaro; Sudarshan, George

2014-11-01

Preface; 1. Introduction: the need for a quantum theory; 2. Experimental foundations of quantum theory; 3. Waves and particles; 4. Schrödinger picture, Heisenberg picture and probabilistic aspects; 5. Integrating the equations of motion; 6. Elementary applications: 1-dimensional problems; 7. Elementary applications: multidimensional problems; 8. Coherent states and related formalism; 9. Introduction to spin; 10. Symmetries in quantum mechanics; 11. Approximation methods; 12. Modern pictures of quantum mechanics; 13. Formulations of quantum mechanics and their physical implications; 14. Exam problems; Glossary of geometric concepts; References; Index.

Population Switching and Charge Sensing in Quantum Dots: A Case for a Quantum Phase Transition

NASA Astrophysics Data System (ADS)

Goldstein, Moshe; Berkovits, Richard; Gefen, Yuval

2010-06-01

A broad and a narrow level of a quantum dot connected to two external leads may swap their respective occupancies as a function of an external gate voltage. By mapping this problem onto a multiflavored Coulomb gas we show that such population switching is not abrupt. However, trying to measure it by adding a third electrostatically coupled lead may render this switching an abrupt first order quantum phase transition. This is related to the interplay of the Mahan mechanism versus the Anderson orthogonality catastrophe, in similitude to the Fermi edge singularity. A concrete setup for experimental observation of this effect is also suggested.

BOOK REVIEW: The Quantum Mechanics Solver: How to Apply Quantum Theory to Modern Physics, 2nd edition

NASA Astrophysics Data System (ADS)

Robbin, J. M.

2007-07-01

he hallmark of a good book of problems is that it allows you to become acquainted with an unfamiliar topic quickly and efficiently. The Quantum Mechanics Solver fits this description admirably. The book contains 27 problems based mainly on recent experimental developments, including neutrino oscillations, tests of Bell's inequality, Bose Einstein condensates, and laser cooling and trapping of atoms, to name a few. Unlike many collections, in which problems are designed around a particular mathematical method, here each problem is devoted to a small group of phenomena or experiments. Most problems contain experimental data from the literature, and readers are asked to estimate parameters from the data, or compare theory to experiment, or both. Standard techniques (e.g., degenerate perturbation theory, addition of angular momentum, asymptotics of special functions) are introduced only as they are needed. The style is closer to a non-specialist seminar rather than an undergraduate lecture. The physical models are kept simple; the emphasis is on cultivating conceptual and qualitative understanding (although in many of the problems, the simple models fit the data quite well). Some less familiar theoretical techniques are introduced, e.g. a variational method for lower (not upper) bounds on ground-state energies for many-body systems with two-body interactions, which is then used to derive a surprisingly accurate relation between baryon and meson masses. The exposition is succinct but clear; the solutions can be read as worked examples if you don't want to do the problems yourself. Many problems have additional discussion on limitations and extensions of the theory, or further applications outside physics (e.g., the accuracy of GPS positioning in connection with atomic clocks; proton and ion tumor therapies in connection with the Bethe Bloch formula for charged particles in solids). The problems use mainly non-relativistic quantum mechanics and are organised into three sections: Elementary Particles, Nuclei and Atoms; Quantum Entanglement and Measurement; and Complex Systems. The coverage is not comprehensive; there is little on scattering theory, for example, and some areas of recent interest, such as topological aspects of quantum mechanics and semiclassics, are not included. The problems are based on examination questions given at the École Polytechnique in the last 15 years. The book is accessible to undergraduates, but working physicists should find it a delight.

A quantum annealing approach for fault detection and diagnosis of graph-based systems

NASA Astrophysics Data System (ADS)

Perdomo-Ortiz, A.; Fluegemann, J.; Narasimhan, S.; Biswas, R.; Smelyanskiy, V. N.

2015-02-01

Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.

Quantum-optical coherence tomography with classical light.

PubMed

Lavoie, J; Kaltenbaek, R; Resch, K J

2009-03-02

Quantum-optical coherence tomography (Q-OCT) is an interferometric technique for axial imaging offering several advantages over conventional methods. Chirped-pulse interferometry (CPI) was recently demonstrated to exhibit all of the benefits of the quantum interferometer upon which Q-OCT is based. Here we use CPI to measure axial interferograms to profile a sample accruing the important benefits of Q-OCT, including automatic dispersion cancellation, but with 10 million times higher signal. Our technique solves the artifact problem in Q-OCT and highlights the power of classical correlation in optical imaging.

Continuity of the sequential product of sequential quantum effect algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lei, Qiang, E-mail: leiqiang@hit.edu.cn; Su, Xiaochao, E-mail: hitswh@163.com; Wu, Junde, E-mail: wjd@zju.edu.cn

In order to study quantum measurement theory, sequential product defined by A∘B = A{sup 1/2}BA{sup 1/2} for any two quantum effects A, B has been introduced. Physically motivated conditions ask the sequential product to be continuous with respect to the strong operator topology. In this paper, we study the continuity problems of the sequential product A∘B = A{sup 1/2}BA{sup 1/2} with respect to other important topologies, such as norm topology, weak operator topology, order topology, and interval topology.

A Survey of Quantum Programming Languages: History, Methods, and Tools

DTIC Science & Technology

2008-01-01

and entanglement , to achieve computational solutions to certain problems in less time (fewer computational cycles) than is possible using classical...superposition of quantum bits, entanglement , destructive measurement, and the no-cloning theorem. These differences must be thoroughly understood and even...computers using well-known languages such as C, C++, Java, and rapid prototyping languages such as Maple, Mathematica, and Matlab . A good on-line

Fast reconstruction of high-qubit-number quantum states via low-rate measurements

NASA Astrophysics Data System (ADS)

Li, K.; Zhang, J.; Cong, S.

2017-07-01

Due to the exponential complexity of the resources required by quantum state tomography (QST), people are interested in approaches towards identifying quantum states which require less effort and time. In this paper, we provide a tailored and efficient method for reconstructing mixed quantum states up to 12 (or even more) qubits from an incomplete set of observables subject to noises. Our method is applicable to any pure or nearly pure state ρ and can be extended to many states of interest in quantum information processing, such as a multiparticle entangled W state, Greenberger-Horne-Zeilinger states, and cluster states that are matrix product operators of low dimensions. The method applies the quantum density matrix constraints to a quantum compressive sensing optimization problem and exploits a modified quantum alternating direction multiplier method (quantum-ADMM) to accelerate the convergence. Our algorithm takes 8 ,35 , and 226 seconds, respectively, to reconstruct superposition state density matrices of 10 ,11 ,and12 qubits with acceptable fidelity using less than 1 % of measurements of expectation. To our knowledge it is the fastest realization that people can achieve using a normal desktop. We further discuss applications of this method using experimental data of mixed states obtained in an ion trap experiment of up to 8 qubits.

Categorization of Quantum Mechanics Problems by Professors and Students

ERIC Educational Resources Information Center

Lin, Shih-Yin; Singh, Chandralekha

2010-01-01

We discuss the categorization of 20 quantum mechanics problems by physics professors and undergraduate students from two honours-level quantum mechanics courses. Professors and students were asked to categorize the problems based upon similarity of solution. We also had individual discussions with professors who categorized the problems. Faculty…

A space-efficient quantum computer simulator suitable for high-speed FPGA implementation

NASA Astrophysics Data System (ADS)

Frank, Michael P.; Oniciuc, Liviu; Meyer-Baese, Uwe H.; Chiorescu, Irinel

2009-05-01

Conventional vector-based simulators for quantum computers are quite limited in the size of the quantum circuits they can handle, due to the worst-case exponential growth of even sparse representations of the full quantum state vector as a function of the number of quantum operations applied. However, this exponential-space requirement can be avoided by using general space-time tradeoffs long known to complexity theorists, which can be appropriately optimized for this particular problem in a way that also illustrates some interesting reformulations of quantum mechanics. In this paper, we describe the design and empirical space/time complexity measurements of a working software prototype of a quantum computer simulator that avoids excessive space requirements. Due to its space-efficiency, this design is well-suited to embedding in single-chip environments, permitting especially fast execution that avoids access latencies to main memory. We plan to prototype our design on a standard FPGA development board.

Analysis of quantum information processors using quantum metrology

NASA Astrophysics Data System (ADS)

Kandula, Mark J.; Kok, Pieter

2018-06-01

Physical implementations of quantum information processing devices are generally not unique, and we are faced with the problem of choosing the best implementation. Here, we consider the sensitivity of quantum devices to variations in their different components. To measure this, we adopt a quantum metrological approach and find that the sensitivity of a device to variations in a component has a particularly simple general form. We use the concept of cost functions to establish a general practical criterion to decide between two different physical implementations of the same quantum device consisting of a variety of components. We give two practical examples of sensitivities of quantum devices to variations in beam splitter transmittivities: the Knill-Laflamme-Milburn (KLM) and reverse nonlinear sign gates for linear optical quantum computing with photonic qubits, and the enhanced optical Bell detectors by Grice and Ewert and van Loock. We briefly compare the sensitivity to the diamond distance and find that the latter is less suited for studying the behavior of components embedded within the larger quantum device.

Quantum critical singularities in two-dimensional metallic XY ferromagnets

NASA Astrophysics Data System (ADS)

Varma, Chandra M.; Gannon, W. J.; Aronson, M. C.; Rodriguez-Rivera, J. A.; Qiu, Y.

2018-02-01

An important problem in contemporary physics concerns quantum-critical fluctuations in metals. A scaling function for the momentum, frequency, temperature, and magnetic field dependence of the correlation function near a 2D-ferromagnetic quantum-critical point (QCP) is constructed, and its singularities are determined by comparing to the recent calculations of the correlation functions of the dissipative quantum XY model (DQXY). The calculations are motivated by the measured properties of the metallic compound YFe2Al10 , which is a realization of the DQXY model in 2D. The frequency, temperature, and magnetic field dependence of the scaling function as well as the singularities measured in the experiments are given by the theory without adjustable exponents. The same model is applicable to the superconductor-insulator transitions, classes of metallic AFM-QCPs, and as fluctuations of the loop-current ordered state in hole-doped cuprates. The results presented here lend credence to the solution found for the 2D-DQXY model and its applications in understanding quantum-critical properties of diverse systems.

Digitized adiabatic quantum computing with a superconducting circuit.

PubMed

Barends, R; Shabani, A; Lamata, L; Kelly, J; Mezzacapo, A; Las Heras, U; Babbush, R; Fowler, A G; Campbell, B; Chen, Yu; Chen, Z; Chiaro, B; Dunsworth, A; Jeffrey, E; Lucero, E; Megrant, A; Mutus, J Y; Neeley, M; Neill, C; O'Malley, P J J; Quintana, C; Roushan, P; Sank, D; Vainsencher, A; Wenner, J; White, T C; Solano, E; Neven, H; Martinis, John M

2016-06-09

Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

Heterogeneous quantum computing for satellite constellation optimization: solving the weighted k-clique problem

NASA Astrophysics Data System (ADS)

Bass, Gideon; Tomlin, Casey; Kumar, Vaibhaw; Rihaczek, Pete; Dulny, Joseph, III

2018-04-01

NP-hard optimization problems scale very rapidly with problem size, becoming unsolvable with brute force methods, even with supercomputing resources. Typically, such problems have been approximated with heuristics. However, these methods still take a long time and are not guaranteed to find an optimal solution. Quantum computing offers the possibility of producing significant speed-up and improved solution quality. Current quantum annealing (QA) devices are designed to solve difficult optimization problems, but they are limited by hardware size and qubit connectivity restrictions. We present a novel heterogeneous computing stack that combines QA and classical machine learning, allowing the use of QA on problems larger than the hardware limits of the quantum device. These results represent experiments on a real-world problem represented by the weighted k-clique problem. Through this experiment, we provide insight into the state of quantum machine learning.

Dimension-dependent stimulated radiative interaction of a single electron quantum wavepacket

NASA Astrophysics Data System (ADS)

Gover, Avraham; Pan, Yiming

2018-06-01

In the foundation of quantum mechanics, the spatial dimensions of electron wavepacket are understood only in terms of an expectation value - the probability distribution of the particle location. One can still inquire how the quantum electron wavepacket size affects a physical process. Here we address the fundamental physics problem of particle-wave duality and the measurability of a free electron quantum wavepacket. Our analysis of stimulated radiative interaction of an electron wavepacket, accompanied by numerical computations, reveals two limits. In the quantum regime of long wavepacket size relative to radiation wavelength, one obtains only quantum-recoil multiphoton sidebands in the electron energy spectrum. In the opposite regime, the wavepacket interaction approaches the limit of classical point-particle acceleration. The wavepacket features can be revealed in experiments carried out in the intermediate regime of wavepacket size commensurate with the radiation wavelength.

A review on economic emission dispatch problems using quantum computational intelligence

NASA Astrophysics Data System (ADS)

Mahdi, Fahad Parvez; Vasant, Pandian; Kallimani, Vish; Abdullah-Al-Wadud, M.

2016-11-01

Economic emission dispatch (EED) problems are one of the most crucial problems in power systems. Growing energy demand, limitation of natural resources and global warming make this topic into the center of discussion and research. This paper reviews the use of Quantum Computational Intelligence (QCI) in solving Economic Emission Dispatch problems. QCI techniques like Quantum Genetic Algorithm (QGA) and Quantum Particle Swarm Optimization (QPSO) algorithm are discussed here. This paper will encourage the researcher to use more QCI based algorithm to get better optimal result for solving EED problems.

Continuous-variable Measurement-device-independent Quantum Relay Network with Phase-sensitive Amplifiers

NASA Astrophysics Data System (ADS)

Li, Fei; Zhao, Wei; Guo, Ying

2018-01-01

Continuous-variable (CV) measurement-device-independent (MDI) quantum cryptography is now heading towards solving the practical problem of implementing scalable quantum networks. In this paper, we show that a solution can come from deploying an optical amplifier in the CV-MDI system, aiming to establish a high-rate quantum network. We suggest an improved CV-MDI protocol using the EPR states coupled with optical amplifiers. It can implement a practical quantum network scheme, where the legal participants create the secret correlations by using EPR states connecting to an untrusted relay via insecure links and applying the multi-entangled Greenberger-Horne-Zeilinger (GHZ) state analysis at relay station. Despite the possibility that the relay could be completely tampered with and imperfect links are subject to the powerful attacks, the legal participants are still able to extract a secret key from network communication. The numerical simulation indicates that the quantum network communication can be achieved in an asymmetric scenario, fulfilling the demands of a practical quantum network. Furthermore, we show that the use of optical amplifiers can compensate the inherent imperfections and improve the secret key rate of the CV-MDI system.

Quantum theory of multiple-input-multiple-output Markovian feedback with diffusive measurements

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chia, A.; Wiseman, H. M.

2011-07-15

Feedback control engineers have been interested in multiple-input-multiple-output (MIMO) extensions of single-input-single-output (SISO) results of various kinds due to its rich mathematical structure and practical applications. An outstanding problem in quantum feedback control is the extension of the SISO theory of Markovian feedback by Wiseman and Milburn [Phys. Rev. Lett. 70, 548 (1993)] to multiple inputs and multiple outputs. Here we generalize the SISO homodyne-mediated feedback theory to allow for multiple inputs, multiple outputs, and arbitrary diffusive quantum measurements. We thus obtain a MIMO framework which resembles the SISO theory and whose additional mathematical structure is highlighted by the extensivemore » use of vector-operator algebra.« less

Experimental demonstration of real-time adaptive one-qubit quantum-state tomography

NASA Astrophysics Data System (ADS)

Yin, Qi; Li, Li; Xiang, Xiao; Xiang, Guo-Yong; Li, Chuang-Feng; Guo, Guang-Can

2017-01-01

Quantum-state tomography plays a pivotal role in quantum computation and information processing. To improve the accuracy in estimating an unknown state, carefully designed measurement schemes, such as adopting an adaptive strategy, are necessarily needed, which have gained great interest recently. In this work, based on the proposal of Sugiyama et al. [Phys. Rev. A 85, 052107 (2012)], 10.1103/PhysRevA.85.052107, we experimentally realize an adaptive quantum-state tomography for one qubit in an optical system. Since this scheme gives an analytical solution to the optimal measurement basis problem, our experiment is updated in real time and the infidelity between the real state and the estimated state is tracked with the detected photons. We observe an almost 1 /N scaling rule of averaged infidelity against the overall number of photons, N , in our experiment, which outperforms 1 /√{N } of nonadaptive schemes.

Joint estimation of phase and phase diffusion for quantum metrology.

PubMed

Vidrighin, Mihai D; Donati, Gaia; Genoni, Marco G; Jin, Xian-Min; Kolthammer, W Steven; Kim, M S; Datta, Animesh; Barbieri, Marco; Walmsley, Ian A

2014-04-14

Phase estimation, at the heart of many quantum metrology and communication schemes, can be strongly affected by noise, whose amplitude may not be known, or might be subject to drift. Here we investigate the joint estimation of a phase shift and the amplitude of phase diffusion at the quantum limit. For several relevant instances, this multiparameter estimation problem can be effectively reshaped as a two-dimensional Hilbert space model, encompassing the description of an interferometer phase probed with relevant quantum states--split single-photons, coherent states or N00N states. For these cases, we obtain a trade-off bound on the statistical variances for the joint estimation of phase and phase diffusion, as well as optimum measurement schemes. We use this bound to quantify the effectiveness of an actual experimental set-up for joint parameter estimation for polarimetry. We conclude by discussing the form of the trade-off relations for more general states and measurements.

The Measurement Problem: Decoherence and Convivial Solipsism

NASA Astrophysics Data System (ADS)

Zwirn, Hervé

2016-06-01

The problem of measurement is often considered an inconsistency inside the quantum formalism. Many attempts to solve (or to dissolve) it have been made since the inception of quantum mechanics. The form of these attempts depends on the philosophical position that their authors endorse. I will review some of them and analyze their relevance. The phenomenon of decoherence is often presented as a solution lying inside the pure quantum formalism and not demanding any particular philosophical assumption. Nevertheless, a widely debated question is to decide between two different interpretations. The first one is to consider that the decoherence process has the effect to actually project a superposed state into one of its classically interpretable component, hence doing the same job as the reduction postulate. For the second one, decoherence is only a way to show why no macroscopic superposed state can be observed, so explaining the classical appearance of the macroscopic world, while the quantum entanglement between the system, the apparatus and the environment never disappears. In this case, explaining why only one single definite outcome is observed remains to do. In this paper, I examine the arguments that have been given for and against both interpretations and defend a new position, the "Convivial Solipsism", according to which the outcome that is observed is relative to the observer, different but in close parallel to the Everett's interpretation and sharing also some similarities with Rovelli's relational interpretation and Quantum Bayesianism. I also show how "Convivial Solipsism" can help getting a new standpoint about the EPR paradox providing a way out of the seemingly unavoidable non-locality of quantum mechanics.

Applications of Atomic Systems in Quantum Simulation, Quantum Computation and Topological Phases of Matter

NASA Astrophysics Data System (ADS)

Wang, Shengtao

The ability to precisely and coherently control atomic systems has improved dramatically in the last two decades, driving remarkable advancements in quantum computation and simulation. In recent years, atomic and atom-like systems have also been served as a platform to study topological phases of matter and non-equilibrium many-body physics. Integrated with rapid theoretical progress, the employment of these systems is expanding the realm of our understanding on a range of physical phenomena. In this dissertation, I draw on state-of-the-art experimental technology to develop several new ideas for controlling and applying atomic systems. In the first part of this dissertation, we propose several novel schemes to realize, detect, and probe topological phases in atomic and atom-like systems. We first theoretically study the intriguing properties of Hopf insulators, a peculiar type of topological insulators beyond the standard classification paradigm of topological phases. Using a solid-state quantum simulator, we report the first experimental observation of Hopf insulators. We demonstrate the Hopf fibration with fascinating topological links in the experiment, showing clear signals of topological phase transitions for the underlying Hamiltonian. Next, we propose a feasible experimental scheme to realize the chiral topological insulator in three dimensions. They are a type of topological insulators protected by the chiral symmetry and have thus far remained unobserved in experiment. We then introduce a method to directly measure topological invariants in cold-atom experiments. This detection scheme is general and applicable to probe of different topological insulators in any spatial dimension. In another study, we theoretically discover a new type of topological gapless rings, dubbed a Weyl exceptional ring, in three-dimensional dissipative cold atomic systems. In the second part of this dissertation, we focus on the application of atomic systems in quantum computation and simulation. Trapped atomic ions are one of the leading platforms to build a scalable, universal quantum computer. The common one-dimensional setup, however, greatly limits the system's scalability. By solving the critical problem of micromotion, we propose a two-dimensional architecture for scalable trapped-ion quantum computation. Hamiltonian tomography for many-body quantum systems is essential for benchmarking quantum computation and simulation. By employing dynamical decoupling, we propose a scalable scheme for full Hamiltonian tomography. The required number of measurements increases only polynomially with the system size, in contrast to an exponential scaling in common methods. Finally, we work toward the goal of demonstrating quantum supremacy. A number of sampling tasks, such as the boson sampling problem, have been proposed to be classically intractable under mild assumptions. An intermediate quantum computer can efficiently solve the sampling problem, but the correct operation of the device is not known to be classically verifiable. Toward practical verification, we present an experimental friendly scheme to extract useful and robust information from the quantum boson samplers based on coarse-grained measurements. In a separate study, we introduce a new model built from translation-invariant Ising-interacting spins. This model possesses several advantageous properties, catalyzing the ultimate experimental demonstration of quantum supremacy.

A strategy for quantum algorithm design assisted by machine learning

NASA Astrophysics Data System (ADS)

Bang, Jeongho; Ryu, Junghee; Yoo, Seokwon; Pawłowski, Marcin; Lee, Jinhyoung

2014-07-01

We propose a method for quantum algorithm design assisted by machine learning. The method uses a quantum-classical hybrid simulator, where a ‘quantum student’ is being taught by a ‘classical teacher’. In other words, in our method, the learning system is supposed to evolve into a quantum algorithm for a given problem, assisted by a classical main-feedback system. Our method is applicable for designing quantum oracle-based algorithms. We chose, as a case study, an oracle decision problem, called a Deutsch-Jozsa problem. We showed by using Monte Carlo simulations that our simulator can faithfully learn a quantum algorithm for solving the problem for a given oracle. Remarkably, the learning time is proportional to the square root of the total number of parameters, rather than showing the exponential dependence found in the classical machine learning-based method.

Spin Glass a Bridge Between Quantum Computation and Statistical Mechanics

NASA Astrophysics Data System (ADS)

Ohzeki, Masayuki

2013-09-01

In this chapter, we show two fascinating topics lying between quantum information processing and statistical mechanics. First, we introduce an elaborated technique, the surface code, to prepare the particular quantum state with robustness against decoherence. Interestingly, the theoretical limitation of the surface code, accuracy threshold, to restore the quantum state has a close connection with the problem on the phase transition in a special model known as spin glasses, which is one of the most active researches in statistical mechanics. The phase transition in spin glasses is an intractable problem, since we must strive many-body system with complicated interactions with change of their signs depending on the distance between spins. Fortunately, recent progress in spin-glass theory enables us to predict the precise location of the critical point, at which the phase transition occurs. It means that statistical mechanics is available for revealing one of the most interesting parts in quantum information processing. We show how to import the special tool in statistical mechanics into the problem on the accuracy threshold in quantum computation. Second, we show another interesting technique to employ quantum nature, quantum annealing. The purpose of quantum annealing is to search for the most favored solution of a multivariable function, namely optimization problem. The most typical instance is the traveling salesman problem to find the minimum tour while visiting all the cities. In quantum annealing, we introduce quantum fluctuation to drive a particular system with the artificial Hamiltonian, in which the ground state represents the optimal solution of the specific problem we desire to solve. Induction of the quantum fluctuation gives rise to the quantum tunneling effect, which allows nontrivial hopping from state to state. We then sketch a strategy to control the quantum fluctuation efficiently reaching the ground state. Such a generic framework is called quantum annealing. The most typical instance is quantum adiabatic computation based on the adiabatic theorem. The quantum adiabatic computation as discussed in the other chapter, unfortunately, has a crucial bottleneck for a part of the optimization problems. We here introduce several recent trials to overcome such a weakpoint by use of developments in statistical mechanics. Through both of the topics, we would shed light on the birth of the interdisciplinary field between quantum mechanics and statistical mechanics.

Quantum probabilistic logic programming

NASA Astrophysics Data System (ADS)

Balu, Radhakrishnan

2015-05-01

We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.

How quantum brain biology can rescue conscious free will

PubMed Central

Hameroff, Stuart

2012-01-01

Conscious “free will” is problematic because (1) brain mechanisms causing consciousness are unknown, (2) measurable brain activity correlating with conscious perception apparently occurs too late for real-time conscious response, consciousness thus being considered “epiphenomenal illusion,” and (3) determinism, i.e., our actions and the world around us seem algorithmic and inevitable. The Penrose–Hameroff theory of “orchestrated objective reduction (Orch OR)” identifies discrete conscious moments with quantum computations in microtubules inside brain neurons, e.g., 40/s in concert with gamma synchrony EEG. Microtubules organize neuronal interiors and regulate synapses. In Orch OR, microtubule quantum computations occur in integration phases in dendrites and cell bodies of integrate-and-fire brain neurons connected and synchronized by gap junctions, allowing entanglement of microtubules among many neurons. Quantum computations in entangled microtubules terminate by Penrose “objective reduction (OR),” a proposal for quantum state reduction and conscious moments linked to fundamental spacetime geometry. Each OR reduction selects microtubule states which can trigger axonal firings, and control behavior. The quantum computations are “orchestrated” by synaptic inputs and memory (thus “Orch OR”). If correct, Orch OR can account for conscious causal agency, resolving problem 1. Regarding problem 2, Orch OR can cause temporal non-locality, sending quantum information backward in classical time, enabling conscious control of behavior. Three lines of evidence for brain backward time effects are presented. Regarding problem 3, Penrose OR (and Orch OR) invokes non-computable influences from information embedded in spacetime geometry, potentially avoiding algorithmic determinism. In summary, Orch OR can account for real-time conscious causal agency, avoiding the need for consciousness to be seen as epiphenomenal illusion. Orch OR can rescue conscious free will. PMID:23091452

Unconditional security of entanglement-based continuous-variable quantum secret sharing

NASA Astrophysics Data System (ADS)

Kogias, Ioannis; Xiang, Yu; He, Qiongyi; Adesso, Gerardo

2017-01-01

The need for secrecy and security is essential in communication. Secret sharing is a conventional protocol to distribute a secret message to a group of parties, who cannot access it individually but need to cooperate in order to decode it. While several variants of this protocol have been investigated, including realizations using quantum systems, the security of quantum secret sharing schemes still remains unproven almost two decades after their original conception. Here we establish an unconditional security proof for entanglement-based continuous-variable quantum secret sharing schemes, in the limit of asymptotic keys and for an arbitrary number of players. We tackle the problem by resorting to the recently developed one-sided device-independent approach to quantum key distribution. We demonstrate theoretically the feasibility of our scheme, which can be implemented by Gaussian states and homodyne measurements, with no need for ideal single-photon sources or quantum memories. Our results contribute to validating quantum secret sharing as a viable primitive for quantum technologies.

Quantum to classical transition in the Hořava-Lifshitz quantum cosmology

NASA Astrophysics Data System (ADS)

Bernardini, A. E.; Leal, P.; Bertolami, O.

2018-02-01

A quasi-Gaussian quantum superposition of Hořava-Lifshitz (HL) stationary states is built in order to describe the transition of the quantum cosmological problem to the related classical dynamics. The obtained HL phase-space superposed Wigner function and its associated Wigner currents describe the conditions for the matching between classical and quantum phase-space trajectories. The matching quantum superposition parameter is associated to the total energy of the classical trajectory which, at the same time, drives the engendered Wigner function to the classical stationary regime. Through the analysis of the Wigner flows, the quantum fluctuations that distort the classical regime can be quantified as a measure of (non)classicality. Finally, the modifications to the Wigner currents due to the inclusion of perturbative potentials are computed in the HL quantum cosmological context. In particular, the inclusion of a cosmological constant provides complementary information that allows for connecting the age of the Universe with the overall stiff matter density profile.

Quantum Biometrics with Retinal Photon Counting

NASA Astrophysics Data System (ADS)

Loulakis, M.; Blatsios, G.; Vrettou, C. S.; Kominis, I. K.

2017-10-01

It is known that the eye's scotopic photodetectors, rhodopsin molecules, and their associated phototransduction mechanism leading to light perception, are efficient single-photon counters. We here use the photon-counting principles of human rod vision to propose a secure quantum biometric identification based on the quantum-statistical properties of retinal photon detection. The photon path along the human eye until its detection by rod cells is modeled as a filter having a specific transmission coefficient. Precisely determining its value from the photodetection statistics registered by the conscious observer is a quantum parameter estimation problem that leads to a quantum secure identification method. The probabilities for false-positive and false-negative identification of this biometric technique can readily approach 10-10 and 10-4, respectively. The security of the biometric method can be further quantified by the physics of quantum measurements. An impostor must be able to perform quantum thermometry and quantum magnetometry with energy resolution better than 10-9ℏ , in order to foil the device by noninvasively monitoring the biometric activity of a user.

Efficiency of quantum vs. classical annealing in nonconvex learning problems

PubMed Central

Zecchina, Riccardo

2018-01-01

Quantum annealers aim at solving nonconvex optimization problems by exploiting cooperative tunneling effects to escape local minima. The underlying idea consists of designing a classical energy function whose ground states are the sought optimal solutions of the original optimization problem and add a controllable quantum transverse field to generate tunneling processes. A key challenge is to identify classes of nonconvex optimization problems for which quantum annealing remains efficient while thermal annealing fails. We show that this happens for a wide class of problems which are central to machine learning. Their energy landscapes are dominated by local minima that cause exponential slowdown of classical thermal annealers while simulated quantum annealing converges efficiently to rare dense regions of optimal solutions. PMID:29382764

A subgradient approach for constrained binary optimization via quantum adiabatic evolution

NASA Astrophysics Data System (ADS)

Karimi, Sahar; Ronagh, Pooya

2017-08-01

Outer approximation method has been proposed for solving the Lagrangian dual of a constrained binary quadratic programming problem via quantum adiabatic evolution in the literature. This should be an efficient prescription for solving the Lagrangian dual problem in the presence of an ideally noise-free quantum adiabatic system. However, current implementations of quantum annealing systems demand methods that are efficient at handling possible sources of noise. In this paper, we consider a subgradient method for finding an optimal primal-dual pair for the Lagrangian dual of a constrained binary polynomial programming problem. We then study the quadratic stable set (QSS) problem as a case study. We see that this method applied to the QSS problem can be viewed as an instance-dependent penalty-term approach that avoids large penalty coefficients. Finally, we report our experimental results of using the D-Wave 2X quantum annealer and conclude that our approach helps this quantum processor to succeed more often in solving these problems compared to the usual penalty-term approaches.

Performance of Quantum Annealers on Hard Scheduling Problems

NASA Astrophysics Data System (ADS)

Pokharel, Bibek; Venturelli, Davide; Rieffel, Eleanor

Quantum annealers have been employed to attack a variety of optimization problems. We compared the performance of the current D-Wave 2X quantum annealer to that of the previous generation D-Wave Two quantum annealer on scheduling-type planning problems. Further, we compared the effect of different anneal times, embeddings of the logical problem, and different settings of the ferromagnetic coupling JF across the logical vertex-model on the performance of the D-Wave 2X quantum annealer. Our results show that at the best settings, the scaling of expected anneal time to solution for D-WAVE 2X is better than that of the DWave Two, but still inferior to that of state of the art classical solvers on these problems. We discuss the implication of our results for the design and programming of future quantum annealers. Supported by NASA Ames Research Center.

Quantum simulator review

NASA Astrophysics Data System (ADS)

Bednar, Earl; Drager, Steven L.

2007-04-01

Quantum information processing's objective is to utilize revolutionary computing capability based on harnessing the paradigm shift offered by quantum computing to solve classically hard and computationally challenging problems. Some of our computationally challenging problems of interest include: the capability for rapid image processing, rapid optimization of logistics, protecting information, secure distributed simulation, and massively parallel computation. Currently, one important problem with quantum information processing is that the implementation of quantum computers is difficult to realize due to poor scalability and great presence of errors. Therefore, we have supported the development of Quantum eXpress and QuIDD Pro, two quantum computer simulators running on classical computers for the development and testing of new quantum algorithms and processes. This paper examines the different methods used by these two quantum computing simulators. It reviews both simulators, highlighting each simulators background, interface, and special features. It also demonstrates the implementation of current quantum algorithms on each simulator. It concludes with summary comments on both simulators.

Demonstration of essentiality of entanglement in a Deutsch-like quantum algorithm

NASA Astrophysics Data System (ADS)

Huang, He-Liang; Goswami, Ashutosh K.; Bao, Wan-Su; Panigrahi, Prasanta K.

2018-06-01

Quantum algorithms can be used to efficiently solve certain classically intractable problems by exploiting quantum parallelism. However, the effectiveness of quantum entanglement in quantum computing remains a question of debate. This study presents a new quantum algorithm that shows entanglement could provide advantages over both classical algorithms and quantum algo- rithms without entanglement. Experiments are implemented to demonstrate the proposed algorithm using superconducting qubits. Results show the viability of the algorithm and suggest that entanglement is essential in obtaining quantum speedup for certain problems in quantum computing. The study provides reliable and clear guidance for developing useful quantum algorithms.

Quantum Bio-Informatics II From Quantum Information to Bio-Informatics

NASA Astrophysics Data System (ADS)

Accardi, L.; Freudenberg, Wolfgang; Ohya, Masanori

2009-02-01

The problem of quantum-like representation in economy cognitive science, and genetics / L. Accardi, A. Khrennikov and M. Ohya -- Chaotic behavior observed in linea dynamics / M. Asano, T. Yamamoto and Y. Togawa -- Complete m-level quantum teleportation based on Kossakowski-Ohya scheme / M. Asano, M. Ohya and Y. Tanaka -- Towards quantum cybernetics: optimal feedback control in quantum bio informatics / V. P. Belavkin -- Quantum entanglement and circulant states / D. Chruściński -- The compound Fock space and its application in brain models / K. -H. Fichtner and W. Freudenberg -- Characterisation of beam splitters / L. Fichtner and M. Gäbler -- Application of entropic chaos degree to a combined quantum baker's map / K. Inoue, M. Ohya and I. V. Volovich -- On quantum algorithm for multiple alignment of amino acid sequences / S. Iriyama and M. Ohya --Quantum-like models for decision making in psychology and cognitive science / A. Khrennikov -- On completely positive non-Markovian evolution of a d-level system / A. Kossakowski and R. Rebolledo -- Measures of entanglement - a Hilbert space approach / W. A. Majewski -- Some characterizations of PPT states and their relation / T. Matsuoka -- On the dynamics of entanglement and characterization ofentangling properties of quantum evolutions / M. Michalski -- Perspective from micro-macro duality - towards non-perturbative renormalization scheme / I. Ojima -- A simple symmetric algorithm using a likeness with Introns behavior in RNA sequences / M. Regoli -- Some aspects of quadratic generalized white noise functionals / Si Si and T. Hida -- Analysis of several social mobility data using measure of departure from symmetry / K. Tahata ... [et al.] -- Time in physics and life science / I. V. Volovich -- Note on entropies in quantum processes / N. Watanabe -- Basics of molecular simulation and its application to biomolecules / T. Ando and I. Yamato -- Theory of proton-induced superionic conduction in hydrogen-bonded systems / H. Kamimura -- Massive collection of full-length complementary DNA clones and microarray analyses: keys to rice transcriptome analysis / S. Kikuchi -- Changes of influenza A(H5) viruses by means of entropic chaos degree / K. Sato and M. Ohya -- Basics of genome sequence analysis in bioinformatics - its fundamental ideas and problems / T. Suzuki and S. Miyazaki -- A basic introduction to gene expression studies using microarray expression data analysis / D. Wanke and J. Kilian -- Integrating biological perspectives: a quantum leap for microarray expression analysis / D. Wanke ... [et al.].

Quantum state discrimination bounds for finite sample size

DOE Office of Scientific and Technical Information (OSTI.GOV)

Audenaert, Koenraad M. R.; Mosonyi, Milan; Mathematical Institute, Budapest University of Technology and Economics, Egry Jozsef u 1., Budapest 1111

2012-12-15

In the problem of quantum state discrimination, one has to determine by measurements the state of a quantum system, based on the a priori side information that the true state is one of the two given and completely known states, {rho} or {sigma}. In general, it is not possible to decide the identity of the true state with certainty, and the optimal measurement strategy depends on whether the two possible errors (mistaking {rho} for {sigma}, or the other way around) are treated as of equal importance or not. Results on the quantum Chernoff and Hoeffding bounds and the quantum Stein'smore » lemma show that, if several copies of the system are available then the optimal error probabilities decay exponentially in the number of copies, and the decay rate is given by a certain statistical distance between {rho} and {sigma} (the Chernoff distance, the Hoeffding distances, and the relative entropy, respectively). While these results provide a complete solution to the asymptotic problem, they are not completely satisfying from a practical point of view. Indeed, in realistic scenarios one has access only to finitely many copies of a system, and therefore it is desirable to have bounds on the error probabilities for finite sample size. In this paper we provide finite-size bounds on the so-called Stein errors, the Chernoff errors, the Hoeffding errors, and the mixed error probabilities related to the Chernoff and the Hoeffding errors.« less

Complexity of the Quantum Adiabatic Algorithm

NASA Astrophysics Data System (ADS)

Hen, Itay

2013-03-01

The Quantum Adiabatic Algorithm (QAA) has been proposed as a mechanism for efficiently solving optimization problems on a quantum computer. Since adiabatic computation is analog in nature and does not require the design and use of quantum gates, it can be thought of as a simpler and perhaps more profound method for performing quantum computations that might also be easier to implement experimentally. While these features have generated substantial research in QAA, to date there is still a lack of solid evidence that the algorithm can outperform classical optimization algorihms. Here, we discuss several aspects of the quantum adiabatic algorithm: We analyze the efficiency of the algorithm on several ``hard'' (NP) computational problems. Studying the size dependence of the typical minimum energy gap of the Hamiltonians of these problems using quantum Monte Carlo methods, we find that while for most problems the minimum gap decreases exponentially with the size of the problem, indicating that the QAA is not more efficient than existing classical search algorithms, for other problems there is evidence to suggest that the gap may be polynomial near the phase transition. We also discuss applications of the QAA to ``real life'' problems and how they can be implemented on currently available (albeit prototypical) quantum hardware such as ``D-Wave One'', that impose serious restrictions as to which type of problems may be tested. Finally, we discuss different approaches to find improved implementations of the algorithm such as local adiabatic evolution, adaptive methods, local search in Hamiltonian space and others.

Quantum gate-set tomography

NASA Astrophysics Data System (ADS)

Blume-Kohout, Robin

2014-03-01

Quantum information technology is built on (1) physical qubits and (2) precise, accurate quantum logic gates that transform their states. Developing quantum logic gates requires good characterization - both in the development phase, where we need to identify a device's flaws so as to fix them, and in the production phase, where we need to make sure that the device works within specs and predict residual error rates and types. This task falls to quantum state and process tomography. But until recently, protocols for tomography relied on a pre-existing and perfectly calibrated reference frame comprising the measurements (and, for process tomography, input states) used to characterize the device. In practice, these measurements are neither independent nor perfectly known - they are usually implemented via exactly the same gates that we are trying to characterize! In the past year, several partial solutions to this self-consistency problem have been proposed. I will present a framework (gate set tomography, or GST) that addresses and resolves this problem, by self-consistently characterizing an entire set of quantum logic gates on a black-box quantum device. In particular, it contains an explicit closed-form protocol for linear-inversion gate set tomography (LGST), which is immune to both calibration error and technical pathologies like local maxima of the likelihood (which plagued earlier methods). GST also demonstrates significant (multiple orders of magnitude) improvements in efficiency over standard tomography by using data derived from long sequences of gates (much like randomized benchmarking). GST has now been applied to qubit devices in multiple technologies. I will present and discuss results of GST experiments in technologies including a single trapped-ion qubit and a silicon quantum dot qubit. Sandia National Laboratories is a multiprogram laboratory operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation, for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-AC04-94AL850.

Experimental quantum compressed sensing for a seven-qubit system

PubMed Central

Riofrío, C. A.; Gross, D.; Flammia, S. T.; Monz, T.; Nigg, D.; Blatt, R.; Eisert, J.

2017-01-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. PMID:28513587

Quantum computation with coherent spin states and the close Hadamard problem

NASA Astrophysics Data System (ADS)

Adcock, Mark R. A.; Høyer, Peter; Sanders, Barry C.

2016-04-01

We study a model of quantum computation based on the continuously parameterized yet finite-dimensional Hilbert space of a spin system. We explore the computational powers of this model by analyzing a pilot problem we refer to as the close Hadamard problem. We prove that the close Hadamard problem can be solved in the spin system model with arbitrarily small error probability in a constant number of oracle queries. We conclude that this model of quantum computation is suitable for solving certain types of problems. The model is effective for problems where symmetries between the structure of the information associated with the problem and the structure of the unitary operators employed in the quantum algorithm can be exploited.

Effect of local minima on adiabatic quantum optimization.

PubMed

Amin, M H S

2008-04-04

We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that, for problems that have an exponentially large number of local minima close to the global minimum, the gap becomes exponentially small making the computation time exponentially long. The quantum advantage of adiabatic quantum computation may then be accessed only via the local adiabatic evolution, which requires phase coherence throughout the evolution and knowledge of the spectrum. Such problems, therefore, are not suitable for adiabatic quantum computation.

Students' Epistemological Framing in Quantum Mechanics Problem Solving

ERIC Educational Resources Information Center

Modir, Bahar; Thompson, John D.; Sayre, Eleanor C.

2017-01-01

Students' difficulties in quantum mechanics may be the result of unproductive framing and not a fundamental inability to solve the problems or misconceptions about physics content. We observed groups of students solving quantum mechanics problems in an upper-division physics course. Using the lens of epistemological framing, we investigated four…

Geometry of Quantum Computation with Qudits

PubMed Central

Luo, Ming-Xing; Chen, Xiu-Bo; Yang, Yi-Xian; Wang, Xiaojun

2014-01-01

The circuit complexity of quantum qubit system evolution as a primitive problem in quantum computation has been discussed widely. We investigate this problem in terms of qudit system. Using the Riemannian geometry the optimal quantum circuits are equivalent to the geodetic evolutions in specially curved parametrization of SU(dn). And the quantum circuit complexity is explicitly dependent of controllable approximation error bound. PMID:24509710

Unraveling Quantum Annealers using Classical Hardness

PubMed Central

Martin-Mayor, Victor; Hen, Itay

2015-01-01

Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, commonly referred to as ‘D-Wave’ chips, promise to solve practical optimization problems potentially faster than conventional ‘classical’ computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of experimental quantum annealers from their classical thermal counterparts. Inspired by recent results in spin-glass theory that recognize ‘temperature chaos’ as the underlying mechanism responsible for the computational intractability of hard optimization problems, we devise a general method to quantify the performance of quantum annealers on optimization problems suffering from varying degrees of temperature chaos: A superior performance of quantum annealers over classical algorithms on these may allude to the role that quantum effects play in providing speedup. We utilize our method to experimentally study the D-Wave Two chip on different temperature-chaotic problems and find, surprisingly, that its performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss several purely classical effects that possibly mask the quantum behavior of the chip. PMID:26483257

Single-shot quantum state estimation via a continuous measurement in the strong backaction regime

NASA Astrophysics Data System (ADS)

Cook, Robert L.; Riofrío, Carlos A.; Deutsch, Ivan H.

2014-09-01

We study quantum tomography based on a stochastic continuous-time measurement record obtained from a probe field collectively interacting with an ensemble of identically prepared systems. In comparison to previous studies, we consider here the case in which the measurement-induced backaction has a non-negligible effect on the dynamical evolution of the ensemble. We formulate a maximum likelihood estimate for the initial quantum state given only a single instance of the continuous diffusive measurement record. We apply our estimator to the simplest problem: state tomography of a single pure qubit, which, during the course of the measurement, is also subjected to dynamical control. We identify a regime where the many-body system is well approximated at all times by a separable pure spin coherent state, whose Bloch vector undergoes a conditional stochastic evolution. We simulate the results of our estimator and show that we can achieve close to the upper bound of fidelity set by the optimal generalized measurement. This estimate is compared to, and significantly outperforms, an equivalent estimator that ignores measurement backaction.

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System.

PubMed

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-31

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System

NASA Astrophysics Data System (ADS)

Xu, Kebiao; Xie, Tianyu; Li, Zhaokai; Xu, Xiangkun; Wang, Mengqi; Ye, Xiangyu; Kong, Fei; Geng, Jianpei; Duan, Changkui; Shi, Fazhan; Du, Jiangfeng

2017-03-01

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian SzIz on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

Speculation on quantum mechanics and the operation of life giving catalysts.

PubMed

Haydon, Nathan; McGlynn, Shawn E; Robus, Olin

2011-02-01

The origin of life necessitated the formation of catalytic functionalities in order to realize a number of those capable of supporting reactions that led to the proliferation of biologically accessible molecules and the formation of a proto-metabolic network. Here, the discussion of the significance of quantum behavior on biological systems is extended from recent hypotheses exploring brain function and DNA mutation to include origins of life considerations in light of the concept of quantum decoherence and the transition from the quantum to the classical. Current understandings of quantum systems indicate that in the context of catalysis, substrate-catalyst interaction may be considered as a quantum measurement problem. Exploration of catalytic functionality necessary for life's emergence may have been accommodated by quantum searches within metal sulfide compartments, where catalyst and substrate wave function interaction may allow for quantum based searches of catalytic phase space. Considering the degree of entanglement experienced by catalytic and non catalytic outcomes of superimposed states, quantum contributions are postulated to have played an important role in the operation of efficient catalysts that would provide for the kinetic basis for the emergence of life.

Fault-tolerant, high-level quantum circuits: form, compilation and description

NASA Astrophysics Data System (ADS)

Paler, Alexandru; Polian, Ilia; Nemoto, Kae; Devitt, Simon J.

2017-06-01

Fault-tolerant quantum error correction is a necessity for any quantum architecture destined to tackle interesting, large-scale problems. Its theoretical formalism has been well founded for nearly two decades. However, we still do not have an appropriate compiler to produce a fault-tolerant, error-corrected description from a higher-level quantum circuit for state-of the-art hardware models. There are many technical hurdles, including dynamic circuit constructions that occur when constructing fault-tolerant circuits with commonly used error correcting codes. We introduce a package that converts high-level quantum circuits consisting of commonly used gates into a form employing all decompositions and ancillary protocols needed for fault-tolerant error correction. We call this form the (I)initialisation, (C)NOT, (M)measurement form (ICM) and consists of an initialisation layer of qubits into one of four distinct states, a massive, deterministic array of CNOT operations and a series of time-ordered X- or Z-basis measurements. The form allows a more flexible approach towards circuit optimisation. At the same time, the package outputs a standard circuit or a canonical geometric description which is a necessity for operating current state-of-the-art hardware architectures using topological quantum codes.

Near optimal discrimination of binary coherent signals via atom–light interaction

NASA Astrophysics Data System (ADS)

Han, Rui; Bergou, János A.; Leuchs, Gerd

2018-04-01

We study the discrimination of weak coherent states of light with significant overlaps by nondestructive measurements on the light states through measuring atomic states that are entangled to the coherent states via dipole coupling. In this way, the problem of measuring and discriminating coherent light states is shifted to finding the appropriate atom–light interaction and atomic measurements. We show that this scheme allows us to attain a probability of error extremely close to the Helstrom bound, the ultimate quantum limit for discriminating binary quantum states, through the simple Jaynes–Cummings interaction between the field and ancilla with optimized light–atom coupling and projective measurements on the atomic states. Moreover, since the measurement is nondestructive on the light state, information that is not detected by one measurement can be extracted from the post-measurement light states through subsequent measurements.

Multistate and multihypothesis discrimination with open quantum systems

NASA Astrophysics Data System (ADS)

Kiilerich, Alexander Holm; Mølmer, Klaus

2018-05-01

We show how an upper bound for the ability to discriminate any number N of candidates for the Hamiltonian governing the evolution of an open quantum system may be calculated by numerically efficient means. Our method applies an effective master-equation analysis to evaluate the pairwise overlaps between candidate full states of the system and its environment pertaining to the Hamiltonians. These overlaps are then used to construct an N -dimensional representation of the states. The optimal positive-operator valued measure (POVM) and the corresponding probability of assigning a false hypothesis may subsequently be evaluated by phrasing optimal discrimination of multiple nonorthogonal quantum states as a semidefinite programming problem. We provide three realistic examples of multihypothesis testing with open quantum systems.

Information security: from classical to quantum

NASA Astrophysics Data System (ADS)

Barnett, Stephen M.; Brougham, Thomas

2012-09-01

Quantum cryptography was designed to provide a new approach to the problem of distributing keys for private-key cryptography. The principal idea is that security can be ensured by exploiting the laws of quantum physics and, in particular, by the fact that any attempt to measure a quantum state will change it uncontrollably. This change can be detected by the legitimate users of the communication channel and so reveal to them the presence of an eavesdropper. In this paper I explain (briefly) how quantum key distribution works and some of the progress that has been made towards making this a viable technology. With the principles of quantum communication and quantum key distribution firmly established, it is perhaps time to consider how efficient it can be made. It is interesting to ask, in particular, how many bits of information might reasonably be encoded securely on each photon. The use of photons entangled in their time of arrival might make it possible to achieve data rates in excess of 10 bits per photon.

Experimental metaphysics2 : The double standard in the quantum-information approach to the foundations of quantum theory

NASA Astrophysics Data System (ADS)

Hagar, Amit

Among the alternatives of non-relativistic quantum mechanics (NRQM) there are those that give different predictions than quantum mechanics in yet-untested circumstances, while remaining compatible with current empirical findings. In order to test these predictions, one must isolate one's system from environmental induced decoherence, which, on the standard view of NRQM, is the dynamical mechanism that is responsible for the 'apparent' collapse in open quantum systems. But while recent advances in condensed-matter physics may lead in the near future to experimental setups that will allow one to test the two hypotheses, namely genuine collapse vs. decoherence, hence make progress toward a solution to the quantum measurement problem, those philosophers and physicists who are advocating an information-theoretic approach to the foundations of quantum mechanics are still unwilling to acknowledge the empirical character of the issue at stake. Here I argue that in doing so they are displaying an unwarranted double standard.

Witnessing eigenstates for quantum simulation of Hamiltonian spectra

PubMed Central

Santagati, Raffaele; Wang, Jianwei; Gentile, Antonio A.; Paesani, Stefano; Wiebe, Nathan; McClean, Jarrod R.; Morley-Short, Sam; Shadbolt, Peter J.; Bonneau, Damien; Silverstone, Joshua W.; Tew, David P.; Zhou, Xiaoqi; O’Brien, Jeremy L.; Thompson, Mark G.

2018-01-01

The efficient calculation of Hamiltonian spectra, a problem often intractable on classical machines, can find application in many fields, from physics to chemistry. We introduce the concept of an “eigenstate witness” and, through it, provide a new quantum approach that combines variational methods and phase estimation to approximate eigenvalues for both ground and excited states. This protocol is experimentally verified on a programmable silicon quantum photonic chip, a mass-manufacturable platform, which embeds entangled state generation, arbitrary controlled unitary operations, and projective measurements. Both ground and excited states are experimentally found with fidelities >99%, and their eigenvalues are estimated with 32 bits of precision. We also investigate and discuss the scalability of the approach and study its performance through numerical simulations of more complex Hamiltonians. This result shows promising progress toward quantum chemistry on quantum computers. PMID:29387796

The Uncertainty Principle in the Presence of Quantum Memory

NASA Astrophysics Data System (ADS)

Renes, Joseph M.; Berta, Mario; Christandl, Matthias; Colbeck, Roger; Renner, Renato

2010-03-01

One consequence of Heisenberg's uncertainty principle is that no observer can predict the outcomes of two incompatible measurements performed on a system to arbitrary precision. However, this implication is invalid if the the observer possesses a quantum memory, a distinct possibility in light of recent technological advances. Entanglement between the system and the memory is responsible for the breakdown of the uncertainty principle, as illustrated by the EPR paradox. In this work we present an improved uncertainty principle which takes this entanglement into account. By quantifying uncertainty using entropy, we show that the sum of the entropies associated with incompatible measurements must exceed a quantity which depends on the degree of incompatibility and the amount of entanglement between system and memory. Apart from its foundational significance, the uncertainty principle motivated the first proposals for quantum cryptography, though the possibility of an eavesdropper having a quantum memory rules out using the original version to argue that these proposals are secure. The uncertainty relation introduced here alleviates this problem and paves the way for its widespread use in quantum cryptography.

Quantum state sharing against the controller's cheating

NASA Astrophysics Data System (ADS)

Shi, Run-hua; Zhong, Hong; Huang, Liu-sheng

2013-08-01

Most existing QSTS schemes are equivalent to the controlled teleportation, in which a designated agent (i.e., the recoverer) can recover the teleported state with the help of the controllers. However, the controller may attempt to cheat the recoverer during the phase of recovering the secret state. How can we detect this cheating? In this paper, we considered the problem of detecting the controller's cheating in Quantum State Sharing, and further proposed an effective Quantum State Sharing scheme against the controller's cheating. We cleverly use Quantum Secret Sharing, Multiple Quantum States Sharing and decoy-particle techniques. In our scheme, via a previously shared entanglement state Alice can teleport multiple arbitrary multi-qubit states to Bob with the help of Charlie. Furthermore, by the classical information shared previously, Alice and Bob can check whether there is any cheating of Charlie. In addition, our scheme only needs to perform Bell-state and single-particle measurements, and to apply C-NOT gate and other single-particle unitary operations. With the present techniques, it is feasible to implement these necessary measurements and operations.

Inverse Bayesian inference as a key of consciousness featuring a macroscopic quantum logical structure.

PubMed

Gunji, Yukio-Pegio; Shinohara, Shuji; Haruna, Taichi; Basios, Vasileios

2017-02-01

To overcome the dualism between mind and matter and to implement consciousness in science, a physical entity has to be embedded with a measurement process. Although quantum mechanics have been regarded as a candidate for implementing consciousness, nature at its macroscopic level is inconsistent with quantum mechanics. We propose a measurement-oriented inference system comprising Bayesian and inverse Bayesian inferences. While Bayesian inference contracts probability space, the newly defined inverse one relaxes the space. These two inferences allow an agent to make a decision corresponding to an immediate change in their environment. They generate a particular pattern of joint probability for data and hypotheses, comprising multiple diagonal and noisy matrices. This is expressed as a nondistributive orthomodular lattice equivalent to quantum logic. We also show that an orthomodular lattice can reveal information generated by inverse syllogism as well as the solutions to the frame and symbol-grounding problems. Our model is the first to connect macroscopic cognitive processes with the mathematical structure of quantum mechanics with no additional assumptions. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

Statistical benchmark for BosonSampling

NASA Astrophysics Data System (ADS)

Walschaers, Mattia; Kuipers, Jack; Urbina, Juan-Diego; Mayer, Klaus; Tichy, Malte Christopher; Richter, Klaus; Buchleitner, Andreas

2016-03-01

Boson samplers—set-ups that generate complex many-particle output states through the transmission of elementary many-particle input states across a multitude of mutually coupled modes—promise the efficient quantum simulation of a classically intractable computational task, and challenge the extended Church-Turing thesis, one of the fundamental dogmas of computer science. However, as in all experimental quantum simulations of truly complex systems, one crucial problem remains: how to certify that a given experimental measurement record unambiguously results from enforcing the claimed dynamics, on bosons, fermions or distinguishable particles? Here we offer a statistical solution to the certification problem, identifying an unambiguous statistical signature of many-body quantum interference upon transmission across a multimode, random scattering device. We show that statistical analysis of only partial information on the output state allows to characterise the imparted dynamics through particle type-specific features of the emerging interference patterns. The relevant statistical quantifiers are classically computable, define a falsifiable benchmark for BosonSampling, and reveal distinctive features of many-particle quantum dynamics, which go much beyond mere bunching or anti-bunching effects.

Quantum Weak Values and Logic: An Uneasy Couple

NASA Astrophysics Data System (ADS)

Svensson, Bengt E. Y.

2017-03-01

Quantum mechanical weak values of projection operators have been used to answer which-way questions, e. g. to trace which arms in a multiple Mach-Zehnder setup a particle may have traversed from a given initial to a prescribed final state. I show that this procedure might lead to logical inconsistencies in the sense that different methods used to answer composite questions, like "Has the particle traversed the way X or the way Y?", may result in different answers depending on which methods are used to find the answer. I illustrate the problem by considering some examples: the "quantum pigeonhole" framework of Aharonov et al., the three-box problem, and Hardy's paradox. To prepare the ground for my main conclusion on the incompatibility in certain cases of weak values and logic, I study the corresponding situation for strong/projective measurements. In this case, no logical inconsistencies occur provided one is always careful in specifying exactly to which ensemble or sample space one refers. My results cast doubts on the utility of quantum weak values in treating cases like the examples mentioned.

Fundamental Study on Quantum Nanojets

DTIC Science & Technology

2004-08-01

Pergamon Press. Bell , J. S . 1966 On the problem of hidden variables in quantum mechanics. Rev. of Modern Phys., 38, 447. Berndl, K., Daumer, M...fluid dynamics based on two quantum mechanical perspectives; Schrödinger’s wave mechanics and quantum fluid dynamics based on Hamilton-Jacoby...References 8 2). Direct Problems a). Quantum fluid dynamics formalism based on Hamilton-Jacoby equation are adapted for the numerical

Algorithms Bridging Quantum Computation and Chemistry

NASA Astrophysics Data System (ADS)

McClean, Jarrod Ryan

The design of new materials and chemicals derived entirely from computation has long been a goal of computational chemistry, and the governing equation whose solution would permit this dream is known. Unfortunately, the exact solution to this equation has been far too expensive and clever approximations fail in critical situations. Quantum computers offer a novel solution to this problem. In this work, we develop not only new algorithms to use quantum computers to study hard problems in chemistry, but also explore how such algorithms can help us to better understand and improve our traditional approaches. In particular, we first introduce a new method, the variational quantum eigensolver, which is designed to maximally utilize the quantum resources available in a device to solve chemical problems. We apply this method in a real quantum photonic device in the lab to study the dissociation of the helium hydride (HeH+) molecule. We also enhance this methodology with architecture specific optimizations on ion trap computers and show how linear-scaling techniques from traditional quantum chemistry can be used to improve the outlook of similar algorithms on quantum computers. We then show how studying quantum algorithms such as these can be used to understand and enhance the development of classical algorithms. In particular we use a tool from adiabatic quantum computation, Feynman's Clock, to develop a new discrete time variational principle and further establish a connection between real-time quantum dynamics and ground state eigenvalue problems. We use these tools to develop two novel parallel-in-time quantum algorithms that outperform competitive algorithms as well as offer new insights into the connection between the fermion sign problem of ground states and the dynamical sign problem of quantum dynamics. Finally we use insights gained in the study of quantum circuits to explore a general notion of sparsity in many-body quantum systems. In particular we use developments from the field of compressed sensing to find compact representations of ground states. As an application we study electronic systems and find solutions dramatically more compact than traditional configuration interaction expansions, offering hope to extend this methodology to challenging systems in chemical and material design.

Investigations of quantum heuristics for optimization

NASA Astrophysics Data System (ADS)

Rieffel, Eleanor; Hadfield, Stuart; Jiang, Zhang; Mandra, Salvatore; Venturelli, Davide; Wang, Zhihui

We explore the design of quantum heuristics for optimization, focusing on the quantum approximate optimization algorithm, a metaheuristic developed by Farhi, Goldstone, and Gutmann. We develop specific instantiations of the of quantum approximate optimization algorithm for a variety of challenging combinatorial optimization problems. Through theoretical analyses and numeric investigations of select problems, we provide insight into parameter setting and Hamiltonian design for quantum approximate optimization algorithms and related quantum heuristics, and into their implementation on hardware realizable in the near term.

Analysis of entanglement measures and LOCC maximized quantum Fisher information of general two qubit systems.

PubMed

Erol, Volkan; Ozaydin, Fatih; Altintas, Azmi Ali

2014-06-24

Entanglement has been studied extensively for unveiling the mysteries of non-classical correlations between quantum systems. In the bipartite case, there are well known measures for quantifying entanglement such as concurrence, relative entropy of entanglement (REE) and negativity, which cannot be increased via local operations. It was found that for sets of non-maximally entangled states of two qubits, comparing these entanglement measures may lead to different entanglement orderings of the states. On the other hand, although it is not an entanglement measure and not monotonic under local operations, due to its ability of detecting multipartite entanglement, quantum Fisher information (QFI) has recently received an intense attraction generally with entanglement in the focus. In this work, we revisit the state ordering problem of general two qubit states. Generating a thousand random quantum states and performing an optimization based on local general rotations of each qubit, we calculate the maximal QFI for each state. We analyze the maximized QFI in comparison with concurrence, REE and negativity and obtain new state orderings. We show that there are pairs of states having equal maximized QFI but different values for concurrence, REE and negativity and vice versa.

Analysis of Entanglement Measures and LOCC Maximized Quantum Fisher Information of General Two Qubit Systems

PubMed Central

Erol, Volkan; Ozaydin, Fatih; Altintas, Azmi Ali

2014-01-01

Entanglement has been studied extensively for unveiling the mysteries of non-classical correlations between quantum systems. In the bipartite case, there are well known measures for quantifying entanglement such as concurrence, relative entropy of entanglement (REE) and negativity, which cannot be increased via local operations. It was found that for sets of non-maximally entangled states of two qubits, comparing these entanglement measures may lead to different entanglement orderings of the states. On the other hand, although it is not an entanglement measure and not monotonic under local operations, due to its ability of detecting multipartite entanglement, quantum Fisher information (QFI) has recently received an intense attraction generally with entanglement in the focus. In this work, we revisit the state ordering problem of general two qubit states. Generating a thousand random quantum states and performing an optimization based on local general rotations of each qubit, we calculate the maximal QFI for each state. We analyze the maximized QFI in comparison with concurrence, REE and negativity and obtain new state orderings. We show that there are pairs of states having equal maximized QFI but different values for concurrence, REE and negativity and vice versa. PMID:24957694

Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance

PubMed Central

Li, Zhaokai; Yung, Man-Hong; Chen, Hongwei; Lu, Dawei; Whitfield, James D.; Peng, Xinhua; Aspuru-Guzik, Alán; Du, Jiangfeng

2011-01-01

Quantum ground-state problems are computationally hard problems for general many-body Hamiltonians; there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state problem of the Heisenberg spin model with an NMR quantum simulator. Our iterative phase estimation procedure yields a high accuracy for the eigenenergies (to the 10−5 decimal digit). The ground-state fidelity was distilled to be more than 80%, and the singlet-to-triplet switching near the critical field is reliably captured. This result shows that quantum simulators can better leverage classical trial wave functions than classical computers PMID:22355607

Boosting quantum annealer performance via sample persistence

NASA Astrophysics Data System (ADS)

Karimi, Hamed; Rosenberg, Gili

2017-07-01

We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer (or any sampler) to fix the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are usually much easier for the quantum annealer to solve, due to their being smaller and consisting of disconnected components. This approach significantly increases the success rate and number of observations of the best known energy value in samples obtained from the quantum annealer, when compared with calling the quantum annealer without using it, even when using fewer annealing cycles. Use of the method results in a considerable improvement in success metrics even for problems with high-precision couplers and biases, which are more challenging for the quantum annealer to solve. The results are further enhanced by applying the method iteratively and combining it with classical pre-processing. We present results for both Chimera graph-structured problems and embedded problems from a real-world application.

Elucidating Reaction Mechanisms on Quantum Computers

NASA Astrophysics Data System (ADS)

Wiebe, Nathan; Reiher, Markus; Svore, Krysta; Wecker, Dave; Troyer, Matthias

We show how a quantum computer can be employed to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical-computer simulations for such problems, to significantly increase their accuracy and enable hitherto intractable simulations. Detailed resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. This demonstrates that quantum computers will realistically be able to tackle important problems in chemistry that are both scientifically and economically significant.

Quantum speedup of the traveling-salesman problem for bounded-degree graphs

NASA Astrophysics Data System (ADS)

Moylett, Dominic J.; Linden, Noah; Montanaro, Ashley

2017-03-01

The traveling-salesman problem is one of the most famous problems in graph theory. However, little is currently known about the extent to which quantum computers could speed up algorithms for the problem. In this paper, we prove a quadratic quantum speedup when the degree of each vertex is at most 3 by applying a quantum backtracking algorithm to a classical algorithm by Xiao and Nagamochi. We then use similar techniques to accelerate a classical algorithm for when the degree of each vertex is at most 4, before speeding up higher-degree graphs via reductions to these instances.

DOE pushes for useful quantum computing

NASA Astrophysics Data System (ADS)

Cho, Adrian

2018-01-01

The U.S. Department of Energy (DOE) is joining the quest to develop quantum computers, devices that would exploit quantum mechanics to crack problems that overwhelm conventional computers. The initiative comes as Google and other companies race to build a quantum computer that can demonstrate "quantum supremacy" by beating classical computers on a test problem. But reaching that milestone will not mean practical uses are at hand, and the new $40 million DOE effort is intended to spur the development of useful quantum computing algorithms for its work in chemistry, materials science, nuclear physics, and particle physics. With the resources at its 17 national laboratories, DOE could play a key role in developing the machines, researchers say, although finding problems with which quantum computers can help isn't so easy.

Truth Values of Quantum Phenomena

NASA Astrophysics Data System (ADS)

Bolotin, Arkady

2018-04-01

In the paper, the idea of describing not-yet-verified properties of quantum objects with logical many-valuedness is scrutinized. As it is argued, to promote such an idea, the following two foundational problems of many-valued quantum logic must be decided: the problem of choosing a proper system of many-valued logic and the problem of the emergence of bivalence from logical many-valuedness. Difficulties accompanying solutions of these problems are discussed.

Experimental characterization of a quantum many-body system via higher-order correlations.

PubMed

Schweigler, Thomas; Kasper, Valentin; Erne, Sebastian; Mazets, Igor; Rauer, Bernhard; Cataldini, Federica; Langen, Tim; Gasenzer, Thomas; Berges, Jürgen; Schmiedmayer, Jörg

2017-05-17

Quantum systems can be characterized by their correlations. Higher-order (larger than second order) correlations, and the ways in which they can be decomposed into correlations of lower order, provide important information about the system, its structure, its interactions and its complexity. The measurement of such correlation functions is therefore an essential tool for reading, verifying and characterizing quantum simulations. Although higher-order correlation functions are frequently used in theoretical calculations, so far mainly correlations up to second order have been studied experimentally. Here we study a pair of tunnel-coupled one-dimensional atomic superfluids and characterize the corresponding quantum many-body problem by measuring correlation functions. We extract phase correlation functions up to tenth order from interference patterns and analyse whether, and under what conditions, these functions factorize into correlations of lower order. This analysis characterizes the essential features of our system, the relevant quasiparticles, their interactions and topologically distinct vacua. From our data we conclude that in thermal equilibrium our system can be seen as a quantum simulator of the sine-Gordon model, relevant for diverse disciplines ranging from particle physics to condensed matter. The measurement and evaluation of higher-order correlation functions can easily be generalized to other systems and to study correlations of any other observable such as density, spin and magnetization. It therefore represents a general method for analysing quantum many-body systems from experimental data.

Quantum cryptography as a retrodiction problem.

PubMed

Werner, A H; Franz, T; Werner, R F

2009-11-27

We propose a quantum key distribution protocol based on a quantum retrodiction protocol, known as the Mean King problem. The protocol uses a two way quantum channel. We show security against coherent attacks in a transmission-error free scenario, even if Eve is allowed to attack both transmissions. This establishes a connection between retrodiction and key distribution.

Parameter estimation of qubit states with unknown phase parameter

NASA Astrophysics Data System (ADS)

Suzuki, Jun

2015-02-01

We discuss a problem of parameter estimation for quantum two-level system, qubit system, in presence of unknown phase parameter. We analyze trade-off relations for mean square errors (MSEs) when estimating relevant parameters with separable measurements based on known precision bounds; the symmetric logarithmic derivative (SLD) Cramér-Rao (CR) bound and Hayashi-Gill-Massar (HGM) bound. We investigate the optimal measurement which attains the HGM bound and discuss its properties. We show that the HGM bound for relevant parameters can be attained asymptotically by using some fraction of given n quantum states to estimate the phase parameter. We also discuss the Holevo bound which can be attained asymptotically by a collective measurement.

Solving quantum optimal control problems using Clebsch variables and Lin constraints

NASA Astrophysics Data System (ADS)

Delgado-Téllez, M.; Ibort, A.; Rodríguez de la Peña, T.

2018-01-01

Clebsch variables (and Lin constraints) are applied to the study of a class of optimal control problems for affine-controlled quantum systems. The optimal control problem will be modelled with controls defined on an auxiliary space where the dynamical group of the system acts freely. The reciprocity between both theories: the classical theory defined by the objective functional and the quantum system, is established by using a suitable version of Lagrange’s multipliers theorem and a geometrical interpretation of the constraints of the system as defining a subspace of horizontal curves in an associated bundle. It is shown how the solutions of the variational problem defined by the objective functional determine solutions of the quantum problem. Then a new way of obtaining explicit solutions for a family of optimal control problems for affine-controlled quantum systems (finite or infinite dimensional) is obtained. One of its main advantages, is the the use of Clebsch variables allows to compute such solutions from solutions of invariant problems that can often be computed explicitly. This procedure can be presented as an algorithm that can be applied to a large class of systems. Finally, some simple examples, spin control, a simple quantum Hamiltonian with an ‘Elroy beanie’ type classical model and a controlled one-dimensional quantum harmonic oscillator, illustrating the main features of the theory, will be discussed.

Compiling quantum circuits to realistic hardware architectures using temporal planners

NASA Astrophysics Data System (ADS)

Venturelli, Davide; Do, Minh; Rieffel, Eleanor; Frank, Jeremy

2018-04-01

To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with only limited means to mitigate decoherence, it is critical to minimize the duration of the circuit. We investigate the application of temporal planners to the problem of compiling quantum circuits to newly emerging quantum hardware. While our approach is general, we focus on compiling to superconducting hardware architectures with nearest neighbor constraints. Our initial experiments focus on compiling Quantum Alternating Operator Ansatz (QAOA) circuits whose high number of commuting gates allow great flexibility in the order in which the gates can be applied. That freedom makes it more challenging to find optimal compilations but also means there is a greater potential win from more optimized compilation than for less flexible circuits. We map this quantum circuit compilation problem to a temporal planning problem, and generated a test suite of compilation problems for QAOA circuits of various sizes to a realistic hardware architecture. We report compilation results from several state-of-the-art temporal planners on this test set. This early empirical evaluation demonstrates that temporal planning is a viable approach to quantum circuit compilation.

Exploring the quantum speed limit with computer games

NASA Astrophysics Data System (ADS)

Sørensen, Jens Jakob W. H.; Pedersen, Mads Kock; Munch, Michael; Haikka, Pinja; Jensen, Jesper Halkjær; Planke, Tilo; Andreasen, Morten Ginnerup; Gajdacz, Miroslav; Mølmer, Klaus; Lieberoth, Andreas; Sherson, Jacob F.

2016-04-01

Humans routinely solve problems of immense computational complexity by intuitively forming simple, low-dimensional heuristic strategies. Citizen science (or crowd sourcing) is a way of exploiting this ability by presenting scientific research problems to non-experts. ‘Gamification’—the application of game elements in a non-game context—is an effective tool with which to enable citizen scientists to provide solutions to research problems. The citizen science games Foldit, EteRNA and EyeWire have been used successfully to study protein and RNA folding and neuron mapping, but so far gamification has not been applied to problems in quantum physics. Here we report on Quantum Moves, an online platform gamifying optimization problems in quantum physics. We show that human players are able to find solutions to difficult problems associated with the task of quantum computing. Players succeed where purely numerical optimization fails, and analyses of their solutions provide insights into the problem of optimization of a more profound and general nature. Using player strategies, we have thus developed a few-parameter heuristic optimization method that efficiently outperforms the most prominent established numerical methods. The numerical complexity associated with time-optimal solutions increases for shorter process durations. To understand this better, we produced a low-dimensional rendering of the optimization landscape. This rendering reveals why traditional optimization methods fail near the quantum speed limit (that is, the shortest process duration with perfect fidelity). Combined analyses of optimization landscapes and heuristic solution strategies may benefit wider classes of optimization problems in quantum physics and beyond.

Exploring the quantum speed limit with computer games.

PubMed

Sørensen, Jens Jakob W H; Pedersen, Mads Kock; Munch, Michael; Haikka, Pinja; Jensen, Jesper Halkjær; Planke, Tilo; Andreasen, Morten Ginnerup; Gajdacz, Miroslav; Mølmer, Klaus; Lieberoth, Andreas; Sherson, Jacob F

2016-04-14

Humans routinely solve problems of immense computational complexity by intuitively forming simple, low-dimensional heuristic strategies. Citizen science (or crowd sourcing) is a way of exploiting this ability by presenting scientific research problems to non-experts. 'Gamification'--the application of game elements in a non-game context--is an effective tool with which to enable citizen scientists to provide solutions to research problems. The citizen science games Foldit, EteRNA and EyeWire have been used successfully to study protein and RNA folding and neuron mapping, but so far gamification has not been applied to problems in quantum physics. Here we report on Quantum Moves, an online platform gamifying optimization problems in quantum physics. We show that human players are able to find solutions to difficult problems associated with the task of quantum computing. Players succeed where purely numerical optimization fails, and analyses of their solutions provide insights into the problem of optimization of a more profound and general nature. Using player strategies, we have thus developed a few-parameter heuristic optimization method that efficiently outperforms the most prominent established numerical methods. The numerical complexity associated with time-optimal solutions increases for shorter process durations. To understand this better, we produced a low-dimensional rendering of the optimization landscape. This rendering reveals why traditional optimization methods fail near the quantum speed limit (that is, the shortest process duration with perfect fidelity). Combined analyses of optimization landscapes and heuristic solution strategies may benefit wider classes of optimization problems in quantum physics and beyond.

Discrete-to-continuous transition in quantum phase estimation

NASA Astrophysics Data System (ADS)

Rządkowski, Wojciech; Demkowicz-Dobrzański, Rafał

2017-09-01

We analyze the problem of quantum phase estimation in which the set of allowed phases forms a discrete N -element subset of the whole [0 ,2 π ] interval, φn=2 π n /N , n =0 ,⋯,N -1 , and study the discrete-to-continuous transition N →∞ for various cost functions as well as the mutual information. We also analyze the relation between the problems of phase discrimination and estimation by considering a step cost function of a given width σ around the true estimated value. We show that in general a direct application of the theory of covariant measurements for a discrete subgroup of the U(1 ) group leads to suboptimal strategies due to an implicit requirement of estimating only the phases that appear in the prior distribution. We develop the theory of subcovariant measurements to remedy this situation and demonstrate truly optimal estimation strategies when performing a transition from discrete to continuous phase estimation.

Quantum issues in optical communication. [noise reduction in signal reception

NASA Technical Reports Server (NTRS)

Kennedy, R. S.

1973-01-01

Various approaches to the problem of controlling quantum noise, the dominant noise in an optical communications system, are discussed. It is shown that, no matter which way the problem is approached, there always remain uncertainties. These uncertainties exist because, to date, only very few communication problems have been solved in their full quantum form.

Quantum adiabatic machine learning

NASA Astrophysics Data System (ADS)

Pudenz, Kristen L.; Lidar, Daniel A.

2013-05-01

We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. This approach consists of two quantum phases, with some amount of classical preprocessing to set up the quantum problems. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we adiabatically evolve one or more strong classifiers on a superposition of inputs in order to find certain anomalous elements in the classification space. Both the training and testing phases are executed via quantum adiabatic evolution. All quantum processing is strictly limited to two-qubit interactions so as to ensure physical feasibility. We apply and illustrate this approach in detail to the problem of software verification and validation, with a specific example of the learning phase applied to a problem of interest in flight control systems. Beyond this example, the algorithm can be used to attack a broad class of anomaly detection problems.

Development of a unique laboratory standard: Indium gallium arsenide detector for the 500-1700 nm spectral region

NASA Technical Reports Server (NTRS)

1987-01-01

A planar (5 mm diameter) indium gallium arsenide detector having a high (greater than 50 pct) quantum efficiency from the visible into the infrared spectrum (500 to 1700 nm) was fabricated. Quantum efficiencies as high as 37 pct at 510 nm, 58 pct at 820 nm and 62 pct at 1300 nm and 1550 nm were measured. A planar InP/InGaAs detector structure was also fabricated using vapor phase epitaxy to grow device structures with 0, 0.2, 0.4 and 0.6 micrometer thick InP caps. Quantum efficiency was studied as a function of cap thickness. Conventional detector structures were also used by completely etching off the InP cap after zinc diffusion. Calibrated quantum efficiencies were measured. Best results were obtained with devices whose caps were completely removed by etching. Certain problems still remain with these detectors including non-uniform shunt resistance, reproducibility, contact resistance and narrow band anti-reflection coatings.

Almost all quantum channels are equidistant

NASA Astrophysics Data System (ADS)

Nechita, Ion; Puchała, Zbigniew; Pawela, Łukasz; Życzkowski, Karol

2018-05-01

In this work, we analyze properties of generic quantum channels in the case of large system size. We use random matrix theory and free probability to show that the distance between two independent random channels converges to a constant value as the dimension of the system grows larger. As a measure of the distance we use the diamond norm. In the case of a flat Hilbert-Schmidt distribution on quantum channels, we obtain that the distance converges to 1/2 +2/π , giving also an estimate for the maximum success probability for distinguishing the channels. We also consider the problem of distinguishing two random unitary rotations.

Three-party quantum secure direct communication against collective noise

NASA Astrophysics Data System (ADS)

He, Ye-Feng; Ma, Wen-Ping

2017-10-01

Based on logical quantum states, two three-party quantum secure direct communication protocols are proposed, which can realize the exchange of the secret messages between three parties with the help of the measurement correlation property of six-particle entangled states. These two protocols can be immune to the collective-dephasing noise and the collective-rotation noise, respectively; neither of them has information leakage problem. The one-way transmission mode ensures that they can congenitally resist against the Trojan horse attacks and the teleportation attack. Furthermore, these two protocols are secure against other active attacks because of the use of the decoy state technology.

An implementation problem for boson fields and quantum Girsanov transform

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ji, Un Cig, E-mail: uncigji@chungbuk.ac.kr; Obata, Nobuaki, E-mail: obata@math.is.tohoku.ac.jp

2016-08-15

We study an implementation problem for quadratic functions of annihilation and creation operators on a boson field in terms of quantum white noise calculus. The implementation problem is shown to be equivalent to a linear differential equation for white noise operators containing quantum white noise derivatives. The solution is explicitly obtained and turns out to form a class of white noise operators including generalized Fourier–Gauss and Fourier–Mehler transforms, Bogoliubov transform, and a quantum extension of the Girsanov transform.

Portfolios of quantum algorithms.

PubMed

Maurer, S M; Hogg, T; Huberman, B A

2001-12-17

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can find the solution of hard problems only probabilistically. Thus the efficiency of the algorithms has to be characterized by both the expected time to completion and the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-satisfiability.

Optimal control of hybrid qubits: Implementing the quantum permutation algorithm

NASA Astrophysics Data System (ADS)

Rivera-Ruiz, C. M.; de Lima, E. F.; Fanchini, F. F.; Lopez-Richard, V.; Castelano, L. K.

2018-03-01

The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with a fidelity higher than 0.9997, when noise is not taken into account. Particularly, these quantum gates were chosen to perform the permutation algorithm in hybrid qubits in double quantum dots (DQDs). The permutation algorithm is an oracle based quantum algorithm that solves the problem of the permutation parity faster than a classical algorithm without the necessity of entanglement between particles. The only requirement for achieving the speedup is the use of a one-particle quantum system with at least three levels. The high fidelity found in our results is closely related to the quantum speed limit, which is a measure of how fast a quantum state can be manipulated. Furthermore, we model charge noise by considering an average over the optimal field centered at different values of the reference detuning, which follows a Gaussian distribution. When the Gaussian spread is of the order of 5 μ eV (10% of the correct value), the fidelity is still higher than 0.95. Our scheme also can be used for the practical realization of different quantum algorithms in DQDs.

Quantum learning of classical stochastic processes: The completely positive realization problem

NASA Astrophysics Data System (ADS)

Monràs, Alex; Winter, Andreas

2016-01-01

Among several tasks in Machine Learning, a specially important one is the problem of inferring the latent variables of a system and their causal relations with the observed behavior. A paradigmatic instance of this is the task of inferring the hidden Markov model underlying a given stochastic process. This is known as the positive realization problem (PRP), [L. Benvenuti and L. Farina, IEEE Trans. Autom. Control 49(5), 651-664 (2004)] and constitutes a central problem in machine learning. The PRP and its solutions have far-reaching consequences in many areas of systems and control theory, and is nowadays an important piece in the broad field of positive systems theory. We consider the scenario where the latent variables are quantum (i.e., quantum states of a finite-dimensional system) and the system dynamics is constrained only by physical transformations on the quantum system. The observable dynamics is then described by a quantum instrument, and the task is to determine which quantum instrument — if any — yields the process at hand by iterative application. We take as a starting point the theory of quasi-realizations, whence a description of the dynamics of the process is given in terms of linear maps on state vectors and probabilities are given by linear functionals on the state vectors. This description, despite its remarkable resemblance with the hidden Markov model, or the iterated quantum instrument, is however devoid of any stochastic or quantum mechanical interpretation, as said maps fail to satisfy any positivity conditions. The completely positive realization problem then consists in determining whether an equivalent quantum mechanical description of the same process exists. We generalize some key results of stochastic realization theory, and show that the problem has deep connections with operator systems theory, giving possible insight to the lifting problem in quotient operator systems. Our results have potential applications in quantum machine learning, device-independent characterization and reverse-engineering of stochastic processes and quantum processors, and more generally, of dynamical processes with quantum memory [M. Guţă, Phys. Rev. A 83(6), 062324 (2011); M. Guţă and N. Yamamoto, e-print arXiv:1303.3771(2013)].

Chance and time: Cutting the Gordian knot

NASA Astrophysics Data System (ADS)

Hagar, Amit

One of the recurrent problems in the foundations of physics is to explain why we rarely observe certain phenomena that are allowed by our theories and laws. In thermodynamics, for example, the spontaneous approach towards equilibrium is ubiquitous yet the time-reversal-invariant laws that presumably govern thermal behaviour in the microscopic level equally allow spontaneous approach away from equilibrium to occur. Why are the former processes frequently observed while the latter are almost never reported? Another example comes from quantum mechanics where the formalism, if considered complete and universally applicable, predicts the existence of macroscopic superpositions---monstrous Schrodinger cats---and these are never observed: while electrons and atoms enjoy the cloudiness of waves, macroscopic objects are always localized to definite positions. A well-known explanatory framework due to Ludwig Boltzmann traces the rarity of "abnormal" thermodynamic phenomena to the scarcity of the initial conditions that lead to it. After all, physical laws are no more than algorithms and these are expected to generate different results according to different initial conditions, hence Boltzmann's insight that violations of thermodynamic laws are possible but highly improbable. Yet Boltzmann introduces probabilities into this explanatory scheme, and since the latter is couched in terms of classical mechanics, these probabilities must be interpreted as a result of ignorance of the exact state the system is in. Quantum mechanics has taught us otherwise. Here the attempts to explain why we never observe macroscopic superpositions have led to different interpretations of the formalism and to different solutions to the quantum measurement problem. These solutions introduce additional interpretations to the meaning of probability over and above ignorance of the definite state of the physical system: quantum probabilities may result from pure chance. Notwithstanding the success of the Boltzmannian framework in explaining the thermodynamic arrow in time it leaves us with a foundational puzzle: how can ignorance play a role in scientific explanation of objective reality? In turns out that two opposing solutions to the quantum measurement problem in which probabilities arise from the stochastic character of the underlying dynamics may scratch this explanatory itch. By offering a dynamical justification to the probabilities employed in classical statistical mechanics these two interpretations complete the Boltzmannian explanatory scheme and allow us to exorcize ignorance from scientific explanations of unobserved phenomena. In this thesis I argue that the puzzle of the thermodynamic arrow in time is closely related to the problem of interpreting quantum mechanics, i.e., to the measurement problem. We may solve one by fiat and thus solve the other, but it seems unwise to try solving them independently. I substantiate this claim by presenting two possible interpretations to non-relativistic quantum mechanics. Differing as they do on the meaning of the probabilities they introduce into the otherwise deterministic dynamics, these interpretations offer alternative explanatory schemes to the standard Boltzmannian statistical mechanical explanation of thermodynamic approach to equilibrium. I then show how notwithstanding their current empirical equivalence, the two approaches diverge at the continental divide between scientific realism and anti-realism.

Quantum speedup in solving the maximal-clique problem

NASA Astrophysics Data System (ADS)

Chang, Weng-Long; Yu, Qi; Li, Zhaokai; Chen, Jiahui; Peng, Xinhua; Feng, Mang

2018-03-01

The maximal-clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, and bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal-clique problem for any graph G with n vertices with quadratic speedup over its classical counterparts, where the time and spatial complexities are reduced to, respectively, O (√{2n}) and O (n2) . With respect to oracle-related quantum algorithms for the NP-complete problems, we identify our algorithm as optimal. To justify the feasibility of the proposed quantum algorithm, we successfully solve a typical clique problem for a graph G with two vertices and one edge by carrying out a nuclear magnetic resonance experiment involving four qubits.

Phase operator problem and macroscopic extension of quantum mechanics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ozawa, M.

1997-06-01

To find the Hermitian phase operator of a single-mode electromagnetic field in quantum mechanics, the Schr{umlt o}dinger representation is extended to a larger Hilbert space augmented by states with infinite excitation by nonstandard analysis. The Hermitian phase operator is shown to exist on the extended Hilbert space. This operator is naturally considered as the controversial limit of the approximate phase operators on finite dimensional spaces proposed by Pegg and Barnett. The spectral measure of this operator is a Naimark extension of the optimal probability operator-valued measure for the phase parameter found by Helstrom. Eventually, the two promising approaches to themore » statistics of the phase in quantum mechanics are synthesized by means of the Hermitian phase operator in the macroscopic extension of the Schr{umlt o}dinger representation. {copyright} 1997 Academic Press, Inc.« less

A synchronous game for binary constraint systems

NASA Astrophysics Data System (ADS)

Kim, Se-Jin; Paulsen, Vern; Schafhauser, Christopher

2018-03-01

Recently, Slofstra proved that the set of quantum correlations is not closed. We prove that the set of synchronous quantum correlations is not closed, which implies his result, by giving an example of a synchronous game that has a perfect quantum approximate strategy but no perfect quantum strategy. We also exhibit a graph for which the quantum independence number and the quantum approximate independence number are different. We prove new characterisations of synchronous quantum approximate correlations and synchronous quantum spatial correlations. We solve the synchronous approximation problem of Dykema and the second author, which yields a new equivalence of Connes' embedding problem in terms of synchronous correlations.

Instantons in Quantum Annealing: Thermally Assisted Tunneling Vs Quantum Monte Carlo Simulations

NASA Technical Reports Server (NTRS)

Jiang, Zhang; Smelyanskiy, Vadim N.; Boixo, Sergio; Isakov, Sergei V.; Neven, Hartmut; Mazzola, Guglielmo; Troyer, Matthias

2015-01-01

Recent numerical result (arXiv:1512.02206) from Google suggested that the D-Wave quantum annealer may have an asymptotic speed-up than simulated annealing, however, the asymptotic advantage disappears when it is compared to quantum Monte Carlo (a classical algorithm despite its name). We show analytically that the asymptotic scaling of quantum tunneling is exactly the same as the escape rate in quantum Monte Carlo for a class of problems. Thus, the Google result might be explained in our framework. We also found that the transition state in quantum Monte Carlo corresponds to the instanton solution in quantum tunneling problems, which is observed in numerical simulations.

Programming and Tuning a Quantum Annealing Device to Solve Real World Problems

NASA Astrophysics Data System (ADS)

Perdomo-Ortiz, Alejandro; O'Gorman, Bryan; Fluegemann, Joseph; Smelyanskiy, Vadim

2015-03-01

Solving real-world applications with quantum algorithms requires overcoming several challenges, ranging from translating the computational problem at hand to the quantum-machine language to tuning parameters of the quantum algorithm that have a significant impact on the performance of the device. In this talk, we discuss these challenges, strategies developed to enhance performance, and also a more efficient implementation of several applications. Although we will focus on applications of interest to NASA's Quantum Artificial Intelligence Laboratory, the methods and concepts presented here apply to a broader family of hard discrete optimization problems, including those that occur in many machine-learning algorithms.

Experimental demonstration of a quantum annealing algorithm for the traveling salesman problem in a nuclear-magnetic-resonance quantum simulator

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen Hongwei; High Magnetic Field Laboratory, Hefei Institutes of Physical Science, Chinese Academy of Sciences, Hefei 230031; Kong Xi

The method of quantum annealing (QA) is a promising way for solving many optimization problems in both classical and quantum information theory. The main advantage of this approach, compared with the gate model, is the robustness of the operations against errors originated from both external controls and the environment. In this work, we succeed in demonstrating experimentally an application of the method of QA to a simplified version of the traveling salesman problem by simulating the corresponding Schroedinger evolution with a NMR quantum simulator. The experimental results unambiguously yielded the optimal traveling route, in good agreement with the theoretical prediction.

Boolean approach to dichotomic quantum measurement theories

NASA Astrophysics Data System (ADS)

Nagata, K.; Nakamura, T.; Batle, J.; Abdalla, S.; Farouk, A.

2017-02-01

Recently, a new measurement theory based on truth values was proposed by Nagata and Nakamura [Int. J. Theor. Phys. 55, 3616 (2016)], that is, a theory where the results of measurements are either 0 or 1. The standard measurement theory accepts a hidden variable model for a single Pauli observable. Hence, we can introduce a classical probability space for the measurement theory in this particular case. Additionally, we discuss in the present contribution the fact that projective measurement theories (the results of which are either +1 or -1) imply the Bell, Kochen, and Specker (BKS) paradox for a single Pauli observable. To justify our assertion, we present the BKS theorem in almost all the two-dimensional states by using a projective measurement theory. As an example, we present the BKS theorem in two-dimensions with white noise. Our discussion provides new insight into the quantum measurement problem by using this measurement theory based on the truth values.

Synthesis of Bi2S3 quantum dots for sensitized solar cells by reverse SILAR

NASA Astrophysics Data System (ADS)

Singh, Navjot; Sharma, J.; Tripathi, S. K.

2016-05-01

Quantum Dot Sensitized Solar cells (QDSSC) have great potential to replace silicon-based solar cells. Quantum dots of various materials and sizes could be used to convert most of the visible light into the electrical current. This paper put emphasis on the synthesis of Bismuth Sulphide quantum dots and selectivity of the anionic precursor by Successive Ionic Layer Adsorption Reaction (SILAR). Bismuth Sulfide (Bi2S3) (group V - Vi semiconductor) is strong contestant for cadmium free solar cells due to its optimum band gap for light harvesting. Optical, structural and electrical measurements are reported and discussed. Problem regarding the choice of precursor for anion extraction is discussed. Band gap of the synthesized quantum dots is 1.2 eV which does not match with the required energy band gap of bismuth sulfide that is 1.7eV.

Local quantum thermal susceptibility

PubMed Central

De Pasquale, Antonella; Rossini, Davide; Fazio, Rosario; Giovannetti, Vittorio

2016-01-01

Thermodynamics relies on the possibility to describe systems composed of a large number of constituents in terms of few macroscopic variables. Its foundations are rooted into the paradigm of statistical mechanics, where thermal properties originate from averaging procedures which smoothen out local details. While undoubtedly successful, elegant and formally correct, this approach carries over an operational problem, namely determining the precision at which such variables are inferred, when technical/practical limitations restrict our capabilities to local probing. Here we introduce the local quantum thermal susceptibility, a quantifier for the best achievable accuracy for temperature estimation via local measurements. Our method relies on basic concepts of quantum estimation theory, providing an operative strategy to address the local thermal response of arbitrary quantum systems at equilibrium. At low temperatures, it highlights the local distinguishability of the ground state from the excited sub-manifolds, thus providing a method to locate quantum phase transitions. PMID:27681458

Local quantum thermal susceptibility

NASA Astrophysics Data System (ADS)

de Pasquale, Antonella; Rossini, Davide; Fazio, Rosario; Giovannetti, Vittorio

2016-09-01

Thermodynamics relies on the possibility to describe systems composed of a large number of constituents in terms of few macroscopic variables. Its foundations are rooted into the paradigm of statistical mechanics, where thermal properties originate from averaging procedures which smoothen out local details. While undoubtedly successful, elegant and formally correct, this approach carries over an operational problem, namely determining the precision at which such variables are inferred, when technical/practical limitations restrict our capabilities to local probing. Here we introduce the local quantum thermal susceptibility, a quantifier for the best achievable accuracy for temperature estimation via local measurements. Our method relies on basic concepts of quantum estimation theory, providing an operative strategy to address the local thermal response of arbitrary quantum systems at equilibrium. At low temperatures, it highlights the local distinguishability of the ground state from the excited sub-manifolds, thus providing a method to locate quantum phase transitions.

Quantum control on entangled bipartite qubits

DOE Office of Scientific and Technical Information (OSTI.GOV)

Delgado, Francisco

2010-04-15

Ising interactions between qubits can produce distortion on entangled pairs generated for engineering purposes (e.g., for quantum computation or quantum cryptography). The presence of parasite magnetic fields destroys or alters the expected behavior for which it was intended. In addition, these pairs are generated with some dispersion in their original configuration, so their discrimination is necessary for applications. Nevertheless, discrimination should be made after Ising distortion. Quantum control helps in both problems; making some projective measurements upon the pair to decide the original state to replace it, or just trying to reconstruct it using some procedures which do not altermore » their quantum nature. Results about the performance of these procedures are reported. First, we will work with pure systems studying restrictions and advantages. Then, we will extend these operations for mixed states generated with uncertainty in the time of distortion, correcting them by assuming the control prescriptions for the most probable one.« less

Exploring quantum computing application to satellite data assimilation

NASA Astrophysics Data System (ADS)

Cheung, S.; Zhang, S. Q.

2015-12-01

This is an exploring work on potential application of quantum computing to a scientific data optimization problem. On classical computational platforms, the physical domain of a satellite data assimilation problem is represented by a discrete variable transform, and classical minimization algorithms are employed to find optimal solution of the analysis cost function. The computation becomes intensive and time-consuming when the problem involves large number of variables and data. The new quantum computer opens a very different approach both in conceptual programming and in hardware architecture for solving optimization problem. In order to explore if we can utilize the quantum computing machine architecture, we formulate a satellite data assimilation experimental case in the form of quadratic programming optimization problem. We find a transformation of the problem to map it into Quadratic Unconstrained Binary Optimization (QUBO) framework. Binary Wavelet Transform (BWT) will be applied to the data assimilation variables for its invertible decomposition and all calculations in BWT are performed by Boolean operations. The transformed problem will be experimented as to solve for a solution of QUBO instances defined on Chimera graphs of the quantum computer.

Device-independent tests of quantum channels

NASA Astrophysics Data System (ADS)

Dall'Arno, Michele; Brandsen, Sarah; Buscemi, Francesco

2017-03-01

We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing the set of input-output correlations compatible with any arbitrary given quantum channel. For binary (i.e. two input symbols, two output symbols) correlations, we show that extremal correlations are always achieved by orthogonal encodings and measurements, irrespective of whether or not the channel preserves commutativity. We further provide a full, closed-form characterization of the sets of binary correlations in the case of: (i) any dihedrally covariant qubit channel (such as any Pauli and amplitude-damping channels) and (ii) any universally-covariant commutativity-preserving channel in an arbitrary dimension (such as any erasure, depolarizing, universal cloning and universal transposition channels).

A blueprint for demonstrating quantum supremacy with superconducting qubits

NASA Astrophysics Data System (ADS)

Neill, C.; Roushan, P.; Kechedzhi, K.; Boixo, S.; Isakov, S. V.; Smelyanskiy, V.; Megrant, A.; Chiaro, B.; Dunsworth, A.; Arya, K.; Barends, R.; Burkett, B.; Chen, Y.; Chen, Z.; Fowler, A.; Foxen, B.; Giustina, M.; Graff, R.; Jeffrey, E.; Huang, T.; Kelly, J.; Klimov, P.; Lucero, E.; Mutus, J.; Neeley, M.; Quintana, C.; Sank, D.; Vainsencher, A.; Wenner, J.; White, T. C.; Neven, H.; Martinis, J. M.

2018-04-01

A key step toward demonstrating a quantum system that can address difficult problems in physics and chemistry will be performing a computation beyond the capabilities of any classical computer, thus achieving so-called quantum supremacy. In this study, we used nine superconducting qubits to demonstrate a promising path toward quantum supremacy. By individually tuning the qubit parameters, we were able to generate thousands of distinct Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert space. As the number of qubits increases, the system continues to explore the exponentially growing number of states. Extending these results to a system of 50 qubits has the potential to address scientific questions that are beyond the capabilities of any classical computer.

Device-independent tests of quantum channels.

PubMed

Dall'Arno, Michele; Brandsen, Sarah; Buscemi, Francesco

2017-03-01

We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing the set of input-output correlations compatible with any arbitrary given quantum channel. For binary (i.e. two input symbols, two output symbols) correlations, we show that extremal correlations are always achieved by orthogonal encodings and measurements, irrespective of whether or not the channel preserves commutativity. We further provide a full, closed-form characterization of the sets of binary correlations in the case of: (i) any dihedrally covariant qubit channel (such as any Pauli and amplitude-damping channels) and (ii) any universally-covariant commutativity-preserving channel in an arbitrary dimension (such as any erasure, depolarizing, universal cloning and universal transposition channels).

Representational Realism, Closed Theories and the Quantum to Classical Limit

NASA Astrophysics Data System (ADS)

de Ronde, Christian

In this chapter, we discuss the representational realist stance as a pluralistontic approach to inter-theoretic relationships. Our stance stresses the fact that physical theories require the necessary consideration of a conceptual level of discourse which determines and configures the specific field of phenomena discussed by each particular theory. We will criticize the orthodox line of research which has grounded the analysis about QM in two (Bohrian) metaphysical presuppositions - accepted in the present as dogmas that all interpretations must follow. We will also examine how the orthodox project of "bridging the gap" between the quantum and the classical domains has constrained the possibilities of research, producing only a limited set of interpretational problems which only focus in the justification of "classical reality" and exclude the possibility of analyzing the possibilities of non-classical conceptual representations of QM. The representational realist stance introduces two new problems, namely, the superposition problem and the contextuality problem, which consider explicitly the conceptual representation of orthodox QM beyond the mere reference to mathematical structures and measurement outcomes. In the final part of the chapter, we revisit, from representational realist perspective, the quantum to classical limit and the orthodox claim that this inter-theoretic relation can be explained through the principle of decoherence.

Quantum Machine Learning

NASA Technical Reports Server (NTRS)

Biswas, Rupak

2018-01-01

Quantum computing promises an unprecedented ability to solve intractable problems by harnessing quantum mechanical effects such as tunneling, superposition, and entanglement. The Quantum Artificial Intelligence Laboratory (QuAIL) at NASA Ames Research Center is the space agency's primary facility for conducting research and development in quantum information sciences. QuAIL conducts fundamental research in quantum physics but also explores how best to exploit and apply this disruptive technology to enable NASA missions in aeronautics, Earth and space sciences, and space exploration. At the same time, machine learning has become a major focus in computer science and captured the imagination of the public as a panacea to myriad big data problems. In this talk, we will discuss how classical machine learning can take advantage of quantum computing to significantly improve its effectiveness. Although we illustrate this concept on a quantum annealer, other quantum platforms could be used as well. If explored fully and implemented efficiently, quantum machine learning could greatly accelerate a wide range of tasks leading to new technologies and discoveries that will significantly change the way we solve real-world problems.

Solving search problems by strongly simulating quantum circuits

PubMed Central

Johnson, T. H.; Biamonte, J. D.; Clark, S. R.; Jaksch, D.

2013-01-01

Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed to be generally inefficient. Nevertheless, several efficient strong simulation techniques are known for restricted families of quantum circuits and we develop an additional technique in this article. Further, we show that strong simulation algorithms perform another fundamental task: solving search problems. Efficient strong simulation techniques allow solutions to a class of search problems to be counted and found efficiently. This enhances the utility of strong simulation methods, known or yet to be discovered, and extends the class of search problems known to be efficiently simulable. Relating strong simulation to search problems also bounds the computational power of efficiently strongly simulable circuits; if they could solve all problems in P this would imply that all problems in NP and #P could be solved in polynomial time. PMID:23390585

Probing for quantum speedup in spin-glass problems with planted solutions

NASA Astrophysics Data System (ADS)

Hen, Itay; Job, Joshua; Albash, Tameem; Rønnow, Troels F.; Troyer, Matthias; Lidar, Daniel A.

2015-10-01

The availability of quantum annealing devices with hundreds of qubits has made the experimental demonstration of a quantum speedup for optimization problems a coveted, albeit elusive goal. Going beyond earlier studies of random Ising problems, here we introduce a method to construct a set of frustrated Ising-model optimization problems with tunable hardness. We study the performance of a D-Wave Two device (DW2) with up to 503 qubits on these problems and compare it to a suite of classical algorithms, including a highly optimized algorithm designed to compete directly with the DW2. The problems are generated around predetermined ground-state configurations, called planted solutions, which makes them particularly suitable for benchmarking purposes. The problem set exhibits properties familiar from constraint satisfaction (SAT) problems, such as a peak in the typical hardness of the problems, determined by a tunable clause density parameter. We bound the hardness regime where the DW2 device either does not or might exhibit a quantum speedup for our problem set. While we do not find evidence for a speedup for the hardest and most frustrated problems in our problem set, we cannot rule out that a speedup might exist for some of the easier, less frustrated problems. Our empirical findings pertain to the specific D-Wave processor and problem set we studied and leave open the possibility that future processors might exhibit a quantum speedup on the same problem set.

Ultrafast adiabatic quantum algorithm for the NP-complete exact cover problem

PubMed Central

Wang, Hefeng; Wu, Lian-Ao

2016-01-01

An adiabatic quantum algorithm may lose quantumness such as quantum coherence entirely in its long runtime, and consequently the expected quantum speedup of the algorithm does not show up. Here we present a general ultrafast adiabatic quantum algorithm. We show that by applying a sequence of fast random or regular signals during evolution, the runtime can be reduced substantially, whereas advantages of the adiabatic algorithm remain intact. We also propose a randomized Trotter formula and show that the driving Hamiltonian and the proposed sequence of fast signals can be implemented simultaneously. We illustrate the algorithm by solving the NP-complete 3-bit exact cover problem (EC3), where NP stands for nondeterministic polynomial time, and put forward an approach to implementing the problem with trapped ions. PMID:26923834

Fidelity-Based Ant Colony Algorithm with Q-learning of Quantum System

NASA Astrophysics Data System (ADS)

Liao, Qin; Guo, Ying; Tu, Yifeng; Zhang, Hang

2018-03-01

Quantum ant colony algorithm (ACA) has potential applications in quantum information processing, such as solutions of traveling salesman problem, zero-one knapsack problem, robot route planning problem, and so on. To shorten the search time of the ACA, we suggest the fidelity-based ant colony algorithm (FACA) for the control of quantum system. Motivated by structure of the Q-learning algorithm, we demonstrate the combination of a FACA with the Q-learning algorithm and suggest the design of a fidelity-based ant colony algorithm with the Q-learning to improve the performance of the FACA in a spin-1/2 quantum system. The numeric simulation results show that the FACA with the Q-learning can efficiently avoid trapping into local optimal policies and increase the speed of convergence process of quantum system.

Fidelity-Based Ant Colony Algorithm with Q-learning of Quantum System

NASA Astrophysics Data System (ADS)

Liao, Qin; Guo, Ying; Tu, Yifeng; Zhang, Hang

2017-12-01

Quantum ant colony algorithm (ACA) has potential applications in quantum information processing, such as solutions of traveling salesman problem, zero-one knapsack problem, robot route planning problem, and so on. To shorten the search time of the ACA, we suggest the fidelity-based ant colony algorithm (FACA) for the control of quantum system. Motivated by structure of the Q-learning algorithm, we demonstrate the combination of a FACA with the Q-learning algorithm and suggest the design of a fidelity-based ant colony algorithm with the Q-learning to improve the performance of the FACA in a spin-1/2 quantum system. The numeric simulation results show that the FACA with the Q-learning can efficiently avoid trapping into local optimal policies and increase the speed of convergence process of quantum system.

Theoretical motivation for gravitation experiments on ultra-low energy antiprotons and antihydrogen

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nieto, M.M.

1995-12-31

It is known that the generally accepted theories of gravity and quantum mechanics are fundamentally incompatible. Thus, when one tries to combine these theories, one must beware of physical pitfalls. Modern theories of quantum gravity are trying to overcome these problems. Any ideas must confront the present agreement with general relativity, but yet be free to wonder about not understood phenomena, such as the dark matter problem. This all has led some {open_quotes}intrepid{close_quotes} theorists to consider a new gravitational regime, that of antimatter. Even more {open_quotes}daring{close_quotes} experimentalists are attempting, or considering attempting, the measurement of the gravitational force on antimatter,more » including low-energy antiprotons and, perhaps most enticing, antihydrogen.« less

Gaussian Boson Sampling.

PubMed

Hamilton, Craig S; Kruse, Regina; Sansoni, Linda; Barkhofen, Sonja; Silberhorn, Christine; Jex, Igor

2017-10-27

Boson sampling has emerged as a tool to explore the advantages of quantum over classical computers as it does not require universal control over the quantum system, which favors current photonic experimental platforms. Here, we introduce Gaussian Boson sampling, a classically hard-to-solve problem that uses squeezed states as a nonclassical resource. We relate the probability to measure specific photon patterns from a general Gaussian state in the Fock basis to a matrix function called the Hafnian, which answers the last remaining question of sampling from Gaussian states. Based on this result, we design Gaussian Boson sampling, a #P hard problem, using squeezed states. This demonstrates that Boson sampling from Gaussian states is possible, with significant advantages in the photon generation probability, compared to existing protocols.

Playing distributed two-party quantum games on quantum networks

NASA Astrophysics Data System (ADS)

Liu, Bo-Yang; Dai, Hong-Yi; Zhang, Ming

2017-12-01

This paper investigates quantum games between two remote players on quantum networks. We propose two schemes for distributed remote quantum games: the client-server scheme based on states transmission between nodes of the network and the peer-to-peer scheme devised upon remote quantum operations. Following these schemes, we construct two designs of the distributed prisoners' dilemma game on quantum entangling networks, where concrete methods are employed for teleportation and nonlocal two-qubits unitary gates, respectively. It seems to us that the requirement for playing distributed quantum games on networks is still an open problem. We explore this problem by comparing and characterizing the two schemes from the viewpoints of network structures, quantum and classical operations, experimental realization and simplification.

JOURNAL SCOPE GUIDELINES: Paper classification scheme

NASA Astrophysics Data System (ADS)

2005-06-01

This scheme is used to clarify the journal's scope and enable authors and readers to more easily locate the appropriate section for their work. For each of the sections listed in the scope statement we suggest some more detailed subject areas which help define that subject area. These lists are by no means exhaustive and are intended only as a guide to the type of papers we envisage appearing in each section. We acknowledge that no classification scheme can be perfect and that there are some papers which might be placed in more than one section. We are happy to provide further advice on paper classification to authors upon request (please email jphysa@iop.org). 1. Statistical physics numerical and computational methods statistical mechanics, phase transitions and critical phenomena quantum condensed matter theory Bose-Einstein condensation strongly correlated electron systems exactly solvable models in statistical mechanics lattice models, random walks and combinatorics field-theoretical models in statistical mechanics disordered systems, spin glasses and neural networks nonequilibrium systems network theory 2. Chaotic and complex systems nonlinear dynamics and classical chaos fractals and multifractals quantum chaos classical and quantum transport cellular automata granular systems and self-organization pattern formation biophysical models 3. Mathematical physics combinatorics algebraic structures and number theory matrix theory classical and quantum groups, symmetry and representation theory Lie algebras, special functions and orthogonal polynomials ordinary and partial differential equations difference and functional equations integrable systems soliton theory functional analysis and operator theory inverse problems geometry, differential geometry and topology numerical approximation and analysis geometric integration computational methods 4. Quantum mechanics and quantum information theory coherent states eigenvalue problems supersymmetric quantum mechanics scattering theory relativistic quantum mechanics semiclassical approximations foundations of quantum mechanics and measurement theory entanglement and quantum nonlocality geometric phases and quantum tomography quantum tunnelling decoherence and open systems quantum cryptography, communication and computation theoretical quantum optics 5. Classical and quantum field theory quantum field theory gauge and conformal field theory quantum electrodynamics and quantum chromodynamics Casimir effect integrable field theory random matrix theory applications in field theory string theory and its developments classical field theory and electromagnetism metamaterials 6. Fluid and plasma theory turbulence fundamental plasma physics kinetic theory magnetohydrodynamics and multifluid descriptions strongly coupled plasmas one-component plasmas non-neutral plasmas astrophysical and dusty plasmas

Simulating chemistry using quantum computers.

PubMed

Kassal, Ivan; Whitfield, James D; Perdomo-Ortiz, Alejandro; Yung, Man-Hong; Aspuru-Guzik, Alán

2011-01-01

The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

Perfect quantum multiple-unicast network coding protocol

NASA Astrophysics Data System (ADS)

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.

A quantum annealing architecture with all-to-all connectivity from local interactions.

PubMed

Lechner, Wolfgang; Hauke, Philipp; Zoller, Peter

2015-10-01

Quantum annealers are physical devices that aim at solving NP-complete optimization problems by exploiting quantum mechanics. The basic principle of quantum annealing is to encode the optimization problem in Ising interactions between quantum bits (qubits). A fundamental challenge in building a fully programmable quantum annealer is the competing requirements of full controllable all-to-all connectivity and the quasi-locality of the interactions between physical qubits. We present a scalable architecture with full connectivity, which can be implemented with local interactions only. The input of the optimization problem is encoded in local fields acting on an extended set of physical qubits. The output is-in the spirit of topological quantum memories-redundantly encoded in the physical qubits, resulting in an intrinsic fault tolerance. Our model can be understood as a lattice gauge theory, where long-range interactions are mediated by gauge constraints. The architecture can be realized on various platforms with local controllability, including superconducting qubits, NV-centers, quantum dots, and atomic systems.

A quantum annealing architecture with all-to-all connectivity from local interactions

PubMed Central

Lechner, Wolfgang; Hauke, Philipp; Zoller, Peter

2015-01-01

Quantum annealers are physical devices that aim at solving NP-complete optimization problems by exploiting quantum mechanics. The basic principle of quantum annealing is to encode the optimization problem in Ising interactions between quantum bits (qubits). A fundamental challenge in building a fully programmable quantum annealer is the competing requirements of full controllable all-to-all connectivity and the quasi-locality of the interactions between physical qubits. We present a scalable architecture with full connectivity, which can be implemented with local interactions only. The input of the optimization problem is encoded in local fields acting on an extended set of physical qubits. The output is—in the spirit of topological quantum memories—redundantly encoded in the physical qubits, resulting in an intrinsic fault tolerance. Our model can be understood as a lattice gauge theory, where long-range interactions are mediated by gauge constraints. The architecture can be realized on various platforms with local controllability, including superconducting qubits, NV-centers, quantum dots, and atomic systems. PMID:26601316

Practical experimental certification of computational quantum gates using a twirling procedure.

PubMed

Moussa, Osama; da Silva, Marcus P; Ryan, Colm A; Laflamme, Raymond

2012-08-17

Because of the technical difficulty of building large quantum computers, it is important to be able to estimate how faithful a given implementation is to an ideal quantum computer. The common approach of completely characterizing the computation process via quantum process tomography requires an exponential amount of resources, and thus is not practical even for relatively small devices. We solve this problem by demonstrating that twirling experiments previously used to characterize the average fidelity of quantum memories efficiently can be easily adapted to estimate the average fidelity of the experimental implementation of important quantum computation processes, such as unitaries in the Clifford group, in a practical and efficient manner with applicability in current quantum devices. Using this procedure, we demonstrate state-of-the-art coherent control of an ensemble of magnetic moments of nuclear spins in a single crystal solid by implementing the encoding operation for a 3-qubit code with only a 1% degradation in average fidelity discounting preparation and measurement errors. We also highlight one of the advances that was instrumental in achieving such high fidelity control.

Error regions in quantum state tomography: computational complexity caused by geometry of quantum states

NASA Astrophysics Data System (ADS)

Suess, Daniel; Rudnicki, Łukasz; maciel, Thiago O.; Gross, David

2017-09-01

The outcomes of quantum mechanical measurements are inherently random. It is therefore necessary to develop stringent methods for quantifying the degree of statistical uncertainty about the results of quantum experiments. For the particularly relevant task of quantum state tomography, it has been shown that a significant reduction in uncertainty can be achieved by taking the positivity of quantum states into account. However—the large number of partial results and heuristics notwithstanding—no efficient general algorithm is known that produces an optimal uncertainty region from experimental data, while making use of the prior constraint of positivity. Here, we provide a precise formulation of this problem and show that the general case is NP-hard. Our result leaves room for the existence of efficient approximate solutions, and therefore does not in itself imply that the practical task of quantum uncertainty quantification is intractable. However, it does show that there exists a non-trivial trade-off between optimality and computational efficiency for error regions. We prove two versions of the result: one for frequentist and one for Bayesian statistics.

Improved HDRG decoders for qudit and non-Abelian quantum error correction

NASA Astrophysics Data System (ADS)

Hutter, Adrian; Loss, Daniel; Wootton, James R.

2015-03-01

Hard-decision renormalization group (HDRG) decoders are an important class of decoding algorithms for topological quantum error correction. Due to their versatility, they have been used to decode systems with fractal logical operators, color codes, qudit topological codes, and non-Abelian systems. In this work, we develop a method of performing HDRG decoding which combines strengths of existing decoders and further improves upon them. In particular, we increase the minimal number of errors necessary for a logical error in a system of linear size L from \\Theta ({{L}2/3}) to Ω ({{L}1-ε }) for any ε \\gt 0. We apply our algorithm to decoding D({{{Z}}d}) quantum double models and a non-Abelian anyon model with Fibonacci-like fusion rules, and show that it indeed significantly outperforms previous HDRG decoders. Furthermore, we provide the first study of continuous error correction with imperfect syndrome measurements for the D({{{Z}}d}) quantum double models. The parallelized runtime of our algorithm is poly(log L) for the perfect measurement case. In the continuous case with imperfect syndrome measurements, the averaged runtime is O(1) for Abelian systems, while continuous error correction for non-Abelian anyons stays an open problem.

From axiomatics of quantum probability to modelling geological uncertainty and management of intelligent hydrocarbon reservoirs with the theory of open quantum systems.

PubMed

Lozada Aguilar, Miguel Ángel; Khrennikov, Andrei; Oleschko, Klaudia

2018-04-28

As was recently shown by the authors, quantum probability theory can be used for the modelling of the process of decision-making (e.g. probabilistic risk analysis) for macroscopic geophysical structures such as hydrocarbon reservoirs. This approach can be considered as a geophysical realization of Hilbert's programme on axiomatization of statistical models in physics (the famous sixth Hilbert problem). In this conceptual paper , we continue development of this approach to decision-making under uncertainty which is generated by complexity, variability, heterogeneity, anisotropy, as well as the restrictions to accessibility of subsurface structures. The belief state of a geological expert about the potential of exploring a hydrocarbon reservoir is continuously updated by outputs of measurements, and selection of mathematical models and scales of numerical simulation. These outputs can be treated as signals from the information environment E The dynamics of the belief state can be modelled with the aid of the theory of open quantum systems: a quantum state (representing uncertainty in beliefs) is dynamically modified through coupling with E ; stabilization to a steady state determines a decision strategy. In this paper, the process of decision-making about hydrocarbon reservoirs (e.g. 'explore or not?'; 'open new well or not?'; 'contaminated by water or not?'; 'double or triple porosity medium?') is modelled by using the Gorini-Kossakowski-Sudarshan-Lindblad equation. In our model, this equation describes the evolution of experts' predictions about a geophysical structure. We proceed with the information approach to quantum theory and the subjective interpretation of quantum probabilities (due to quantum Bayesianism).This article is part of the theme issue 'Hilbert's sixth problem'. © 2018 The Author(s).

From axiomatics of quantum probability to modelling geological uncertainty and management of intelligent hydrocarbon reservoirs with the theory of open quantum systems

NASA Astrophysics Data System (ADS)

Lozada Aguilar, Miguel Ángel; Khrennikov, Andrei; Oleschko, Klaudia

2018-04-01

As was recently shown by the authors, quantum probability theory can be used for the modelling of the process of decision-making (e.g. probabilistic risk analysis) for macroscopic geophysical structures such as hydrocarbon reservoirs. This approach can be considered as a geophysical realization of Hilbert's programme on axiomatization of statistical models in physics (the famous sixth Hilbert problem). In this conceptual paper, we continue development of this approach to decision-making under uncertainty which is generated by complexity, variability, heterogeneity, anisotropy, as well as the restrictions to accessibility of subsurface structures. The belief state of a geological expert about the potential of exploring a hydrocarbon reservoir is continuously updated by outputs of measurements, and selection of mathematical models and scales of numerical simulation. These outputs can be treated as signals from the information environment E. The dynamics of the belief state can be modelled with the aid of the theory of open quantum systems: a quantum state (representing uncertainty in beliefs) is dynamically modified through coupling with E; stabilization to a steady state determines a decision strategy. In this paper, the process of decision-making about hydrocarbon reservoirs (e.g. `explore or not?'; `open new well or not?'; `contaminated by water or not?'; `double or triple porosity medium?') is modelled by using the Gorini-Kossakowski-Sudarshan-Lindblad equation. In our model, this equation describes the evolution of experts' predictions about a geophysical structure. We proceed with the information approach to quantum theory and the subjective interpretation of quantum probabilities (due to quantum Bayesianism). This article is part of the theme issue `Hilbert's sixth problem'.

Multipartite quantum correlations and local recoverability

PubMed Central

Wilde, Mark M.

2015-01-01

Characterizing genuine multipartite quantum correlations in quantum physical systems has historically been a challenging problem in quantum information theory. More recently, however, the total correlation or multipartite information measure has been helpful in accomplishing this goal, especially with the multipartite symmetric quantum (MSQ) discord (Piani et al. 2008 Phys. Rev. Lett. 100, 090502. (doi:10.1103/PhysRevLett.100.090502)) and the conditional entanglement of multipartite information (CEMI) (Yang et al. 2008 Phys. Rev. Lett. 101, 140501. (doi:10.1103/PhysRevLett.101.140501)). Here, we apply a recent and significant improvement of strong subadditivity of quantum entropy (Fawzi & Renner 2014 (http://arxiv.org/abs/1410.0664)) in order to develop these quantities further. In particular, we prove that the MSQ discord is nearly equal to zero if and only if the multipartite state for which it is evaluated is approximately locally recoverable after performing measurements on each of its systems. Furthermore, we prove that the CEMI is a faithful entanglement measure, i.e. it vanishes if and only if the multipartite state for which it is evaluated is a fully separable state. Along the way, we provide an operational interpretation of the MSQ discord in terms of the partial state distribution protocol, which in turn, as a special case, gives an interpretation for the original discord quantity. Finally, we prove an inequality that could potentially improve upon the Fawzi–Renner inequality in the multipartite context, but it remains an open question to determine whether this is so. PMID:27547097

Quantum learning of classical stochastic processes: The completely positive realization problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Monràs, Alex; Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543; Winter, Andreas

2016-01-15

Among several tasks in Machine Learning, a specially important one is the problem of inferring the latent variables of a system and their causal relations with the observed behavior. A paradigmatic instance of this is the task of inferring the hidden Markov model underlying a given stochastic process. This is known as the positive realization problem (PRP), [L. Benvenuti and L. Farina, IEEE Trans. Autom. Control 49(5), 651–664 (2004)] and constitutes a central problem in machine learning. The PRP and its solutions have far-reaching consequences in many areas of systems and control theory, and is nowadays an important piece inmore » the broad field of positive systems theory. We consider the scenario where the latent variables are quantum (i.e., quantum states of a finite-dimensional system) and the system dynamics is constrained only by physical transformations on the quantum system. The observable dynamics is then described by a quantum instrument, and the task is to determine which quantum instrument — if any — yields the process at hand by iterative application. We take as a starting point the theory of quasi-realizations, whence a description of the dynamics of the process is given in terms of linear maps on state vectors and probabilities are given by linear functionals on the state vectors. This description, despite its remarkable resemblance with the hidden Markov model, or the iterated quantum instrument, is however devoid of any stochastic or quantum mechanical interpretation, as said maps fail to satisfy any positivity conditions. The completely positive realization problem then consists in determining whether an equivalent quantum mechanical description of the same process exists. We generalize some key results of stochastic realization theory, and show that the problem has deep connections with operator systems theory, giving possible insight to the lifting problem in quotient operator systems. Our results have potential applications in quantum machine learning, device-independent characterization and reverse-engineering of stochastic processes and quantum processors, and more generally, of dynamical processes with quantum memory [M. Guţă, Phys. Rev. A 83(6), 062324 (2011); M. Guţă and N. Yamamoto, e-print http://arxiv.org/abs/1303.3771 (2013)].« less

The Role of Frame Force in Quantum Detection

DTIC Science & Technology

2007-01-01

42040) 10. C. H. Bennett, Quantum cryptography using any two nonorthogonal states, Phys. Rev. Lett. 68 (1992), no. 21, 3121–3124. MR 1 163 546 11. S ...SUBTITLE The Role of Frame Force in Quantum Detection 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR( S ) 5d. PROJECT...equivalent to a quantum detection problem from quantum mechanics. To this end we first reformulate Problem 1.2 in terms of orthonormal bases instead of 1

A sub-ensemble theory of ideal quantum measurement processes

NASA Astrophysics Data System (ADS)

Allahverdyan, Armen E.; Balian, Roger; Nieuwenhuizen, Theo M.

2017-01-01

In order to elucidate the properties currently attributed to ideal measurements, one must explain how the concept of an individual event with a well-defined outcome may emerge from quantum theory which deals with statistical ensembles, and how different runs issued from the same initial state may end up with different final states. This so-called "measurement problem" is tackled with two guidelines. On the one hand, the dynamics of the macroscopic apparatus A coupled to the tested system S is described mathematically within a standard quantum formalism, where " q-probabilities" remain devoid of interpretation. On the other hand, interpretative principles, aimed to be minimal, are introduced to account for the expected features of ideal measurements. Most of the five principles stated here, which relate the quantum formalism to physical reality, are straightforward and refer to macroscopic variables. The process can be identified with a relaxation of S + A to thermodynamic equilibrium, not only for a large ensemble E of runs but even for its sub-ensembles. The different mechanisms of quantum statistical dynamics that ensure these types of relaxation are exhibited, and the required properties of the Hamiltonian of S + A are indicated. The additional theoretical information provided by the study of sub-ensembles remove Schrödinger's quantum ambiguity of the final density operator for E which hinders its direct interpretation, and bring out a commutative behaviour of the pointer observable at the final time. The latter property supports the introduction of a last interpretative principle, needed to switch from the statistical ensembles and sub-ensembles described by quantum theory to individual experimental events. It amounts to identify some formal " q-probabilities" with ordinary frequencies, but only those which refer to the final indications of the pointer. The desired properties of ideal measurements, in particular the uniqueness of the result for each individual run of the ensemble and von Neumann's reduction, are thereby recovered with economic interpretations. The status of Born's rule involving both A and S is re-evaluated, and contextuality of quantum measurements is made obvious.

Quantum Iterative Deepening with an Application to the Halting Problem

PubMed Central

Tarrataca, Luís; Wichert, Andreas

2013-01-01

Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signaling an end of a calculation by setting a halt bit, which needs to be systematically checked by an observer. The capacity of quantum computational models to operate on a superposition of states requires an alternative approach. From a quantum perspective, any measurement of an equivalent halt qubit would have the potential to inherently interfere with the computation by provoking a random collapse amongst the states. This issue is exacerbated by undecidable problems such as the Entscheidungsproblem which require universal computational models, e.g. the classical Turing machine, to be able to proceed indefinitely. In this work we present an alternative view of quantum computation based on production system theory in conjunction with Grover's amplitude amplification scheme that allows for (1) a detection of halt states without interfering with the final result of a computation; (2) the possibility of non-terminating computation and (3) an inherent speedup to occur during computations susceptible of parallelization. We discuss how such a strategy can be employed in order to simulate classical Turing machines. PMID:23520465

Quantum communication complexity of establishing a shared reference frame.

PubMed

Rudolph, Terry; Grover, Lov

2003-11-21

We discuss the aligning of spatial reference frames from a quantum communication complexity perspective. This enables us to analyze multiple rounds of communication and give several simple examples demonstrating tradeoffs between the number of rounds and the type of communication. Using a distributed variant of a quantum computational algorithm, we give an explicit protocol for aligning spatial axes via the exchange of spin-1/2 particles which makes no use of either exchanged entangled states, or of joint measurements. This protocol achieves a worst-case fidelity for the problem of "direction finding" that is asymptotically equivalent to the optimal average case fidelity achievable via a single forward communication of entangled states.

Quantum oscillations of nitrogen atoms in uranium nitride

NASA Astrophysics Data System (ADS)

Aczel, A. A.; Granroth, G. E.; MacDougall, G. J.; Buyers, W. J. L.; Abernathy, D. L.; Samolyuk, G. D.; Stocks, G. M.; Nagler, S. E.

2012-10-01

The vibrational excitations of crystalline solids corresponding to acoustic or optic one-phonon modes appear as sharp features in measurements such as neutron spectroscopy. In contrast, many-phonon excitations generally produce a complicated, weak and featureless response. Here we present time-of-flight neutron scattering measurements for the binary solid uranium nitride, showing well-defined, equally spaced, high-energy vibrational modes in addition to the usual phonons. The spectrum is that of a single atom, isotropic quantum harmonic oscillator and characterizes independent motions of light nitrogen atoms, each found in an octahedral cage of heavy uranium atoms. This is an unexpected and beautiful experimental realization of one of the fundamental, exactly solvable problems in quantum mechanics. There are also practical implications, as the oscillator modes must be accounted for in the design of generation IV nuclear reactors that plan to use uranium nitride as a fuel.

Quantum oscillations of nitrogen atoms in uranium nitride.

PubMed

Aczel, A A; Granroth, G E; Macdougall, G J; Buyers, W J L; Abernathy, D L; Samolyuk, G D; Stocks, G M; Nagler, S E

2012-01-01

The vibrational excitations of crystalline solids corresponding to acoustic or optic one-phonon modes appear as sharp features in measurements such as neutron spectroscopy. In contrast, many-phonon excitations generally produce a complicated, weak and featureless response. Here we present time-of-flight neutron scattering measurements for the binary solid uranium nitride, showing well-defined, equally spaced, high-energy vibrational modes in addition to the usual phonons. The spectrum is that of a single atom, isotropic quantum harmonic oscillator and characterizes independent motions of light nitrogen atoms, each found in an octahedral cage of heavy uranium atoms. This is an unexpected and beautiful experimental realization of one of the fundamental, exactly solvable problems in quantum mechanics. There are also practical implications, as the oscillator modes must be accounted for in the design of generation IV nuclear reactors that plan to use uranium nitride as a fuel.

Philosophical perspectives on quantum chaos: Models and interpretations

NASA Astrophysics Data System (ADS)

Bokulich, Alisa Nicole

2001-09-01

The problem of quantum chaos is a special case of the larger problem of understanding how the classical world emerges from quantum mechanics. While we have learned that chaos is pervasive in classical systems, it appears to be almost entirely absent in quantum systems. The aim of this dissertation is to determine what implications the interpretation of quantum mechanics has for attempts to explain the emergence of classical chaos. There are three interpretations of quantum mechanics that have set out programs for solving the problem of quantum chaos: the standard interpretation, the statistical interpretation, and the deBroglie-Bohm causal interpretation. One of the main conclusions of this dissertation is that an interpretation alone is insufficient for solving the problem of quantum chaos and that the phenomenon of decoherence must be taken into account. Although a completely satisfactory solution of the problem of quantum chaos is still outstanding, I argue that the deBroglie-Bohm interpretation with the help of decoherence outlines the most promising research program to pursue. In addition to making a contribution to the debate in the philosophy of physics concerning the interpretation of quantum mechanics, this dissertation reveals two important methodological lessons for the philosophy of science. First, issues of reductionism and intertheoretic relations cannot be divorced from questions concerning the interpretation of the theories involved. Not only is the exploration of intertheoretic relations a central part of the articulation and interpretation of an individual theory, but the very terms used to discuss intertheoretic relations, such as `state' and `classical limit', are themselves defined by particular interpretations of the theory. The second lesson that emerges is that, when it comes to characterizing the relationship between classical chaos and quantum mechanics, the traditional approaches to intertheoretic relations, namely reductionism and theoretical pluralism, are inadequate. The fruitful ways in which models have been used in quantum chaos research point to the need for a new framework for addressing intertheoretic relations that focuses on models rather than laws.

Quantum algorithm for solving some discrete mathematical problems by probing their energy spectra

NASA Astrophysics Data System (ADS)

Wang, Hefeng; Fan, Heng; Li, Fuli

2014-01-01

When a probe qubit is coupled to a quantum register that represents a physical system, the probe qubit will exhibit a dynamical response only when it is resonant with a transition in the system. Using this principle, we propose a quantum algorithm for solving discrete mathematical problems based on the circuit model. Our algorithm has favorable scaling properties in solving some discrete mathematical problems.

Nonparadoxical loss of information in black hole evaporation in a quantum collapse model

NASA Astrophysics Data System (ADS)

Modak, Sujoy K.; Ortíz, Leonardo; Peña, Igor; Sudarsky, Daniel

2015-06-01

We consider a novel approach to address the black hole information paradox. The idea is based on adapting, to the situation at hand, the modified versions of quantum theory involving spontaneous stochastic dynamical collapse of quantum states, which have been considered in attempts to deal with shortcomings of the standard Copenhagen interpretation of quantum mechanics, in particular, the issue known as "the measurement problem." The new basic hypothesis is that the modified quantum behavior is enhanced in the region of high curvature so that the information encoded in the initial quantum state of the matter fields is rapidly erased as the black hole singularity is approached. We show that in this manner the complete evaporation of the black hole via Hawking radiation can be understood as involving no paradox. Calculations are performed using a modified version of quantum theory known as "continuous spontaneous localization" (CSL), which was originally developed in the context of many-particle nonrelativistic quantum mechanics. We use a version of CSL tailored to quantum field theory and applied in the context of the two -dimensional Callan-Giddings-Harvey-Strominger model. Although the role of quantum gravity in this picture is restricted to the resolution of the singularity, related studies suggest that there might be further connections.

Optimal sequential measurements for bipartite state discrimination

NASA Astrophysics Data System (ADS)

Croke, Sarah; Barnett, Stephen M.; Weir, Graeme

2017-05-01

State discrimination is a useful test problem with which to clarify the power and limitations of different classes of measurement. We consider the problem of discriminating between given states of a bipartite quantum system via sequential measurement of the subsystems, with classical feed-forward of measurement results. Our aim is to understand when sequential measurements, which are relatively easy to implement experimentally, perform as well, or almost as well, as optimal joint measurements, which are in general more technologically challenging. We construct conditions that the optimal sequential measurement must satisfy, analogous to the well-known Helstrom conditions for minimum error discrimination in the unrestricted case. We give several examples and compare the optimal probability of correctly identifying the state via global versus sequential measurement strategies.

Designing quantum information processing via structural physical approximation.

PubMed

Bae, Joonwoo

2017-10-01

In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of quantum mechanics is more restrictive than classical systems, identified to a specific form of dynamics, that is, unitary transformations and, consequently, positive and completely positive maps to subsystems. This also characterizes classes of disallowed transformations on quantum systems, among which positive but not completely maps are of particular interest as they characterize entangled states, a general resource in quantum information processing. Structural physical approximation offers a systematic way of approximating those non-physical maps, positive but not completely positive maps, with quantum channels. Since it has been proposed as a method of detecting entangled states, it has stimulated fundamental problems on classifications of positive maps and the structure of Hermitian operators and quantum states, as well as on quantum measurement such as quantum design in quantum information theory. It has developed efficient and feasible methods of directly detecting entangled states in practice, for which proof-of-principle experimental demonstrations have also been performed with photonic qubit states. Here, we present a comprehensive review on quantum information processing with structural physical approximations and the related progress. The review mainly focuses on properties of structural physical approximations and their applications toward practical information applications.

Designing quantum information processing via structural physical approximation

NASA Astrophysics Data System (ADS)

Bae, Joonwoo

2017-10-01

In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of quantum mechanics is more restrictive than classical systems, identified to a specific form of dynamics, that is, unitary transformations and, consequently, positive and completely positive maps to subsystems. This also characterizes classes of disallowed transformations on quantum systems, among which positive but not completely maps are of particular interest as they characterize entangled states, a general resource in quantum information processing. Structural physical approximation offers a systematic way of approximating those non-physical maps, positive but not completely positive maps, with quantum channels. Since it has been proposed as a method of detecting entangled states, it has stimulated fundamental problems on classifications of positive maps and the structure of Hermitian operators and quantum states, as well as on quantum measurement such as quantum design in quantum information theory. It has developed efficient and feasible methods of directly detecting entangled states in practice, for which proof-of-principle experimental demonstrations have also been performed with photonic qubit states. Here, we present a comprehensive review on quantum information processing with structural physical approximations and the related progress. The review mainly focuses on properties of structural physical approximations and their applications toward practical information applications.

Robust quantum optimizer with full connectivity.

PubMed

Nigg, Simon E; Lörch, Niels; Tiwari, Rakesh P

2017-04-01

Quantum phenomena have the potential to speed up the solution of hard optimization problems. For example, quantum annealing, based on the quantum tunneling effect, has recently been shown to scale exponentially better with system size than classical simulated annealing. However, current realizations of quantum annealers with superconducting qubits face two major challenges. First, the connectivity between the qubits is limited, excluding many optimization problems from a direct implementation. Second, decoherence degrades the success probability of the optimization. We address both of these shortcomings and propose an architecture in which the qubits are robustly encoded in continuous variable degrees of freedom. By leveraging the phenomenon of flux quantization, all-to-all connectivity with sufficient tunability to implement many relevant optimization problems is obtained without overhead. Furthermore, we demonstrate the robustness of this architecture by simulating the optimal solution of a small instance of the nondeterministic polynomial-time hard (NP-hard) and fully connected number partitioning problem in the presence of dissipation.

Closed-loop and robust control of quantum systems.

PubMed

Chen, Chunlin; Wang, Lin-Cheng; Wang, Yuanlong

2013-01-01

For most practical quantum control systems, it is important and difficult to attain robustness and reliability due to unavoidable uncertainties in the system dynamics or models. Three kinds of typical approaches (e.g., closed-loop learning control, feedback control, and robust control) have been proved to be effective to solve these problems. This work presents a self-contained survey on the closed-loop and robust control of quantum systems, as well as a brief introduction to a selection of basic theories and methods in this research area, to provide interested readers with a general idea for further studies. In the area of closed-loop learning control of quantum systems, we survey and introduce such learning control methods as gradient-based methods, genetic algorithms (GA), and reinforcement learning (RL) methods from a unified point of view of exploring the quantum control landscapes. For the feedback control approach, the paper surveys three control strategies including Lyapunov control, measurement-based control, and coherent-feedback control. Then such topics in the field of quantum robust control as H(∞) control, sliding mode control, quantum risk-sensitive control, and quantum ensemble control are reviewed. The paper concludes with a perspective of future research directions that are likely to attract more attention.

Polarization entanglement purification of nonlocal microwave photons based on the cross-Kerr effect in circuit QED

NASA Astrophysics Data System (ADS)

Zhang, Hao; Liu, Qian; Xu, Xu-Sheng; Xiong, Jun; Alsaedi, Ahmed; Hayat, Tasawar; Deng, Fu-Guo

2017-11-01

Microwave photons have become very important qubits in quantum communication, as the first quantum satellite has been launched successfully. Therefore, it is a necessary and meaningful task for ensuring the high security and efficiency of microwave-based quantum communication in practice. Here, we present an original polarization entanglement purification protocol for nonlocal microwave photons based on the cross-Kerr effect in circuit quantum electrodynamics (QED). Our protocol can solve the problem that the purity of maximally entangled states used for constructing quantum channels will decrease due to decoherence from environment noise. This task is accomplished by means of the polarization parity-check quantum nondemolition (QND) detector, the bit-flipping operation, and the linear microwave elements. The QND detector is composed of several cross-Kerr effect systems which can be realized by coupling two superconducting transmission line resonators to a superconducting molecule with the N -type level structure. We give the applicable experimental parameters of QND measurement system in circuit QED and analyze the fidelities. Our protocol has good applications in long-distance quantum communication assisted by microwave photons in the future, such as satellite quantum communication.

Students' Conceptual Difficulties in Quantum Mechanics: Potential Well Problems

ERIC Educational Resources Information Center

Ozcan, Ozgur; Didis, Nilufer; Tasar, Mehmet Fatih

2009-01-01

In this study, students' conceptual difficulties about some basic concepts in quantum mechanics like one-dimensional potential well problems and probability density of tunneling particles were identified. For this aim, a multiple choice instrument named Quantum Mechanics Conceptual Test has been developed by one of the researchers of this study…

Improved mapping of the travelling salesman problem for quantum annealing

NASA Astrophysics Data System (ADS)

Troyer, Matthias; Heim, Bettina; Brown, Ethan; Wecker, David

2015-03-01

We consider the quantum adiabatic algorithm as applied to the travelling salesman problem (TSP). We introduce a novel mapping of TSP to an Ising spin glass Hamiltonian and compare it to previous known mappings. Through direct perturbative analysis, unitary evolution, and simulated quantum annealing, we show this new mapping to be significantly superior. We discuss how this advantage can translate to actual physical implementations of TSP on quantum annealers.

Black Holes, Information Loss and the Measurement Problem

NASA Astrophysics Data System (ADS)

Okon, Elias; Sudarsky, Daniel

2017-01-01

The information loss paradox is often presented as an unavoidable consequence of well-established physics. However, in order for a genuine paradox to ensue, not-trivial assumptions about, e.g., quantum effects on spacetime, are necessary. In this work we will be explicit about these additional, speculative assumptions required. We will also sketch a map of the available routes to tackle the issue, highlighting the, often overlooked, commitments demanded of each alternative. Finally, we will display the strong link between black holes, the issue of information loss and the measurement problem.

Non-Markovian quantum feedback networks II: Controlled flows

NASA Astrophysics Data System (ADS)

Gough, John E.

2017-06-01

The concept of a controlled flow of a dynamical system, especially when the controlling process feeds information back about the system, is of central importance in control engineering. In this paper, we build on the ideas presented by Bouten and van Handel [Quantum Stochastics and Information: Statistics, Filtering and Control (World Scientific, 2008)] and develop a general theory of quantum feedback. We elucidate the relationship between the controlling processes, Z, and the measured processes, Y, and to this end we make a distinction between what we call the input picture and the output picture. We should note that the input-output relations for the noise fields have additional terms not present in the standard theory but that the relationship between the control processes and measured processes themselves is internally consistent—we do this for the two main cases of quadrature measurement and photon-counting measurement. The theory is general enough to include a modulating filter which post-processes the measurement readout Y before returning to the system. This opens up the prospect of applying very general engineering feedback control techniques to open quantum systems in a systematic manner, and we consider a number of specific modulating filter problems. Finally, we give a brief argument as to why most of the rules for making instantaneous feedback connections [J. Gough and M. R. James, Commun. Math. Phys. 287, 1109 (2009)] ought to apply for controlled dynamical networks as well.

Analysis of quantum semiconductor heterostructures by ballistic electron emission spectroscopy

NASA Astrophysics Data System (ADS)

Guthrie, Daniel K.

1998-09-01

The microelectronics industry is diligently working to achieve the goal of gigascale integration (GSI) by early in the 21st century. For the past twenty-five years, progress toward this goal has been made by continually scaling down device technology. Unfortunately, this trend cannot continue to the point of producing arbitrarily small device sizes. One possible solution to this problem that is currently under intensive study is the relatively new area of quantum devices. Quantum devices represent a new class of microelectronic devices that operate by utilizing the wave-like nature (reflection, refraction, and confinement) of electrons together with the laws of quantum mechanics to construct useful devices. One difficulty associated with these structures is the absence of measurement techniques that can fully characterize carrier transport in such devices. This thesis addresses this need by focusing on the study of carrier transport in quantum semiconductor heterostructures using a relatively new and versatile measurement technique known as ballistic electron emission spectroscopy (BEES). To achieve this goal, a systematic approach that encompasses a set of progressively more complex structures is utilized. First, the simplest BEES structure possible, the metal/semiconductor interface, is thoroughly investigated in order to provide a foundation for measurements on more the complex structures. By modifying the semiclassical model commonly used to describe the experimental BEES spectrum, a very complete and accurate description of the basic structure has been achieved. Next, a very simple semiconductor heterostructure, a Ga1-xAlxAs single-barrier structure, was measured and analyzed. Low-temperature measurements on this structure were used to investigate the band structure and electron-wave interference effects in the Ga1-xAlxAs single barrier structure. These measurements are extended to a simple quantum device by designing, measuring, and analyzing a set of complementary electron-wave Fabry-Perot quantum interference filters which included both a half- and a quarter-electron-wavelength resonant device. High-resolution, low noise, BEES spectra obtained on these devices at low-temperature were used to measure the zero-bias electron transmittance as a function of injected energy for these resonant devices. Finally, by analyzing BEES spectra taken at various spatial locations, one monolayer variations in the thickness of a buried quantum well have been detected.

Practical quantum private query with better performance in resisting joint-measurement attack

NASA Astrophysics Data System (ADS)

Wei, Chun-Yan; Wang, Tian-Yin; Gao, Fei

2016-04-01

As a kind of practical protocol, quantum-key-distribution (QKD)-based quantum private queries (QPQs) have drawn lots of attention. However, joint-measurement (JM) attack poses a noticeable threat to the database security in such protocols. That is, by JM attack a malicious user can illegally elicit many more items from the database than the average amount an honest one can obtain. Taking Jacobi et al.'s protocol as an example, by JM attack a malicious user can obtain as many as 500 bits, instead of the expected 2.44 bits, from a 104-bit database in one query. It is a noticeable security flaw in theory, and would also arise in application with the development of quantum memories. To solve this problem, we propose a QPQ protocol based on a two-way QKD scheme, which behaves much better in resisting JM attack. Concretely, the user Alice cannot get more database items by conducting JM attack on the qubits because she has to send them back to Bob (the database holder) before knowing which of them should be jointly measured. Furthermore, JM attack by both Alice and Bob would be detected with certain probability, which is quite different from previous protocols. Moreover, our protocol retains the good characters of QKD-based QPQs, e.g., it is loss tolerant and robust against quantum memory attack.

Single-photon quantum key distribution in the presence of loss

NASA Astrophysics Data System (ADS)

Curty, Marcos; Moroder, Tobias

2007-05-01

We investigate two-way and one-way single-photon quantum key distribution (QKD) protocols in the presence of loss introduced by the quantum channel. Our analysis is based on a simple precondition for secure QKD in each case. In particular, the legitimate users need to prove that there exists no separable state (in the case of two-way QKD), or that there exists no quantum state having a symmetric extension (one-way QKD), that is compatible with the available measurements results. We show that both criteria can be formulated as a convex optimization problem known as a semidefinite program, which can be efficiently solved. Moreover, we prove that the solution to the dual optimization corresponds to the evaluation of an optimal witness operator that belongs to the minimal verification set of them for the given two-way (or one-way) QKD protocol. A positive expectation value of this optimal witness operator states that no secret key can be distilled from the available measurements results. We apply such analysis to several well-known single-photon QKD protocols under losses.

Quantum biological channel modeling and capacity calculation.

PubMed

Djordjevic, Ivan B

2012-12-10

Quantum mechanics has an important role in photosynthesis, magnetoreception, and evolution. There were many attempts in an effort to explain the structure of genetic code and transfer of information from DNA to protein by using the concepts of quantum mechanics. The existing biological quantum channel models are not sufficiently general to incorporate all relevant contributions responsible for imperfect protein synthesis. Moreover, the problem of determination of quantum biological channel capacity is still an open problem. To solve these problems, we construct the operator-sum representation of biological channel based on codon basekets (basis vectors), and determine the quantum channel model suitable for study of the quantum biological channel capacity and beyond. The transcription process, DNA point mutations, insertions, deletions, and translation are interpreted as the quantum noise processes. The various types of quantum errors are classified into several broad categories: (i) storage errors that occur in DNA itself as it represents an imperfect storage of genetic information, (ii) replication errors introduced during DNA replication process, (iii) transcription errors introduced during DNA to mRNA transcription, and (iv) translation errors introduced during the translation process. By using this model, we determine the biological quantum channel capacity and compare it against corresponding classical biological channel capacity. We demonstrate that the quantum biological channel capacity is higher than the classical one, for a coherent quantum channel model, suggesting that quantum effects have an important role in biological systems. The proposed model is of crucial importance towards future study of quantum DNA error correction, developing quantum mechanical model of aging, developing the quantum mechanical models for tumors/cancer, and study of intracellular dynamics in general.

An approach to quantum-computational hydrologic inverse analysis

DOE PAGES

O'Malley, Daniel

2018-05-02

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealermore » to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.« less

An approach to quantum-computational hydrologic inverse analysis.

PubMed

O'Malley, Daniel

2018-05-02

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealer to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.

An approach to quantum-computational hydrologic inverse analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

O'Malley, Daniel

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealermore » to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.« less

Quantum digital-to-analog conversion algorithm using decoherence

NASA Astrophysics Data System (ADS)

SaiToh, Akira

2015-08-01

We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.

A different Deutsch-Jozsa

NASA Astrophysics Data System (ADS)

Bera, Debajyoti

2015-06-01

One of the early achievements of quantum computing was demonstrated by Deutsch and Jozsa (Proc R Soc Lond A Math Phys Sci 439(1907):553, 1992) regarding classification of a particular type of Boolean functions. Their solution demonstrated an exponential speedup compared to classical approaches to the same problem; however, their solution was the only known quantum algorithm for that specific problem so far. This paper demonstrates another quantum algorithm for the same problem, with the same exponential advantage compared to classical algorithms. The novelty of this algorithm is the use of quantum amplitude amplification, a technique that is the key component of another celebrated quantum algorithm developed by Grover (Proceedings of the twenty-eighth annual ACM symposium on theory of computing, ACM Press, New York, 1996). A lower bound for randomized (classical) algorithms is also presented which establishes a sound gap between the effectiveness of our quantum algorithm and that of any randomized algorithm with similar efficiency.

Computer Series, 86. Bits and Pieces, 35.

ERIC Educational Resources Information Center

Moore, John W., Ed.

1987-01-01

Describes eight applications of the use of computers in teaching chemistry. Includes discussions of audio frequency measurements of heat capacity ratios, quantum mechanics, ab initio calculations, problem solving using spreadsheets, simplex optimization, faradaic impedance diagrams, and the recording and tabulation of student laboratory data. (TW)

The Fermionic Projector, entanglement and the collapse of the wave function

NASA Astrophysics Data System (ADS)

Finster, Felix

2011-07-01

After a brief introduction to the fermionic projector approach, we review how entanglement and second quantized bosonic and fermionic fields can be described in this framework. The constructions are discussed with regard to decoherence phenomena and the measurement problem. We propose a mechanism leading to the collapse of the wave function in the quantum mechanical measurement process.

Origin of probabilities and their application to the multiverse

NASA Astrophysics Data System (ADS)

Albrecht, Andreas; Phillips, Daniel

2014-12-01

We argue using simple models that all successful practical uses of probabilities originate in quantum fluctuations in the microscopic physical world around us, often propagated to macroscopic scales. Thus we claim there is no physically verified fully classical theory of probability. We comment on the general implications of this view, and specifically question the application of purely classical probabilities to cosmology in cases where key questions are known to have no quantum answer. We argue that the ideas developed here may offer a way out of the notorious measure problems of eternal inflation.

Quantum reinforcement learning.

PubMed

Dong, Daoyi; Chen, Chunlin; Li, Hanxiong; Tarn, Tzyh-Jong

2008-10-01

The key approaches for machine learning, particularly learning in unknown probabilistic environments, are new representations and computation mechanisms. In this paper, a novel quantum reinforcement learning (QRL) method is proposed by combining quantum theory and reinforcement learning (RL). Inspired by the state superposition principle and quantum parallelism, a framework of a value-updating algorithm is introduced. The state (action) in traditional RL is identified as the eigen state (eigen action) in QRL. The state (action) set can be represented with a quantum superposition state, and the eigen state (eigen action) can be obtained by randomly observing the simulated quantum state according to the collapse postulate of quantum measurement. The probability of the eigen action is determined by the probability amplitude, which is updated in parallel according to rewards. Some related characteristics of QRL such as convergence, optimality, and balancing between exploration and exploitation are also analyzed, which shows that this approach makes a good tradeoff between exploration and exploitation using the probability amplitude and can speedup learning through the quantum parallelism. To evaluate the performance and practicability of QRL, several simulated experiments are given, and the results demonstrate the effectiveness and superiority of the QRL algorithm for some complex problems. This paper is also an effective exploration on the application of quantum computation to artificial intelligence.

String theory, quantum phase transitions, and the emergent Fermi liquid.

PubMed

Cubrović, Mihailo; Zaanen, Jan; Schalm, Koenraad

2009-07-24

A central problem in quantum condensed matter physics is the critical theory governing the zero-temperature quantum phase transition between strongly renormalized Fermi liquids as found in heavy fermion intermetallics and possibly in high-critical temperature superconductors. We found that the mathematics of string theory is capable of describing such fermionic quantum critical states. Using the anti-de Sitter/conformal field theory correspondence to relate fermionic quantum critical fields to a gravitational problem, we computed the spectral functions of fermions in the field theory. By increasing the fermion density away from the relativistic quantum critical point, a state emerges with all the features of the Fermi liquid.

Optimal quantum cloning based on the maximin principle by using a priori information

NASA Astrophysics Data System (ADS)

Kang, Peng; Dai, Hong-Yi; Wei, Jia-Hua; Zhang, Ming

2016-10-01

We propose an optimal 1 →2 quantum cloning method based on the maximin principle by making full use of a priori information of amplitude and phase about the general cloned qubit input set, which is a simply connected region enclosed by a "longitude-latitude grid" on the Bloch sphere. Theoretically, the fidelity of the optimal quantum cloning machine derived from this method is the largest in terms of the maximin principle compared with that of any other machine. The problem solving is an optimization process that involves six unknown complex variables, six vectors in an uncertain-dimensional complex vector space, and four equality constraints. Moreover, by restricting the structure of the quantum cloning machine, the optimization problem is simplified as a three-real-parameter suboptimization problem with only one equality constraint. We obtain the explicit formula for a suboptimal quantum cloning machine. Additionally, the fidelity of our suboptimal quantum cloning machine is higher than or at least equal to that of universal quantum cloning machines and phase-covariant quantum cloning machines. It is also underlined that the suboptimal cloning machine outperforms the "belt quantum cloning machine" for some cases.

Quantum Metropolis sampling.

PubMed

Temme, K; Osborne, T J; Vollbrecht, K G; Poulin, D; Verstraete, F

2011-03-03

The original motivation to build a quantum computer came from Feynman, who imagined a machine capable of simulating generic quantum mechanical systems--a task that is believed to be intractable for classical computers. Such a machine could have far-reaching applications in the simulation of many-body quantum physics in condensed-matter, chemical and high-energy systems. Part of Feynman's challenge was met by Lloyd, who showed how to approximately decompose the time evolution operator of interacting quantum particles into a short sequence of elementary gates, suitable for operation on a quantum computer. However, this left open the problem of how to simulate the equilibrium and static properties of quantum systems. This requires the preparation of ground and Gibbs states on a quantum computer. For classical systems, this problem is solved by the ubiquitous Metropolis algorithm, a method that has basically acquired a monopoly on the simulation of interacting particles. Here we demonstrate how to implement a quantum version of the Metropolis algorithm. This algorithm permits sampling directly from the eigenstates of the Hamiltonian, and thus evades the sign problem present in classical simulations. A small-scale implementation of this algorithm should be achievable with today's technology.

Some Thoughts Regarding Practical Quantum Computing

NASA Astrophysics Data System (ADS)

Ghoshal, Debabrata; Gomez, Richard; Lanzagorta, Marco; Uhlmann, Jeffrey

2006-03-01

Quantum computing has become an important area of research in computer science because of its potential to provide more efficient algorithmic solutions to certain problems than are possible with classical computing. The ability of performing parallel operations over an exponentially large computational space has proved to be the main advantage of the quantum computing model. In this regard, we are particularly interested in the potential applications of quantum computers to enhance real software systems of interest to the defense, industrial, scientific and financial communities. However, while much has been written in popular and scientific literature about the benefits of the quantum computational model, several of the problems associated to the practical implementation of real-life complex software systems in quantum computers are often ignored. In this presentation we will argue that practical quantum computation is not as straightforward as commonly advertised, even if the technological problems associated to the manufacturing and engineering of large-scale quantum registers were solved overnight. We will discuss some of the frequently overlooked difficulties that plague quantum computing in the areas of memories, I/O, addressing schemes, compilers, oracles, approximate information copying, logical debugging, error correction and fault-tolerant computing protocols.

Towards a heralded eigenstate-preserving measurement of multi-qubit parity in circuit QED

NASA Astrophysics Data System (ADS)

Huembeli, Patrick; Nigg, Simon E.

2017-07-01

Eigenstate-preserving multi-qubit parity measurements lie at the heart of stabilizer quantum error correction, which is a promising approach to mitigate the problem of decoherence in quantum computers. In this work we explore a high-fidelity, eigenstate-preserving parity readout for superconducting qubits dispersively coupled to a microwave resonator, where the parity bit is encoded in the amplitude of a coherent state of the resonator. Detecting photons emitted by the resonator via a current biased Josephson junction yields information about the parity bit. We analyze theoretically the measurement back action in the limit of a strongly coupled fast detector and show that in general such a parity measurement, while approximately quantum nondemolition is not eigenstate preserving. To remediate this shortcoming we propose a simple dynamical decoupling technique during photon detection, which greatly reduces decoherence within a given parity subspace. Furthermore, by applying a sequence of fast displacement operations interleaved with the dynamical decoupling pulses, the natural bias of this binary detector can be efficiently suppressed. Finally, we introduce the concept of a heralded parity measurement, where a detector click guarantees successful multi-qubit parity detection even for finite detection efficiency.

Beyond the Quantum

NASA Astrophysics Data System (ADS)

Nieuwenhuizen, Theo M.; Mehmani, Bahar; Špička, Václav; Aghdami, Maryam J.; Khrennikov, Andrei Yu

2007-09-01

pt. A. Introductions. The mathematical basis for deterministic quantum mechanics / G.'t Hooft. What did we learn from quantum gravity? / A. Ashtekar. Bose-Einstein condensates and EPR quantum non-locality / F. Laloe. The quantum measurement process: lessons from an exactly solvable model / A.E. Allahverdyan, R. Balian and Th. M. Nieuwenhuizen -- pt. B. Quantum mechanics and quantum information. POVMs: a small but important step beyond standard quantum mechanics / W. M. de Muynck. State reduction by measurements with a null result / G. Nienhuis. Solving open questions in the Bose-Einstein condensation of an ideal gas via a hybrid mixture of laser and statistical physics / M. Kim, A. Svidzinsky and M.O. Scully. Twin-Photon light scattering and causality / G. Puentes, A. Aiello and J. P. Woerdman. Simultaneous measurement of non-commuting observables / G. Aquino and B. Mehmani. Quantum decoherence and gravitational waves / M.T. Jaekel ... [et al.]. Role of various entropies in the black hole information loss problem / Th. M. Nieuwenhuizen and I.V. Volovich. Quantum and super-quantum correlations / G.S. Jaeger -- pt. C. Long distance correlations and bell inequalities. Understanding long-distance quantum correlations / L. Marchildon. Connection of probability models to EPR experiments: probability spaces and Bell's theorem / K. Hess and W. Philipp. Fair sampling vs no-signalling principle in EPR experiments / G. Adenier and A. Yu. Khrennikov -- pt. D. Mathematical foundations. Where the mathematical structure of quantum mechanics comes from / G.M. D'Ariano. Phase space description of quantum mechanics and non-commutative geometry: Wigner-Moyal and Bohm in a wider context / B.J. Hiley. Quantum mechanics as simple algorithm for approximation of classical integrals / A. Yu. Khrennikov. Noncommutative quantum mechanics viewed from Feynman Formalism / J. Lages ... [et al.]. Beyond the quantum in Snyder space / J.F.S. van Huele and M. K. Transtrum -- pt. E. Stochastic electrodynamics. Some quantum experiments from the point of view of Stochastic electrodynamics / V. Spicka ... [et al.]. On the ergodic behaviour of atomic systems under the action of the zero-point radiation field / L. De La Peña and A. M. Cetto. Inertia and the vacuum-view on the emergence of the inertia reaction force / A. Rueda and H. Sunahata -- pt. F. Models for the electron. Rotating Hopf-Kinks: oscillators in the sense of de Broglie / U. Enz. Kerr-Newman particles: symmetries and other properties / H.I. Arcos and J.G. Pereira. Kerr geometry beyond the quantum theory / Th. M. Nieuwenhuizen -- pt. G. Philosophical considerations. Probability in non-collapse interpretations of a quantum mechanics / D. Dieks. The Schrödinger-Park paradox about the concept of "State" in quantum statistical mechanics and quantum information theory is still open: one more reason to go beyond? / G.P. Beretta. The conjecture that local realism is possible / E. Santos -- pt. H. The round table. Round table discussion / A.M. Cetto ... [et al.].

Quantum mechanics and hidden superconformal symmetry

NASA Astrophysics Data System (ADS)

Bonezzi, R.; Corradini, O.; Latini, E.; Waldron, A.

2017-12-01

Solvability of the ubiquitous quantum harmonic oscillator relies on a spectrum generating osp (1 |2 ) superconformal symmetry. We study the problem of constructing all quantum mechanical models with a hidden osp (1 |2 ) symmetry on a given space of states. This problem stems from interacting higher spin models coupled to gravity. In one dimension, we show that the solution to this problem is the Vasiliev-Plyushchay family of quantum mechanical models with hidden superconformal symmetry obtained by viewing the harmonic oscillator as a one dimensional Dirac system, so that Grassmann parity equals wave function parity. These models—both oscillator and particlelike—realize all possible unitary irreducible representations of osp (1 |2 ).

Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems

NASA Astrophysics Data System (ADS)

Mandrà, Salvatore; Giacomo Guerreschi, Gian; Aspuru-Guzik, Alán

2016-07-01

We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists in the identification and efficient characterization of a restricted subspace that contains all the valid assignments of the Exact Satisfiability; while the second part performs a quantum search in such restricted subspace. The quantum algorithm can be used either to find a valid assignment (or to certify that no solution exists) or to count the total number of valid assignments. The query complexities for the worst-case are respectively bounded by O(\\sqrt{{2}n-{M\\prime }}) and O({2}n-{M\\prime }), where n is the number of variables and {M}\\prime the number of linearly independent clauses. Remarkably, the proposed quantum algorithm results to be faster than any known exact classical algorithm to solve dense formulas of Exact Satisfiability. As a concrete application, we provide the worst-case complexity for the Hamiltonian cycle problem obtained after mapping it to a suitable Occupation problem. Specifically, we show that the time complexity for the proposed quantum algorithm is bounded by O({2}n/4) for 3-regular undirected graphs, where n is the number of nodes. The same worst-case complexity holds for (3,3)-regular bipartite graphs. As a reference, the current best classical algorithm has a (worst-case) running time bounded by O({2}31n/96). Finally, when compared to heuristic techniques for Exact Satisfiability problems, the proposed quantum algorithm is faster than the classical WalkSAT and Adiabatic Quantum Optimization for random instances with a density of constraints close to the satisfiability threshold, the regime in which instances are typically the hardest to solve. The proposed quantum algorithm can be straightforwardly extended to the generalized version of the Exact Satisfiability known as Occupation problem. The general version of the algorithm is presented and analyzed.

Ballistic One-Dimensional InAs Nanowire Cross-Junction Interconnects.

PubMed

Gooth, Johannes; Borg, Mattias; Schmid, Heinz; Schaller, Vanessa; Wirths, Stephan; Moselund, Kirsten; Luisier, Mathieu; Karg, Siegfried; Riel, Heike

2017-04-12

Coherent interconnection of quantum bits remains an ongoing challenge in quantum information technology. Envisioned hardware to achieve this goal is based on semiconductor nanowire (NW) circuits, comprising individual NW devices that are linked through ballistic interconnects. However, maintaining the sensitive ballistic conduction and confinement conditions across NW intersections is a nontrivial problem. Here, we go beyond the characterization of a single NW device and demonstrate ballistic one-dimensional (1D) quantum transport in InAs NW cross-junctions, monolithically integrated on Si. Characteristic 1D conductance plateaus are resolved in field-effect measurements across up to four NW-junctions in series. The 1D ballistic transport and sub-band splitting is preserved for both crossing-directions. We show that the 1D modes of a single injection terminal can be distributed into multiple NW branches. We believe that NW cross-junctions are well-suited as cross-directional communication links for the reliable transfer of quantum information as required for quantum computational systems.

Method for universal detection of two-photon polarization entanglement

NASA Astrophysics Data System (ADS)

Bartkiewicz, Karol; Horodecki, Paweł; Lemr, Karel; Miranowicz, Adam; Życzkowski, Karol

2015-03-01

Detecting and quantifying quantum entanglement of a given unknown state poses problems that are fundamentally important for quantum information processing. Surprisingly, no direct (i.e., without quantum tomography) universal experimental implementation of a necessary and sufficient test of entanglement has been designed even for a general two-qubit state. Here we propose an experimental method for detecting a collective universal witness, which is a necessary and sufficient test of two-photon polarization entanglement. It allows us to detect entanglement for any two-qubit mixed state and to establish tight upper and lower bounds on its amount. A different element of this method is the sequential character of its main components, which allows us to obtain relatively complicated information about quantum correlations with the help of simple linear-optical elements. As such, this proposal realizes a universal two-qubit entanglement test within the present state of the art of quantum optics. We show the optimality of our setup with respect to the minimal number of measured quantities.

Enhancing multi-step quantum state tomography by PhaseLift

NASA Astrophysics Data System (ADS)

Lu, Yiping; Zhao, Qing

2017-09-01

Multi-photon system has been studied by many groups, however the biggest challenge faced is the number of copies of an unknown state are limited and far from detecting quantum entanglement. The difficulty to prepare copies of the state is even more serious for the quantum state tomography. One possible way to solve this problem is to use adaptive quantum state tomography, which means to get a preliminary density matrix in the first step and revise it in the second step. In order to improve the performance of adaptive quantum state tomography, we develop a new distribution scheme of samples and extend it to three steps, that is to correct it once again based on the density matrix obtained in the traditional adaptive quantum state tomography. Our numerical results show that the mean square error of the reconstructed density matrix by our new method is improved to the level from 10-4 to 10-9 for several tested states. In addition, PhaseLift is also applied to reduce the required storage space of measurement operator.

Quantum annealing correction with minor embedding

NASA Astrophysics Data System (ADS)

Vinci, Walter; Albash, Tameem; Paz-Silva, Gerardo; Hen, Itay; Lidar, Daniel A.

2015-10-01

Quantum annealing provides a promising route for the development of quantum optimization devices, but the usefulness of such devices will be limited in part by the range of implementable problems as dictated by hardware constraints. To overcome constraints imposed by restricted connectivity between qubits, a larger set of interactions can be approximated using minor embedding techniques whereby several physical qubits are used to represent a single logical qubit. However, minor embedding introduces new types of errors due to its approximate nature. We introduce and study quantum annealing correction schemes designed to improve the performance of quantum annealers in conjunction with minor embedding, thus leading to a hybrid scheme defined over an encoded graph. We argue that this scheme can be efficiently decoded using an energy minimization technique provided the density of errors does not exceed the per-site percolation threshold of the encoded graph. We test the hybrid scheme using a D-Wave Two processor on problems for which the encoded graph is a two-level grid and the Ising model is known to be NP-hard. The problems we consider are frustrated Ising model problem instances with "planted" (a priori known) solutions. Applied in conjunction with optimized energy penalties and decoding techniques, we find that this approach enables the quantum annealer to solve minor embedded instances with significantly higher success probability than it would without error correction. Our work demonstrates that quantum annealing correction can and should be used to improve the robustness of quantum annealing not only for natively embeddable problems but also when minor embedding is used to extend the connectivity of physical devices.

Quantum probability and Hilbert's sixth problem

NASA Astrophysics Data System (ADS)

Accardi, Luigi

2018-04-01

With the birth of quantum mechanics, the two disciplines that Hilbert proposed to axiomatize, probability and mechanics, became entangled and a new probabilistic model arose in addition to the classical one. Thus, to meet Hilbert's challenge, an axiomatization should account deductively for the basic features of all three disciplines. This goal was achieved within the framework of quantum probability. The present paper surveys the quantum probabilistic axiomatization. This article is part of the themed issue `Hilbert's sixth problem'.

A blueprint for demonstrating quantum supremacy with superconducting qubits.

PubMed

Neill, C; Roushan, P; Kechedzhi, K; Boixo, S; Isakov, S V; Smelyanskiy, V; Megrant, A; Chiaro, B; Dunsworth, A; Arya, K; Barends, R; Burkett, B; Chen, Y; Chen, Z; Fowler, A; Foxen, B; Giustina, M; Graff, R; Jeffrey, E; Huang, T; Kelly, J; Klimov, P; Lucero, E; Mutus, J; Neeley, M; Quintana, C; Sank, D; Vainsencher, A; Wenner, J; White, T C; Neven, H; Martinis, J M

2018-04-13

A key step toward demonstrating a quantum system that can address difficult problems in physics and chemistry will be performing a computation beyond the capabilities of any classical computer, thus achieving so-called quantum supremacy. In this study, we used nine superconducting qubits to demonstrate a promising path toward quantum supremacy. By individually tuning the qubit parameters, we were able to generate thousands of distinct Hamiltonian evolutions and probe the output probabilities. The measured probabilities obey a universal distribution, consistent with uniformly sampling the full Hilbert space. As the number of qubits increases, the system continues to explore the exponentially growing number of states. Extending these results to a system of 50 qubits has the potential to address scientific questions that are beyond the capabilities of any classical computer. Copyright © 2018 The Authors, some rights reserved; exclusive licensee American Association for the Advancement of Science. No claim to original U.S. Government Works.

Path-integral Monte Carlo method for Rényi entanglement entropies.

PubMed

Herdman, C M; Inglis, Stephen; Roy, P-N; Melko, R G; Del Maestro, A

2014-07-01

We introduce a quantum Monte Carlo algorithm to measure the Rényi entanglement entropies in systems of interacting bosons in the continuum. This approach is based on a path-integral ground state method that can be applied to interacting itinerant bosons in any spatial dimension with direct relevance to experimental systems of quantum fluids. We demonstrate how it may be used to compute spatial mode entanglement, particle partitioned entanglement, and the entanglement of particles, providing insights into quantum correlations generated by fluctuations, indistinguishability, and interactions. We present proof-of-principle calculations and benchmark against an exactly soluble model of interacting bosons in one spatial dimension. As this algorithm retains the fundamental polynomial scaling of quantum Monte Carlo when applied to sign-problem-free models, future applications should allow for the study of entanglement entropy in large-scale many-body systems of interacting bosons.

Quantum Mechanics, Pattern Recognition, and the Mammalian Brain

NASA Astrophysics Data System (ADS)

Chapline, George

2008-10-01

Although the usual way of representing Markov processes is time asymmetric, there is a way of describing Markov processes, due to Schrodinger, which is time symmetric. This observation provides a link between quantum mechanics and the layered Bayesian networks that are often used in automated pattern recognition systems. In particular, there is a striking formal similarity between quantum mechanics and a particular type of Bayesian network, the Helmholtz machine, which provides a plausible model for how the mammalian brain recognizes important environmental situations. One interesting aspect of this relationship is that the "wake-sleep" algorithm for training a Helmholtz machine is very similar to the problem of finding the potential for the multi-channel Schrodinger equation. As a practical application of this insight it may be possible to use inverse scattering techniques to study the relationship between human brain wave patterns, pattern recognition, and learning. We also comment on whether there is a relationship between quantum measurements and consciousness.

Dynamical control of a quantum Kapitza pendulum in a spin-1 BEC

NASA Astrophysics Data System (ADS)

Hoang, Thai; Gerving, Corey; Land, Ben; Anquez, Martin; Hamley, Chris; Chapman, Michael

2013-05-01

We demonstrate dynamic stabilization of an unstable strongly interacting quantum many-body system by periodic manipulation of the phase of the collective states. The experiment employs a spin-1 atomic Bose condensate that has spin dynamics analogous to a non-rigid pendulum in the mean-field limit. The condensate spin is initialized to an unstable (hyperbolic) fixed point of the phase space, where subsequent free evolution gives rise to spin-nematic squeezing and quantum spin mixing. To stabilize the system, periodic microwave pulses are applied that manipulate the spin-nematic fluctuations and limit their growth. The range of pulse periods and phase shifts with which the condensate can be stabilized is measured and compares well with a linear stability analysis of the problem. C.D. Hamley, et al., ``Spin-Nematic Squeezed Vacuum in a Quantum Gas,'' Nature Physics 8, 305-308 (2012).

Interpretations of quantum mechanics, joint measurement of incompatible observables, and counterfactual definiteness

NASA Astrophysics Data System (ADS)

de Muynck, W. M.; de Baere, W.; Martens, H.

1994-12-01

The validity of the conclusion to the nonlocality of quantum mechanics, accepted widely today as the only reasonable solution to the EPR and Bell issues, is questioned and criticized. Arguments are presented which remove the compelling character of this conclusion and make clear that it is not the most obvious solution. Alternative solutions are developed which are free of the contradictions related with the nonlocality conclusion. Firstly, the dependence on the adopted interpretation is shown, with the conclusion that the alleged nonlocality property of the quantum formalism may have been reached on the basis of an interpretation that is unnecessarily restrictive. Secondly, by extending the conventional quantum formalism along the lines of Ludwig and Davies it is shown that the Bell problem may be related to complementarity rather than to nonlocality. Finally, the dependence on counterfactual reasoning is critically examined. It appears that locality on the quantum level may still be retained provided one accepts a newly proposed principle of nonreproducibility at the individual quantum level as an alternative of quantum nonlocality. It is concluded that the locality principle can retain its general validity, in full conformity with all experimental data.

Interpretations of quantum mechanics, joint measurement of incompatible observables, and counterfactual definiteness

DOE Office of Scientific and Technical Information (OSTI.GOV)

Muynck, W.M. de; Martens, H.; De Baere, W.

1994-12-01

The validity of the conclusion to the nonlocality of quantum mechanics, accepted widely today as the only reasonable solution to the EPR and Bell issues, is questioned and criticized. Arguments are presented which remove the compelling character of this conclusion and make clear that it is not the most obvious solution. Alternative solutions are developed which are free of the contradictions related with the nonlocality conclusion. Firstly, the dependence on the adopted interpretation is shown, with the conclusion that the alleged nonlocality property of the quantum formalism may have been reached on the basis of an interpretation that is unnecessarilymore » restrictive. Secondly, by extending the conventional quantum formalism along the lines of Ludwig and Davies it is shown that the Bell problem may be related to complementarity rather than to nonlocality. Finally, the dependence on counterfactual reasoning is critically examined. It appears that locality on the quantum level may still be retained provided one accepts a newly proposed principle of nonreproducibility at the individual quantum level as an alternative of quantum nonlocality. It is concluded that the locality principle can retain its general validity, in full conformity with all experimental data.« less

Boltzmann babies in the proper time measure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bousso, Raphael; Freivogel, Ben; Yang, I-S.

2008-05-15

After commenting briefly on the role of the typicality assumption in science, we advocate a phenomenological approach to the cosmological measure problem. Like any other theory, a measure should be simple, general, well defined, and consistent with observation. This allows us to proceed by elimination. As an example, we consider the proper time cutoff on a geodesic congruence. It predicts that typical observers are quantum fluctuations in the early universe, or Boltzmann babies. We sharpen this well-known youngness problem by taking into account the expansion and open spatial geometry of pocket universes. Moreover, we relate the youngness problem directly tomore » the probability distribution for observables, such as the temperature of the cosmic background radiation. We consider a number of modifications of the proper time measure, but find none that would make it compatible with observation.« less

Boltzmann babies in the proper time measure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bousso, Raphael; Bousso, Raphael; Freivogel, Ben

After commenting briefly on the role of the typicality assumption in science, we advocate a phenomenological approach to the cosmological measure problem. Like any other theory, a measure should be simple, general, well defined, and consistent with observation. This allows us to proceed by elimination. As an example, we consider the proper time cutoff on a geodesic congruence. It predicts that typical observers are quantum fluctuations in the early universe, or Boltzmann babies. We sharpen this well-known youngness problem by taking into account the expansion and open spatial geometry of pocket universes. Moreover, we relate the youngness problem directly tomore » the probability distribution for observables, such as the temperature of the cosmic background radiation. We consider a number of modifications of the proper time measure, but find none that would make it compatible with observation.« less

Relativistic particle in a box: Klein-Gordon versus Dirac equations

NASA Astrophysics Data System (ADS)

Alberto, Pedro; Das, Saurya; Vagenas, Elias C.

2018-03-01

The problem of a particle in a box is probably the simplest problem in quantum mechanics which allows for significant insight into the nature of quantum systems and thus is a cornerstone in the teaching of quantum mechanics. In relativistic quantum mechanics this problem allows also to highlight the implications of special relativity for quantum physics, namely the effect that spin has on the quantised energy spectra. To illustrate this point, we solve the problem of a spin zero relativistic particle in a one- and three-dimensional box using the Klein-Gordon equation in the Feshbach-Villars formalism. We compare the solutions and the energy spectra obtained with the corresponding ones from the Dirac equation for a spin one-half relativistic particle. We note the similarities and differences, in particular the spin effects in the relativistic energy spectrum. As expected, the non-relativistic limit is the same for both kinds of particles, since, for a particle in a box, the spin contribution to the energy is a relativistic effect.

Robust quantum optimizer with full connectivity

PubMed Central

Nigg, Simon E.; Lörch, Niels; Tiwari, Rakesh P.

2017-01-01

Quantum phenomena have the potential to speed up the solution of hard optimization problems. For example, quantum annealing, based on the quantum tunneling effect, has recently been shown to scale exponentially better with system size than classical simulated annealing. However, current realizations of quantum annealers with superconducting qubits face two major challenges. First, the connectivity between the qubits is limited, excluding many optimization problems from a direct implementation. Second, decoherence degrades the success probability of the optimization. We address both of these shortcomings and propose an architecture in which the qubits are robustly encoded in continuous variable degrees of freedom. By leveraging the phenomenon of flux quantization, all-to-all connectivity with sufficient tunability to implement many relevant optimization problems is obtained without overhead. Furthermore, we demonstrate the robustness of this architecture by simulating the optimal solution of a small instance of the nondeterministic polynomial-time hard (NP-hard) and fully connected number partitioning problem in the presence of dissipation. PMID:28435880

Experimental quantum annealing: case study involving the graph isomorphism problem.

PubMed

Zick, Kenneth M; Shehab, Omar; French, Matthew

2015-06-08

Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is known about how to partition and optimize the processing. This article presents an experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem. To illustrate the role of classical pre-processing, a compact Hamiltonian is presented that enables a reduced Ising model for each problem instance. On random N-vertex graphs, the median number of variables is reduced from N(2) to fewer than N log2 N and solvable graph sizes increase from N = 5 to N = 13. Additionally, error correction via classical post-processing majority voting is evaluated. While the solution times are not competitive with classical approaches to graph isomorphism, the enhanced solver ultimately classified correctly every problem that was mapped to the processor and demonstrated clear advantages over the baseline approach. The results shed some light on the nature of real-world quantum annealing and the associated hybrid classical-quantum solvers.

Experimental quantum annealing: case study involving the graph isomorphism problem

PubMed Central

Zick, Kenneth M.; Shehab, Omar; French, Matthew

2015-01-01

Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is known about how to partition and optimize the processing. This article presents an experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem. To illustrate the role of classical pre-processing, a compact Hamiltonian is presented that enables a reduced Ising model for each problem instance. On random N-vertex graphs, the median number of variables is reduced from N2 to fewer than N log2 N and solvable graph sizes increase from N = 5 to N = 13. Additionally, error correction via classical post-processing majority voting is evaluated. While the solution times are not competitive with classical approaches to graph isomorphism, the enhanced solver ultimately classified correctly every problem that was mapped to the processor and demonstrated clear advantages over the baseline approach. The results shed some light on the nature of real-world quantum annealing and the associated hybrid classical-quantum solvers. PMID:26053973

Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces

NASA Astrophysics Data System (ADS)

Neukart, Florian; Von Dollen, David; Seidel, Christian; Compostella, Gabriele

2017-12-01

Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum annealing machines produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. Here, we present a way to partially embed both Monte Carlo policy iteration for finding an optimal policy on random observations, as well as how to embed n sub-optimal state-value functions for approximating an improved state-value function given a policy for finite horizon games with discrete state spaces on a D-Wave 2000Q quantum processing unit (QPU). We explain how both problems can be expressed as a quadratic unconstrained binary optimization (QUBO) problem, and show that quantum-enhanced Monte Carlo policy evaluation allows for finding equivalent or better state-value functions for a given policy with the same number episodes compared to a purely classical Monte Carlo algorithm. Additionally, we describe a quantum-classical policy learning algorithm. Our first and foremost aim is to explain how to represent and solve parts of these problems with the help of the QPU, and not to prove supremacy over every existing classical policy evaluation algorithm.

Elucidating reaction mechanisms on quantum computers.

PubMed

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M; Wecker, Dave; Troyer, Matthias

2017-07-18

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

Elucidating reaction mechanisms on quantum computers

PubMed Central

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-01-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources. PMID:28674011

An Introduction to Multi-player, Multi-choice Quantum Games: Quantum Minority Games & Kolkata Restaurant Problems

NASA Astrophysics Data System (ADS)

Sharif, Puya; Heydari, Hoshang

We give a self contained introduction to a few quantum game protocols, starting with the quantum version of the two-player two-choice game of Prisoners dilemma, followed by an n-player generalization trough the quantum minority games, and finishing with a contribution towards an n-player m-choice generalization with a quantum version of a three-player Kolkata restaurant problem. We have omitted some technical details accompanying these protocols, and instead laid the focus on presenting some general aspects of the field as a whole. This review contains an introduction to the formalism of quantum information theory, as well as to important game theoretical concepts, and is aimed to work as a review suiting economists and game theorists with limited knowledge of quantum physics as well as to physicists with limited knowledge of game theory.

Elucidating reaction mechanisms on quantum computers

NASA Astrophysics Data System (ADS)

Reiher, Markus; Wiebe, Nathan; Svore, Krysta M.; Wecker, Dave; Troyer, Matthias

2017-07-01

With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

Performance of quantum annealing on random Ising problems implemented using the D-Wave Two

NASA Astrophysics Data System (ADS)

Wang, Zhihui; Job, Joshua; Rønnow, Troels F.; Troyer, Matthias; Lidar, Daniel A.; USC Collaboration; ETH Collaboration

2014-03-01

Detecting a possible speedup of quantum annealing compared to classical algorithms is a pressing task in experimental adiabatic quantum computing. In this talk, we discuss the performance of the D-Wave Two quantum annealing device on Ising spin glass problems. The expected time to solution for the device to solve random instances with up to 503 spins and with specified coupling ranges is evaluated while carefully addressing the issue of statistical errors. We perform a systematic comparison of the expected time to solution between the D-Wave Two and classical stochastic solvers, specifically simulated annealing, and simulated quantum annealing based on quantum Monte Carlo, and discuss the question of speedup.

Measurement contextuality is implied by macroscopic realism

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen Zeqian; Montina, A.; Perimeter Institute for Theoretical Physics, 31 Caroline Street North, Waterloo, Ontario, N2L 2Y5

2011-04-15

Ontological theories of quantum mechanics provide a realistic description of single systems by means of well-defined quantities conditioning the measurement outcomes. In order to be complete, they should also fulfill the minimal condition of macroscopic realism. Under the assumption of outcome determinism and for Hilbert space dimension greater than 2, they were all proved to be contextual for projective measurements. In recent years a generalized concept of noncontextuality was introduced that applies also to the case of outcome indeterminism and unsharp measurements. It was pointed out that the Beltrametti-Bugajski model is an example of measurement noncontextual indeterminist theory. Here wemore » provide a simple proof that this model is the only one with such a feature for projective measurements and Hilbert space dimension greater than 2. In other words, there is no extension of quantum theory providing more accurate predictions of outcomes and simultaneously preserving the minimal labeling of events through projective operators. As a corollary, noncontextuality for projective measurements implies noncontextuality for unsharp measurements. By noting that the condition of macroscopic realism requires an extension of quantum theory, unless a breaking of unitarity is invoked, we arrive at the conclusion that the only way to solve the measurement problem in the framework of an ontological theory is by relaxing the hypothesis of measurement noncontextuality in its generalized sense.« less

Strange Bedfellows: Quantum Mechanics and Data Mining

NASA Astrophysics Data System (ADS)

Weinstein, Marvin

2010-02-01

Last year, in 2008, I gave a talk titled Quantum Calisthenics. This year I am going to tell you about how the work I described then has spun off into a most unlikely direction. What I am going to talk about is how one maps the problem of finding clusters in a given data set into a problem in quantum mechanics. I will then use the tricks I described to let quantum evolution lets the clusters come together on their own.

Many worlds in perspective

NASA Astrophysics Data System (ADS)

Päs, Heinrich

2017-08-01

A minimal approach to the measurement problem and the quantum-to-classical transition assumes a universally valid quantum formalism, i.e. unitary time evolution governed by a Schrödinger-type equation. As had been pointed out long ago, in this view the measurement process can be described by decoherence which results in a ”Many-Worlds” or ”Many-Minds” scenario according to Everett and Zeh. A silent assumption for decoherence to proceed is however, that there exists incomplete information about the environment our object system gets entangled with in the measurement process. This paper addresses the question where this information is traced out and - by adopting recent approaches to model consciousness in neuroscience - argues that a rigorous interpretation results in a perspectival notion of the quantum-to-classical transition. The information that is or is not available in the consciousness of the observer is crucial for the definition of the environment (i.e. the unknown degrees of freedom in the remainder of the Universe). As such the Many-Worlds-Interpretation, while being difficult or impossible to probe in physics, may become testable in psychology.

Optimum testing of multiple hypotheses in quantum detection theory

NASA Technical Reports Server (NTRS)

Yuen, H. P.; Kennedy, R. S.; Lax, M.

1975-01-01

The problem of specifying the optimum quantum detector in multiple hypotheses testing is considered for application to optical communications. The quantum digital detection problem is formulated as a linear programming problem on an infinite-dimensional space. A necessary and sufficient condition is derived by the application of a general duality theorem specifying the optimum detector in terms of a set of linear operator equations and inequalities. Existence of the optimum quantum detector is also established. The optimality of commuting detection operators is discussed in some examples. The structure and performance of the optimal receiver are derived for the quantum detection of narrow-band coherent orthogonal and simplex signals. It is shown that modal photon counting is asymptotically optimum in the limit of a large signaling alphabet and that the capacity goes to infinity in the absence of a bandwidth limitation.

Quantum-Enhanced Machine Learning

NASA Astrophysics Data System (ADS)

Dunjko, Vedran; Taylor, Jacob M.; Briegel, Hans J.

2016-09-01

The emerging field of quantum machine learning has the potential to substantially aid in the problems and scope of artificial intelligence. This is only enhanced by recent successes in the field of classical machine learning. In this work we propose an approach for the systematic treatment of machine learning, from the perspective of quantum information. Our approach is general and covers all three main branches of machine learning: supervised, unsupervised, and reinforcement learning. While quantum improvements in supervised and unsupervised learning have been reported, reinforcement learning has received much less attention. Within our approach, we tackle the problem of quantum enhancements in reinforcement learning as well, and propose a systematic scheme for providing improvements. As an example, we show that quadratic improvements in learning efficiency, and exponential improvements in performance over limited time periods, can be obtained for a broad class of learning problems.

Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization

DOE Office of Scientific and Technical Information (OSTI.GOV)

Imam, Neena; Humble, Travis S.; McCaskey, Alex

A content-addressable memory (CAM) stores key-value associations such that the key is recalled by providing its associated value. While CAM recall is traditionally performed using recurrent neural network models, we show how to solve this problem using adiabatic quantum optimization. Our approach maps the recurrent neural network to a commercially available quantum processing unit by taking advantage of the common underlying Ising spin model. We then assess the accuracy of the quantum processor to store key-value associations by quantifying recall performance against an ensemble of problem sets. We observe that different learning rules from the neural network community influence recallmore » accuracy but performance appears to be limited by potential noise in the processor. The strong connection established between quantum processors and neural network problems supports the growing intersection of these two ideas.« less

Connes' embedding problem and winning strategies for quantum XOR games

NASA Astrophysics Data System (ADS)

Harris, Samuel J.

2017-12-01

We consider quantum XOR games, defined in the work of Regev and Vidick [ACM Trans. Comput. Theory 7, 43 (2015)], from the perspective of unitary correlations defined in the work of Harris and Paulsen [Integr. Equations Oper. Theory 89, 125 (2017)]. We show that the winning bias of a quantum XOR game in the tensor product model (respectively, the commuting model) is equal to the norm of its associated linear functional on the unitary correlation set from the appropriate model. We show that Connes' embedding problem has a positive answer if and only if every quantum XOR game has entanglement bias equal to the commuting bias. In particular, the embedding problem is equivalent to determining whether every quantum XOR game G with a winning strategy in the commuting model also has a winning strategy in the approximate finite-dimensional model.

Niels Bohr as philosopher of experiment: Does decoherence theory challenge Bohr's doctrine of classical concepts?

NASA Astrophysics Data System (ADS)

Camilleri, Kristian; Schlosshauer, Maximilian

2015-02-01

Niels Bohr's doctrine of the primacy of "classical concepts" is arguably his most criticized and misunderstood view. We present a new, careful historical analysis that makes clear that Bohr's doctrine was primarily an epistemological thesis, derived from his understanding of the functional role of experiment. A hitherto largely overlooked disagreement between Bohr and Heisenberg about the movability of the "cut" between measuring apparatus and observed quantum system supports the view that, for Bohr, such a cut did not originate in dynamical (ontological) considerations, but rather in functional (epistemological) considerations. As such, both the motivation and the target of Bohr's doctrine of classical concepts are of a fundamentally different nature than what is understood as the dynamical problem of the quantum-to-classical transition. Our analysis suggests that, contrary to claims often found in the literature, Bohr's doctrine is not, and cannot be, at odds with proposed solutions to the dynamical problem of the quantum-classical transition that were pursued by several of Bohr's followers and culminated in the development of decoherence theory.

Semiclassical approach to finite-temperature quantum annealing with trapped ions

NASA Astrophysics Data System (ADS)

Raventós, David; Graß, Tobias; Juliá-Díaz, Bruno; Lewenstein, Maciej

2018-05-01

Recently it has been demonstrated that an ensemble of trapped ions may serve as a quantum annealer for the number-partitioning problem [Nat. Commun. 7, 11524 (2016), 10.1038/ncomms11524]. This hard computational problem may be addressed by employing a tunable spin-glass architecture. Following the proposal of the trapped-ion annealer, we study here its robustness against thermal effects; that is, we investigate the role played by thermal phonons. For the efficient description of the system, we use a semiclassical approach, and benchmark it against the exact quantum evolution. The aim is to understand better and characterize how the quantum device approaches a solution of an otherwise difficult to solve NP-hard problem.

Closed-Loop and Robust Control of Quantum Systems

PubMed Central

Wang, Lin-Cheng

2013-01-01

For most practical quantum control systems, it is important and difficult to attain robustness and reliability due to unavoidable uncertainties in the system dynamics or models. Three kinds of typical approaches (e.g., closed-loop learning control, feedback control, and robust control) have been proved to be effective to solve these problems. This work presents a self-contained survey on the closed-loop and robust control of quantum systems, as well as a brief introduction to a selection of basic theories and methods in this research area, to provide interested readers with a general idea for further studies. In the area of closed-loop learning control of quantum systems, we survey and introduce such learning control methods as gradient-based methods, genetic algorithms (GA), and reinforcement learning (RL) methods from a unified point of view of exploring the quantum control landscapes. For the feedback control approach, the paper surveys three control strategies including Lyapunov control, measurement-based control, and coherent-feedback control. Then such topics in the field of quantum robust control as H ∞ control, sliding mode control, quantum risk-sensitive control, and quantum ensemble control are reviewed. The paper concludes with a perspective of future research directions that are likely to attract more attention. PMID:23997680

Quantum information tapping using a fiber optical parametric amplifier with noise figure improved by correlated inputs.

PubMed

Guo, Xueshi; Li, Xiaoying; Liu, Nannan; Ou, Z Y

2016-07-26

One of the important functions in a communication network is the distribution of information. It is not a problem to accomplish this in a classical system since classical information can be copied at will. However, challenges arise in quantum system because extra quantum noise is often added when the information content of a quantum state is distributed to various users. Here, we experimentally demonstrate a quantum information tap by using a fiber optical parametric amplifier (FOPA) with correlated inputs, whose noise is reduced by the destructive quantum interference through quantum entanglement between the signal and the idler input fields. By measuring the noise figure of the FOPA and comparing with a regular FOPA, we observe an improvement of 0.7 ± 0.1 dB and 0.84 ± 0.09 dB from the signal and idler outputs, respectively. When the low noise FOPA functions as an information splitter, the device has a total information transfer coefficient of Ts+Ti = 1.5 ± 0.2, which is greater than the classical limit of 1. Moreover, this fiber based device works at the 1550 nm telecom band, so it is compatible with the current fiber-optical network for quantum information distribution.

Simulation of n-qubit quantum systems. V. Quantum measurements

NASA Astrophysics Data System (ADS)

Radtke, T.; Fritzsche, S.

2010-02-01

The FEYNMAN program has been developed during the last years to support case studies on the dynamics and entanglement of n-qubit quantum registers. Apart from basic transformations and (gate) operations, it currently supports a good number of separability criteria and entanglement measures, quantum channels as well as the parametrizations of various frequently applied objects in quantum information theory, such as (pure and mixed) quantum states, hermitian and unitary matrices or classical probability distributions. With the present update of the FEYNMAN program, we provide a simple access to (the simulation of) quantum measurements. This includes not only the widely-applied projective measurements upon the eigenspaces of some given operator but also single-qubit measurements in various pre- and user-defined bases as well as the support for two-qubit Bell measurements. In addition, we help perform generalized and POVM measurements. Knowing the importance of measurements for many quantum information protocols, e.g., one-way computing, we hope that this update makes the FEYNMAN code an attractive and versatile tool for both, research and education. New version program summaryProgram title: FEYNMAN Catalogue identifier: ADWE_v5_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADWE_v5_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 27 210 No. of bytes in distributed program, including test data, etc.: 1 960 471 Distribution format: tar.gz Programming language: Maple 12 Computer: Any computer with Maple software installed Operating system: Any system that supports Maple; the program has been tested under Microsoft Windows XP and Linux Classification: 4.15 Catalogue identifier of previous version: ADWE_v4_0 Journal reference of previous version: Comput. Phys. Commun. 179 (2008) 647 Does the new version supersede the previous version?: Yes Nature of problem: During the last decade, the field of quantum information science has largely contributed to our understanding of quantum mechanics, and has provided also new and efficient protocols that are used on quantum entanglement. To further analyze the amount and transfer of entanglement in n-qubit quantum protocols, symbolic and numerical simulations need to be handled efficiently. Solution method: Using the computer algebra system Maple, we developed a set of procedures in order to support the definition, manipulation and analysis of n-qubit quantum registers. These procedures also help to deal with (unitary) logic gates and (nonunitary) quantum operations and measurements that act upon the quantum registers. All commands are organized in a hierarchical order and can be used interactively in order to simulate and analyze the evolution of n-qubit quantum systems, both in ideal and noisy quantum circuits. Reasons for new version: Until the present, the FEYNMAN program supported the basic data structures and operations of n-qubit quantum registers [1], a good number of separability and entanglement measures [2], quantum operations (noisy channels) [3] as well as the parametrizations of various frequently applied objects, such as (pure and mixed) quantum states, hermitian and unitary matrices or classical probability distributions [4]. With the current extension, we here add all necessary features to simulate quantum measurements, including the projective measurements in various single-qubit and the two-qubit Bell basis, and POVM measurements. Together with the previously implemented functionality, this greatly enhances the possibilities of analyzing quantum information protocols in which measurements play a central role, e.g., one-way computation. Running time: Most commands require ⩽10 seconds of processor time on a Pentium 4 processor with ⩾2 GHz RAM or newer, if they work with quantum registers with five or less qubits. Moreover, about 5-20 MB of working memory is typically needed (in addition to the memory for the Maple environment itself). However, especially when working with symbolic expressions, the requirements on the CPU time and memory critically depend on the size of the quantum registers owing to the exponential growth of the dimension of the associated Hilbert space. For example, complex (symbolic) noise models, i.e. with several Kraus operators, may result in very large expressions that dramatically slow down the evaluation of e.g. distance measures or the final-state entropy, etc. In these cases, Maple's assume facility sometimes helps to reduce the complexity of the symbolic expressions, but more often than not only a numerical evaluation is feasible. Since the various commands can be applied to quite different scenarios, no general scaling rule can be given for the CPU time or the request of memory. References:[1] T. Radtke, S. Fritzsche, Comput. Phys. Commun. 173 (2005) 91.[2] T. Radtke, S. Fritzsche, Comput. Phys. Commun. 175 (2006) 145.[3] T. Radtke, S. Fritzsche, Comput. Phys. Commun. 176 (2007) 617.[4] T. Radtke, S. Fritzsche, Comput. Phys. Commun. 179 (2008) 647.

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

NASA Technical Reports Server (NTRS)

Wang, Zhihui; Rubin, Nicholas; Rieffel, Eleanor G.

2018-01-01

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

The Quantum Binding Problem in the Context of Associative Memory

PubMed Central

Wichert, Andreas

2016-01-01

We present a method to solve the binding problem by using a quantum algorithm for the retrieval of associations from associative memory during visual scene analysis. The problem is solved by mapping the information representing different objects into superposition by using entanglement and Grover’s amplification algorithm. PMID:27603782

Scalable effective-temperature reduction for quantum annealers via nested quantum annealing correction

NASA Astrophysics Data System (ADS)

Vinci, Walter; Lidar, Daniel A.

2018-02-01

Nested quantum annealing correction (NQAC) is an error-correcting scheme for quantum annealing that allows for the encoding of a logical qubit into an arbitrarily large number of physical qubits. The encoding replaces each logical qubit by a complete graph of degree C . The nesting level C represents the distance of the error-correcting code and controls the amount of protection against thermal and control errors. Theoretical mean-field analyses and empirical data obtained with a D-Wave Two quantum annealer (supporting up to 512 qubits) showed that NQAC has the potential to achieve a scalable effective-temperature reduction, Teff˜C-η , with 0 <η ≤2 . We confirm that this scaling is preserved when NQAC is tested on a D-Wave 2000Q device (supporting up to 2048 qubits). In addition, we show that NQAC can also be used in sampling problems to lower the effective-temperature of a quantum annealer. Such effective-temperature reduction is relevant for machine-learning applications. Since we demonstrate that NQAC achieves error correction via a reduction of the effective-temperature of the quantum annealing device, our results address the problem of the "temperature scaling law for quantum annealers," which requires the temperature of quantum annealers to be reduced as problems of larger sizes are attempted to be solved.

Thermalization and prethermalization in isolated quantum systems: a theoretical overview

NASA Astrophysics Data System (ADS)

Mori, Takashi; Ikeda, Tatsuhiko N.; Kaminishi, Eriko; Ueda, Masahito

2018-06-01

The approach to thermal equilibrium, or thermalization, in isolated quantum systems is among the most fundamental problems in statistical physics. Recent theoretical studies have revealed that thermalization in isolated quantum systems has several remarkable features, which emerge from quantum entanglement and are quite distinct from those in classical systems. Experimentally, well isolated and highly controllable ultracold quantum gases offer an ideal testbed to study the nonequilibrium dynamics in isolated quantum systems, promoting intensive recent theoretical endeavors on this fundamental subject. Besides thermalization, many isolated quantum systems show intriguing behavior in relaxation processes, especially prethermalization. Prethermalization occurs when there is a clear separation of relevant time scales and has several different physical origins depending on individual systems. In this review, we overview theoretical approaches to the problems of thermalization and prethermalization.

Protecting software agents from malicious hosts using quantum computing

NASA Astrophysics Data System (ADS)

Reisner, John; Donkor, Eric

2000-07-01

We evaluate how quantum computing can be applied to security problems for software agents. Agent-based computing, which merges technological advances in artificial intelligence and mobile computing, is a rapidly growing domain, especially in applications such as electronic commerce, network management, information retrieval, and mission planning. System security is one of the more eminent research areas in agent-based computing, and the specific problem of protecting a mobile agent from a potentially hostile host is one of the most difficult of these challenges. In this work, we describe our agent model, and discuss the capabilities and limitations of classical solutions to the malicious host problem. Quantum computing may be extremely helpful in addressing the limitations of classical solutions to this problem. This paper highlights some of the areas where quantum computing could be applied to agent security.

Quo vadis: Hydrologic inverse analyses using high-performance computing and a D-Wave quantum annealer

NASA Astrophysics Data System (ADS)

O'Malley, D.; Vesselinov, V. V.

2017-12-01

Classical microprocessors have had a dramatic impact on hydrology for decades, due largely to the exponential growth in computing power predicted by Moore's law. However, this growth is not expected to continue indefinitely and has already begun to slow. Quantum computing is an emerging alternative to classical microprocessors. Here, we demonstrated cutting edge inverse model analyses utilizing some of the best available resources in both worlds: high-performance classical computing and a D-Wave quantum annealer. The classical high-performance computing resources are utilized to build an advanced numerical model that assimilates data from O(10^5) observations, including water levels, drawdowns, and contaminant concentrations. The developed model accurately reproduces the hydrologic conditions at a Los Alamos National Laboratory contamination site, and can be leveraged to inform decision-making about site remediation. We demonstrate the use of a D-Wave 2X quantum annealer to solve hydrologic inverse problems. This work can be seen as an early step in quantum-computational hydrology. We compare and contrast our results with an early inverse approach in classical-computational hydrology that is comparable to the approach we use with quantum annealing. Our results show that quantum annealing can be useful for identifying regions of high and low permeability within an aquifer. While the problems we consider are small-scale compared to the problems that can be solved with modern classical computers, they are large compared to the problems that could be solved with early classical CPUs. Further, the binary nature of the high/low permeability problem makes it well-suited to quantum annealing, but challenging for classical computers.

Effective optimization using sample persistence: A case study on quantum annealers and various Monte Carlo optimization methods

NASA Astrophysics Data System (ADS)

Karimi, Hamed; Rosenberg, Gili; Katzgraber, Helmut G.

2017-10-01

We present and apply a general-purpose, multistart algorithm for improving the performance of low-energy samplers used for solving optimization problems. The algorithm iteratively fixes the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are smaller and less connected, and samplers tend to give better low-energy samples for these problems. The algorithm is trivially parallelizable since each start in the multistart algorithm is independent, and could be applied to any heuristic solver that can be run multiple times to give a sample. We present results for several classes of hard problems solved using simulated annealing, path-integral quantum Monte Carlo, parallel tempering with isoenergetic cluster moves, and a quantum annealer, and show that the success metrics and the scaling are improved substantially. When combined with this algorithm, the quantum annealer's scaling was substantially improved for native Chimera graph problems. In addition, with this algorithm the scaling of the time to solution of the quantum annealer is comparable to the Hamze-de Freitas-Selby algorithm on the weak-strong cluster problems introduced by Boixo et al. Parallel tempering with isoenergetic cluster moves was able to consistently solve three-dimensional spin glass problems with 8000 variables when combined with our method, whereas without our method it could not solve any.

Quantum cryptography and applications in the optical fiber network

NASA Astrophysics Data System (ADS)

Luo, Yuhui

2005-09-01

Quantum cryptography, as part of quantum information and communications, can provide absolute security for information transmission because it is established on the fundamental laws of quantum theory, such as the principle of uncertainty, No-cloning theorem and quantum entanglement. In this thesis research, a novel scheme to implement quantum key distribution based on multiphoton entanglement with a new protocol is proposed. Its advantages are: a larger information capacity can be obtained with a longer transmission distance and the detection of multiple photons is easier than that of a single photon. The security and attacks pertaining to such a system are also studied. Next, a quantum key distribution over wavelength division multiplexed (WDM) optical fiber networks is realized. Quantum key distribution in networks is a long-standing problem for practical applications. Here we combine quantum cryptography and WDM to solve this problem because WDM technology is universally deployed in the current and next generation fiber networks. The ultimate target is to deploy quantum key distribution over commercial networks. The problems arising from the networks are also studied in this part. Then quantum key distribution in multi-access networks using wavelength routing technology is investigated in this research. For the first time, quantum cryptography for multiple individually targeted users has been successfully implemented in sharp contrast to that using the indiscriminating broadcasting structure. It overcomes the shortcoming that every user in the network can acquire the quantum key signals intended to be exchanged between only two users. Furthermore, a more efficient scheme of quantum key distribution is adopted, hence resulting in a higher key rate. Lastly, a quantum random number generator based on quantum optics has been experimentally demonstrated. This device is a key component for quantum key distribution as it can create truly random numbers, which is an essential requirement to perform quantum key distribution. This new generator is composed of a single optical fiber coupler with fiber pigtails, which can be easily used in optical fiber communications.

An Early Quantum Computing Proposal

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Stephen Russell; Alexander, Francis Joseph; Barros, Kipton Marcos

The D-Wave 2X is the third generation of quantum processing created by D-Wave. NASA (with Google and USRA) and Lockheed Martin (with USC), both own D-Wave systems. Los Alamos National Laboratory (LANL) purchased a D-Wave 2X in November 2015. The D-Wave 2X processor contains (nominally) 1152 quantum bits (or qubits) and is designed to specifically perform quantum annealing, which is a well-known method for finding a global minimum of an optimization problem. This methodology is based on direct execution of a quantum evolution in experimental quantum hardware. While this can be a powerful method for solving particular kinds of problems,more » it also means that the D-Wave 2X processor is not a general computing processor and cannot be programmed to perform a wide variety of tasks. It is a highly specialized processor, well beyond what NNSA currently thinks of as an “advanced architecture.”A D-Wave is best described as a quantum optimizer. That is, it uses quantum superposition to find the lowest energy state of a system by repeated doses of power and settling stages. The D-Wave produces multiple solutions to any suitably formulated problem, one of which is the lowest energy state solution (global minimum). Mapping problems onto the D-Wave requires defining an objective function to be minimized and then encoding that function in the Hamiltonian of the D-Wave system. The quantum annealing method is then used to find the lowest energy configuration of the Hamiltonian using the current D-Wave Two, two-level, quantum processor. This is not always an easy thing to do, and the D-Wave Two has significant limitations that restrict problem sizes that can be run and algorithmic choices that can be made. Furthermore, as more people are exploring this technology, it has become clear that it is very difficult to come up with general approaches to optimization that can both utilize the D-Wave and that can do better than highly developed algorithms on conventional computers for specific applications. These are all fundamental challenges that must be overcome for the D-Wave, or similar, quantum computing technology to be broadly applicable.« less

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

NASA Technical Reports Server (NTRS)

Smelyanskiy, V. N.; Toussaint, U. V.; Timucin, D. A.

2002-01-01

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

NASA Technical Reports Server (NTRS)

Smelyanskiy, Vadius; vonToussaint, Udo V.; Timucin, Dogan A.; Clancy, Daniel (Technical Monitor)

2002-01-01

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Dynamical gauge effects in an open quantum network

NASA Astrophysics Data System (ADS)

Zhao, Jianshi; Price, Craig; Liu, Qi; Gemelke, Nathan

2016-05-01

We describe new experimental techniques for simulation of high-energy field theories based on an analogy between open thermodynamic systems and effective dynamical gauge-fields following SU(2) × U(1) Yang-Mills models. By coupling near-resonant laser-modes to atoms moving in a disordered optical environment, we create an open system which exhibits a non-equilibrium phase transition between two steady-state behaviors, exhibiting scale-invariant behavior near the transition. By measuring transport of atoms through the disordered network, we observe two distinct scaling behaviors, corresponding to the classical and quantum limits for the dynamical gauge field. This behavior is loosely analogous to dynamical gauge effects in quantum chromodynamics, and can mapped onto generalized open problems in theoretical understanding of quantized non-Abelian gauge theories. Additional, the scaling behavior can be understood from the geometric structure of the gauge potential and linked to the measure of information in the local disordered potential, reflecting an underlying holographic principle. We acknowledge support from NSF Award No.1068570, and the Charles E. Kaufman Foundation.

Repetitive Interrogation of 2-Level Quantum Systems

NASA Technical Reports Server (NTRS)

Prestage, John D.; Chung, Sang K.

2010-01-01

Trapped ion clocks derive information from a reference atomic transition by repetitive interrogations of the same quantum system, either a single ion or ionized gas of many millions of ions. Atomic beam frequency standards, by contrast, measure reference atomic transitions in a continuously replenished "flow through" configuration where initial ensemble atomic coherence is zero. We will describe some issues and problems that can arise when atomic state selection and preparation of the quantum atomic system is not completed, that is, optical pumping has not fully relaxed the coherence and also not fully transferred atoms to the initial state. We present a simple two-level density matrix analysis showing how frequency shifts during the state-selection process can cause frequency shifts of the measured clock transition. Such considerations are very important when a low intensity lamp light source is used for state selection, where there is relatively weak relaxation and re-pumping of ions to an initial state and much weaker 'environmental' relaxation of the atomic coherence set-up in the atomic sample.

Loop Quantum Gravity and Asymptotically Flat Spaces

NASA Astrophysics Data System (ADS)

Arnsdorf, Matthias

2002-12-01

Remarkable progress has been made in the field of non-perturbative (loop) quantum gravity in the last decade or so and it is now a rigorously defined kinematical theory (c.f. [5] for a review and references). We are now at the stage where physical applications of loop quantum gravity can be studied and used to provide checks for the consistency of the quantisation programme. Equally, old fundamental problems of canonical quantum gravity such as the problem of time or the interpretation of quantum cosmology need to be reevaluated seriously. These issues can be addressed most profitably in the asymptotically flat sector of quantum gravity. Indeed, it is likely that we should obtain a quantum theory for this special case even if it is not possible to quantise full general relativity. The purpose of this summary is to advertise the extension of loop quantum gravity to this sector that was developed in [1]...

Time-dependent perturbation of a two-state quantum mechanical system

NASA Technical Reports Server (NTRS)

Dion, D. R.

1974-01-01

A two- (nondegenerate) level quantum system interacting with a classical monochromatic radiation field is described. The existing work on this problem is reviewed and some novel aspects of the problems are presented.

Physics: Quantum problems solved through games

NASA Astrophysics Data System (ADS)

Maniscalco, Sabrina

2016-04-01

Humans are better than computers at performing certain tasks because of their intuition and superior visual processing. Video games are now being used to channel these abilities to solve problems in quantum physics. See Letter p.210

Recent progress of quantum annealing

DOE Office of Scientific and Technical Information (OSTI.GOV)

Suzuki, Sei

2015-03-10

We review the recent progress of quantum annealing. Quantum annealing was proposed as a method to solve generic optimization problems. Recently a Canadian company has drawn a great deal of attention, as it has commercialized a quantum computer based on quantum annealing. Although the performance of quantum annealing is not sufficiently understood, it is likely that quantum annealing will be a practical method both on a conventional computer and on a quantum computer.

Faithful Squashed Entanglement

NASA Astrophysics Data System (ADS)

Brandão, Fernando G. S. L.; Christandl, Matthias; Yard, Jon

2011-09-01

Squashed entanglement is a measure for the entanglement of bipartite quantum states. In this paper we present a lower bound for squashed entanglement in terms of a distance to the set of separable states. This implies that squashed entanglement is faithful, that is, it is strictly positive if and only if the state is entangled. We derive the lower bound on squashed entanglement from a lower bound on the quantum conditional mutual information which is used to define squashed entanglement. The quantum conditional mutual information corresponds to the amount by which strong subadditivity of von Neumann entropy fails to be saturated. Our result therefore sheds light on the structure of states that almost satisfy strong subadditivity with equality. The proof is based on two recent results from quantum information theory: the operational interpretation of the quantum mutual information as the optimal rate for state redistribution and the interpretation of the regularised relative entropy of entanglement as an error exponent in hypothesis testing. The distance to the set of separable states is measured in terms of the LOCC norm, an operationally motivated norm giving the optimal probability of distinguishing two bipartite quantum states, each shared by two parties, using any protocol formed by local quantum operations and classical communication (LOCC) between the parties. A similar result for the Frobenius or Euclidean norm follows as an immediate consequence. The result has two applications in complexity theory. The first application is a quasipolynomial-time algorithm solving the weak membership problem for the set of separable states in LOCC or Euclidean norm. The second application concerns quantum Merlin-Arthur games. Here we show that multiple provers are not more powerful than a single prover when the verifier is restricted to LOCC operations thereby providing a new characterisation of the complexity class QMA.

Quantum dice rolling: a multi-outcome generalization of quantum coin flipping

NASA Astrophysics Data System (ADS)

Aharon, N.; Silman, J.

2010-03-01

The problem of quantum dice rolling (DR)—a generalization of the problem of quantum coin flipping (CF) to more than two outcomes and parties—is studied in both its weak and strong variants. We prove by construction that quantum mechanics allows for (i) weak N-sided DR admitting arbitrarily small bias for any N and (ii) two-party strong N-sided DR saturating Kitaev's bound for any N. To derive (ii) we also prove by construction that quantum mechanics allows for (iii) strong imbalanced CF saturating Kitaev's bound for any degree of imbalance. Furthermore, as a corollary of (ii) we introduce a family of optimal 2m-party strong nm-sided DR protocols for any pair m and n.

Two new Controlled not Gate Based Quantum Secret Sharing Protocols without Entanglement Attenuation

NASA Astrophysics Data System (ADS)

Zhu, Zhen-Chao; Hu, Ai-Qun; Fu, An-Min

2016-05-01

In this paper, we propose two new controlled not gate based quantum secret sharing protocols. In these two protocols, each photon only travels once, which guarantees the agents located in long distance can be able to derive the dealer's secret without suffering entanglement attenuation problem. The protocols are secure against trojan horse attack, intercept-resend attack, entangle-measure attack and entanglement-swapping attack. The theoretical efficiency for qubits of these two protocols can approach 100 %, except those used for eavesdropping checking, all entangled states can be used for final secret sharing.

Variational Quantum Tomography with Incomplete Information by Means of Semidefinite Programs

NASA Astrophysics Data System (ADS)

Maciel, Thiago O.; Cesário, André T.; Vianna, Reinaldo O.

We introduce a new method to reconstruct unknown quantum states out of incomplete and noisy information. The method is a linear convex optimization problem, therefore with a unique minimum, which can be efficiently solved with Semidefinite Programs. Numerical simulations indicate that the estimated state does not overestimate purity, and neither the expectation value of optimal entanglement witnesses. The convergence properties of the method are similar to compressed sensing approaches, in the sense that, in order to reconstruct low rank states, it needs just a fraction of the effort corresponding to an informationally complete measurement.

Non-Markovianity quantifier of an arbitrary quantum process

NASA Astrophysics Data System (ADS)

Debarba, Tiago; Fanchini, Felipe F.

2017-12-01

Calculating the degree of non-Markovianity of a quantum process, for a high-dimensional system, is a difficult task given complex maximization problems. Focusing on the entanglement-based measure of non-Markovianity we propose a numerically feasible quantifier for finite-dimensional systems. We define the non-Markovianity measure in terms of a class of entanglement quantifiers named witnessed entanglement which allow us to write several entanglement based measures of non-Markovianity in a unique formalism. In this formalism, we show that the non-Markovianity, in a given time interval, can be witnessed by calculating the expectation value of an observable, making it attractive for experimental investigations. Following this property we introduce a quantifier base on the entanglement witness in an interval of time; we show that measure is a bonafide measure of non-Markovianity. In our example, we use the generalized robustness of entanglement, an entanglement measure that can be readily calculated by a semidefinite programming method, to study impurity atoms coupled to a Bose-Einstein condensate.

The "Hard Problem" and the Quantum Physicists. Part 1: The First Generation

ERIC Educational Resources Information Center

Smith, C. U. M.

2006-01-01

All four of the most important figures in the early twentieth-century development of quantum physics--Niels Bohr, Erwin Schroedinger, Werner Heisenberg and Wolfgang Pauli--had strong interests in the traditional mind--brain, or "hard," problem. This paper reviews their approach to this problem, showing the influence of Bohr's complementarity…

Replicating the benefits of Deutschian closed timelike curves without breaking causality

NASA Astrophysics Data System (ADS)

Yuan, Xiao; Assad, Syed M.; Thompson, Jayne; Haw, Jing Yan; Vedral, Vlatko; Ralph, Timothy C.; Lam, Ping Koy; Weedbrook, Christian; Gu, Mile

2015-11-01

In general relativity, closed timelike curves can break causality with remarkable and unsettling consequences. At the classical level, they induce causal paradoxes disturbing enough to motivate conjectures that explicitly prevent their existence. At the quantum level such problems can be resolved through the Deutschian formalism, however this induces radical benefits—from cloning unknown quantum states to solving problems intractable to quantum computers. Instinctively, one expects these benefits to vanish if causality is respected. Here we show that in harnessing entanglement, we can efficiently solve NP-complete problems and clone arbitrary quantum states—even when all time-travelling systems are completely isolated from the past. Thus, the many defining benefits of Deutschian closed timelike curves can still be harnessed, even when causality is preserved. Our results unveil a subtle interplay between entanglement and general relativity, and significantly improve the potential of probing the radical effects that may exist at the interface between relativity and quantum theory.

Quantum annealing for the number-partitioning problem using a tunable spin glass of ions

PubMed Central

Graß, Tobias; Raventós, David; Juliá-Díaz, Bruno; Gogolin, Christian; Lewenstein, Maciej

2016-01-01

Exploiting quantum properties to outperform classical ways of information processing is an outstanding goal of modern physics. A promising route is quantum simulation, which aims at implementing relevant and computationally hard problems in controllable quantum systems. Here we demonstrate that in a trapped ion setup, with present day technology, it is possible to realize a spin model of the Mattis-type that exhibits spin glass phases. Our method produces the glassy behaviour without the need for any disorder potential, just by controlling the detuning of the spin-phonon coupling. Applying a transverse field, the system can be used to benchmark quantum annealing strategies which aim at reaching the ground state of the spin glass starting from the paramagnetic phase. In the vicinity of a phonon resonance, the problem maps onto number partitioning, and instances which are difficult to address classically can be implemented. PMID:27230802

Dynamics of a Landau-Zener non-dissipative system with fluctuating energy levels

NASA Astrophysics Data System (ADS)

Fai, L. C.; Diffo, J. T.; Ateuafack, M. E.; Tchoffo, M.; Fouokeng, G. C.

2014-12-01

This paper considers a Landau-Zener (two-level) system influenced by a three-dimensional Gaussian and non-Gaussian coloured noise and finds a general form of the time dependent diabatic quantum bit (qubit) flip transition probabilities in the fast, intermediate and slow noise limits. The qubit flip probability is observed to mimic (for low-frequencies noise) that of the standard LZ problem. The qubit flip probability is also observed to be the measure of quantum coherence of states. The transition probability is observed to be tailored by non-Gaussian low-frequency noise and otherwise by Gaussian low-frequency coloured noise. Intermediate and fast noise limits are observed to alter the memory of the system in time and found to improve and control quantum information processing.

Preface of the special issue quantum foundations: information approach

PubMed Central

2016-01-01

This special issue is based on the contributions of a group of top experts in quantum foundations and quantum information and probability. It enlightens a number of interpretational, mathematical and experimental problems of quantum theory. PMID:27091161

Resonant transition-based quantum computation

NASA Astrophysics Data System (ADS)

Chiang, Chen-Fu; Hsieh, Chang-Yu

2017-05-01

In this article we assess a novel quantum computation paradigm based on the resonant transition (RT) phenomenon commonly associated with atomic and molecular systems. We thoroughly analyze the intimate connections between the RT-based quantum computation and the well-established adiabatic quantum computation (AQC). Both quantum computing frameworks encode solutions to computational problems in the spectral properties of a Hamiltonian and rely on the quantum dynamics to obtain the desired output state. We discuss how one can adapt any adiabatic quantum algorithm to a corresponding RT version and the two approaches are limited by different aspects of Hamiltonians' spectra. The RT approach provides a compelling alternative to the AQC under various circumstances. To better illustrate the usefulness of the novel framework, we analyze the time complexity of an algorithm for 3-SAT problems and discuss straightforward methods to fine tune its efficiency.

Area-Preserving Diffeomorphisms, W∞ and { U}q [sl(2)] in Chern-Simons Theory and the Quantum Hall System

NASA Astrophysics Data System (ADS)

Kogan, Ian I.

We discuss a quantum { U}q [sl(2)] symmetry in the Landau problem, which naturally arises due to the relation between { U}q [sl(2)] and the group of magnetic translations. The latter is connected with W∞ and area-preserving (symplectic) diffeomorphisms which are the canonical transformations in the two-dimensional phase space. We shall discuss the hidden quantum symmetry in a 2 + 1 gauge theory with the Chern-Simons term and in a quantum Hall system, which are both connected with the Landau problem.

Semi-quantum communication: protocols for key agreement, controlled secure direct communication and dialogue

NASA Astrophysics Data System (ADS)

Shukla, Chitra; Thapliyal, Kishore; Pathak, Anirban

2017-12-01

Semi-quantum protocols that allow some of the users to remain classical are proposed for a large class of problems associated with secure communication and secure multiparty computation. Specifically, first-time semi-quantum protocols are proposed for key agreement, controlled deterministic secure communication and dialogue, and it is shown that the semi-quantum protocols for controlled deterministic secure communication and dialogue can be reduced to semi-quantum protocols for e-commerce and private comparison (socialist millionaire problem), respectively. Complementing with the earlier proposed semi-quantum schemes for key distribution, secret sharing and deterministic secure communication, set of schemes proposed here and subsequent discussions have established that almost every secure communication and computation tasks that can be performed using fully quantum protocols can also be performed in semi-quantum manner. Some of the proposed schemes are completely orthogonal-state-based, and thus, fundamentally different from the existing semi-quantum schemes that are conjugate coding-based. Security, efficiency and applicability of the proposed schemes have been discussed with appropriate importance.

Quantum self-gravitating collapsing matter in a quantum geometry

NASA Astrophysics Data System (ADS)

Campiglia, Miguel; Gambini, Rodolfo; Olmedo, Javier; Pullin, Jorge

2016-09-01

The problem of how space-time responds to gravitating quantum matter in full quantum gravity has been one of the main questions that any program of quantization of gravity should address. Here we analyze this issue by considering the quantization of a collapsing null shell coupled to spherically symmetric loop quantum gravity. We show that the constraint algebra of canonical gravity is Abelian both classically and when quantized using loop quantum gravity techniques. The Hamiltonian constraint is well defined and suitable Dirac observables characterizing the problem were identified at the quantum level. We can write the metric as a parameterized Dirac observable at the quantum level and study the physics of the collapsing shell and black hole formation. We show how the singularity inside the black hole is eliminated by loop quantum gravity and how the shell can traverse it. The construction is compatible with a scenario in which the shell tunnels into a baby universe inside the black hole or one in which it could emerge through a white hole.

Detection of Biochemical Pathogens, Laser Stand-off Spectroscopy, Quantum Coherence, and Many Body Quantum Optics

DTIC Science & Technology

2012-02-24

AND SUBTITLE Detection of Biochemical Pathogens, Laser Stand-off Spectroscopy, Quantum Coherence, and Many Body Quantum Optics 6. AUTHORS Marian O...Maximum 200 words) Results of our earlier research in the realm of quantum optics were extended in order to solve the challenging technical problems of...efficient methods of generating UV light via quantum coherence. 14. SUBJECT TERMS Quantum coherence, quantum optics, lasers 15. NUMBER OF PAGES 15

Statistical inference with quantum measurements: methodologies for nitrogen vacancy centers in diamond

NASA Astrophysics Data System (ADS)

Hincks, Ian; Granade, Christopher; Cory, David G.

2018-01-01

The analysis of photon count data from the standard nitrogen vacancy (NV) measurement process is treated as a statistical inference problem. This has applications toward gaining better and more rigorous error bars for tasks such as parameter estimation (e.g. magnetometry), tomography, and randomized benchmarking. We start by providing a summary of the standard phenomenological model of the NV optical process in terms of Lindblad jump operators. This model is used to derive random variables describing emitted photons during measurement, to which finite visibility, dark counts, and imperfect state preparation are added. NV spin-state measurement is then stated as an abstract statistical inference problem consisting of an underlying biased coin obstructed by three Poisson rates. Relevant frequentist and Bayesian estimators are provided, discussed, and quantitatively compared. We show numerically that the risk of the maximum likelihood estimator is well approximated by the Cramér-Rao bound, for which we provide a simple formula. Of the estimators, we in particular promote the Bayes estimator, owing to its slightly better risk performance, and straightforward error propagation into more complex experiments. This is illustrated on experimental data, where quantum Hamiltonian learning is performed and cross-validated in a fully Bayesian setting, and compared to a more traditional weighted least squares fit.

From quantum coherence to quantum correlations

NASA Astrophysics Data System (ADS)

Sun, Yuan; Mao, Yuanyuan; Luo, Shunlong

2017-06-01

In quantum mechanics, quantum coherence of a state relative to a quantum measurement can be identified with the quantumness that has to be destroyed by the measurement. In particular, quantum coherence of a bipartite state relative to a local quantum measurement encodes quantum correlations in the state. If one takes minimization with respect to the local measurements, then one is led to quantifiers which capture quantum correlations from the perspective of coherence. In this vein, quantum discord, which quantifies the minimal correlations that have to be destroyed by quantum measurements, can be identified as the minimal coherence, with the coherence measured by the relative entropy of coherence. To advocate and formulate this idea in a general context, we first review coherence relative to Lüders measurements which extends the notion of coherence relative to von Neumann measurements (or equivalently, orthonomal bases), and highlight the observation that quantum discord arises as minimal coherence through two prototypical examples. Then, we introduce some novel measures of quantum correlations in terms of coherence, illustrate them through examples, investigate their fundamental properties and implications, and indicate their applications to quantum metrology.

Insights into teaching quantum mechanics in secondary and lower undergraduate education

NASA Astrophysics Data System (ADS)

Krijtenburg-Lewerissa, K.; Pol, H. J.; Brinkman, A.; van Joolingen, W. R.

2017-06-01

This study presents a review of the current state of research on teaching quantum mechanics in secondary and lower undergraduate education. A conceptual approach to quantum mechanics is being implemented in more and more introductory physics courses around the world. Because of the differences between the conceptual nature of quantum mechanics and classical physics, research on misconceptions, testing, and teaching strategies for introductory quantum mechanics is needed. For this review, 74 articles were selected and analyzed for the misconceptions, research tools, teaching strategies, and multimedia applications investigated. Outcomes were categorized according to their contribution to the various subtopics of quantum mechanics. Analysis shows that students have difficulty relating quantum physics to physical reality. It also shows that the teaching of complex quantum behavior, such as time dependence, superposition, and the measurement problem, has barely been investigated for the secondary and lower undergraduate level. At the secondary school level, this article shows a need to investigate student difficulties concerning wave functions and potential wells. Investigation of research tools shows the necessity for the development of assessment tools for secondary and lower undergraduate education, which cover all major topics and are suitable for statistical analysis. Furthermore, this article shows the existence of very diverse ideas concerning teaching strategies for quantum mechanics and a lack of research into which strategies promote understanding. This article underlines the need for more empirical research into student difficulties, teaching strategies, activities, and research tools intended for a conceptual approach for quantum mechanics.

Quantum communication and information processing

NASA Astrophysics Data System (ADS)

Beals, Travis Roland

Quantum computers enable dramatically more efficient algorithms for solving certain classes of computational problems, but, in doing so, they create new problems. In particular, Shor's Algorithm allows for efficient cryptanalysis of many public-key cryptosystems. As public key cryptography is a critical component of present-day electronic commerce, it is crucial that a working, secure replacement be found. Quantum key distribution (QKD), first developed by C.H. Bennett and G. Brassard, offers a partial solution, but many challenges remain, both in terms of hardware limitations and in designing cryptographic protocols for a viable large-scale quantum communication infrastructure. In Part I, I investigate optical lattice-based approaches to quantum information processing. I look at details of a proposal for an optical lattice-based quantum computer, which could potentially be used for both quantum communications and for more sophisticated quantum information processing. In Part III, I propose a method for converting and storing photonic quantum bits in the internal state of periodically-spaced neutral atoms by generating and manipulating a photonic band gap and associated defect states. In Part II, I present a cryptographic protocol which allows for the extension of present-day QKD networks over much longer distances without the development of new hardware. I also present a second, related protocol which effectively solves the authentication problem faced by a large QKD network, thus making QKD a viable, information-theoretic secure replacement for public key cryptosystems.

Entanglement distribution schemes employing coherent photon-to-spin conversion in semiconductor quantum dot circuits

NASA Astrophysics Data System (ADS)

Gaudreau, Louis; Bogan, Alex; Korkusinski, Marek; Studenikin, Sergei; Austing, D. Guy; Sachrajda, Andrew S.

2017-09-01

Long distance entanglement distribution is an important problem for quantum information technologies to solve. Current optical schemes are known to have fundamental limitations. A coherent photon-to-spin interface built with quantum dots (QDs) in a direct bandgap semiconductor can provide a solution for efficient entanglement distribution. QD circuits offer integrated spin processing for full Bell state measurement (BSM) analysis and spin quantum memory. Crucially the photo-generated spins can be heralded by non-destructive charge detection techniques. We review current schemes to transfer a polarization-encoded state or a time-bin-encoded state of a photon to the state of a spin in a QD. The spin may be that of an electron or that of a hole. We describe adaptations of the original schemes to employ heavy holes which have a number of attractive properties including a g-factor that is tunable to zero for QDs in an appropriately oriented external magnetic field. We also introduce simple throughput scaling models to demonstrate the potential performance advantage of full BSM capability in a QD scheme, even when the quantum memory is imperfect, over optical schemes relying on linear optical elements and ensemble quantum memories.

Limits on efficient computation in the physical world

NASA Astrophysics Data System (ADS)

Aaronson, Scott Joel

More than a speculative technology, quantum computing seems to challenge our most basic intuitions about how the physical world should behave. In this thesis I show that, while some intuitions from classical computer science must be jettisoned in the light of modern physics, many others emerge nearly unscathed; and I use powerful tools from computational complexity theory to help determine which are which. In the first part of the thesis, I attack the common belief that quantum computing resembles classical exponential parallelism, by showing that quantum computers would face serious limitations on a wider range of problems than was previously known. In particular, any quantum algorithm that solves the collision problem---that of deciding whether a sequence of n integers is one-to-one or two-to-one---must query the sequence O (n1/5) times. This resolves a question that was open for years; previously no lower bound better than constant was known. A corollary is that there is no "black-box" quantum algorithm to break cryptographic hash functions or solve the Graph Isomorphism problem in polynomial time. I also show that relative to an oracle, quantum computers could not solve NP-complete problems in polynomial time, even with the help of nonuniform "quantum advice states"; and that any quantum algorithm needs O (2n/4/n) queries to find a local minimum of a black-box function on the n-dimensional hypercube. Surprisingly, the latter result also leads to new classical lower bounds for the local search problem. Finally, I give new lower bounds on quantum one-way communication complexity, and on the quantum query complexity of total Boolean functions and recursive Fourier sampling. The second part of the thesis studies the relationship of the quantum computing model to physical reality. I first examine the arguments of Leonid Levin, Stephen Wolfram, and others who believe quantum computing to be fundamentally impossible. I find their arguments unconvincing without a "Sure/Shor separator"---a criterion that separates the already-verified quantum states from those that appear in Shor's factoring algorithm. I argue that such a separator should be based on a complexity classification of quantum states, and go on to create such a classification. Next I ask what happens to the quantum computing model if we take into account that the speed of light is finite---and in particular, whether Grover's algorithm still yields a quadratic speedup for searching a database. Refuting a claim by Benioff, I show that the surprising answer is yes. Finally, I analyze hypothetical models of computation that go even beyond quantum computing. I show that many such models would be as powerful as the complexity class PP, and use this fact to give a simple, quantum computing based proof that PP is closed under intersection. On the other hand, I also present one model---wherein we could sample the entire history of a hidden variable---that appears to be more powerful than standard quantum computing, but only slightly so.

The quantum pinch effect in semiconducting quantum wires: A bird’s-eye view

NASA Astrophysics Data System (ADS)

Kushwaha, Manvir S.

2016-01-01

Those who measure success with culmination do not seem to be aware that life is a journey not a destination. This spirit is best reflected in the unceasing failures in efforts for solving the problem of controlled thermonuclear fusion for even the simplest pinches for over decades; and the nature keeps us challenging with examples. However, these efforts have permitted researchers the obtention of a dense plasma with a lifetime that, albeit short, is sufficient to study the physics of the pinch effect, to create methods of plasma diagnostics, and to develop a modern theory of plasma processes. Most importantly, they have impregnated the solid state plasmas, particularly the electron-hole plasmas in semiconductors, which do not suffer from the issues related with the confinement and which have demonstrated their potential not only for the fundamental physics but also for the device physics. Here, we report on a two-component, cylindrical, quasi-one-dimensional quantum plasma subjected to a radial confining harmonic potential and an applied magnetic field in the symmetric gauge. It is demonstrated that such a system, as can be realized in semiconducting quantum wires, offers an excellent medium for observing the quantum pinch effect at low temperatures. An exact analytical solution of the problem allows us to make significant observations: Surprisingly, in contrast to the classical pinch effect, the particle density as well as the current density display a determinable maximum before attaining a minimum at the surface of the quantum wire. The effect will persist as long as the equilibrium pair density is sustained. Therefore, the technological promise that emerges is the route to the precise electronic devices that will control the particle beams at the nanoscale.

Bell's Inequality: Revolution in Quantum Physics or Just AN Inadequate Mathematical Model?

NASA Astrophysics Data System (ADS)

Khrennikov, Andrei

The main aim of this review is to stress the role of mathematical models in physics. The Bell inequality (BI) is often called the "most famous inequality of the 20th century." It is commonly accepted that its violation in corresponding experiments induced a revolution in quantum physics. Unlike "old quantum mechanics" (of Einstein, Schrodinger Bohr, Heisenberg, Pauli, Landau, Fock), "modern quantum mechanics" (of Bell, Aspect, Zeilinger, Shimony, Green-berger, Gisin, Mermin) takes seriously so called quantum non-locality. We will show that the conclusion that one has to give up the realism (i.e., a possibility to assign results of measurements to physical systems) or the locality (i.e., to assume action at a distance) is heavily based on one special mathematical model. This model was invented by A. N. Kolmogorov in 1933. One should pay serious attention to the role of mathematical models in physics. The problems of the realism and locality induced by Bell's argument can be solved by using non-Kolmogorovian probabilistic models. We compare this situation with non-Euclidean geometric models in relativity theory.

Test One to Test Many: A Unified Approach to Quantum Benchmarks

NASA Astrophysics Data System (ADS)

Bai, Ge; Chiribella, Giulio

2018-04-01

Quantum benchmarks are routinely used to validate the experimental demonstration of quantum information protocols. Many relevant protocols, however, involve an infinite set of input states, of which only a finite subset can be used to test the quality of the implementation. This is a problem, because the benchmark for the finitely many states used in the test can be higher than the original benchmark calculated for infinitely many states. This situation arises in the teleportation and storage of coherent states, for which the benchmark of 50% fidelity is commonly used in experiments, although finite sets of coherent states normally lead to higher benchmarks. Here, we show that the average fidelity over all coherent states can be indirectly probed with a single setup, requiring only two-mode squeezing, a 50-50 beam splitter, and homodyne detection. Our setup enables a rigorous experimental validation of quantum teleportation, storage, amplification, attenuation, and purification of noisy coherent states. More generally, we prove that every quantum benchmark can be tested by preparing a single entangled state and measuring a single observable.

Niels Bohr on the wave function and the classical/quantum divide

NASA Astrophysics Data System (ADS)

Zinkernagel, Henrik

2016-02-01

It is well known that Niels Bohr insisted on the necessity of classical concepts in the account of quantum phenomena. But there is little consensus concerning his reasons, and what he exactly meant by this. In this paper, I re-examine Bohr's interpretation of quantum mechanics, and argue that the necessity of the classical can be seen as part of his response to the measurement problem. More generally, I attempt to clarify Bohr's view on the classical/quantum divide, arguing that the relation between the two theories is that of mutual dependence. An important element in this clarification consists in distinguishing Bohr's idea of the wave function as symbolic from both a purely epistemic and an ontological interpretation. Together with new evidence concerning Bohr's conception of the wave function collapse, this sets his interpretation apart from both standard versions of the Copenhagen interpretation, and from some of the reconstructions of his view found in the literature. I conclude with a few remarks on how Bohr's ideas make much sense also when modern developments in quantum gravity and early universe cosmology are taken into account.

Compiling Planning into Quantum Optimization Problems: A Comparative Study

DTIC Science & Technology

2015-06-07

and Sipser, M. 2000. Quantum computation by adiabatic evolution. arXiv:quant- ph/0001106. Fikes, R. E., and Nilsson, N. J. 1972. STRIPS: A new...become available: quantum annealing. Quantum annealing is one of the most accessible quantum algorithms for a computer sci- ence audience not versed...in quantum computing because of its close ties to classical optimization algorithms such as simulated annealing. While large-scale universal quantum

New insights on emergence from the perspective of weak values and dynamical non-locality

NASA Astrophysics Data System (ADS)

Tollaksen, Jeff

2014-04-01

In this article, we will examine new fundamental aspects of "emergence" and "information" using novel approaches to quantum mechanics which originated from the group around Aharonov. The two-state vector formalism provides a complete description of pre- and post-selected quantum systems and has uncovered a host of new quantum phenomena which were previously hidden. The most important feature is that any weak coupling to a pre- and post-selected system is effectively a coupling to a "weak value" which is given by a simple expression depending on the two-state vector. In particular, weak values, are the outcomes of so called "weak measurements" which have recently become a very powerful tool for ultra-sensitive measurements. Using weak values, we will show how to separate a particle from its properties, not unlike the Cheshire cat story: "Well! I've often seen a cat without a grin," thought Alice; "but a grin without a cat! It's the most curious thing I ever saw in all my life!" Next, we address the question whether the physics on different scales "emerges" from quantum mechanics or whether the laws of physics at those scales are fundamental. We show that the classical limit of quantum mechanics is a far more complicated issue; it is in fact dramatically more involved and it requires a complete revision of all our intuitions. The revised intuitions can then serve as a guide to finding novel quantum effects. Next we show that novel experimental aspects of contextuality can be demonstrated with weak measurements and these suggest new restrictions on hidden variable approaches. Next we emphasize that the most important implication of the Aharonov-Bohm effect is the existence of non-local interactions which do not violate causality. Finally, we review some generalizations of quantum mechanics and their implications for "emergence" and "information." First, we review an alternative approach to quantum evolution in which each moment of time is viewed as a new "universe" and time evolution is given by correlations between different moments. Next, we present a new solution to the measurement problem involving future boundary conditions placed on the universe as a whole. Finally, we introduce another fundamental approach to quantum evolution which allows for tremendous richness in the types of allowable Hamiltonians.

How quantum are non-negative wavefunctions?

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hastings, M. B.

2016-01-15

We consider wavefunctions which are non-negative in some tensor product basis. We study what possible teleportation can occur in such wavefunctions, giving a complete answer in some cases (when one system is a qubit) and partial answers elsewhere. We use this to show that a one-dimensional wavefunction which is non-negative and has zero correlation length can be written in a “coherent Gibbs state” form, as explained later. We conjecture that such holds in higher dimensions. Additionally, some results are provided on possible teleportation in general wavefunctions, explaining how Schmidt coefficients before measurement limit the possible Schmidt coefficients after measurement, andmore » on the absence of a “generalized area law” [D. Aharonov et al., in Proceedings of Foundations of Computer Science (FOCS) (IEEE, 2014), p. 246; e-print arXiv.org:1410.0951] even for Hamiltonians with no sign problem. One of the motivations for this work is an attempt to prove a conjecture about ground state wavefunctions which have an “intrinsic” sign problem that cannot be removed by any quantum circuit. We show a weaker version of this, showing that the sign problem is intrinsic for commuting Hamiltonians in the same phase as the double semion model under the technical assumption that TQO-2 holds [S. Bravyi et al., J. Math. Phys. 51, 093512 (2010)].« less

On the 'principle of the quantumness', the quantumness of Relativity, and the computational grand-unification

DOE Office of Scientific and Technical Information (OSTI.GOV)

D'Ariano, Giacomo Mauro

2010-05-04

I will argue that the proposal of establishing operational foundations of Quantum Theory should have top-priority, and that the Lucien Hardy's program on Quantum Gravity should be paralleled by an analogous program on Quantum Field Theory (QFT), which needs to be reformulated, notwithstanding its experimental success. In this paper, after reviewing recently suggested operational 'principles of the quantumness', I address the problem on whether Quantum Theory and Special Relativity are unrelated theories, or instead, if the one implies the other. I show how Special Relativity can be indeed derived from causality of Quantum Theory, within the computational paradigm 'the universemore » is a huge quantum computer', reformulating QFT as a Quantum-Computational Field Theory (QCFT). In QCFT Special Relativity emerges from the fabric of the computational network, which also naturally embeds gauge invariance. In this scheme even the quantization rule and the Planck constant can in principle be derived as emergent from the underlying causal tapestry of space-time. In this way Quantum Theory remains the only theory operating the huge computer of the universe.Is the computational paradigm only a speculative tautology (theory as simulation of reality), or does it have a scientific value? The answer will come from Occam's razor, depending on the mathematical simplicity of QCFT. Here I will just start scratching the surface of QCFT, analyzing simple field theories, including Dirac's. The number of problems and unmotivated recipes that plague QFT strongly motivates us to undertake the QCFT project, since QCFT makes all such problems manifest, and forces a re-foundation of QFT.« less

Quantum snake walk on graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rosmanis, Ansis

2011-02-15

I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, whichmore » asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.« less

Implementation of a three-qubit refined Deutsch Jozsa algorithm using SFG quantum logic gates

NASA Astrophysics Data System (ADS)

DelDuce, A.; Savory, S.; Bayvel, P.

2006-05-01

In this paper we present a quantum logic circuit which can be used for the experimental demonstration of a three-qubit solid state quantum computer based on a recent proposal of optically driven quantum logic gates. In these gates, the entanglement of randomly placed electron spin qubits is manipulated by optical excitation of control electrons. The circuit we describe solves the Deutsch problem with an improved algorithm called the refined Deutsch-Jozsa algorithm. We show that it is possible to select optical pulses that solve the Deutsch problem correctly, and do so without losing quantum information to the control electrons, even though the gate parameters vary substantially from one gate to another.

Strategies in a symmetric quantum Kolkata restaurant problem

NASA Astrophysics Data System (ADS)

Sharif, Puya; Heydari, Hoshang

2012-12-01

The Quantum Kolkata restaurant problem is a multiple-choice version of the quantum minority game, where a set of n non-communicating players have to chose between one of m choices. A payoff is granted to the players that make a unique choice. It has previously been shown that shared entanglement and quantum operations can aid the players to coordinate their actions and acquire higher payoffs than is possible with classical randomization. In this paper the initial quantum state is expanded to a family of GHZ-type states and strategies are discussed in terms of possible final outcomes. It is shown that the players individually seek outcomes that maximize the collective good.

Practicality of quantum information processing

NASA Astrophysics Data System (ADS)

Lau, Hoi-Kwan

Quantum Information Processing (QIP) is expected to bring revolutionary enhancement to various technological areas. However, today's QIP applications are far from being practical. The problem involves both hardware issues, i.e., quantum devices are imperfect, and software issues, i.e., the functionality of some QIP applications is not fully understood. Aiming to improve the practicality of QIP, in my PhD research I have studied various topics in quantum cryptography and ion trap quantum computation. In quantum cryptography, I first studied the security of position-based quantum cryptography (PBQC). I discovered a wrong assumption in the previous literature that the cheaters are not allowed to share entangled resources. I proposed entanglement attacks that could cheat all known PBQC protocols. I also studied the practicality of continuous-variable (CV) quantum secret sharing (QSS). While the security of CV QSS was considered by the literature only in the limit of infinite squeezing, I found that finitely squeezed CV resources could also provide finite secret sharing rate. Our work relaxes the stringent resources requirement of implementing QSS. In ion trap quantum computation, I studied the phase error of quantum information induced by dc Stark effect during ion transportation. I found an optimized ion trajectory for which the phase error is the minimum. I also defined a threshold speed, above which ion transportation would induce significant error. In addition, I proposed a new application for ion trap systems as universal bosonic simulators (UBS). I introduced two architectures, and discussed their respective strength and weakness. I illustrated the implementations of bosonic state initialization, transformation, and measurement by applying radiation fields or by varying the trap potential. When comparing with conducting optical experiments, the ion trap UBS is advantageous in higher state initialization efficiency and higher measurement accuracy. Finally, I proposed a new method to re-cool ion qubits during quantum computation. The idea is to transfer the motional excitation of a qubit to another ion that is prepared in the motional ground state. I showed that my method could be ten times faster than current laser cooling techniques, and thus could improve the speed of ion trap quantum computation.

NP-hardness of decoding quantum error-correction codes

NASA Astrophysics Data System (ADS)

Hsieh, Min-Hsiu; Le Gall, François

2011-05-01

Although the theory of quantum error correction is intimately related to classical coding theory and, in particular, one can construct quantum error-correction codes (QECCs) from classical codes with the dual-containing property, this does not necessarily imply that the computational complexity of decoding QECCs is the same as their classical counterparts. Instead, decoding QECCs can be very much different from decoding classical codes due to the degeneracy property. Intuitively, one expects degeneracy would simplify the decoding since two different errors might not and need not be distinguished in order to correct them. However, we show that general quantum decoding problem is NP-hard regardless of the quantum codes being degenerate or nondegenerate. This finding implies that no considerably fast decoding algorithm exists for the general quantum decoding problems and suggests the existence of a quantum cryptosystem based on the hardness of decoding QECCs.

A variational eigenvalue solver on a photonic quantum processor

PubMed Central

Peruzzo, Alberto; McClean, Jarrod; Shadbolt, Peter; Yung, Man-Hong; Zhou, Xiao-Qi; Love, Peter J.; Aspuru-Guzik, Alán; O’Brien, Jeremy L.

2014-01-01

Quantum computers promise to efficiently solve important problems that are intractable on a conventional computer. For quantum systems, where the physical dimension grows exponentially, finding the eigenvalues of certain operators is one such intractable problem and remains a fundamental challenge. The quantum phase estimation algorithm efficiently finds the eigenvalue of a given eigenvector but requires fully coherent evolution. Here we present an alternative approach that greatly reduces the requirements for coherent evolution and combine this method with a new approach to state preparation based on ansätze and classical optimization. We implement the algorithm by combining a highly reconfigurable photonic quantum processor with a conventional computer. We experimentally demonstrate the feasibility of this approach with an example from quantum chemistry—calculating the ground-state molecular energy for He–H+. The proposed approach drastically reduces the coherence time requirements, enhancing the potential of quantum resources available today and in the near future. PMID:25055053

Quantum game application to spectrum scarcity problems

NASA Astrophysics Data System (ADS)

Zabaleta, O. G.; Barrangú, J. P.; Arizmendi, C. M.

2017-01-01

Recent spectrum-sharing research has produced a strategy to address spectrum scarcity problems. This novel idea, named cognitive radio, considers that secondary users can opportunistically exploit spectrum holes left temporarily unused by primary users. This presents a competitive scenario among cognitive users, making it suitable for game theory treatment. In this work, we show that the spectrum-sharing benefits of cognitive radio can be increased by designing a medium access control based on quantum game theory. In this context, we propose a model to manage spectrum fairly and effectively, based on a multiple-users multiple-choice quantum minority game. By taking advantage of quantum entanglement and quantum interference, it is possible to reduce the probability of collision problems commonly associated with classic algorithms. Collision avoidance is an essential property for classic and quantum communications systems. In our model, two different scenarios are considered, to meet the requirements of different user strategies. The first considers sensor networks where the rational use of energy is a cornerstone; the second focuses on installations where the quality of service of the entire network is a priority.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gross, D.; Eisert, J.; Schuch, N.

We introduce schemes for quantum computing based on local measurements on entangled resource states. This work elaborates on the framework established in Gross and Eisert [Phys. Rev. Lett. 98, 220503 (2007); quant-ph/0609149]. Our method makes use of tools from many-body physics--matrix product states, finitely correlated states, or projected entangled pairs states--to show how measurements on entangled states can be viewed as processing quantum information. This work hence constitutes an instance where a quantum information problem--how to realize quantum computation--was approached using tools from many-body theory and not vice versa. We give a more detailed description of the setting and presentmore » a large number of examples. We find computational schemes, which differ from the original one-way computer, for example, in the way the randomness of measurement outcomes is handled. Also, schemes are presented where the logical qubits are no longer strictly localized on the resource state. Notably, we find a great flexibility in the properties of the universal resource states: They may, for example, exhibit nonvanishing long-range correlation functions or be locally arbitrarily close to a pure state. We discuss variants of Kitaev's toric code states as universal resources, and contrast this with situations where they can be efficiently classically simulated. This framework opens up a way of thinking of tailoring resource states to specific physical systems, such as cold atoms in optical lattices or linear optical systems.« less

Further Evidence in Support of the Universal Nilpotent Grammatical Computational Paradigm of Quantum Physics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Marcer, Peter J.; Rowlands, Peter

2010-12-22

Further evidence is presented in favour of the computational paradigm, conceived and constructed by Rowlands and Diaz, as detailed in Rowlands' book Zero to Infinity (2007), and in particular the authors' paper 'The Grammatical Universe: the Laws of Thermodynamics and Quantum Entanglement'. The paradigm, which has isomorphic group and algebraic quantum mechanical language interpretations, not only predicts the well-established facts of quantum physics, the periodic table, chemistry / valence and of molecular biology, whose understanding it extends; it also provides an elegant, simple solution to the unresolved quantum measurement problem. In this fundamental paradigm, all the computational constructs / predictionsmore » that emerge, follow from the simple fact, that, as in quantum mechanics, the wave function is defined only up to an arbitrary fixed phase. This fixed phase provides a simple physical understanding of the quantum vacuum in quantum field theory, where only relative phases, known to be able to encode 3+1 relativistic space-time geometries, can be measured. It is the arbitrary fixed measurement standard, against which everything that follows is to be measured, even though the standard itself cannot be, since nothing exists against which to measure it. The standard, as an arbitrary fixed reference phase, functions as the holographic basis for a self-organized universal quantum process of emergent novel fermion states of matter where, following each emergence, the arbitrary standard is re-fixed anew so as to provide a complete history / holographic record or hologram of the current fixed past, advancing an unending irreversible evolution, such as is the evidence of our senses. The fermion states, in accord with the Pauli exclusion principle, each correspond to a unique nilpotent symbol in the infinite alphabet (which specifies the grammar in this nilpotent universal computational rewrite system (NUCRS) paradigm); and the alphabet, as Hill and Rowlands hypothesize on substantial evidence [26], includes that of the RNA / DNA genetic code and, as holographic phase encodings / holograms, the 4D geometries of all living systems as self-organised grammatical computational rewrite machines / machinery. Human brains, natural grammatical (written symbol) languages, 4D geometric self-awareness and a totally new emergent property of matter, human consciousness, can thus with some measure of confidence be postulated as further genetic consequences which follow from this self-organizing fundamental rewrite NUCRS construction. For it, like natural language, possesses a semantics and not just a syntax, where the initial symbol, i.e. the arbitrary fixed phase measurement standard, is able to function as the template for the blueprints of the emergent 4D relativistic real and virtual geometries to come, in a 'from the Self Creation to the creation of the human self' computational rewrite process evolution.« less

Further Evidence in Support of the Universal Nilpotent Grammatical Computational Paradigm of Quantum Physics

NASA Astrophysics Data System (ADS)

Marcer, Peter J.; Rowlands, Peter

2010-12-01

Further evidence is presented in favour of the computational paradigm, conceived and constructed by Rowlands and Diaz, as detailed in Rowlands' book Zero to Infinity (2007) [2], and in particular the authors' paper `The Grammatical Universe: the Laws of Thermodynamics and Quantum Entanglement' [1]. The paradigm, which has isomorphic group and algebraic quantum mechanical language interpretations, not only predicts the well-established facts of quantum physics, the periodic table, chemistry / valence and of molecular biology, whose understanding it extends; it also provides an elegant, simple solution to the unresolved quantum measurement problem. In this fundamental paradigm, all the computational constructs / predictions that emerge, follow from the simple fact, that, as in quantum mechanics, the wave function is defined only up to an arbitrary fixed phase. This fixed phase provides a simple physical understanding of the quantum vacuum in quantum field theory, where only relative phases, known to be able to encode 3+1 relativistic space-time geometries, can be measured. It is the arbitrary fixed measurement standard, against which everything that follows is to be measured, even though the standard itself cannot be, since nothing exists against which to measure it. The standard, as an arbitrary fixed reference phase, functions as the holographic basis for a self-organized universal quantum process of emergent novel fermion states of matter where, following each emergence, the arbitrary standard is re-fixed anew so as to provide a complete history / holographic record or hologram of the current fixed past, advancing an unending irreversible evolution, such as is the evidence of our senses. The fermion states, in accord with the Pauli exclusion principle, each correspond to a unique nilpotent symbol in the infinite alphabet (which specifies the grammar in this nilpotent universal computational rewrite system (NUCRS) paradigm); and the alphabet, as Hill and Rowlands hypothesize on substantial evidence [26], includes that of the RNA / DNA genetic code and, as holographic phase encodings / holograms, the 4D geometries of all living systems as self-organised grammatical computational rewrite machines / machinery. Human brains, natural grammatical (written symbol) languages, 4D geometric self-awareness and a totally new emergent property of matter, human consciousness, can thus with some measure of confidence be postulated as further genetic consequences which follow from this self-organizing fundamental rewrite NUCRS construction. For it, like natural language, possesses a semantics and not just a syntax, where the initial symbol, i.e. the arbitrary fixed phase measurement standard, is able to function as the template for the blueprints of the emergent 4D relativistic real and virtual geometries to come, in a `from the Self Creation to the creation of the human self' computational rewrite process evolution.

Computational Role of Tunneling in a Programmable Quantum Annealer

NASA Technical Reports Server (NTRS)

Boixo, Sergio; Smelyanskiy, Vadim; Shabani, Alireza; Isakov, Sergei V.; Dykman, Mark; Amin, Mohammad; Mohseni, Masoud; Denchev, Vasil S.; Neven, Hartmut

2016-01-01

Quantum tunneling is a phenomenon in which a quantum state tunnels through energy barriers above the energy of the state itself. Tunneling has been hypothesized as an advantageous physical resource for optimization. Here we present the first experimental evidence of a computational role of multiqubit quantum tunneling in the evolution of a programmable quantum annealer. We developed a theoretical model based on a NIBA Quantum Master Equation to describe the multi-qubit dissipative cotunneling effects under the complex noise characteristics of such quantum devices.We start by considering a computational primitive, the simplest non-convex optimization problem consisting of just one global and one local minimum. The quantum evolutions enable tunneling to the global minimum while the corresponding classical paths are trapped in a false minimum. In our study the non-convex potentials are realized by frustrated networks of qubit clusters with strong intra-cluster coupling. We show that the collective effect of the quantum environment is suppressed in the critical phase during the evolution where quantum tunneling decides the right path to solution. In a later stage dissipation facilitates the multiqubit cotunneling leading to the solution state. The predictions of the model accurately describe the experimental data from the D-WaveII quantum annealer at NASA Ames. In our computational primitive the temperature dependence of the probability of success in the quantum model is opposite to that of the classical paths with thermal hopping. Specially, we provide an analysis of an optimization problem with sixteen qubits,demonstrating eight qubit cotunneling that increases success probabilities. Furthermore, we report results for larger problems with up to 200 qubits that contain the primitive as subproblems.

Solution to the satisfiability problem using a complete Grover search with trapped ions

NASA Astrophysics Data System (ADS)

Yang, Wan-Li; Wei, Hua; Zhou, Fei; Chang, Weng-Long; Feng, Mang

2009-07-01

The main idea in the original Grover search (1997 Phys. Rev. Lett. 79 325) is to single out a target state containing the solution to a search problem by amplifying the amplitude of the state, following the Oracle's job, i.e., a black box giving us information about the target state. We design quantum circuits to accomplish a complete Grover search involving both the Oracle's job and the amplification of the target state, which are employed to solve satisfiability (SAT) problems. We explore how to carry out the quantum circuits with currently available ion-trap quantum computing technology.

The quantum N-body problem in the mean-field and semiclassical regime

NASA Astrophysics Data System (ADS)

Golse, François

2018-04-01

The present work discusses the mean-field limit for the quantum N-body problem in the semiclassical regime. More precisely, we establish a convergence rate for the mean-field limit which is uniform as the ratio of Planck constant to the action of the typical single particle tends to zero. This convergence rate is formulated in terms of a quantum analogue of the quadratic Monge-Kantorovich or Wasserstein distance. This paper is an account of some recent collaboration with C. Mouhot, T. Paul and M. Pulvirenti. This article is part of the themed issue `Hilbert's sixth problem'.

Schrödinger problem, Lévy processes, and noise in relativistic quantum mechanics

NASA Astrophysics Data System (ADS)

Garbaczewski, Piotr; Klauder, John R.; Olkiewicz, Robert

1995-05-01

The main purpose of the paper is an essentially probabilistic analysis of relativistic quantum mechanics. It is based on the assumption that whenever probability distributions arise, there exists a stochastic process that is either responsible for the temporal evolution of a given measure or preserves the measure in the stationary case. Our departure point is the so-called Schrödinger problem of probabilistic evolution, which provides for a unique Markov stochastic interpolation between any given pair of boundary probability densities for a process covering a fixed, finite duration of time, provided we have decided a priori what kind of primordial dynamical semigroup transition mechanism is involved. In the nonrelativistic theory, including quantum mechanics, Feynman-Kac-like kernels are the building blocks for suitable transition probability densities of the process. In the standard ``free'' case (Feynman-Kac potential equal to zero) the familiar Wiener noise is recovered. In the framework of the Schrödinger problem, the ``free noise'' can also be extended to any infinitely divisible probability law, as covered by the Lévy-Khintchine formula. Since the relativistic Hamiltonians ||∇|| and √-Δ+m2 -m are known to generate such laws, we focus on them for the analysis of probabilistic phenomena, which are shown to be associated with the relativistic wave (D'Alembert) and matter-wave (Klein-Gordon) equations, respectively. We show that such stochastic processes exist and are spatial jump processes. In general, in the presence of external potentials, they do not share the Markov property, except for stationary situations. A concrete example of the pseudodifferential Cauchy-Schrödinger evolution is analyzed in detail. The relativistic covariance of related wave equations is exploited to demonstrate how the associated stochastic jump processes comply with the principles of special relativity.

Quantum mechanics without the projection postulate and its realistic interpretation

NASA Astrophysics Data System (ADS)

Dieks, D.

1989-11-01

It is widely held that quantum mechanics is the first scientific theory to present scientifically internal, fundamental difficulties for a realistic interpretation (in the philosophical sense). The standard (Copenhagen) interpretation of the quantum theory is often described as the inevitable instrumentalistic response. It is the purpose of the present article to argue that quantum theory does not present fundamental new problems to a realistic interpretation. The formalism of quantum theory has the same states—it will be argued—as the formalisms of older physical theories and is capable of the same kinds of philosophical interpretation. This result is reached via an analysis of what it means to give a realistic interpretation to a theory. The main point of difference between quantum mechanics and other theories—as far as the possibilities of interpretation are concerned—is the special treatment given to measurement by the “projection postulate.” But it is possible to do without this postulate. Moreover, rejection of the projection postulate does not, in spite of what is often maintained in the literature, automatically lead to the many-worlds interpretation of quantum mechanics. A realistic interpretation is possible in which only the reality of one (our) world is recognized. It is argued that the Copenhagen interpretation as expounded by Bohr is not in conflict with the here proposed realistic interpretation of quantum theory.

Long-distance quantum communication over noisy networks without long-time quantum memory

NASA Astrophysics Data System (ADS)

Mazurek, Paweł; Grudka, Andrzej; Horodecki, Michał; Horodecki, Paweł; Łodyga, Justyna; Pankowski, Łukasz; PrzysieŻna, Anna

2014-12-01

The problem of sharing entanglement over large distances is crucial for implementations of quantum cryptography. A possible scheme for long-distance entanglement sharing and quantum communication exploits networks whose nodes share Einstein-Podolsky-Rosen (EPR) pairs. In Perseguers et al. [Phys. Rev. A 78, 062324 (2008), 10.1103/PhysRevA.78.062324] the authors put forward an important isomorphism between storing quantum information in a dimension D and transmission of quantum information in a D +1 -dimensional network. We show that it is possible to obtain long-distance entanglement in a noisy two-dimensional (2D) network, even when taking into account that encoding and decoding of a state is exposed to an error. For 3D networks we propose a simple encoding and decoding scheme based solely on syndrome measurements on 2D Kitaev topological quantum memory. Our procedure constitutes an alternative scheme of state injection that can be used for universal quantum computation on 2D Kitaev code. It is shown that the encoding scheme is equivalent to teleporting the state, from a specific node into a whole two-dimensional network, through some virtual EPR pair existing within the rest of network qubits. We present an analytic lower bound on fidelity of the encoding and decoding procedure, using as our main tool a modified metric on space-time lattice, deviating from a taxicab metric at the first and the last time slices.

Memory-assisted quantum key distribution resilient against multiple-excitation effects

NASA Astrophysics Data System (ADS)

Lo Piparo, Nicolò; Sinclair, Neil; Razavi, Mohsen

2018-01-01

Memory-assisted measurement-device-independent quantum key distribution (MA-MDI-QKD) has recently been proposed as a technique to improve the rate-versus-distance behavior of QKD systems by using existing, or nearly-achievable, quantum technologies. The promise is that MA-MDI-QKD would require less demanding quantum memories than the ones needed for probabilistic quantum repeaters. Nevertheless, early investigations suggest that, in order to beat the conventional memory-less QKD schemes, the quantum memories used in the MA-MDI-QKD protocols must have high bandwidth-storage products and short interaction times. Among different types of quantum memories, ensemble-based memories offer some of the required specifications, but they typically suffer from multiple excitation effects. To avoid the latter issue, in this paper, we propose two new variants of MA-MDI-QKD both relying on single-photon sources for entangling purposes. One is based on known techniques for entanglement distribution in quantum repeaters. This scheme turns out to offer no advantage even if one uses ideal single-photon sources. By finding the root cause of the problem, we then propose another setup, which can outperform single memory-less setups even if we allow for some imperfections in our single-photon sources. For such a scheme, we compare the key rate for different types of ensemble-based memories and show that certain classes of atomic ensembles can improve the rate-versus-distance behavior.

Monotonically increasing functions of any quantum correlation can make all multiparty states monogamous

DOE Office of Scientific and Technical Information (OSTI.GOV)

Salini, K.; Prabhu, R.; Sen, Aditi

2014-09-15

Monogamy of quantum correlation measures puts restrictions on the sharability of quantum correlations in multiparty quantum states. Multiparty quantum states can satisfy or violate monogamy relations with respect to given quantum correlations. We show that all multiparty quantum states can be made monogamous with respect to all measures. More precisely, given any quantum correlation measure that is non-monogamic for a multiparty quantum state, it is always possible to find a monotonically increasing function of the measure that is monogamous for the same state. The statement holds for all quantum states, whether pure or mixed, in all finite dimensions and formore » an arbitrary number of parties. The monotonically increasing function of the quantum correlation measure satisfies all the properties that are expected for quantum correlations to follow. We illustrate the concepts by considering a thermodynamic measure of quantum correlation, called the quantum work deficit.« less

Field Extension of Real Values of Physical Observables in Classical Theory can Help Attain Quantum Results

NASA Astrophysics Data System (ADS)

Wang, Hai; Kumar, Asutosh; Cho, Minhyung; Wu, Junde

2018-04-01

Physical quantities are assumed to take real values, which stems from the fact that an usual measuring instrument that measures a physical observable always yields a real number. Here we consider the question of what would happen if physical observables are allowed to assume complex values. In this paper, we show that by allowing observables in the Bell inequality to take complex values, a classical physical theory can actually get the same upper bound of the Bell expression as quantum theory. Also, by extending the real field to the quaternionic field, we can puzzle out the GHZ problem using local hidden variable model. Furthermore, we try to build a new type of hidden-variable theory of a single qubit based on the result.

Solution to the sign problem in a frustrated quantum impurity model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hann, Connor T., E-mail: connor.hann@yale.edu; Huffman, Emilie; Chandrasekharan, Shailesh

2017-01-15

In this work we solve the sign problem of a frustrated quantum impurity model consisting of three quantum spin-half chains interacting through an anti-ferromagnetic Heisenberg interaction at one end. We first map the model into a repulsive Hubbard model of spin-half fermions hopping on three independent one dimensional chains that interact through a triangular hopping at one end. We then convert the fermion model into an inhomogeneous one dimensional model and express the partition function as a weighted sum over fermion worldline configurations. By imposing a pairing of fermion worldlines in half the space we show that all negative weightmore » configurations can be eliminated. This pairing naturally leads to the original frustrated quantum spin model at half filling and thus solves its sign problem.« less

Continuous-variable quantum key distribution based on a plug-and-play dual-phase-modulated coherent-states protocol

NASA Astrophysics Data System (ADS)

Huang, Duan; Huang, Peng; Wang, Tao; Li, Huasheng; Zhou, Yingming; Zeng, Guihua

2016-09-01

We propose and experimentally demonstrate a continuous-variable quantum key distribution (CV-QKD) protocol using dual-phase-modulated coherent states. We show that the modulation scheme of our protocol works equivalently to that of the Gaussian-modulated coherent-states (GMCS) protocol, but shows better experimental feasibility in the plug-and-play configuration. Besides, it waives the necessity of propagation of a local oscillator (LO) between legitimate users and generates a real local LO for quantum measurement. Our protocol is proposed independent of the one-way GMCS QKD without sending a LO [Opt. Lett. 40, 3695 (2015), 10.1364/OL.40.003695; Phys. Rev. X 5, 041009 (2015), 10.1103/PhysRevX.5.041009; Phys. Rev. X 5, 041010 (2015), 10.1103/PhysRevX.5.041010]. In those recent works, the system stability will suffer the impact of polarization drifts induced by environmental perturbations, and two independent frequency-locked laser sources are necessary to achieve reliable coherent detection. In the proposed protocol, these previous problems can be resolved. We derive the security bounds for our protocol against collective attacks, and we also perform a proof-of-principle experiment to confirm the utility of our proposal in real-life applications. Such an efficient scheme provides a way of removing the security loopholes associated with the transmitting LO, which have been a notoriously hard problem in continuous-variable quantum communication.

Quantum noise in the mirror-field system: A field theoretic approach

NASA Astrophysics Data System (ADS)

Hsiang, Jen-Tsung; Wu, Tai-Hung; Lee, Da-Shin; King, Sun-Kun; Wu, Chun-Hsien

2013-02-01

We revisit the quantum noise problem in the mirror-field system by a field-theoretic approach. Here a perfectly reflecting mirror is illuminated by a single-mode coherent state of the massless scalar field. The associated radiation pressure is described by a surface integral of the stress-tensor of the field. The read-out field is measured by a monopole detector, from which the effective distance between the detector and mirror can be obtained. In the slow-motion limit of the mirror, this field-theoretic approach allows to identify various sources of quantum noise that all in all leads to uncertainty of the read-out measurement. In addition to well-known sources from shot noise and radiation pressure fluctuations, a new source of noise is found from field fluctuations modified by the mirror's displacement. Correlation between different sources of noise can be established in the read-out measurement as the consequence of interference between the incident field and the field reflected off the mirror. In the case of negative correlation, we found that the uncertainty can be lowered than the value predicted by the standard quantum limit. Since the particle-number approach is often used in quantum optics, we compared results obtained by both approaches and examine its validity. We also derive a Langevin equation that describes the stochastic dynamics of the mirror. The underlying fluctuation-dissipation relation is briefly mentioned. Finally we discuss the backreaction induced by the radiation pressure. It will alter the mean displacement of the mirror, but we argue this backreaction can be ignored for a slowly moving mirror.

Quantum Optical Implementations of Current Quantum Computing Paradigms

DTIC Science & Technology

2005-05-01

Conferences and Proceedings: The results were presented at several conferences. These include: 1. M. O. Scully, " Foundations of Quantum Mechanics ", in...applications have revealed a strong connection between the fundamental aspects of quantum mechanics that governs physical systems and the informational...could be solved in polynomial time using quantum computers. Another set of problems where quantum mechanics can carry out computations substantially

Quantum harmonic oscillator in a thermal bath

NASA Technical Reports Server (NTRS)

Zhang, Yuhong

1993-01-01

The influence functional path-integral treatment of quantum Brownian motion is briefly reviewed. A newly derived exact master equation of a quantum harmonic oscillator coupled to a general environment at arbitrary temperature is discussed. It is applied to the problem of loss of quantum coherence.

Problems in particle theory. Technical report - 1993--1994

DOE Office of Scientific and Technical Information (OSTI.GOV)

Adler, S.L.; Wilczek, F.

This report is a progress report on the work of two principal investigators in the broad area of particle physics theory, covering their personal work, that of their coworkers, and their proposed work for the future. One author has worked in the past on various topics in field theory and particle physics, among them current algebras, the physics of neutrino induced reactions, quantum electrodynamics (including strong magnetic field processes), the theory of the axial-vector current anomaly, topics in quantum gravity, and nonlinear models for quark confinement. While much of his work has been analytical, all of the projects listed abovemore » (except for the work on gravity) had phases which required considerable computer work as well. Over the next several years, he proposes to continue or initiate research on the following problems: (1) Acceleration algorithms for the Monte Carlo analysis of lattice field and gauge theories, and more generally, new research in computational neuroscience and pattern recognition. (2) Construction of quaternionic generalizations of complex quantum mechanics and field theory, and their application to composite models of quarks and leptons, and to the problem of unifying quantum theories of matter with general relativity. One author has worked on problems in exotic quantum statistics and its applications to condensed matter systems. His work has also continued on the quantum theory of black holes. This has evolved toward understanding properties of quantum field theory and string theory in incomplete regions of flat space.« less

Quantum Gauss-Jordan Elimination and Simulation of Accounting Principles on Quantum Computers

NASA Astrophysics Data System (ADS)

Diep, Do Ngoc; Giang, Do Hoang; Van Minh, Nguyen

2017-06-01

The paper is devoted to a version of Quantum Gauss-Jordan Elimination and its applications. In the first part, we construct the Quantum Gauss-Jordan Elimination (QGJE) Algorithm and estimate the complexity of computation of Reduced Row Echelon Form (RREF) of N × N matrices. The main result asserts that QGJE has computation time is of order 2 N/2. The second part is devoted to a new idea of simulation of accounting by quantum computing. We first expose the actual accounting principles in a pure mathematics language. Then, we simulate the accounting principles on quantum computers. We show that, all accounting actions are exhousted by the described basic actions. The main problems of accounting are reduced to some system of linear equations in the economic model of Leontief. In this simulation, we use our constructed Quantum Gauss-Jordan Elimination to solve the problems and the complexity of quantum computing is a square root order faster than the complexity in classical computing.

Quantum Matching Theory (with new complexity-theoretic, combinatorial and topical insights on the nature of the quantum entanglement)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gurvits, L.

2002-01-01

Classical matching theory can be defined in terms of matrices with nonnegative entries. The notion of Positive operator, central in Quantum Theory, is a natural generalization of matrices with non-negative entries. Based on this point of view, we introduce a definition of perfect Quantum (operator) matching. We show that the new notion inherits many 'classical' properties, but not all of them. This new notion goes somewhere beyound matroids. For separable bipartite quantum states this new notion coinsides with the full rank property of the intersection of two corresponding geometric matroids. In the classical situation, permanents are naturally associated with perfectsmore » matchings. We introduce an analog of permanents for positive operators, called Quantum Permanent and show how this generalization of the permanent is related to the Quantum Entanglement. Besides many other things, Quantum Permanents provide new rational inequalities necessary for the separability of bipartite quantum states. Using Quantum Permanents, we give deterministic poly-time algorithm to solve Hidden Matroids Intersection Problem and indicate some 'classical' complexity difficulties associated with the Quantum Entanglement. Finally, we prove that the weak membership problem for the convex set of separable bipartite density matrices is NP-HARD.« less

Magnetism and local symmetry breaking in a Mott insulator with strong spin orbit interactions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lu, L.; Song, M.; Liu, W.

2017-02-09

Study of the combined effects of strong electronic correlations with spin-orbit coupling (SOC) represents a central issue in quantum materials research. Predicting emergent properties represents a huge theoretical problem since the presence of SOC implies that the spin is not a good quantum number. Existing theories propose the emergence of a multitude of exotic quantum phases, distinguishable by either local point symmetry breaking or local spin expectation values, even in materials with simple cubic crystal structure such as Ba 2NaOsO 6. Experimental tests of these theories by local probes are highly sought for. Our local measurements designed to concurrently probemore » spin and orbital/lattice degrees of freedom of Ba 2NaOsO 6 provide such tests. As a result, we show that a canted ferromagnetic phase which is preceded by local point symmetry breaking is stabilized at low temperatures, as predicted by quantum theories involving multipolar spin interactions.« less

Towards zero-threshold optical gain using charged semiconductor quantum dots

DOE PAGES

Wu, Kaifeng; Park, Young -Shin; Lim, Jaehoon; ...

2017-10-16

Colloidal semiconductor quantum dots are attractive materials for the realization of solution-processable lasers. However, their applications as optical-gain media are complicated by a non-unity degeneracy of band-edge states, because of which multiexcitons are required to achieve the lasing regime. This increases the lasing thresholds and leads to very short optical gain lifetimes limited by nonradiative Auger recombination. Here, we show that these problems can be at least partially resolved by employing not neutral but negatively charged quantum dots. By applying photodoping to specially engineered quantum dots with impeded Auger decay, we demonstrate a considerable reduction of the optical gain thresholdmore » due to suppression of ground-state absorption by pre-existing carriers. Moreover, by injecting approximately one electron per dot on average, we achieve a more than twofold reduction in the amplified spontaneous emission threshold, bringing it to the sub-single-exciton level. Furthermore, these measurements indicate the feasibility of ‘zero-threshold’ gain achievable by completely blocking the band-edge state with two electrons.« less

Statistical quasi-particle theory for open quantum systems

NASA Astrophysics Data System (ADS)

Zhang, Hou-Dao; Xu, Rui-Xue; Zheng, Xiao; Yan, YiJing

2018-04-01

This paper presents a comprehensive account on the recently developed dissipaton-equation-of-motion (DEOM) theory. This is a statistical quasi-particle theory for quantum dissipative dynamics. It accurately describes the influence of bulk environments, with a few number of quasi-particles, the dissipatons. The novel dissipaton algebra is then followed, which readily bridges the Schrödinger equation to the DEOM theory. As a fundamental theory of quantum mechanics in open systems, DEOM characterizes both the stationary and dynamic properties of system-and-bath interferences. It treats not only the quantum dissipative systems of primary interest, but also the hybrid environment dynamics that could be experimentally measurable. Examples are the linear or nonlinear Fano interferences and the Herzberg-Teller vibronic couplings in optical spectroscopies. This review covers the DEOM construction, the underlying dissipaton algebra and theorems, the physical meanings of dynamical variables, the possible identifications of dissipatons, and some recent advancements in efficient DEOM evaluations on various problems. The relations of the present theory to other nonperturbative methods are also critically presented.

Towards zero-threshold optical gain using charged semiconductor quantum dots

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Kaifeng; Park, Young -Shin; Lim, Jaehoon

Colloidal semiconductor quantum dots are attractive materials for the realization of solution-processable lasers. However, their applications as optical-gain media are complicated by a non-unity degeneracy of band-edge states, because of which multiexcitons are required to achieve the lasing regime. This increases the lasing thresholds and leads to very short optical gain lifetimes limited by nonradiative Auger recombination. Here, we show that these problems can be at least partially resolved by employing not neutral but negatively charged quantum dots. By applying photodoping to specially engineered quantum dots with impeded Auger decay, we demonstrate a considerable reduction of the optical gain thresholdmore » due to suppression of ground-state absorption by pre-existing carriers. Moreover, by injecting approximately one electron per dot on average, we achieve a more than twofold reduction in the amplified spontaneous emission threshold, bringing it to the sub-single-exciton level. Furthermore, these measurements indicate the feasibility of ‘zero-threshold’ gain achievable by completely blocking the band-edge state with two electrons.« less

Quenching of dynamic nuclear polarization by spin-orbit coupling in GaAs quantum dots.

PubMed

Nichol, John M; Harvey, Shannon P; Shulman, Michael D; Pal, Arijeet; Umansky, Vladimir; Rashba, Emmanuel I; Halperin, Bertrand I; Yacoby, Amir

2015-07-17

The central-spin problem is a widely studied model of quantum decoherence. Dynamic nuclear polarization occurs in central-spin systems when electronic angular momentum is transferred to nuclear spins and is exploited in quantum information processing for coherent spin manipulation. However, the mechanisms limiting this process remain only partially understood. Here we show that spin-orbit coupling can quench dynamic nuclear polarization in a GaAs quantum dot, because spin conservation is violated in the electron-nuclear system, despite weak spin-orbit coupling in GaAs. Using Landau-Zener sweeps to measure static and dynamic properties of the electron spin-flip probability, we observe that the size of the spin-orbit and hyperfine interactions depends on the magnitude and direction of applied magnetic field. We find that dynamic nuclear polarization is quenched when the spin-orbit contribution exceeds the hyperfine, in agreement with a theoretical model. Our results shed light on the surprisingly strong effect of spin-orbit coupling in central-spin systems.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Weinstein, Marvin; /SLAC

Last year, in 2008, I gave a talk titled Quantum Calisthenics. This year I am going to tell you about how the work I described then has spun off into a most unlikely direction. What I am going to talk about is how one maps the problem of finding clusters in a given data set into a problem in quantum mechanics. I will then use the tricks I described to let quantum evolution lets the clusters come together on their own.

Understanding quantum measurement from the solution of dynamical models

NASA Astrophysics Data System (ADS)

Allahverdyan, Armen E.; Balian, Roger; Nieuwenhuizen, Theo M.

2013-04-01

The quantum measurement problem, to wit, understanding why a unique outcome is obtained in each individual experiment, is currently tackled by solving models. After an introduction we review the many dynamical models proposed over the years for elucidating quantum measurements. The approaches range from standard quantum theory, relying for instance on quantum statistical mechanics or on decoherence, to quantum-classical methods, to consistent histories and to modifications of the theory. Next, a flexible and rather realistic quantum model is introduced, describing the measurement of the z-component of a spin through interaction with a magnetic memory simulated by a Curie-Weiss magnet, including N≫1 spins weakly coupled to a phonon bath. Initially prepared in a metastable paramagnetic state, it may transit to its up or down ferromagnetic state, triggered by its coupling with the tested spin, so that its magnetization acts as a pointer. A detailed solution of the dynamical equations is worked out, exhibiting several time scales. Conditions on the parameters of the model are found, which ensure that the process satisfies all the features of ideal measurements. Various imperfections of the measurement are discussed, as well as attempts of incompatible measurements. The first steps consist in the solution of the Hamiltonian dynamics for the spin-apparatus density matrix Dˆ(t). Its off-diagonal blocks in a basis selected by the spin-pointer coupling, rapidly decay owing to the many degrees of freedom of the pointer. Recurrences are ruled out either by some randomness of that coupling, or by the interaction with the bath. On a longer time scale, the trend towards equilibrium of the magnet produces a final state Dˆ(t) that involves correlations between the system and the indications of the pointer, thus ensuring registration. Although Dˆ(t) has the form expected for ideal measurements, it only describes a large set of runs. Individual runs are approached by analyzing the final states associated with all possible subensembles of runs, within a specified version of the statistical interpretation. There the difficulty lies in a quantum ambiguity: There exist many incompatible decompositions of the density matrix Dˆ(t) into a sum of sub-matrices, so that one cannot infer from its sole determination the states that would describe small subsets of runs. This difficulty is overcome by dynamics due to suitable interactions within the apparatus, which produce a special combination of relaxation and decoherence associated with the broken invariance of the pointer. Any subset of runs thus reaches over a brief delay a stable state which satisfies the same hierarchic property as in classical probability theory; the reduction of the state for each individual run follows. Standard quantum statistical mechanics alone appears sufficient to explain the occurrence of a unique answer in each run and the emergence of classicality in a measurement process. Finally, pedagogical exercises are proposed and lessons for future works on models are suggested, while the statistical interpretation is promoted for teaching.

Quantum Resonance Approach to Combinatorial Optimization

NASA Technical Reports Server (NTRS)

Zak, Michail

1997-01-01

It is shown that quantum resonance can be used for combinatorial optimization. The advantage of the approach is in independence of the computing time upon the dimensionality of the problem. As an example, the solution to a constraint satisfaction problem of exponential complexity is demonstrated.

Degenerate quantum codes and the quantum Hamming bound

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sarvepalli, Pradeep; Klappenecker, Andreas

2010-03-15

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

About approximation of integer factorization problem by the combination fixed-point iteration method and Bayesian rounding for quantum cryptography

NASA Astrophysics Data System (ADS)

Ogorodnikov, Yuri; Khachay, Michael; Pljonkin, Anton

2018-04-01

We describe the possibility of employing the special case of the 3-SAT problem stemming from the well known integer factorization problem for the quantum cryptography. It is known, that for every instance of our 3-SAT setting the given 3-CNF is satisfiable by a unique truth assignment, and the goal is to find this assignment. Since the complexity status of the factorization problem is still undefined, development of approximation algorithms and heuristics adopts interest of numerous researchers. One of promising approaches to construction of approximation techniques is based on real-valued relaxation of the given 3-CNF followed by minimizing of the appropriate differentiable loss function, and subsequent rounding of the fractional minimizer obtained. Actually, algorithms developed this way differ by the rounding scheme applied on their final stage. We propose a new rounding scheme based on Bayesian learning. The article shows that the proposed method can be used to determine the security in quantum key distribution systems. In the quantum distribution the Shannon rules is applied and the factorization problem is paramount when decrypting secret keys.

Study of Atomic Quasi-Stable States, Decoherence And Cooling of Mesoscale Particles

NASA Astrophysics Data System (ADS)

Zhong, Changchun

Quantum mechanics, since its very beginning, has totally changed the way we understand nature. The past hundred years have seen great successes in the application of quantum physics, including atomic spectra, laser technology, condensed matter physics and the remarkable possibility for quantum computing, etc. This thesis is dedicated to a small regime of quantum physics. In the first part of the thesis, I present the studies of atomic quasi-stable states, which refer to those Rydberg states of an atom that are relatively stable in the presence of strong fields. Through spectrally probing the quasi-stable states, series of survival peaks are found. If the quasi-stable electrons were created by ultraviolet (UV) lasers with two different frequencies, the survival peaks could be modulated by continuously changing the phase difference between the UV and the IR laser. The quantum simulation, through directly solving the Schrodinger equation, matches the experimental results performed with microwave fields, and our studies should provide a guidance for future experiments. Despite the huge achievements in the application of quantum theory, there are still some fundamental problems that remain unresolved. One of them is the so-called quantum-to-classical transition, which refers to the expectation that the system behaves in a more classical manner when the system size increases. This basic question was not well answered until decoherence theory was proposed, which states that the coherence of a quantum system tends to be destroyed by environmental interruptions. Thus, if a system is well isolated from its environment, it is in principle possible to observe macroscopic quantum coherence. Quite recently, testing quantum principles in the macroscale has become a hot topic due to rapic technological developments. A very promising platform for testing macroscale quantum physics is a laser levitated nanoparticle, and cooling its mechanical motion to the ground state is the first step. In the second part of this thesis, we develop the theory of decoherence for a mesoscopic system's rotational degrees of freedom. Combining decoherence in the translational degrees of freedom, the system's shot noise heating is discussed. We then focus on cooling the nanoparticle in the laser-shot-noise-dominant regime using two different feedback cooling schemes: the force feedback cooling and the parametric feedback cooling. Both quantum and classical calculations are performed, and an exact match is observed. We also explore the parameters that could possibly affect the cooling trend, where we find that the cooling limit for both cooling schemes strongly depends on the position measurement efficiency, and it poses good questions for researchers interested in achieving ground state cooling: what is the best measurement efficiency for a given measurement setup and what can be done to get a better measurement efficiency?

Role of Weak Measurements on States Ordering and Monogamy of Quantum Correlation

NASA Astrophysics Data System (ADS)

Hu, Ming-Liang; Fan, Heng; Tian, Dong-Ping

2015-01-01

The information-theoretic definition of quantum correlation, e.g., quantum discord, is measurement dependent. By considering the more general quantum measurements, weak measurements, which include the projective measurement as a limiting case, we show that while weak measurements can enable one to capture more quantumness of correlation in a state, it can also induce other counterintuitive quantum effects. Specifically, we show that the general measurements with different strengths can impose different orderings for quantum correlations of some states. It can also modify the monogamous character for certain classes of states as well which may diminish the usefulness of quantum correlation as a resource in some protocols. In this sense, we say that the weak measurements play a dual role in defining quantum correlation.

Quantum histories without contrary inferences

NASA Astrophysics Data System (ADS)

Losada, Marcelo; Laura, Roberto

2014-12-01

In the consistent histories formulation of quantum theory it was shown that it is possible to retrodict contrary properties. We show that this problem do not appear in our formalism of generalized contexts for quantum histories.

Test-state approach to the quantum search problem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sehrawat, Arun; Nguyen, Le Huy; Graduate School for Integrative Sciences and Engineering, National University of Singapore, Singapore 117597

2011-05-15

The search for 'a quantum needle in a quantum haystack' is a metaphor for the problem of finding out which one of a permissible set of unitary mappings - the oracles - is implemented by a given black box. Grover's algorithm solves this problem with quadratic speedup as compared with the analogous search for 'a classical needle in a classical haystack'. Since the outcome of Grover's algorithm is probabilistic - it gives the correct answer with high probability, not with certainty - the answer requires verification. For this purpose we introduce specific test states, one for each oracle. These testmore » states can also be used to realize 'a classical search for the quantum needle' which is deterministic - it always gives a definite answer after a finite number of steps - and 3.41 times as fast as the purely classical search. Since the test-state search and Grover's algorithm look for the same quantum needle, the average number of oracle queries of the test-state search is the classical benchmark for Grover's algorithm.« less

Symmetric quantum fully homomorphic encryption with perfect security

NASA Astrophysics Data System (ADS)

Liang, Min

2013-12-01

Suppose some data have been encrypted, can you compute with the data without decrypting them? This problem has been studied as homomorphic encryption and blind computing. We consider this problem in the context of quantum information processing, and present the definitions of quantum homomorphic encryption (QHE) and quantum fully homomorphic encryption (QFHE). Then, based on quantum one-time pad (QOTP), we construct a symmetric QFHE scheme, where the evaluate algorithm depends on the secret key. This scheme permits any unitary transformation on any -qubit state that has been encrypted. Compared with classical homomorphic encryption, the QFHE scheme has perfect security. Finally, we also construct a QOTP-based symmetric QHE scheme, where the evaluate algorithm is independent of the secret key.

Measurement problem in Program Universe. Revision

NASA Astrophysics Data System (ADS)

Noyes, H. P.; Gefwert, C.; Manthey, M. J.

1985-07-01

The measurement problem of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not and) G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact.

Chain representations of Open Quantum Systems and Lieb-Robinson like bounds for the dynamics

NASA Astrophysics Data System (ADS)

Woods, Mischa

2013-03-01

This talk is concerned with the mapping of the Hamiltonian of open quantum systems onto chain representations, which forms the basis for a rigorous theory of the interaction of a system with its environment. This mapping progresses as an interaction which gives rise to a sequence of residual spectral densities of the system. The rigorous mathematical properties of this mapping have been unknown so far. Here we develop the theory of secondary measures to derive an analytic, expression for the sequence solely in terms of the initial measure and its associated orthogonal polynomials of the first and second kind. These mappings can be thought of as taking a highly nonlocal Hamiltonian to a local Hamiltonian. In the latter, a Lieb-Robinson like bound for the dynamics of the open quantum system makes sense. We develop analytical bounds on the error to observables of the system as a function of time when the semi-infinite chain in truncated at some finite length. The fact that this is possible shows that there is a finite ``Speed of sound'' in these chain representations. This has many implications of the simulatability of open quantum systems of this type and demonstrates that a truncated chain can faithfully reproduce the dynamics at shorter times. These results make a significant and mathematically rigorous contribution to the understanding of the theory of open quantum systems; and pave the way towards the efficient simulation of these systems, which within the standard methods, is often an intractable problem. EPSRC CDT in Controlled Quantum Dynamics, EU STREP project and Alexander von Humboldt Foundation

Position-Momentum Duality and Fractional Quantum Hall Effect in Chern Insulators

DOE PAGES

Claassen, Martin; Lee, Ching-Hua; Thomale, Ronny; ...

2015-06-11

We develop a first quantization description of fractional Chern insulators that is the dual of the conventional fractional quantum Hall (FQH) problem, with the roles of position and momentum interchanged. In this picture, FQH states are described by anisotropic FQH liquids forming in momentum-space Landau levels in a fluctuating magnetic field. The fundamental quantum geometry of the problem emerges from the interplay of single-body and interaction metrics, both of which act as momentum-space duals of the geometrical picture of the anisotropic FQH effect. We then present a novel broad class of ideal Chern insulator lattice models that act as dualsmore » of the isotropic FQH effect. The interacting problem is well-captured by Haldane pseudopotentials and affords a detailed microscopic understanding of the interplay of interactions and non-trivial quantum geometry.« less

Bell-Boole Inequality: Nonlocality or Probabilistic Incompatibility of Random Variables?

NASA Astrophysics Data System (ADS)

Khrennikov, Andrei

2008-06-01

The main aim of this report is to inform the quantum information community about investigations on the problem of probabilistic compatibility of a family of random variables: a possibility to realize such a family on the basis of a single probability measure (to construct a single Kolmogorov probability space). These investigations were started hundred of years ago by J. Boole (who invented Boolean algebras). The complete solution of the problem was obtained by Soviet mathematician Vorobjev in 60th. Surprisingly probabilists and statisticians obtained inequalities for probabilities and correlations among which one can find the famous Bell’s inequality and its generalizations. Such inequalities appeared simply as constraints for probabilistic compatibility. In this framework one can not see a priori any link to such problems as nonlocality and “death of reality” which are typically linked to Bell’s type inequalities in physical literature. We analyze the difference between positions of mathematicians and quantum physicists. In particular, we found that one of the most reasonable explanations of probabilistic incompatibility is mixing in Bell’s type inequalities statistical data from a number of experiments performed under different experimental contexts.

Infinite variance in fermion quantum Monte Carlo calculations.

PubMed

Shi, Hao; Zhang, Shiwei

2016-03-01

For important classes of many-fermion problems, quantum Monte Carlo (QMC) methods allow exact calculations of ground-state and finite-temperature properties without the sign problem. The list spans condensed matter, nuclear physics, and high-energy physics, including the half-filled repulsive Hubbard model, the spin-balanced atomic Fermi gas, and lattice quantum chromodynamics calculations at zero density with Wilson Fermions, and is growing rapidly as a number of problems have been discovered recently to be free of the sign problem. In these situations, QMC calculations are relied on to provide definitive answers. Their results are instrumental to our ability to understand and compute properties in fundamental models important to multiple subareas in quantum physics. It is shown, however, that the most commonly employed algorithms in such situations have an infinite variance problem. A diverging variance causes the estimated Monte Carlo statistical error bar to be incorrect, which can render the results of the calculation unreliable or meaningless. We discuss how to identify the infinite variance problem. An approach is then proposed to solve the problem. The solution does not require major modifications to standard algorithms, adding a "bridge link" to the imaginary-time path integral. The general idea is applicable to a variety of situations where the infinite variance problem may be present. Illustrative results are presented for the ground state of the Hubbard model at half-filling.

Completing the Physical Representation of Quantum Algorithms Provides a Quantitative Explanation of Their Computational Speedup

NASA Astrophysics Data System (ADS)

Castagnoli, Giuseppe

2018-03-01

The usual representation of quantum algorithms, limited to the process of solving the problem, is physically incomplete. We complete it in three steps: (i) extending the representation to the process of setting the problem, (ii) relativizing the extended representation to the problem solver to whom the problem setting must be concealed, and (iii) symmetrizing the relativized representation for time reversal to represent the reversibility of the underlying physical process. The third steps projects the input state of the representation, where the problem solver is completely ignorant of the setting and thus the solution of the problem, on one where she knows half solution (half of the information specifying it when the solution is an unstructured bit string). Completing the physical representation shows that the number of computation steps (oracle queries) required to solve any oracle problem in an optimal quantum way should be that of a classical algorithm endowed with the advanced knowledge of half solution.

Quantum Mechanics From the Cradle?

ERIC Educational Resources Information Center

Martin, John L.

1974-01-01

States that the major problem in learning quantum mechanics is often the student's ignorance of classical mechanics and that one conceptual hurdle in quantum mechanics is its statistical nature, in contrast to the determinism of classical mechanics. (MLH)

Quantum discord with weak measurement operators of quasi-Werner states based on bipartite entangled coherent states

NASA Astrophysics Data System (ADS)

Castro, E.; Gómez, R.; Ladera, C. L.; Zambrano, A.

2013-11-01

Among many applications quantum weak measurements have been shown to be important in exploring fundamental physics issues, such as the experimental violation of the Heisenberg uncertainty relation and the Hardy paradox, and have also technological implications in quantum optics, quantum metrology and quantum communications, where the precision of the measurement is as important as the precision of quantum state preparation. The theory of weak measurement can be formulated using the pre-and post-selected quantum systems, as well as using the weak measurement operator formalism. In this work, we study the quantum discord (QD) of quasi-Werner mixed states based on bipartite entangled coherent states using the weak measurements operator, instead of the projective measurement operators. We then compare the quantum discord for both kinds of measurement operators, in terms of the entanglement quality, the latter being measured using the concept of concurrence. It's found greater quantum correlations using the weak measurement operators.

A Non-Intuitionist's Approach To The Interpretation Problem Of Quantum Mechanics

NASA Astrophysics Data System (ADS)

Grelland, Hans Herlof

2005-02-01

A philosophy of physics called "linguistic empiricism" is presented and applied to the interpretation problem of quantum mechanics. This philosophical position is based on the works of Jacques Derrida. The main propositions are (i) that meaning, included the meaning attached to observations, are language-dependent and (ii) that mathematics in physics should be considered as a proper language, not necessary translatable to a more basic language of intuition and immediate experience. This has fundamental implications for quantum mechanics, which is a mathematically coherent and consistent theory; its interpretation problem is associated with its lack of physical images expressible in ordinary language.

Hidden symmetry in the confined hydrogen atom problem

NASA Astrophysics Data System (ADS)

Pupyshev, Vladimir I.; Scherbinin, Andrei V.

2002-07-01

The classical counterpart of the well-known quantum mechanical model of a spherically confined hydrogen atom is examined in terms of the Lenz vector, a dynamic variable featuring the conventional Kepler problem. It is shown that a conditional conservation law associated with the Lenz vector is true, in fair agreement with the corresponding quantum problem previously found to exhibit a hidden symmetry as well.

The Problem of Representation and Experience in Quantum Mechanics

NASA Astrophysics Data System (ADS)

Ronde, Christian De

2014-03-01

In this paper we discuss the problem of representation and experience in quantum mechanics. We analyze the importance of metaphysics in physical thought and its relation to empiricism and analytic philosophy. We argue against both instrumentalism and scientific realism and claim that both perspectives tend to bypass the problem of representation and justify a "common sense" type experience. Finally, we present our expressionist conception of physics.

Global Dirac bispinor entanglement under Lorentz boosts

NASA Astrophysics Data System (ADS)

Bittencourt, Victor A. S. V.; Bernardini, Alex E.; Blasone, Massimo

2018-03-01

The effects of Lorentz boosts on the quantum entanglement encoded by a pair of massive spin-1/2 particles are described according to the Lorentz covariant structure described by Dirac bispinors. The quantum system considered incorporates four degrees of freedom: two of them related to the bispinor intrinsic parity and the other two related to the bispinor spin projection, i.e., the Dirac particle helicity. Because of the natural multipartite structure involved, the Meyer-Wallach global measure of entanglement is preliminarily used for computing global quantum correlations, while the entanglement separately encoded by spin degrees of freedom is measured through the negativity of the reduced two-particle spin-spin state. A general framework to compute the changes on quantum entanglement induced by a boost is developed and then specialized to describe three particular antisymmetric two-particle states. According to the results obtained, two-particle spin-spin entanglement cannot be created by the action of a Lorentz boost in a spin-spin separable antisymmetric state. On the other hand, the maximal spin-spin entanglement encoded by antisymmetric superpositions is degraded by Lorentz boosts driven by high-speed frame transformations. Finally, the effects of boosts on chiral states are shown to exhibit interesting invariance properties, which can only be obtained through such a Lorentz covariant formulation of the problem.

Entanglement via Faraday effect - an old tool at a new job for Quantum Networks

NASA Astrophysics Data System (ADS)

Polzik, Eugene

2002-05-01

A new approach to the problem of the quantum interface between light and atoms has been developed [1,2]. The method utilizes free space dispersive interaction of pulses of light with spin polarized atomic ensembles. Entanglement between the polarization state of light and the collective spin state of atoms is established by measurement, more precisely by detection of light in certain polarization basis. In the first demonstration of this approach [3] we have generated a long-lived entangled state of two separate macroscopic atomic samples by a polarization measurement on light transmitted through the samples. We then have shown that this approach also works for mapping of a quantum state of light onto long-lived atomic spin state [4] paving the road towards realization of the quantum memory for light. Progress with other communication protocols such as atomic state teleportation and multiparty networks will be presented. 1. A. Kuzmich and E. S. Polzik, Phys. Rev. Lett. (2000) 85, 5639. 2. Lu-Ming Duan, J.I. Cirac, P. Zoller and E. S. Polzik, Phys. Rev. Lett. (2000) 85, (25), 5643. 3. B. Julsgaard, A. Kozhekin, and E. S. Polzik, Nature, 413, 400 (2001). 4. J. L. Sorensen, B. Julsgaard, C. Schori and E. S. Polzik, submitted for publication.

Walther Nernst, Albert Einstein, Otto Stern, and the Specific Heat of Hydrogen.

NASA Astrophysics Data System (ADS)

Gearhart, Clayton

2007-04-01

In 1911, the German physical chemist Walther Nernst observed that the new quantum theory might both clarify unresolved problems in the specific heats of gases and shed new light on quantum theory itself. He noted that measurements of the specific heat of hydrogen gas at low temperatures might be particularly informative. Arnold Euken, working in Nernst's laboratory in Berlin, published the first measurements in 1912. They showed a sharp drop, corresponding to the rotational degrees of freedom ``freezing out.'' Nernst also developed a theory in his 1911 paper, in which, remarkably, rotational energies were not quantized. Instead, the specific heat fell off because the gas was in equilibrium with quantized Planck oscillators. Nernst's theory was flawed But Einstein adopted an improved version at the 1911 Solvay Conference, and in 1913, he and Otto Stern published a more detailed treatment, in which they suggested tentatively that Planck's recently introduced zero-point energy might reduce or even eliminate the need to quantize physical systems. This episode points out just how mysterious quantum phenomena seemed early in the 20th century.

Quantum Theory of Superresolution for Incoherent Optical Imaging

NASA Astrophysics Data System (ADS)

Tsang, Mankei

Rayleigh's criterion for resolving two incoherent point sources has been the most influential measure of optical imaging resolution for over a century. In the context of statistical image processing, violation of the criterion is especially detrimental to the estimation of the separation between the sources, and modern far-field superresolution techniques rely on suppressing the emission of close sources to enhance the localization precision. Using quantum optics, quantum metrology, and statistical analysis, here we show that, even if two close incoherent sources emit simultaneously, measurements with linear optics and photon counting can estimate their separation from the far field almost as precisely as conventional methods do for isolated sources, rendering Rayleigh's criterion irrelevant to the problem. Our results demonstrate that superresolution can be achieved not only for fluorophores but also for stars. Recent progress in generalizing our theory for multiple sources and spectroscopy will also be discussed. This work is supported by the Singapore National Research Foundation under NRF Grant No. NRF-NRFF2011-07 and the Singapore Ministry of Education Academic Research Fund Tier 1 Project R-263-000-C06-112.

Quantum Information Theory of Measurement

NASA Astrophysics Data System (ADS)

Glick, Jennifer Ranae

Quantum measurement lies at the heart of quantum information processing and is one of the criteria for quantum computation. Despite its central role, there remains a need for a robust quantum information-theoretical description of measurement. In this work, I will quantify how information is processed in a quantum measurement by framing it in quantum information-theoretic terms. I will consider a diverse set of measurement scenarios, including weak and strong measurements, and parallel and consecutive measurements. In each case, I will perform a comprehensive analysis of the role of entanglement and entropy in the measurement process and track the flow of information through all subsystems. In particular, I will discuss how weak and strong measurements are fundamentally of the same nature and show that weak values can be computed exactly for certain measurements with an arbitrary interaction strength. In the context of the Bell-state quantum eraser, I will derive a trade-off between the coherence and "which-path" information of an entangled pair of photons and show that a quantum information-theoretic approach yields additional insights into the origins of complementarity. I will consider two types of quantum measurements: those that are made within a closed system where every part of the measurement device, the ancilla, remains under control (what I will call unamplified measurements), and those performed within an open system where some degrees of freedom are traced over (amplified measurements). For sequences of measurements of the same quantum system, I will show that information about the quantum state is encoded in the measurement chain and that some of this information is "lost" when the measurements are amplified-the ancillae become equivalent to a quantum Markov chain. Finally, using the coherent structure of unamplified measurements, I will outline a protocol for generating remote entanglement, an essential resource for quantum teleportation and quantum cryptographic tasks.

Finding Maximum Cliques on the D-Wave Quantum Annealer

DOE PAGES

Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg; ...

2018-05-03

This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less

Finding Maximum Cliques on the D-Wave Quantum Annealer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg

This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less

Intrication temporelle et communication quantique

NASA Astrophysics Data System (ADS)

Bussieres, Felix

Quantum communication is the art of transferring a quantum state from one place to another and the study of tasks that can be accomplished with it. This thesis is devoted to the development of tools and tasks for quantum communication in a real-world setting. These were implemented using an underground optical fibre link deployed in an urban environment. The technological and theoretical innovations presented here broaden the range of applications of time-bin entanglement through new methods of manipulating time-bin qubits, a novel model for characterizing sources of photon pairs, new ways of testing non-locality and the design and the first implementation of a new loss-tolerant quantum coin-flipping protocol. Manipulating time-bin qubits. A single photon is an excellent vehicle in which a qubit, the fundamental unit of quantum information, can be encoded. In particular, the time-bin encoding of photonic qubits is well suited for optical fibre transmission. Before this thesis, the applications of quantum communication based on the time-bin encoding were limited due to the lack of methods to implement arbitrary operations and measurements. We have removed this restriction by proposing the first methods to realize arbitrary deterministic operations on time-bin qubits as well as single qubit measurements in an arbitrary basis. We applied these propositions to the specific case of optical measurement-based quantum computing and showed how to implement the feedforward operations, which are essential to this model. This therefore opens new possibilities for creating an optical quantum computer, but also for other quantum communication tasks. Characterizing sources of photon pairs. Experimental quantum communication requires the creation of single photons and entangled photons. These two ingredients can be obtained from a source of photon pairs based on non-linear spontaneous processes. Several tasks in quantum communication require a precise knowledge of the properties of the source being used. We developed and implemented a fast and simple method to characterize a source of photon pairs. This method is well suited for a realistic setting where experimental conditions, such as channel transmittance, may fluctuate, and for which the characterization of the source has to be done in real time. Testing the non-locality of time-bin entanglement. Entanglement is a resource needed for the realization of many important tasks in quantum communication. It also allows two physical systems to be correlated in a way that cannot be explained by classical physics; this manifestation of entanglement is called non-locality. We built a source of time-bin entangled photonic qubits and characterized it with the new methods implementing arbitrary single qubit measurements that we developed. This allowed us to reveal the non-local nature of our source of entanglement in ways that were never implemented before. It also opens the door to study previously untested features of non-locality using this source. Theses experiments were performed in a realistic setting where quantum (non-local) correlations were observed even after transmission of one of the entangled qubits over 12.4 km of an underground optical fibre. Flipping quantum coins. Quantum coin-flipping is a quantum cryptographic primitive proposed in 1984, that is when the very first steps of quantum communication were being taken, where two players alternate in sending classical and quantum information in order to generate a shared random bit. The use of quantum information is such that a potential cheater cannot force the outcome to his choice with certainty. Classically, however, one of the players can always deterministically choose the outcome. Unfortunately, the security of all previous quantum coin-flipping protocols is seriously compromised in the presence of losses on the transmission channel, thereby making this task impractical. We found a solution to this problem and obtained the first loss-tolerant quantum coin-flipping protocol whose security is independent of the amount of the losses. We have also experimentally demonstrated our loss-tolerant protocol using our source of time-bin entanglement combined with our arbitrary single qubit measurement methods. This experiment took place in a realistic setting where qubits travelled over an underground optical fibre link. This new task thus joins quantum key distribution as a practical application of quantum communication. Keywords. quantum communication, photonics, time-bin encoding, source of photon pairs, heralded single photon source, entanglement, non-locality, time-bin entanglement, hybrid entanglement, quantum network, quantum cryptography, quantum coin-flipping, measurement-based quantum computation, telecommunication, optical fibre, nonlinear optics.

Spectral and entropic characterizations of Wigner functions: applications to model vibrational systems.

PubMed

Luzanov, A V

2008-09-07

The Wigner function for the pure quantum states is used as an integral kernel of the non-Hermitian operator K, to which the standard singular value decomposition (SVD) is applied. It provides a set of the squared singular values treated as probabilities of the individual phase-space processes, the latter being described by eigenfunctions of KK(+) (for coordinate variables) and K(+)K (for momentum variables). Such a SVD representation is employed to obviate the well-known difficulties in the definition of the phase-space entropy measures in terms of the Wigner function that usually allows negative values. In particular, the new measures of nonclassicality are constructed in the form that automatically satisfies additivity for systems composed of noninteracting parts. Furthermore, the emphasis is given on the geometrical interpretation of the full entropy measure as the effective phase-space volume in the Wigner picture of quantum mechanics. The approach is exemplified by considering some generic vibrational systems. Specifically, for eigenstates of the harmonic oscillator and a superposition of coherent states, the singular value spectrum is evaluated analytically. Numerical computations are given for the nonlinear problems (the Morse and double well oscillators, and the Henon-Heiles system). We also discuss the difficulties in implementation of a similar technique for electronic problems.

Quantum annealing versus classical machine learning applied to a simplified computational biology problem

PubMed Central

Li, Richard Y.; Di Felice, Rosa; Rohs, Remo; Lidar, Daniel A.

2018-01-01

Transcription factors regulate gene expression, but how these proteins recognize and specifically bind to their DNA targets is still debated. Machine learning models are effective means to reveal interaction mechanisms. Here we studied the ability of a quantum machine learning approach to predict binding specificity. Using simplified datasets of a small number of DNA sequences derived from actual binding affinity experiments, we trained a commercially available quantum annealer to classify and rank transcription factor binding. The results were compared to state-of-the-art classical approaches for the same simplified datasets, including simulated annealing, simulated quantum annealing, multiple linear regression, LASSO, and extreme gradient boosting. Despite technological limitations, we find a slight advantage in classification performance and nearly equal ranking performance using the quantum annealer for these fairly small training data sets. Thus, we propose that quantum annealing might be an effective method to implement machine learning for certain computational biology problems. PMID:29652405

Quantum annealing with all-to-all connected nonlinear oscillators

PubMed Central

Puri, Shruti; Andersen, Christian Kraglund; Grimsmo, Arne L.; Blais, Alexandre

2017-01-01

Quantum annealing aims at solving combinatorial optimization problems mapped to Ising interactions between quantum spins. Here, with the objective of developing a noise-resilient annealer, we propose a paradigm for quantum annealing with a scalable network of two-photon-driven Kerr-nonlinear resonators. Each resonator encodes an Ising spin in a robust degenerate subspace formed by two coherent states of opposite phases. A fully connected optimization problem is mapped to local fields driving the resonators, which are connected with only local four-body interactions. We describe an adiabatic annealing protocol in this system and analyse its performance in the presence of photon loss. Numerical simulations indicate substantial resilience to this noise channel, leading to a high success probability for quantum annealing. Finally, we propose a realistic circuit QED implementation of this promising platform for implementing a large-scale quantum Ising machine. PMID:28593952

Coherent states, quantum gravity, and the Born-Oppenheimer approximation. I. General considerations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stottmeister, Alexander, E-mail: alexander.stottmeister@gravity.fau.de; Thiemann, Thomas, E-mail: thomas.thiemann@gravity.fau.de

2016-06-15

This article, as the first of three, aims at establishing the (time-dependent) Born-Oppenheimer approximation, in the sense of space adiabatic perturbation theory, for quantum systems constructed by techniques of the loop quantum gravity framework, especially the canonical formulation of the latter. The analysis presented here fits into a rather general framework and offers a solution to the problem of applying the usual Born-Oppenheimer ansatz for molecular (or structurally analogous) systems to more general quantum systems (e.g., spin-orbit models) by means of space adiabatic perturbation theory. The proposed solution is applied to a simple, finite dimensional model of interacting spin systems,more » which serves as a non-trivial, minimal model of the aforesaid problem. Furthermore, it is explained how the content of this article and its companion affect the possible extraction of quantum field theory on curved spacetime from loop quantum gravity (including matter fields).« less

Quantum key distribution session with 16-dimensional photonic states.

PubMed

Etcheverry, S; Cañas, G; Gómez, E S; Nogueira, W A T; Saavedra, C; Xavier, G B; Lima, G

2013-01-01

The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD.

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding.

PubMed

Lau, Hoi-Kwan; Plenio, Martin B

2016-09-02

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

Universal Quantum Computing with Arbitrary Continuous-Variable Encoding

NASA Astrophysics Data System (ADS)

Lau, Hoi-Kwan; Plenio, Martin B.

2016-09-01

Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal quantum computation with a fixed set of operations but arbitrary encoding. By storing a qubit in the parity of two or four qumodes, all computing processes can be implemented by basis state preparations, continuous-variable exponential-swap operations, and swap tests. Our formalism inherits the advantages that the quantum information is decoupled from collective noise, and logical qubits with different encodings can be brought to interact without decoding. We also propose a possible implementation of the required operations by using interactions that are available in a variety of continuous-variable systems. Our work separates the "hardware" problem of engineering quantum-computing-universal interactions, from the "software" problem of designing encodings for specific purposes. The development of quantum computer architecture could hence be simplified.

An adaptive quantum mechanics/molecular mechanics method for the infrared spectrum of water: incorporation of the quantum effect between solute and solvent.

PubMed

Watanabe, Hiroshi C; Banno, Misa; Sakurai, Minoru

2016-03-14

Quantum effects in solute-solvent interactions, such as the many-body effect and the dipole-induced dipole, are known to be critical factors influencing the infrared spectra of species in the liquid phase. For accurate spectrum evaluation, the surrounding solvent molecules, in addition to the solute of interest, should be treated using a quantum mechanical method. However, conventional quantum mechanics/molecular mechanics (QM/MM) methods cannot handle free QM solvent molecules during molecular dynamics (MD) simulation because of the diffusion problem. To deal with this problem, we have previously proposed an adaptive QM/MM "size-consistent multipartitioning (SCMP) method". In the present study, as the first application of the SCMP method, we demonstrate the reproduction of the infrared spectrum of liquid-phase water, and evaluate the quantum effect in comparison with conventional QM/MM simulations.

Quantum key distribution session with 16-dimensional photonic states

NASA Astrophysics Data System (ADS)

Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.

2013-07-01

The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD.

Experimental loss-tolerant quantum coin flipping

PubMed Central

Berlín, Guido; Brassard, Gilles; Bussières, Félix; Godbout, Nicolas; Slater, Joshua A.; Tittel, Wolfgang

2011-01-01

Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of classical bits: one dishonest player has complete control over the final outcome. It is only when coin flipping is supplemented with quantum communication that this problem can be alleviated, although partial bias remains. Unfortunately, practical systems are subject to loss of quantum data, which allows a cheater to force a bias that is complete or arbitrarily close to complete in all previous protocols and implementations. Here we report on the first experimental demonstration of a quantum coin-flipping protocol for which loss cannot be exploited to cheat better. By eliminating the problem of loss, which is unavoidable in any realistic setting, quantum coin flipping takes a significant step towards real-world applications of quantum communication. PMID:22127057

Quantum key distribution session with 16-dimensional photonic states

PubMed Central

Etcheverry, S.; Cañas, G.; Gómez, E. S.; Nogueira, W. A. T.; Saavedra, C.; Xavier, G. B.; Lima, G.

2013-01-01

The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD. PMID:23897033

Quantum machine learning: a classical perspective

NASA Astrophysics Data System (ADS)

Ciliberto, Carlo; Herbster, Mark; Ialongo, Alessandro Davide; Pontil, Massimiliano; Rocchetto, Andrea; Severini, Simone; Wossnig, Leonard

2018-01-01

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning (ML) techniques to impressive results in regression, classification, data generation and reinforcement learning tasks. Despite these successes, the proximity to the physical limits of chip fabrication alongside the increasing size of datasets is motivating a growing number of researchers to explore the possibility of harnessing the power of quantum computation to speed up classical ML algorithms. Here we review the literature in quantum ML and discuss perspectives for a mixed readership of classical ML and quantum computation experts. Particular emphasis will be placed on clarifying the limitations of quantum algorithms, how they compare with their best classical counterparts and why quantum resources are expected to provide advantages for learning problems. Learning in the presence of noise and certain computationally hard problems in ML are identified as promising directions for the field. Practical questions, such as how to upload classical data into quantum form, will also be addressed.

Quantum machine learning: a classical perspective

PubMed Central

Ciliberto, Carlo; Herbster, Mark; Ialongo, Alessandro Davide; Pontil, Massimiliano; Severini, Simone; Wossnig, Leonard

2018-01-01

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning (ML) techniques to impressive results in regression, classification, data generation and reinforcement learning tasks. Despite these successes, the proximity to the physical limits of chip fabrication alongside the increasing size of datasets is motivating a growing number of researchers to explore the possibility of harnessing the power of quantum computation to speed up classical ML algorithms. Here we review the literature in quantum ML and discuss perspectives for a mixed readership of classical ML and quantum computation experts. Particular emphasis will be placed on clarifying the limitations of quantum algorithms, how they compare with their best classical counterparts and why quantum resources are expected to provide advantages for learning problems. Learning in the presence of noise and certain computationally hard problems in ML are identified as promising directions for the field. Practical questions, such as how to upload classical data into quantum form, will also be addressed. PMID:29434508

Quantum machine learning: a classical perspective.

PubMed

Ciliberto, Carlo; Herbster, Mark; Ialongo, Alessandro Davide; Pontil, Massimiliano; Rocchetto, Andrea; Severini, Simone; Wossnig, Leonard

2018-01-01

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning (ML) techniques to impressive results in regression, classification, data generation and reinforcement learning tasks. Despite these successes, the proximity to the physical limits of chip fabrication alongside the increasing size of datasets is motivating a growing number of researchers to explore the possibility of harnessing the power of quantum computation to speed up classical ML algorithms. Here we review the literature in quantum ML and discuss perspectives for a mixed readership of classical ML and quantum computation experts. Particular emphasis will be placed on clarifying the limitations of quantum algorithms, how they compare with their best classical counterparts and why quantum resources are expected to provide advantages for learning problems. Learning in the presence of noise and certain computationally hard problems in ML are identified as promising directions for the field. Practical questions, such as how to upload classical data into quantum form, will also be addressed.

Quantum-like model of brain's functioning: decision making from decoherence.

PubMed

Asano, Masanari; Ohya, Masanori; Tanaka, Yoshiharu; Basieva, Irina; Khrennikov, Andrei

2011-07-21

We present a quantum-like model of decision making in games of the Prisoner's Dilemma type. By this model the brain processes information by using representation of mental states in a complex Hilbert space. Driven by the master equation the mental state of a player, say Alice, approaches an equilibrium point in the space of density matrices (representing mental states). This equilibrium state determines Alice's mixed (i.e., probabilistic) strategy. We use a master equation in which quantum physics describes the process of decoherence as the result of interaction with environment. Thus our model is a model of thinking through decoherence of the initially pure mental state. Decoherence is induced by the interaction with memory and the external mental environment. We study (numerically) the dynamics of quantum entropy of Alice's mental state in the process of decision making. We also consider classical entropy corresponding to Alice's choices. We introduce a measure of Alice's diffidence as the difference between classical and quantum entropies of Alice's mental state. We see that (at least in our model example) diffidence decreases (approaching zero) in the process of decision making. Finally, we discuss the problem of neuronal realization of quantum-like dynamics in the brain; especially roles played by lateral prefrontal cortex or/and orbitofrontal cortex. Copyright © 2011 Elsevier Ltd. All rights reserved.

Quantum information generation, storage and transmission based on nuclear spins

NASA Astrophysics Data System (ADS)

Zaharov, V. V.; Makarov, V. I.

2018-05-01

A new approach to quantum information generation, storage and transmission is proposed. It is shown that quantum information generation and storage using an ensemble of N electron spins encounter unresolvable implementation problems (at least at the present time). As an alternative implementation we discuss two promising radical systems, one with N equivalent nuclear spins and another with N nonequivalent nuclear spins. Detailed analysis shows that only the radical system containing N nonequivalent nuclei is perfectly matched for quantum information generation, storage and transmission. We develop a procedure based on pulsed electron paramagnetic resonance (EPR) and we apply it to the radical system with the set of nonequivalent nuclei. The resulting EPR spectrum contains 2N transition lines, where N is the number of the atoms with the nuclear spin 1/2, and each of these lines may be encoded with a determined qudit sequence. For encoding the EPR lines we propose to submit the radical system to two magnetic pulses in the direction perpendicular to the z axis of the reference frame. As a result, the radical system impulse response may be measured, stored and transmitted through the communications channel. Confirming our development, the ab initio analysis of the system with three anion radicals was done showing matching between the simulations and the theoretical predictions. The developed method may be easily adapted for quantum information generation, storage, processing and transmission in quantum computing and quantum communications applications.

Quantum teleportation and information splitting via four-qubit cluster state and a Bell state

NASA Astrophysics Data System (ADS)

Ramírez, Marlon David González; Falaye, Babatunde James; Sun, Guo-Hua; Cruz-Irisson, M.; Dong, Shi-Hai

2017-10-01

Quantum teleportation provides a "bodiless" way of transmitting the quantum state from one object to another, at a distant location, using a classical communication channel and a previously shared entangled state. In this paper, we present a tripartite scheme for probabilistic teleportation of an arbitrary single qubit state, without losing the information of the state being teleported, via a fourqubit cluster state of the form | ϕ>1234 = α|0000>+ β|1010>+ γ|0101>- η|1111>, as the quantum channel, where the nonzero real numbers α, β, γ, and η satisfy the relation j αj2 + | β|2 + | γ|2 + | η|2 = 1. With the introduction of an auxiliary qubit with state |0>, using a suitable unitary transformation and a positive-operator valued measure (POVM), the receiver can recreate the state of the original qubit. An important advantage of the teleportation scheme demonstrated here is that, if the teleportation fails, it can be repeated without teleporting copies of the unknown quantum state, if the concerned parties share another pair of entangled qubit. We also present a protocol for quantum information splitting of an arbitrary two-particle system via the aforementioned cluster state and a Bell-state as the quantum channel. Problems related to security attacks were examined for both the cases and it was found that this protocol is secure. This protocol is highly efficient and easy to implement.

Geometry of quantum state manifolds generated by the Lie algebra operators

NASA Astrophysics Data System (ADS)

Kuzmak, A. R.

2018-03-01

The Fubini-Study metric of quantum state manifold generated by the operators which satisfy the Heisenberg Lie algebra is calculated. The similar problem is studied for the manifold generated by the so(3) Lie algebra operators. Using these results, we calculate the Fubini-Study metrics of state manifolds generated by the position and momentum operators. Also the metrics of quantum state manifolds generated by some spin systems are obtained. Finally, we generalize this problem for operators of an arbitrary Lie algebra.

Quantum annealing of the traveling-salesman problem.

PubMed

Martonák, Roman; Santoro, Giuseppe E; Tosatti, Erio

2004-11-01

We propose a path-integral Monte Carlo quantum annealing scheme for the symmetric traveling-salesman problem, based on a highly constrained Ising-like representation, and we compare its performance against standard thermal simulated annealing. The Monte Carlo moves implemented are standard, and consist in restructuring a tour by exchanging two links (two-opt moves). The quantum annealing scheme, even with a drastically simple form of kinetic energy, appears definitely superior to the classical one, when tested on a 1002-city instance of the standard TSPLIB.

Classical versus quantum dynamical chaos: Sensitivity to external perturbations, stability and reversibility

NASA Astrophysics Data System (ADS)

Sokolov, Valentin V.; Zhirov, Oleg V.; Kharkov, Yaroslav A.

The extraordinary complexity of classical trajectories of typical nonlinear systems that manifest stochastic behavior is intimately connected with exponential sensitivity to small variations of initial conditions and/or weak external perturbations. In rigorous terms, such classical systems are characterized by positive algorithmic complexity described by the Lyapunov exponent or, alternatively, by the Kolmogorov-Sinai entropy. The said implies that, in spite of the fact that, formally, any however complex trajectory of a perfectly isolated (closed) system is unique and differentiable for any certain initial conditions and the motion is perfectly reversible, it is impractical to treat that sort of classical systems as closed ones. Inevitably, arbitrary weak influence of an environment crucially impacts the dynamics. This influence, that can be considered as a noise, rapidly effaces the memory of initial conditions and turns the motion into an irreversible random process. In striking contrast, the quantum mechanics of the classically chaotic systems exhibit much weaker sensitivity and strong memory of the initial state. Qualitatively, this crucial difference could be expected in view of a much simpler structure of quantum states as compared to the extraordinary complexity of random and unpredictable classical trajectories. However the very notion of trajectories is absent in quantum mechanics so that the concept of exponential instability seems to be irrelevant in this case. The problem of a quantitative measure of complexity of a quantum state of motion, that is a very important and nontrivial issue of the theory of quantum dynamical chaos, is the one of our concern. With such a measure in hand, we quantitatively analyze the stability and reversibility of quantum dynamics in the presence of external noise. To solve this problem we point out that individual classical trajectories are of minor interest if the motion is chaotic. Properties of all of them are alike in this case and rather the behavior of their manifolds carries really valuable information. Therefore the phase-space methods and, correspondingly, the Liouville form of the classical mechanics become the most adequate. It is very important that, opposite to the classical trajectories, the classical phase space distribution and the Liouville equation have direct quantum analogs. Hence, the analogy and difference of classical and quantum dynamics can be traced by comparing the classical (W(c)(I,θ;t)) and quantum (Wigner function W(I,θ;t)) phase space distributions both expressed in identical phase-space variables but ruled by different(!) linear equations. The paramount property of the classical dynamical chaos is the exponentially fast structuring of the system's phase space on finer and finer scales. On the contrary, degree of structuring of the corresponding Wigner function is restricted by the quantization of the phase space. This makes Wigner function more coarse and relatively "simple" as compared to its classical counterpart. Fourier analysis affords quite suitable ground for analyzing complexity of a phase space distribution, that is equally valid in classical and quantum cases. We demonstrate that the typical number of Fourier harmonics is indeed a relevant measure of complexity of states of motion in both classical as well as quantum cases. This allowed us to investigate in detail and introduce a quantitative measure of sensitivity to an external noisy environment and formulate the conditions under which the quantum motion remains reversible. It turns out that while the mean number of harmonics of the classical phase-space distribution of a non-integrable system grows with time exponentially during the whole time of the motion, the time of exponential upgrowth of this number in the case of the corresponding quantum Wigner function is restricted only to the Ehrenfest interval 0 < t < tE - just the interval within which the Wigner function still satisfies the classical Liouville equation. We showed that the number of harmonics increases beyond this interval algebraically. This fact gains a crucial importance when the Ehrenfest time is so short that the exponential regime has no time to show up. Under this condition the quantum motion turns out to be quite stable and reversible.

Adapting the traveling salesman problem to an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Warren, Richard H.

2013-04-01

We show how to guide a quantum computer to select an optimal tour for the traveling salesman. This is significant because it opens a rapid solution method for the wide range of applications of the traveling salesman problem, which include vehicle routing, job sequencing and data clustering.

The Soccer-Ball Problem

NASA Astrophysics Data System (ADS)

Hossenfelder, Sabine

2014-07-01

The idea that Lorentz-symmetry in momentum space could be modified but still remain observer-independent has received quite some attention in the recent years. This modified Lorentz-symmetry, which has been argued to arise in Loop Quantum Gravity, is being used as a phenomenological model to test possibly observable effects of quantum gravity. The most pressing problem in these models is the treatment of multi-particle states, known as the 'soccer-ball problem'. This article briefly reviews the problem and the status of existing solution attempts.

A heteronuclear zero quantum coherence Nz-exchange experiment that resolves resonance overlap and its application to measure the rates of heme binding to the IsdC protein.

PubMed

Robson, Scott A; Peterson, Robert; Bouchard, Louis-S; Villareal, Valerie A; Clubb, Robert T

2010-07-21

Chemical exchange phenomena in NMR spectra can be quantitatively interpreted to measure the rates of ligand binding, as well as conformational and chemical rearrangements. In macromolecules, processes that occur slowly on the chemical shift time scale are frequently studied using 2D heteronuclear ZZ or N(z)-exchange spectroscopy. However, to successfully apply this method, peaks arising from each exchanging species must have unique chemical shifts in both dimensions, a condition that is often not satisfied in protein-ligand binding equilibria for (15)N nuclei. To overcome the problem of (15)N chemical shift degeneracy we developed a heteronuclear zero-quantum (and double-quantum) coherence N(z)-exchange experiment that resolves (15)N chemical shift degeneracy in the indirect dimension. We demonstrate the utility of this new experiment by measuring the heme binding kinetics of the IsdC protein from Staphylococcus aureus. Because of peak overlap, we could not reliably analyze binding kinetics using conventional methods. However, our new experiment resulted in six well-resolved systems that yielded interpretable data. We measured a relatively slow k(off) rate of heme from IsdC (<10 s(-1)), which we interpret as necessary so heme loaded IsdC has time to encounter downstream binding partners to which it passes the heme. The utility of using this new exchange experiment can be easily expanded to (13)C nuclei. We expect our heteronuclear zero-quantum coherence N(z)-exchange experiment will expand the usefulness of exchange spectroscopy to slow chemical exchange events that involve ligand binding.

Quantum dissipation theory and applications to quantum transport and quantum measurement in mesoscopic systems

NASA Astrophysics Data System (ADS)

Cui, Ping

The thesis comprises two major themes of quantum statistical dynamics. One is the development of quantum dissipation theory (QDT). It covers the establishment of some basic relations of quantum statistical dynamics, the construction of several nonequivalent complete second-order formulations, and the development of exact QDT. Another is related to the applications of quantum statistical dynamics to a variety of research fields. In particular, unconventional but novel theories of the electron transfer in Debye solvents, quantum transport, and quantum measurement are developed on the basis of QDT formulations. The thesis is organized as follows. In Chapter 1, we present some background knowledge in relation to the aforementioned two themes of this thesis. The key quantity in QDT is the reduced density operator rho(t) ≡ trBrho T(t); i.e., the partial trace of the total system and bath composite rhoT(t) over the bath degrees of freedom. QDT governs the evolution of reduced density operator, where the effects of bath are treated in a quantum statistical manner. In principle, the reduced density operator contains all dynamics information of interest. However, the conventional quantum transport theory is formulated in terms of nonequilibrium Green's function. The newly emerging field of quantum measurement in relation to quantum information and quantum computing does exploit a sort of QDT formalism. Besides the background of the relevant theoretical development, some representative experiments on molecular nanojunctions are also briefly discussed. In chapter 2, we outline some basic (including new) relations that highlight several important issues on QDT. The content includes the background of nonequilibrium quantum statistical mechanics, the general description of the total composite Hamiltonian with stochastic system-bath interaction, a novel parameterization scheme for bath correlation functions, a newly developed exact theory of driven Brownian oscillator (DBO) systems, and its closely related solvation mode transformation of system-bath coupling Hamiltonian in general. The exact QDT of DBO systems is also used to clarify the validity of conventional QDT formulations that involve Markovian approximation. In Chapter 3, we develop three nonequivalent but all complete second-order QDT (CS-QDT) formulations. Two of them are of the conventional prescriptions in terms of time-local dissipation and memory kernel, respectively. The third one is called the correlated driving-dissipation equations of motion (CODDE). This novel CS-QDT combines the merits of the former two for its advantages in both the application and numerical implementation aspects. Also highlighted is the importance of correlated driving-dissipation effects on the dynamics of the reduced system. In Chapter 4, we construct an exact QDT formalism via the calculus on path integrals. The new theory aims at the efficient evaluation of non-Markovian dissipation beyond the weak system-bath interaction regime in the presence of time-dependent external field. By adopting exponential-like expansions for bath correlation function, hierarchical equations of motion formalism and continued fraction Liouville-space Green's function formalism are established. The latter will soon be used together with the Dyson equation technique for an efficient evaluation of non-perturbative reduced density matrix dynamics. The interplay between system-bath interaction strength, non-Markovian property, and the required level of hierarchy is also studied with the aid of simple spin-boson systems, together with the three proposed schemes to truncate the infinite hierarchy. In Chapter 5, we develop a nonperturbative theory of electron transfer (ET) in Debye solvents. The resulting exact and analytical rate expression is constructed on the basis of the aforementioned continued fraction Liouville-space Green's function formalism, together with the Dyson equation technique. Not only does it recover the celebrated Marcus' inversion and Kramers' turnover behaviors, the new theory also shows some distinct quantum solvation effects that can alter the ET mechanism. Moreover, the present theory predicts further for the ET reaction thermodynamics, such as equilibrium Gibbs free-energy and entropy, some interesting solvent-dependent features that are calling for experimental verification. In Chapter 6, we discuss the constructed QDTs, in terms of their unified mathematical structure that supports a linear dynamics space, and thus facilitates their applications to various physical problems. The involving details are exemplified with the CODDE form of QDT. As the linear space is concerned, we identify the Schrodinger versus Heisenberg picture and the forward versus backward propagation of the reduced, dissipative Liouville dynamics. For applications we discuss the reduced linear response theory and the optimal control problems, in which the correlated effects of non-Markovian dissipation and field driving are shown to be important. In Chapter 7, we turn to quantum transport, i.e., electric current through molecular or mesoscopic systems under finite applied voltage. By viewing the nonequilibrium transport setup as a quantum open system, we develop a reduced-density-matrix approach to quantum transport. The resulting current is explicitly expressed in terms of the molecular reduced density matrix by tracing out the degrees of freedom of the electrodes at finite bias and temperature. We propose a conditional quantum master equation theory, which is an extension of the conventional (or unconditional) QDT by tracing out the well-defined bath subsets individually, instead of the entire bath degrees of freedom. Both the current and the noise spectrum can be conveniently analyzed in terms of the conditional reduced density matrix dynamics. By far, the QDT (including the conditional one) has only been exploited in second-order form. A self-consistent Born approximation for the system-electrode coupling is further proposed to recover all existing nonlinear current-voltage behaviors including the nonequilibrium Kondo effect. Transport theory based on the exact QDT formalism will be developed in future. In Chapter 8, we study the quantum measurement of a qubit with a quantum-point-contact detector. On the basis of a unified quantum master equation (a form of QDT), we study the measurement-induced relaxation and dephasing of the qubit. Our treatment pays particular attention on the detailed-balance relation, which is a consequence of properly accounting for the energy exchange between the qubit and detector during the measurement process. We also derive a conditional quantum master equation for quantum measurement in general, and study the readout characteristics of the qubit measurement. Our theory is applicable to the quantum measurement at arbitrary voltage and temperature. A number of remarkable new features are found and highlighted in concern with their possible relevance to future experiments. In Chapter 9, we discuss the further development of QDT, aiming at an efficient evaluation of many-electron systems. This will be carried out by reducing the many-particle (Fermion or Boson) QDT to a single-particle one by exploring, e.g. the Wick's contraction theorem. It also results in a time-dependent density functional theory (TDDFT) for transport through complex large-scale (e.g. molecules) systems. Primary results of the TDDFT-QDT are reported. In Chapter 10, we summary the thesis, and comment and remark on the future work on both the theoretical and application aspects of QDT.

Quantum information, cognition, and music.

PubMed

Dalla Chiara, Maria L; Giuntini, Roberto; Leporini, Roberto; Negri, Eleonora; Sergioli, Giuseppe

2015-01-01

Parallelism represents an essential aspect of human mind/brain activities. One can recognize some common features between psychological parallelism and the characteristic parallel structures that arise in quantum theory and in quantum computation. The article is devoted to a discussion of the following questions: a comparison between classical probabilistic Turing machines and quantum Turing machines.possible applications of the quantum computational semantics to cognitive problems.parallelism in music.

Quantum information, cognition, and music

PubMed Central

Dalla Chiara, Maria L.; Giuntini, Roberto; Leporini, Roberto; Negri, Eleonora; Sergioli, Giuseppe

2015-01-01

Parallelism represents an essential aspect of human mind/brain activities. One can recognize some common features between psychological parallelism and the characteristic parallel structures that arise in quantum theory and in quantum computation. The article is devoted to a discussion of the following questions: a comparison between classical probabilistic Turing machines and quantum Turing machines.possible applications of the quantum computational semantics to cognitive problems.parallelism in music. PMID:26539139