Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum Numbers”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,117 records · Page 62

Reaction-diffusive dynamics of number-conserving dissipative quantum state preparation

The use of dissipation for the controlled creation of nontrivial quantum many-body correlated states is of much fundamental and practical interest. What is the result of imposing number conservation, which, in closed system, gives rise to diffusive spreading? For this work, we investigate this question for a paradigmatic model of a two-band system, with dissipative dynamics aiming to empty one band and to populate the other, which had been introduced before for the dissipative stabilization of topological states. Going beyond the mean-field treatment of the dissipative dynamics, we demonstrate the emergence of a diffusive regime for the particle and hole density modes at intermediate length- and timescales, which, interestingly, can only be excited in nonlinear response to external fields. We also identify processes that limit the diffusive behavior of this mode at the longest length- and timescales. Strikingly, we find that these processes lead to a reaction-diffusion dynamics governed by the Fisher-Kolmogorov-Petrovsky-Piskunov equation, making the designed dark state unstable towards a state with a finite particle and hole density.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantifying the Variation in the Number of Donors in Quantum Dots Created Using Atomic Precision Advanced Manufacturing

Atomic-precision advanced manufacturing enables unique silicon quantum electronics built on quantum dots fabricated from small numbers of phosphorus dopants. The number of dopant atoms comprising a dot plays a central role in determining the behavior of charge and spin confined to the dots and thus overall device performance. Here in this work, we use both theoretical and experimental techniques to explore the combined impact of lithographic variation and stochastic kinetics on the number of P incorporations in quantum dots made using these techniques and how this variation changes as a function of the size of the dot. Using a kinetic model of PH3 dissociation augmented with novel reaction barriers, we demonstrate that for a 2 × 3 silicon dimer window the probability that no donor incorporates goes to zero, allowing for certainty in the placement of at least one donor. However, this still comes with some uncertainty in the precise number of incorporated donors (either one or two), and this variability may still impact certain applications. We also examine the impact of the size of the initial lithographic window, finding that the incorporation fraction saturates to δ-layer-like coverage as the circumference-to-area ratio decreases. We predict that this incorporation fraction depends strongly on the dosage of the precursor and that the standard deviation of the number of incorporations scales as ~√n, as would be expected for a sequence of largely independent incorporation events. Finally, we characterize an array of 36 experimentally prepared multidonor 3 × 3 nm lithographic windows with scanning tunneling microscopy, measuring the fidelity of the lithography to the desired array and the final location of PH x fragments within these lithographic windows. We use our kinetic model to examine the expected variability due to the observed lithographic error, predicting a negligible impact on incorporation statistics. We find good agreement between our model and the inferred incorporation locations in these windows from scanning tunneling microscope measurements.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

State Preparation of Antisymmetrized Geminal Power on a Quantum Computer without Number Projection

The antisymmetrized geminal power (AGP) is equivalent to the number projected Bardeen–Cooper–Schrieffer (PBCS) wave function. It is also an elementary symmetric polynomial (ESP) state. We generalize previous research on deterministically implementing the Dicke state to a state preparation algorithm for an ESP state, or equivalently AGP, on a quantum computer. Our method is deterministic and has polynomial cost, and it does not rely on number symmetry breaking and restoration. We also show that our circuit is equivalent to a disentangled unitary paired coupled cluster operator and a layer of unitary Jastrow operator acting on a single Slater determinant. Here, the method presented herein highlights the ability of disentangled unitary coupled cluster to capture nontrivial entanglement properties that are hardly accessible with traditional Hartree–Fock based electronic structure methods.

97 MATHEMATICS AND COMPUTING↗

Quantum particle-number fluctuations in a two-component Bose gas in a double-well potential

A two-component Bose gas in a double-well potential with repulsive interactions may undergo a phase separation transition if the interspecies interactions outweigh the intraspecies ones. We analyze the transition in the strong interaction limit within the two-mode approximation. Numbers of particles in each potential well are equal and constant. However, at the transition point, the ground state of the system reveals huge fluctuations of numbers of particles belonging to the different gas components; that is, the probability for observation of any mixture of particles in each potential well becomes uniform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Network Community Detection on Small Quantum Computers

In recent years, a number of quantum computing devices with small numbers of qubits have become available. A hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size is presented. Herein, the proposed approach is applied to the network community detection problem. QLS is hardware-agnostic and easily extendable to new quantum computing devices as they become available. It is demonstrated to solve the 2-community detection problem on graphs of sizes of up to 410 vertices using the 16-qubit IBM quantum computer and D-Wave 2000Q, and compare their performance with the optimal solutions. The results herein demonstrate that QLS performs similarly in terms of quality of the solution and the number of iterations to convergence on both types of quantum computers and it is capable of achieving results comparable to state-of-the-art solvers in terms of quality of the solution including reaching the optimal solutions.

97 MATHEMATICS AND COMPUTING↗

Number Partitioning via Quantum Adiabatic Computation

