Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum channel simulation”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Online Convex Optimization of Programmable Quantum Computers to Simulate Time-Varying Quantum Channels

Simulating quantum channels is a fundamental primitive in quantum computing, since quantum channels define general (trace-preserving) quantum operations. An arbitrary quantum channel cannot be exactly simulated using a finite-dimensional programmable quantum processor, making it important to develop optimal approximate simulation techniques. In this paper, we study the challenging setting in which the channel to be simulated varies adversarially with time. We propose the use of matrix exponentiated gradient descent (MEGD), an online convex optimization method, and analytically show that it achieves a sublinear regret in time. Through experiments, we validate the main results for time-varying dephasing channels using a programmable generalized teleportation processor.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Software-defined quantum network switching

We present the design and implementation of a software-defined quantum networking protocol and software switch integrated with a numerical quantum channel simulator. Our protocol design leverages recent advances in the OpenFlow protocol that enable software-defined control and management of optical network traffic using side-channel metadata. We implement this design using customization of the open source vSwitch for optical network routing, and we test the implementation using a numerical simulator of the quantum channel alongside actual network traffic. Our results support the integration of quantum communication with existing optical transport methods.

Humble, Travis↗
DOE OSTI2011

Communication cost of classically simulating a quantum channel with subsequent rank-1 projective measurement

A process of preparation, transmission, and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However, to the best of our knowledge, no model for n qubits with a finite amount of classical communication is known at present. A lower bound for the communication cost can provide useful hints for a generalization. It is known, for example, that the amount of communication must be greater than c2{sup n}, where c{approx_equal}0.01. The proof uses a quite elaborate theorem of communication complexity. Using a mathematical conjecture known as the ''double cap conjecture,'' we strengthen this result by presenting a geometrical and extremely simple derivation of the lower bound 2{sup n}-1. Only rank-1 projective measurements are involved in the derivation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2011

Approximate simulation of quantum channels

Earlier, we proved a duality between two optimizations problems [Phys. Rev. Lett. 104, 120501 (2010)]. The primary one is, given two quantum channels M and N, to find a quantum channel R such that R White-Bullet N is optimally close to M as measured by the worst-case entanglement fidelity. The dual problem involves the information obtained by the environment through the so-called complementary channels M and N, and consists in finding a quantum channel R' such that R Prime White-Bullet cM is optimally close to N. It turns out to be easier to find an approximate solution to the dual problem in certain important situations, notably when M is the identity channel - the problem of quantum error correction - yielding a good near-optimal worst-case entanglement fidelity as well as the corresponding near-optimal correcting channel. Here we provide more detailed proofs of these results. In addition, we generalize the main theorem to the case where there are certain constraints on the implementation of R, namely, on the number of Kraus operators. We also offer a simple algebraic form for the near-optimal correction channel in the case M=id. For approximate error correction, we show that any {epsilon}-correctable channel is, up to appending an ancilla, {epsilon}-close to an exactly correctable one. We also demonstrate an application of our theorem to the problem of minimax state discrimination.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Efficient Simulation of Open Quantum Systems on NISQ Trapped‐Ion Hardware

Abstract Simulating open quantum systems, which interact with external environments, presents significant challenges on noisy intermediate‐scale quantum (NISQ) devices due to limited qubit resources and noise. In this study, an efficient framework is proposed for simulating open quantum systems on NISQ hardware by leveraging a time‐perturbative Kraus operator representation of the system's dynamics. This approach avoids the computationally expensive Trotterization method and exploits the Lindblad master equation to represent time evolution in a compact form, particularly for systems satisfying specific commutation relations. The efficiency of this method is demonstrated by simulating quantum channels, such as the continuous‐time Pauli channel and damped harmonic oscillators, on NISQ trapped‐ion hardware, including IonQ Harmony and Quantinuum H1‐1. Additionally, hardware‐agnostic error mitigation techniques are introduced, including Pauli channel fitting and quantum depolarizing channel inversion, to enhance the fidelity of quantum simulations. These results show strong agreement between the simulations on real quantum hardware and exact solutions, highlighting the potential of Kraus‐based methods for scalable and accurate simulation of open quantum systems on NISQ devices. This framework opens pathways for simulating more complex systems under realistic conditions in the near term.

