Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum channels”

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

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↗

Entanglement entropy and non-local duality: Quantum channels and quantum algebras

Here, we investigate the transformation of entanglement entropy under dualities, using the Kramers–Wannier duality present in the transverse field Ising model as our example. Entanglement entropy between local spin degrees of freedom is not generically preserved by the duality; instead, entangled states may be mapped to states with no local entanglement. To understand the fate of this entanglement, we consider two quantitative descriptions of degrees of freedom and their transformation under duality. The first involves Kraus operators implementing the partial trace as a quantum channel, while the second utilizes the algebraic approach to quantum mechanics, where degrees of freedom are encoded in subalgebras. Using both approaches, we show that entanglement of local degrees of freedom is not lost; instead it is transferred to non-local degrees of freedom by the duality transformation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coexistent quantum channel characterization using quantum process tomography with spectrally resolved detection

The coexistence of classical and quantum signals over the same optical fiber is critical for quantum networks operating within the existing communications infrastructure. Here, we characterize the quantum channel that results from distributing approximate single-photon polarization-encoded qubits simultaneously with classical light of varying intensities through a 25 km fiber-optic channel. We use spectrally resolved quantum process tomography with a newly developed Bayesian reconstruction method to estimate the quantum channel from experimental data, both with and without classical noise. Furthermore, we show that the coexistent fiber-based quantum channel has high process fidelity with an ideal depolarizing channel if the noise is dominated by Raman scattering. These results aid future development of quantum repeater designs and quantum error-correcting codes which benefit from realistic channel error models.

Chapman, Joseph↗

Base norms and discrimination of generalized quantum channels

We introduce and study norms in the space of hermitian matrices, obtained from base norms in positively generated subspaces. These norms are closely related to discrimination of so-called generalized quantum channels, including quantum states, channels, and networks. We further introduce generalized quantum decision problems and show that the maximal average payoffs of decision procedures are again given by these norms. We also study optimality of decision procedures, in particular, we obtain a necessary and sufficient condition under which an optimal 1-tester for discrimination of quantum channels exists, such that the input state is maximally entangled.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Lower Estimates for Distances from a Given Quantum Channel to Certain Classes of Quantum Channels

By using estimates for the variation of quantum mutual information and the relative entropy of entanglement, we obtain ε-exact lower estimates for distances from a given quantum channels to sets of degradable, antidegradable, and entanglement-breaking channels. As an auxiliary result, we obtain ε-exact lower estimates for the distance from a given two-particle state to the set of all separable states.

97 MATHEMATICS AND COMPUTING↗

Some characterizations of quantum channel in infinite Hilbert spaces

We first show that for any quantum states ρ on H and σ on K there exists a quantum channel Φ such that Φ(ρ) = σ, where H and K are finite or infinite dimensional Hilbert spaces. Then we consider some conclusions for the quantum channel Φ such that Φ(ρ) = σ and Φ(I{sub H}) exists or Φ(I{sub H})=I{sub K}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Process tomography for unitary quantum channels

We study the number of measurements required for quantum process tomography under prior information, such as a promise that the unknown channel is unitary. We introduce the notion of an interactive observable and we show that any unitary channel acting on a d-level quantum system can be uniquely identified among all other channels (unitary or otherwise) with only O(d{sup 2}) interactive observables, as opposed to the O(d{sup 4}) required for tomography of arbitrary channels. This result generalizes to the problem of identifying channels with at most q Kraus operators, and slight improvements can be obtained if we wish to identify such a channel only among unital channels or among other channels with q Kraus operators. These results are proven via explicit construction of large subspaces of Hermitian matrices with various conditions on rank, eigenvalues, and partial trace. Our constructions are built upon various forms of totally nonsingular matrices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Arbitrarily small amounts of correlation for arbitrarily varying quantum channels

As our main result show that in order to achieve the randomness assisted message and entanglement transmission capacities of a finite arbitrarily varying quantum channel it is not necessary that sender and receiver share (asymptotically perfect) common randomness. Rather, it is sufficient that they each have access to an unlimited amount of uses of one part of a correlated bipartite source. This access might be restricted to an arbitrary small (nonzero) fraction per channel use, without changing the main result. We investigate the notion of common randomness. It turns out that this is a very costly resource – generically, it cannot be obtained just by local processing of a bipartite source. This result underlines the importance of our main result. Also, the asymptotic equivalence of the maximal- and average error criterion for classical message transmission over finite arbitrarily varying quantum channels is proven. At last, we prove a simplified symmetrizability condition for finite arbitrarily varying quantum channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Conditions for uniqueness of product representations for separable quantum channels and separable quantum states

We give a sufficient condition that an operator sum representation of a separable quantum channel in terms of product operators is the unique product representation for that channel, and then provide examples of such channels for any number of parties. This result has implications for efforts to determine whether or not a given separable channel can be exactly implemented by local operations and classical communication. By the Choi-Jamiolkowski isomorphism, it also translates to a condition for the uniqueness of product state ensembles representing a given quantum state. These ideas follow from considerations concerning whether or not a subspace spanned by a given set of product operators contains at least one additional product operator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Realization of the Werner-Holevo and Landau-Streater Quantum Channels for Qutrits on Quantum Computers.

