We introduce high-order dynamical decoupling strategies for open-system adiabatic quantum computation. Our numerical results for the random-unitary map model demonstrate that a judicious choice of high-order dynamical...
详细信息
We introduce high-order dynamical decoupling strategies for open-system adiabatic quantum computation. Our numerical results for the random-unitary map model demonstrate that a judicious choice of high-order dynamical decoupling method, in conjunction with an encoding which allows computation to proceed alongside decoupling, can dramatically enhance the fidelity of adiabatic quantum computation in spite of decoherence.
The increasing use of verbal reports in psychological research requires tools for improving the ease and reliability of collecting and coding verbal report data. An approach is described that maintains the verbal repo...
详细信息
The increasing use of verbal reports in psychological research requires tools for improving the ease and reliability of collecting and coding verbal report data. An approach is described that maintains the verbal report data in digitally recorded audio form throughout the collecting and encoding processes. A new computer-aided encoding tool, CAPAS, is described, which randomly selects and plays individual protocol segments and stores computer keyboard-entered codes in an SPSS-formatted data file.
A study explores and describes the process of instructional consultation with feedback using videotape recordings of interactions between instructional consultants and their faculty clients. Prescriptive and Collabor...
详细信息
A study explores and describes the process of instructional consultation with feedback using videotape recordings of interactions between instructional consultants and their faculty clients. Prescriptive and Collaborative models of consultation were the most frequently used. Results are discussed.
There exist in the literature two natural generalizations of low density parity check (LDPC) codes: 1) LDPC convolutional codes or sometimes also called spatially coupled LDPC codes which have shown to be able to reac...
详细信息
There exist in the literature two natural generalizations of low density parity check (LDPC) codes: 1) LDPC convolutional codes or sometimes also called spatially coupled LDPC codes which have shown to be able to reach Shannon capacity in a practical way. 2) Moderate density parity check (MDPC) codes which are linear codes possessing a parity check matrix whose row weight is not more than O(√n), still allowing efficient decoding with high probability. MDPC codes became a highly interesting class of block codes for the purpose of doing code-based cryptography. In this paper we study MDPC convolutional codes and some of their basic properties. At the end of the paper we explain how one can construct a new code-based cryptographic system. This new system can be seen as a convolutional version of the famous BIKE system currently evaluated for possible standardization by the National Institute for Standards and Technology (NIST).
The paper devoted to implementation of the public key algorithm based on directed algebraic graphs over finite commutative ring K and their symmetries. First we expand the key space K n of graph based encryption algor...
详细信息
The paper devoted to implementation of the public key algorithm based on directed algebraic graphs over finite commutative ring K and their symmetries. First we expand the key space K n of graph based encryption algorithm in such way that arbitrary chosen plaintext can be converted to arbitrary chosen ciphertext. Second, we conjugate chosen encryption map, which is a composition of several “elementary” cubical polynomial automorphisms of a free module K n with special invertible affine transformation of K n . Finally we compute symbolically corresponding cubic public map g of K n onto K n . We evaluate time for the generation of g , time of execution of public map, number of monomial expression in the list of corresponding public rules.
Today most software applications come with a graphical user interface, including U. S. Nuclear Regulatory Commission TRAC/RELAP Advanced Computational Engine (TRACE) best-estimate reactor system code. The graphical us...
详细信息
Today most software applications come with a graphical user interface, including U. S. Nuclear Regulatory Commission TRAC/RELAP Advanced Computational Engine (TRACE) best-estimate reactor system code. The graphical user interface is called Symbolic Nuclear Analysis Package (SNAP). The purpose of the present study was to assess the TRACE computer code and to assess the SNAP capabilities for input deck preparation and advanced presentation of the results. BETHSY 6.2 TC test was selected, which is 15.24 cm equivalent diameter horizontal cold leg break. For calculations the TRACE V5.0 Patch 1 and RELAP5/MOD3.3 Patch 4 were used. The RELAP5 legacy input deck was converted to TRACE input deck using SNAP. The RELAP5 and TRACE comparison to experimental data showed that TRACE results are as good as or better than the RELAP5 calculated results. The developed animation masks were of great help in comparison of results and investigating the calculated physical phenomena and processes.
This paper proposes a photovoltaic (PV) power system for battery charger applications. The charger uses an interleaving boost converter with a single-capacitor turn-off snubber to reduce voltage stresses of active swi...
详细信息
This paper proposes a photovoltaic (PV) power system for battery charger applications. The charger uses an interleaving boost converter with a single-capacitor turn-off snubber to reduce voltage stresses of active switches at turn-off transition. Therefore, active switches of the charger can be operated with zero-voltage transition (ZVT) to decrease switching losses and increase conversion efficiency. In order to draw the maximum power from PV arrays and obtain the optimal power control of the battery charger, a perturbation-and-observation method and microchip are incorporated to implement maximum power point tracking (MPPT) algorithm and power management. Finally, a prototype battery charger is built and implemented. Experimental results have verified the performance and feasibility of the proposed PV power system for battery charger applications.
Studies investigating neural information processing often implicitly ask both, which processing strategy out of several alternatives is used and how this strategy is implemented in neural dynamics. A prime example are...
详细信息
Studies investigating neural information processing often implicitly ask both, which processing strategy out of several alternatives is used and how this strategy is implemented in neural dynamics. A prime example are studies on predictive coding. These often ask whether confirmed predictions about inputs or predictions errors between internal predictions and inputs are passed on in a hierarchical neural system-while at the same time looking for the neural correlates of coding for errors and predictions. If we do not know exactly what a neural system predicts at any given moment, this results in a circular analysis-as has been criticized correctly. To circumvent such circular analysis, we propose to express information processing strategies (such as predictive coding) by local information-theoretic quantities, such that they can be estimated directly from neural data. We demonstrate our approach by investigating two opposing accounts of predictive coding-like processing strategies, where we quantify the building blocks of predictive coding, namely predictability of inputs and transfer of information, by local active information storage and local transfer entropy. We define testable hypotheses on the relationship of both quantities, allowing us to identify which of the assumed strategies was used. We demonstrate our approach on spiking data collected from the retinogeniculate synapse of the cat (N = 16). Applying our local information dynamics framework, we are able to show that the synapse codes for predictable rather than surprising input. To support our findings, we estimate quantities applied in the partial information decomposition framework, which allow to differentiate whether the transferred information is primarily bottom-up sensory input or information transferred conditionally on the current state of the synapse. Supporting our local information-theoretic results, we find that the synapse preferentially transfers bottom-up information. Many neuroscience st
A soft-decision decoder for quantum erasure errors with standard depolarizing errors is proposed for concatenated Calderbank-Shor-Steane codes. This decoding is computationally efficient as long as the block size of e...
详细信息
A soft-decision decoder for quantum erasure errors with standard depolarizing errors is proposed for concatenated Calderbank-Shor-Steane codes. This decoding is computationally efficient as long as the block size of each concatenation level is sufficiently small. The numerical simulation with a specific quantum code called the C4/C6 code shows that this decoder can achieve almost optimal performance and the so-called hashing bound for the erasure and depolarizing error model. Since probabilistic-gate errors can be regarded as erasure errors, this decoder is useful for fault-tolerant quantum computation with probabilistic gates. To demonstrate this, we perform numerical simulation with the C4/C6 code. Consequently, it turns out that the error probability of a logical controlled-not gate with probabilistic physical two-qubit gates is improved by three orders of magnitude by the present decoder compared to a previous hard-decision decoder.
The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of information which can be transmitted reliably over that channel. To evaluate the strong capacity of a particular channel...
详细信息
The strong capacity of a particular channel can be interpreted as a sharp limit on the amount of information which can be transmitted reliably over that channel. To evaluate the strong capacity of a particular channel one must prove both the direct part of the channel coding theorem and the strong converse for the channel. Here we consider the strong converse theorem for the periodic quantum channel and show some rather surprising results. We first show that the strong converse does not hold in general for this channel and therefore the channel does not have a strong capacity. Instead, we find that there is a scale of capacities corresponding to error probabilities between integer multiples of the inverse of the periodicity of the channel. A similar scale also exists for the random channel.
暂无评论