Burdine, Colin [Department of Electrical and Compu↗
DOE OSTI2021

Characterization and Optimization of Building Blocks for Specialized Computing Platforms

As noise limits the performance of quantum processors, the ability to characterize this noise and develop methods to overcome it is essential for the future of quantum computing. In this report, we develop a complete set of tools for improving quantum processor performance at the application level, including low-level physical models of quantum gates, a numerically efficient method of producing process matrices that span a wide range of model parameters, and full-channel quantum simulations. We then provide a few examples of how to use these tools to study the effects of noise on quantum circuits.

42 ENGINEERING↗
DOE OSTI2023

Continuous variable port-based teleportation

Abstract Port-based teleportation (PBT) is a generalisation of the standard teleportation protocol which does not require unitary operations by the receiver. This comes at the price of requiring N > 1 entangled pairs, while N = 1 for the standard teleportation protocol. The lack of correction unitaries allows PBT to be used as a fundamental theoretical tool to simulate arbitrary channels with a general resource, with applications to study fundamental limits of quantum communication, cryptography and sensing, and to define general programmable quantum computers. Here we introduce a general formulation of port-based teleportation in continuous variable systems and study in detail the N = 2 case. In particular, we interpret the resulting channel as an energy truncation and analyse the kinds of channels that can be naturally simulated after this restriction.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Conditional channel simulation

In this work we design a specific simulation tool for quantum channels which is based on the use of a control system. This allows us to simulate an average quantum channel which is expressed in terms of an ensemble of channels, even when these channel-components are not jointly teleportation-covariant. This design is also extended to asymptotic simulations, continuous ensembles, and memory channels. As an application, we derive relative-entropy-of-entanglement upper bounds for private communication over various channels, including non-Gaussian mixtures of bosonic lossy channels. Among other results, we also establish the two-way quantum and private capacity of the so-called “dephrasure” channel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Efficient simulation of open quantum systems coupled to a reservoir through multiple channels

It is challenging to simulate open quantum systems that are connected to a reservoir through multiple channels. For example, vibrations may induce fluctuations in both energy gaps and electronic couplings, which represent two independent channels of system–bath couplings. Systems of this kind are ubiquitous in the processes of excited state radiationless decay. Combined with density matrix renormalization group (DMRG) and matrix product states (MPS) methods, we develop an interaction-picture chain mapping strategy for vibrational reservoirs to simulate the dynamics of these open systems, resulting in time-dependent spatially local system–bath couplings in the chain-mapped Hamiltonian. This transformation causes the entanglement generated by the system–bath interactions to be restricted within a narrow frequency window of vibrational modes, enabling efficient DMRG/MPS dynamical simulations. We demonstrate the utility of this approach by simulating singlet fission dynamics using a generalized spin-boson Hamiltonian with both diagonal and off-diagonal system–bath couplings. This approach generalizes an earlier interaction-picture chain mapping scheme, allowing for efficient and exact simulation of systems with multi-channel system–bath couplings using matrix product states, which may further our understanding of nonlocal exciton–phonon couplings in exciton transport and the non-Condon effect in energy and electron transfer.

Chemistry↗
DOE OSTI2018

Toward prethreshold gate-based quantum simulation of chemical dynamics: using potential energy surfaces to simulate few-channel molecular collisions

Here, one of the most promising applications of an error-corrected universal quantum computer is the efficient simulation of complex quantum systems such as large molecular systems. In this application, one is interested in both the electronic structure such as the ground state energy and dynamical properties such as the scattering cross section and chemical reaction rates. However, most theoretical work and experimental demonstrations have focused on the quantum computation of energies and energy surfaces. In this work, we attempt to make the prethreshold (not error-corrected) quantum simulation of dynamical properties practical as well. We show that the use of precomputed potential energy surfaces and couplings enables the gate-based simulation of few-channel but otherwise realistic molecular collisions. Our approach is based on the widely used Born–Oppenheimer approximation for the structure problem coupled with a semiclassical method for the dynamics. In the latter the electrons are treated quantum mechanically but the nuclei are classical, which restricts the collisions to high energy or temperature (typically above ≈10 eV). By using operator splitting techniques optimized for the resulting time-dependent Hamiltonian simulation problem, we give several physically realistic collision examples, with 3–8 channels and circuit depths < 1000.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2015

Application of the self-consistent quantum method for simulating the size quantization effect in the channel of a nano-scale dual gate MOSFET

Self-Consistent Quantum Method using Schrodinger-Poisson equations have been used for determining the Channel electron density of Nano-Scale MOSFETs for 6nm and 9nm thick channels. The 6nm thick MOSFET show the peak of the electron density at the middle where as the 9nm thick MOSFET shows the accumulation of the electrons at the oxide/semiconductor interface. The electron density in the channel is obtained from the diagonal elements of the density matrix; [ρ]=[1/(1+exp(β(H − μ)))] A Tridiagonal Hamiltonian Matrix [H] is constructed for the oxide/channel/oxide 1D structure for the dual gate MOSFET. This structure is discretized and Finite-Difference method is used for constructing the matrix equation. The comparison of these results which are obtained by Quantum methods are done with Semi-Classical methods.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2011

Approximate simulation of entanglement with a linear cost of communication

Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for n Bell states, but it grows exponentially in n. Three simple protocols are presented that provide approximate simulations for low-dimensional entangled systems and require a linearly growing amount of communication. We have tested them by performing some simulations for a family of measurements. The maximal error is less than 1% in three dimensions and grows sublinearly with the number of entangled bits in the range numerically tested. One protocol is the multidimensional generalization of the exact Toner-Bacon [Phys. Rev. Lett. 91, 187904 (2003)] model for a single Bell state. The other two protocols are generalizations of an alternative exact model, which we derive from the Kochen-Specker [J. Math. Mech. 17, 59 (1967)] scheme for simulating single-qubit measurements. These protocols can give some indication for finding optimal one-way communication protocols that classically simulate entanglement and quantum channels. Furthermore they can be useful for deciding if a quantum communication protocol provides an advantage on classical protocols.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗
DOE OSTI2010

Quantum-capacity-approaching codes for the detected-jump channel

The quantum-channel capacity gives the ultimate limit for the rate at which quantum data can be reliably transmitted through a noisy quantum channel. Degradable quantum channels are among the few channels whose quantum capacities are known. Given the quantum capacity of a degradable channel, it remains challenging to find a practical coding scheme which approaches capacity. Here we discuss code designs for the detected-jump channel, a degradable channel with practical relevance describing the physics of spontaneous decay of atoms with detected photon emission. We show that this channel can be used to simulate a binary classical channel with both erasures and bit flips. The capacity of the simulated classical channel gives a lower bound on the quantum capacity of the detected-jump channel. When the jump probability is small, it almost equals the quantum capacity. Hence using a classical capacity-approaching code for the simulated classical channel yields a quantum code which approaches the quantum capacity of the detected-jump channel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Quantifying the magic of quantum channels

Abstract To achieve universal quantum computation via general fault-tolerant schemes, stabilizer operations must be supplemented with other non-stabilizer quantum resources. Motivated by this necessity, we develop a resource theory for magic quantum channels to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits. For qudit quantum computing with odd dimension d , it is known that quantum states with non-negative Wigner function can be efficiently simulated classically. First, inspired by this observation, we introduce a resource theory based on completely positive-Wigner-preserving quantum operations as free operations, and we show that they can be efficiently simulated via a classical algorithm. Second, we introduce two efficiently computable magic measures for quantum channels, called the mana and thauma of a quantum channel. As applications, we show that these measures not only provide fundamental limits on the distillable magic of quantum channels, but they also lead to lower bounds for the task of synthesizing non-Clifford gates. Third, we propose a classical algorithm for simulating noisy quantum circuits, whose sample complexity can be quantified by the mana of a quantum channel. We further show that this algorithm can outperform another approach for simulating noisy quantum circuits, based on channel robustness. Finally, we explore the threshold of non-stabilizerness for basic quantum circuits under depolarizing noise.

Wang, Xin (ORCID:0000000206413186)↗
DOE OSTI2015

Photodissociation of the carbon monoxide dication in the {sup 3}Σ{sup −} manifold: Quantum control simulation towards the C{sup 2+} + O channel

The photodissociation and laser assisted dissociation of the carbon monoxide dication X{sup 3}Π CO{sup 2+} into the {sup 3}Σ{sup −} states are investigated. Ab initio electronic structure calculations of the adiabatic potential energy curves, radial nonadiabatic couplings, and dipole moments for the X {sup 3}Π state are performed for 13 excited {sup 3}Σ{sup −} states of CO{sup 2+}. The photodissociation cross section, calculated by time-dependent methods, shows that the C{sup +} + O{sup +} channels dominate the process in the studied energy range. The carbon monoxide dication CO{sup 2+} is an interesting candidate for control because it can be produced in a single, long lived, v = 0 vibrational state due to the instability of all the other excited vibrational states of the ground {sup 3}Π electronic state. In a spectral range of about 25 eV, perpendicular transition dipoles couple this {sup 3}Π state to a manifold of {sup 3}Σ{sup −} excited states leading to numerous C{sup +} + O{sup +} channels and a single C{sup 2+} + O channel. This unique channel is used as target for control calculations using local control theory. We illustrate the efficiency of this method in order to find a tailored electric field driving the photodissociation in a manifold of strongly interacting electronic states. The selected local pulses are then concatenated in a sequence inspired by the “laser distillation” strategy. Finally, the local pulse is compared with optimal control theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

A quantum algorithm for evolving open quantum dynamics on quantum computing devices

Abstract Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.

42 ENGINEERING↗
DOE OSTI2025

Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements

The adaptive variational quantum dynamics simulation (AVQDS) method performs real-time evolution of quantum states using automatically generated parametrized quantum circuits that often contain substantially fewer gates than Trotter circuits. Here we report an improved version of the method, which we call AVQDS(T), by porting the tiling efficient trial circuits with rotations implemented simultaneously technique. The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold. Here we perform benchmark noiseless AVQDS(T) simulations of quench dynamics in local spin models and compare with an alternative adaptive variational approach on quantum resource requirement. Quantum dynamical simulations implementing realistic noise channels are also reported. Finally, we propose a way to substantially alleviate the measurement overhead of AVQDS(T) while maintaining high accuracy by synergistically integrating quantum circuit calculations on quantum processing units with classical calculations using, e.g., tensor networks to evaluate the quantum geometric tensor. We showcase that this approach enables AVQDS(T) to deliver more accurate results than simulations using a fixed ansatz of comparable final depth for a significant time duration with fewer quantum resources.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