We study both analytically and numerically the complexity of the adiabatic quantum evolution algorithm applied to random instances of combinatorial optimization problems. We use as an example the NP-complete set partition problem and obtain an asymptotic expression for the minimal gap separating the ground and exited states of a system during the execution of the algorithm. We show that for computationally hard problem instances the size of the minimal gap scales exponentially with the problem size. This result is in qualitative agreement with the direct numerical simulation of the algorithm for small instances of the set partition problem. We describe the statistical properties of the optimization problem that are responsible for the exponential behavior of the algorithm.

Smelyanskiy, Vadim N.↗

Random Number Generation for Petascale Quantum Monte Carlo

The quality of random number generators can affect the results of Monte Carlo computations, especially when a large number of random numbers are consumed. Furthermore, correlations present between different random number streams in a parallel computation can further affect the results. The SPRNG software, which the author had developed earlier, has pseudo-random number generators (PRNGs) capable of producing large numbers of streams with large periods. However, they had been empirically tested on only thousand streams earlier. In the work summarized here, we tested the SPRNG generators with over a hundred thousand streams, involving over 10^14 random numbers per test, on some tests. We also tested the popular Mersenne Twister. We believe that these are the largest tests of PRNGs, both in terms of the numbers of streams tested and the number of random numbers tested. We observed defects in some of these generators, including the Mersenne Twister, while a few generators appeared to perform well. We also corrected an error in the implementation of one of the SPRNG generators.

97 MATHEMATICS AND COMPUTING↗

Traceable random numbers from a non-local quantum advantage

The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations—the generation processes cannot be fully traced, audited and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol forms the basis for a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7,434 out of 7,454 attempts—a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error multiplied by actual success probability bounded by 2−64. Further, the generation of certifiable and traceable randomness represents a public service that operates with an entanglement-derived advantage over comparable classical approaches.

97 MATHEMATICS AND COMPUTING↗

Oscillatory quantum screening effects on the positronium (Ps) formation in quantum plasmas

The oscillatory quantum screening effects on the positronium formation by the positron are investigated in quantum plasmas. It is found that the oscillatory screening effects suppress the positronium formation radius as well as the positronium formation cross section. It is also found that the positronium formation radius decreases with increasing quantum wave number. It is found that the peak position of the differential cross section is receded from the projectile with decreasing quantum wave number. In addition, the oscillatory screening effects on the positronium formation cross section are found to be decreased with an increase of the collision energy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Discriminating quantum-optical beam-splitter channels with number-diagonal signal states: Applications to quantum reading and target detection

We consider the problem of distinguishing, with minimum probability of error, two optical beam-splitter channels with unequal complex-valued reflectivities using general quantum probe states entangled over M signal and M' idler mode pairs of which the signal modes are bounced off the beam splitter while the idler modes are retained losslessly. We obtain a lower bound on the output state fidelity valid for any pure input state. We define number-diagonal signal (NDS) states to be input states whose density operator in the signal modes is diagonal in the multimode number basis. For such input states, we derive series formulas for the optimal error probability, the output state fidelity, and the Chernoff-type upper bounds on the error probability. For the special cases of quantum reading of a classical digital memory and target detection (for which the reflectivities are real valued), we show that for a given input signal photon probability distribution, the fidelity is minimized by the NDS states with that distribution and that for a given average total signal energy N{sub s}, the fidelity is minimized by any multimode Fock state with N{sub s} total signal photons. For reading of an ideal memory, it is shown that Fock state inputs minimize the Chernoff bound. For target detection under high-loss conditions, a no-go result showing the lack of appreciable quantum advantage over coherent state transmitters is derived. A comparison of the error probability performance for quantum reading of number state and two-mode squeezed vacuum state (or EPR state) transmitters relative to coherent state transmitters is presented for various values of the reflectances. While the nonclassical states in general perform better than the coherent state, the quantitative performance gains differ depending on the values of the reflectances. The experimental outlook for realizing nonclassical gains from number state transmitters with current technology at moderate to high values of the reflectances is argued to be good.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Effects of Number Scaling on Entangled States in Quantum Mechanics

A summary of number structure scaling is followed by a description of the effects of number scaling in nonrelativistic quantum mechanics. The description extends earlier work to include the effects on the states of two or more interacting particles. Emphasis is placed on the effects on entangled states. The resulting scaling field is generalized to describe the effects on these states. It is also seen that one can use fiber bundles with fibers associated with single locations of the underlying space to describe the effects of scaling on arbitrary numbers of particles.

entangled states↗

Shadow process tomography of quantum channels

