LONG LIFE HIGH BRIGHTNESS PHOTOCATHODES USING III-NITRIDE MATERIALS
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Most near-term quantum information processing devices will not be capable of implementing quantum error correction and the associated logical quantum gate set. Instead, quantum circuits will be implemented directly using the physical native gate set of the device. These native gates often have a parameterization (e.g., rotation angles) which provide the ability to perform a continuous range of operations. Verification of the correct operation of these gates across the allowable range of parameters is important for gaining confidence in the reliability of these devices. In this work, we demonstrate a procedure for sample-efficient verification of continuously-parameterized quantum gates for small quantum processors of up to approximately 10 qubits. This procedure involves generating random sequences of randomly-parameterized layers of gates chosen from the native gate set of the device, and then stochastically compiling an approximate inverse to this sequence such that executing the full sequence on the device should leave the system near its initial state. We show that fidelity estimates made via this technique have a lower variance than fidelity estimates made via cross-entropy benchmarking. This provides an experimentally-relevant advantage in sample efficiency when estimating the fidelity loss to some desired precision. We describe the experimental realization of this technique using continuously-parameterized quantum gate sets on a trapped-ion quantum processor from Sandia QSCOUT and a superconducting quantum processor from IBM Q, and we demonstrate the sample efficiency advantage of this technique both numerically and experimentally.
We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.
Recent developments have shown the existence of quantum low-density parity check (qLDPC) codes with constant rate and linear distance. A natural question concerns the efficient decodability of these codes. In this paper, we present a linear time decoder for the recent quantum Tanner codes construction of asymptotically good qLDPC codes, which can correct all errors of weight up to a constant fraction of the blocklength. Our decoder is an iterative algorithm which searches for corrections within constant-sized regions. At each step, the corrections are found by reducing a locally defined and efficiently computable cost function which serves as a proxy for the weight of the remaining error.
Designing efficient and noise-tolerant quantum computation protocols generally begins with an understanding of quantum error-correcting codes and their native logical operations. The simplest class of native operations are transversal gates, which are naturally fault-tolerant. Here, in this paper, we aim to characterize the transversal gates of quantum Reed–Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. We start our work by establishing a new geometric characterization of quantum RM codes via the Boolean hypercube and its associated subcube complex. More specifically, a set of stabilizer generators for a quantum RM code can be described via transversal X and Z operators acting on subcubes of particular dimensions. This characterization leads us to define subcube operators composed of single-qubit π/2 k Z -rotations that act on subcubes of given dimensions. We first characterize the action of subcube operators on the code space: depending on the dimension of the subcube, these operators either (1) act as a logical identity on the code space, (2) implement non-trivial logic, or (3) rotate a state away from the code space. Second, and more remarkably, we uncover that the logic implemented by these operators corresponds to circuits of multi-controlled-Z gates that have an explicit and simple combinatorial description. Overall, this suite of results yields a comprehensive understanding of a class of natural transversal operators for quantum RM codes.
The objective of the project is to optimize the deposition and post-deposition annealing conditions of quantum-cutting materials to enable coatings with high photoluminescence quantum yields and optimal absorption onset. These coatings will be integrated with commercial solar photovoltaic cells to enable improved power conversion efficiency, and the quantum-cutting cell stability will be ensured using industry-standard packaging methods.
This paper investigates the feasibility and efficiency of quantum-circuit-based algorithms for microgrid state estimation. Here, our new contributions include: (1) a general quantum state estimation (GQSE) formulation is devised for swing-bus-contained microgrids through the quantized Gaussian–Newton iteration, (2) a preconditioned quantum linear solver (PQLS) is developed for tackling the ill-conditioned GQSE with limited quantum resources, and (3) an enhanced quantum state estimation (EQSE) algorithm is further established for hierarchical-control-based microgrids with exogenous disturbances. Extensive case studies demonstrate the correctness of GQSE, PQLS and EQSE in two typical microgrids. The robustness and convergence performance of EQSE are also verified.
Here, we demonstrate a new approach for fast preparation, manipulation, and collective readout of an atomic Rydberg-state qubit. By making use of Rydberg blockade inside a small atomic ensemble, we prepare a single qubit within 3 μs with a success probability of $F_p$ = 0.93 ± 0.02, rotate it, and read out its state in 6 μs with a single-shot fidelity of $F_d$ = 0.92 ± 0.04. The ensemble-assisted detection is 10 3 times faster than imaging of a single atom with the same optical resolution, and enables fast repeated nondestructive measurement. We observe qubit coherence times of 15 μs, much longer than the π rotation time of 90 ns. Potential applications ranging from faster quantum information processing in atom arrays to efficient implementation of quantum error correction are discussed.
Here, a multilayer multi-configurational theory framework is adapted to simulate circuit-based quantum computers. Quantum addition of superpositions of an exponential number of summands is performed in polynomial time with high accuracy. We demonstrate numerically accurate calculations including up to one million qubits for entangling benchmarks. Simulation cost can be assessed by entropy-based entanglement measures. For the considered systems, we show that the entanglement only grows weakly with the system size. The present simulations demonstrate how quantum algorithms in low-entropy regimes can be used efficiently on classically simulated quantum computers.
Superconducting microwave circuits with Josephson junctions, the major platform for quantum computing, can only reach the full capability when connected. This requires an efficient protocol to distribute microwave entanglement. While quantum computers typically use discrete-variable (DV) methods for information encoding, the entire continuous-variable (CV) degree of freedom in electromagnetic fields must be utilized to achieve the highest entanglement distribution rate. Here, we propose a hybrid protocol to resolve the incompatibility between DV microwave quantum computers and CV quantum communications. CV microwave entanglement is distributed using optical swapping of optical-microwave entanglement pairs. To interface with DV microwave quantum computers, we further design a hybrid circuit to simultaneously convert and distill high-quality DV entanglement from noisy CV entanglement. The hybrid circuit is trained with machine-learning algorithms, ensuring high entanglement fidelity and generation rate. In conclusion, our work not only provides a practical method to realize efficient quantum links for superconducting microwave quantum computers, but also opens avenues to bridge the gap between DV and CV quantum systems.
We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high accuracy. We benchmark our approach on dimerized Fermi–Hubbard chains with four sites, demonstrating precise Berry phase simulations in both noninteracting and interacting regimes. Our results show that circuit depths reach up to 106 layers for noninteracting systems and increase to 279 layers for interacting systems due to added complexity. In addition, we demonstrate the robustness of our scheme across a wide range of parameters governing adiabatic evolution and variational algorithms. These findings highlight the potential of adaptive variational quantum algorithms for advancing quantum simulations of topological materials and computing geometric phases in strongly correlated systems.
GaAs is often used as a multijunction subcell due to its high material quality on GaAs substrates, despite having a non-optimal bandgap. The bandgap can be beneficially reduced using many layers of thin, strain-balanced GaInAs in a superlattice or quantum well device, but achieving excellent carrier collection without increased recombination has proven challenging. Here, we develop and demonstrate high performance, optically thick GaInAs/GaAsP strain-balanced solar cells. Excellent material quality is achieved in thick superlattices by using growth conditions that limit progressive thickness and composition fluctuations. Bandgap-voltage offsets as low as 0.31V are shown in superlattice cells using thin, highly strained GaP barriers. Optically thick superlattice cells with over 2500 nm of total GaInAs in the depletion region are developed, enabling 3.8 mA/cm 2 of extra photocurrent beyond the GaAs band edge under the AM0 space spectrum. Optimized superlattice solar cells are incorporated into two-junction devices that achieve 29.2% efficiency under the AM0 space spectrum due to their improved bandgap combination and high subcell voltages.
Here, decarbonization is demonstrated by catalytic conversion of CO 2 to fuel by means of exposure of cadmium selenide (CdSe) quantum dots-titania (TiO 2 ) nanophotocatalysts to sunlight illumination. The primary products resulted from this chemical reactions are methanol, carbon monoxide, and hydrogen after several hours of exposure to sun light. The overall CO 2 conversion efficiency of such quantum dot-titania nanostructures was compared with that of pure TiO 2 nanorod array photocatalyst. Data shows an improved conversion efficiency when composite quantum dot-titania nanostructures were used in comparison with titania nanophotocatalysts. It is postulated that this is due to the additional absorbance of visible light by the quantum dots and generation of additional charge separation at the CdSe-TiO 2 interfaces. The conversion efficiency of such an artificial photosynthesis process remains to be optimized for practical applications.
Lead sulfide (PbS) quantum dots (QDs) have shown promising performance as a sensitizer in infrared-to-visible photon upconversion systems. To investigate the key design rules, we compare three PbS-sensitized upconversion systems using three mediator molecules with the same tetracene triplet acceptor at different distances from the QD. Using transient absorption spectroscopy, we directly measure the triplet energy-transfer rates and efficiencies from the QD to the mediator and from the mediator to the emitter. With increasing distance between the mediator and PbS QD, the efficiency of the first triplet energy transfer from the QD to the mediator decreases because of a decrease in the rate of this triplet energy-transfer step, while the efficiency of the second triplet energy transfer from the mediator to the emitter increases because of a reduction in the QD-induced mediator triplet state decay. The latter effect is a result of the slow rate constant of the second triplet energy-transfer process, which is 3 orders of magnitude slower than the diffusion-limited value. The combined results lead to a net decrease of the steady-state upconversion quantum yield with distance, which could be predicted by our kinetic model. Our result shows that the QD/mediator interface affects both the first and second triplet energy transfer processes in the photon upconversion system, and the QD/mediator distance has an opposite effect on the efficiencies of the first and second triplet energy transfer. Lastly, these findings provide important insight for the further rational improvement of the overall efficiency of QD-based upconversion systems.
Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory has been shown to be bounded-error quantum polynomial time (BQP) complete, making it a representative problem for which quantum computation is efficient. As a step toward large-scale quantum simulations of collision processes, scattering of wave packets in one-dimensional scalar field theory is simulated using 120 qubits of IBM’s Heron superconducting quantum computer ibm_fez. Variational circuits compressing vacuum preparation, wave packet initialization, and time evolution are determined using classical resources. By leveraging physical properties of states in the theory, such as symmetries and locality, the variational quantum algorithm constructs scalable circuits that can be used to simulate arbitrarily large system sizes. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103. The effect of interactions is clearly seen, and is found to be in agreement with classical matrix product state simulations. Finally, the developments that will be necessary to simulate high-energy inelastic collisions on a quantum computer are discussed.
Efficient high-power operation of light emitting diodes based on InGaN quantum wells (QWs) requires rapid interwell hole transport and low nonradiative recombination. The transport rate can be increased by replacing GaN barriers with that of InGaN. Introduction of InGaN barriers, however, increases the rate of the nonradiative recombination. In this work, we have attempted to reduce the negative impact of the nonradiative recombination by introducing thin GaN or AlGaN interlayers at the QW/barrier interfaces. The interlayers, indeed, reduce the nonradiative recombination rate and increase the internal quantum efficiency by about 10%. Here, the interlayers do not substantially slow down the interwell hole transport; for 0.5 nm Al 0.10 Ga 0.90 N interlayers the transport rate has even been found to increase. Another positive feature of the interlayers is narrowing of the QW PL linewidth, which is attributed to smoother QW interfaces and reduced fluctuations of the QW width.
We present an efficient method to prepare states of a many-body system on quantum hardware, first isolating individual quantum numbers and then using time evolution to isolate the energy. Our method in its simplest form requires only one additional auxiliary qubit. The total time evolved for an accurate solution is proportional to the ratio of the spectrum range of the trial state to the gap to the lowest excited state, a substantial improvement over other projection algorithms, and the accuracy increases exponentially with the time evolved. Isolating the quantum numbers is efficient because of the known eigenvalues and increases the gap thus shortening the propagation time required. The success rate of the algorithm, or the probability of producing the desired state, is a simple function of measurement times and phases and is dominated by the square overlap of the original state to the desired state. We present examples from the nuclear shell model and the Heisenberg model. In conclusion, we compare this algorithm to previous algorithms for short evolution times and discuss potential further improvements.