We realize the Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for qutrits on IBM quantum computers. These channels correspond to the interaction between a qutrit and its environment that results in the globally unitarily covariant qutrit transformation violating the multiplicativity of the maximal p-norm. Our realization of the LS and WH channels is based on embedding the qutrit states into states of two qubits and using the single-qubit and two-qubit CNOT gates to implement the specific interaction. We employ the standard quantum gates, hence the developed algorithm suits any quantum computer. We run our algorithm on a 5-qubit computer and a 20-qubit computer, as well as on a simulator. We quantify the quality of the implemented channels comparing their action on different input states with theoretical predictions. The overall efficiency is quantified by the fidelity between the theoretical and experimental Choi states implemented on the 20-qubit computer.

completely-positive trace-preserving map↗

Coexistent Quantum Channel Characterization Using Spectrally Resolved Bayesian Quantum Process Tomography

The coexistence of quantum and classical signals over the same optical fiber with minimal degradation of the transmitted quantum information is critical for operating large-scale quantum networks over the existing communications infrastructure. In this work, we systematically characterize the quantum channel that results from simultaneously distributing approximate single-photon polarization-encoded qubits and classical light of varying intensities through fiber-optic channels of up to 15 km. Using spectrally resolved quantum process tomography with a Bayesian reconstruction method that we develop, we estimate the full quantum channel from experimental photon counting data, both with and without classical background. Furthermore, although we find the exact channel description to be a weak function of the pump polarization, we nevertheless show that the coexistent fiber-based quantum channel has high process fidelity with an ideal depolarizing channel when the noise is dominated by Raman scattering. These results provide a basis for the future development of quantum repeater designs and quantum error-correcting codes for real-world channels and inform models used in the analysis and simulation of quantum networks.

97 MATHEMATICS AND COMPUTING↗

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)↗

Multiplexed communication over a high-speed quantum channel

In quantum information systems it is of particular interest to consider the best way in which to use the nonclassical resources consumed by that system. Quantum communication protocols are integral to quantum information systems and are among the most promising near-term applications of quantum information science. Here we show that a multiplexed, digital quantum communications system supported by a comb of vacuum squeezing has a greater channel capacity per photon than a source of broadband squeezing with the same analog band width. We report on the time-resolved, simultaneous observation of the first dozen teeth in a 2.4-GHz comb of vacuum squeezing produced by a subthreshold optical parametric oscillator, as required for such a quantum communications channel. We also demonstrate multiplexed communication on that channel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unconditional security proof of a deterministic quantum key distribution with a two-way quantum channel

In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD protocol with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD protocol against general attacks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Information transmission with continuous variable quantum erasure channels

Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different types of channels, evaluating the corresponding quantum capacity, and finding the capacity-approaching coding scheme are the major tasks in quantum communication theory. Quantum channel in discrete variables has been discussed enormously based on various error models, while error model in the continuous variable channel has been less studied due to the infinite dimensional problem. In this paper, we investigate a general continuous variable quantum erasure channel. By defining an effective subspace of the continuous variable system, we find a continuous variable random coding model. We then derive the quantum capacity of the continuous variable erasure channel in the framework of decoupling theory. The discussion in this paper fills the gap of a quantum erasure channel in continuous variable setting and sheds light on the understanding of other types of continuous variable quantum channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reversibility conditions for quantum channels and their applications

Conditions for a quantum channel (noncommutative Markov operator) to be reversible with respect to complete families of quantum states with bounded rank are obtained. A description of all quantum channels reversible with respect to a given (orthogonal or nonorthogonal) complete family of pure states is given. Some applications in quantum information theory are considered. Bibliography: 20 titles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Out-of-Distribution Generalization for Learning Quantum Channels with Low-Energy Coherent States

When experimentally learning the action of a continuous-variable quantum process by probing it with inputs, there will often be some restriction on the input states used. One experimentally simple way to probe a quantum channel is to use low-energy coherent states. Learning a quantum channel in this way presents difficulties, due to the fact that two channels may act similarly on low-energy inputs but very differently for high-energy inputs. They may also act similarly on coherent-state inputs but differently on nonclassical inputs. Extrapolating the behavior of a channel for more general input states from its action on the far more limited set of low-energy coherent states is a case of out-of-distribution generalization. To be sure that such generalization gives meaningful results, one needs to relate error bounds for the training set to bounds that are valid for all inputs. We show that for any pair of channels that act sufficiently similarly on low-energy coherent-state inputs, one can bound how different the input-output relations are for any (high-energy or highly nonclassical) input. This proves that out-of-distribution generalization is always possible for learning quantum channels using low-energy coherent states, as long as enough samples are used.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