Quantum process tomography is a critical capability for building quantum computers, enabling quantum networks, and understanding quantum sensors. Like quantum state tomography, the process tomography of an arbitrary quantum channel requires a number of measurements that scales exponentially in the number of quantum bits affected. However, the recent field of shadow tomography, applied to quantum states, has demonstrated the ability to extract key information about a state with only polynomially many measurements. In this work, we apply the concepts of shadow state tomography to the challenge of characterizing quantum processes. Furthermore, we make use of the Choi isomorphism to directly apply rigorous bounds from shadow state tomography to shadow process tomography, and we find additional bounds on the number of measurements that are unique to process tomography. Our results, which include algorithms for implementing shadow process tomography, enable new techniques including evaluation of channel concatenation and the application of channels to shadows of quantum states. This provides a dramatic improvement for understanding large-scale quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation

Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) is challenging. In this paper, we present SQUARE (Strategic QUantum Ancilla REuse), a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in modular quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Current Noisy Intermediate-Scale Quantum (NISQ) computers and forward-looking Fault-Tolerant (FT) quantum computers have fundamentally different constraints such as data locality, instruction parallelism, and communication overhead. Our heuristic-based ancilla-reuse algorithm balances these considerations and fits computations into resource-constrained NISQ or FT quantum machines, throttling parallelism when necessary. To precisely capture the workload of a program, we propose an improved metric, the "active quantum volume," and use this metric to evaluate the effectiveness of our algorithm. Furthermore, our results show that SQUARE improves the average success rate of NISQ applications by 1.47X. Surprisingly, the additional gates for uncomputation create ancilla with better locality, and result in substantially fewer swap gates and less gate noise overall. SQUARE also achieves an average reduction of 1.5X (and up to 9.6X) in active quantum volume for FT machines.

compiler optimization↗

A possible approach to inclusion of space and time in frame fields of quantum representations of real and complex numbers.

This work is based on the field of reference frames based on quantum representations of real and complex numbers described in other work. Here frame domains are expanded to include space and time lattices. Strings of qukits are described as hybrid systems as they are both mathematical and physical systems. As mathematical systems they represent numbers. As physical systems in each frame the strings have a discrete Schroedinger dynamics on the lattices. The frame field has an iterative structure such that the contents of a stage j frame have images in a stage j-1 (parent) frame. A discussion of parent frame images includes the proposal that points of stage j frame lattices have images as hybrid systems in parent frames. The resulting association of energy with images of lattice point locations, as hybrid systems states, is discussed. Representations and images of other physical systems in the different frames are also described.

97 MATHEMATICS AND COMPUTING↗

Quantum abacus for counting and factorizing numbers

We generalize the binary quantum counting algorithm of Lesovik, Suslov, and Blatter [Phys. Rev. A 82, 012316 (2010)] to higher counting bases. The algorithm makes use of qubits, qutrits, and qudits to count numbers in a base-2, base-3, or base-d representation. In operating the algorithm, the number n<N=d{sup K} is read into a K-qudit register through its interaction with a stream of n particles passing in a nearby wire; this step corresponds to a quantum Fourier transformation from the Hilbert space of particles to the Hilbert space of qudit states. An inverse quantum Fourier transformation provides the number n in the base-d representation; the inverse transformation is fully quantum at the level of individual qudits, while a simpler semiclassical version can be used on the level of qudit registers. Combining registers of qubits, qutrits, and qudits, where d is a prime number, with a simpler single-shot measurement allows us to find the powers of 2, 3, and other primes d in the number n. We show that the counting task naturally leads to the shift operation and an algorithm based on the quantum Fourier transformation. We discuss possible implementations of the algorithm using quantum spin-d systems, d-well systems, and their emulation with spin-1/2 or double-well systems. We establish the analogy between our counting algorithm and the phase estimation algorithm and make use of the latter's performance analysis in stabilizing our scheme. Applications embrace a quantum metrological scheme to measure voltage (an analog to digital converter) and a simple procedure to entangle multiparticle states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Integers

In number theory, a partition of a positive integer n is a way of writing n as a sum of positive integers. The number of partitions of n is given by the partition function p(n). Inspired by quantum information processing, we extend the concept of partitions in number theory as follows: for an integer n, we treat each partition as a basis state of a quantum system representing that number n, so that the Hilbert-space that corresponds to that integer n is of dimension p(n); the 'classical integer' n can thus be generalized into a (pure) quantum state ||psi(n) > which is a superposition of the partitions of n, in the same way that a quantum bit (qubit) is a generalization of a classical bit. More generally, rho(n) is a density matrix in that same Hilbert-space (a probability distribution over pure states). Inspired by the notion of quantum numbers in quantum theory (such as in Bohr's model of the atom), we then try to go beyond the partitions, by defining (via recursion) the notion of 'sub-partitions' in number theory. Combining the two notions mentioned above, sub-partitions and quantum integers, we finally provide an alternative definition of the quantum integers [the pure-state |psi'(n)> and the mixed-state rho'(n),] this time using the sub-partitions as the basis states instead of the partitions, for describing the quantum number that corresponds to the integer n.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulating fermions with a digital quantum computer

Quantum computers are expected to become a powerful tool for studying physical quantum systems. Consequently, a number of quantum algorithms to determine the physical properties of such systems have been developed. Although qubit-based quantum computers are naturally suited to the study of spin-1/2 systems, systems containing other degrees of freedom must first be encoded into qubits. Transformations to and from fermionic degrees of freedom have long been an important tool in physics and chemistry, which is now finding another application in the simulation of fermionic systems on quantum computers based on qubits. In this work, we discuss methods for encoding fermionic degrees of freedom into qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