75,947 research outputs found
On the Limits of Gate Elimination
Although a simple counting argument shows the existence of Boolean functions of exponential circuit complexity, proving superlinear circuit lower bounds for explicit functions seems to be out of reach of the current techniques. There has been a (very slow) progress in proving linear lower bounds with the latest record of 3 1/86*n-o(n). All known lower bounds are based on the so-called gate elimination technique. A typical gate elimination argument shows that it is possible to eliminate several gates from an optimal circuit by making one or several substitutions to the input variables and repeats this inductively. In this note we prove that this method cannot achieve linear bounds of cn beyond a certain constant c, where c depends only on the number of substitutions made at a single step of the induction
Retrograde p-well for 10kV-class SiC IGBTs
In this paper, we propose the use of a retrograde doping profile for the p-well for ultrahigh voltage (>10 kV) SiC IGBTs. We show that the retrograde p-well effectively addresses the punchthrough issue, whereas offering a robust control over the gate threshold voltage. Both the punchthrough elimination and the gate threshold voltage control are crucial to high-voltage vertical IGBT architectures and are determined by the limits on the doping concentration and the depth that a conventional p-well implant can have. Without any punchthrough, a 10-kV SiC IGBT consisting of retrograde p-well yields gate threshold voltages in the range of 6-7 V with a gate oxide thickness of 100 nm. Gate oxide thickness is typically restricted to 50-60 nm in SiC IGBTs if a conventional p-well with 1×10 17 cm -3 is utilized. We further show that the optimized retrograde p-well offers the most optimum switching performance. We propose that such an effective retrograde p-well, which requires low-energy shallow implants and thus key to minimize processing challenges and device development cost, is highly promising for the ultrahigh-voltage (>10 kV) SiC IGBT technology
Understanding the complexity of #SAT using knowledge compilation
Two main techniques have been used so far to solve the #P-hard problem #SAT.
The first one, used in practice, is based on an extension of DPLL for model
counting called exhaustive DPLL. The second approach, more theoretical,
exploits the structure of the input to compute the number of satisfying
assignments by usually using a dynamic programming scheme on a decomposition of
the formula. In this paper, we make a first step toward the separation of these
two techniques by exhibiting a family of formulas that can be solved in
polynomial time with the first technique but needs an exponential time with the
second one. We show this by observing that both techniques implicitely
construct a very specific boolean circuit equivalent to the input formula. We
then show that every beta-acyclic formula can be represented by a polynomial
size circuit corresponding to the first method and exhibit a family of
beta-acyclic formulas which cannot be represented by polynomial size circuits
corresponding to the second method. This result shed a new light on the
complexity of #SAT and related problems on beta-acyclic formulas. As a
byproduct, we give new handy tools to design algorithms on beta-acyclic
hypergraphs
The Essential Role and the Continuous Evolution of Modulation Techniques for Voltage-Source Inverters in the Past, Present, and Future Power Electronics
The cost reduction of power-electronic devices, the increase in their reliability, efficiency, and power capability, and lower development times, together with more demanding application requirements, has driven the development of several new inverter topologies recently introduced in the industry, particularly medium-voltage converters. New more complex inverter topologies and new application fields come along with additional control challenges, such as voltage imbalances, power-quality issues, higher efficiency needs, and fault-tolerant operation, which necessarily requires the parallel development of modulation schemes. Therefore, recently, there have been significant advances in the field of modulation of dc/ac converters, which conceptually has been dominated during the last several decades almost exclusively by classic pulse-width modulation (PWM) methods. This paper aims to concentrate and discuss the latest developments on this exciting technology, to provide insight on where the state-of-the-art stands today, and analyze the trends and challenges driving its future
Robustness of high-fidelity Rydberg gates with single-site addressability
Controlled phase (CPHASE) gates can in principle be realized with trapped
neutral atoms by making use of the Rydberg blockade. Achieving the ultra-high
fidelities required for quantum computation with such Rydberg gates is however
compromised by experimental inaccuracies in pulse amplitudes and timings, as
well as by stray fields that cause fluctuations of the Rydberg levels. We
report here a comparative study of analytic and numerical pulse sequences for
the Rydberg CPHASE gate that specifically examines the robustness of the gate
fidelity with respect to such experimental perturbations. Analytical pulse
sequences of both simultaneous and stimulated Raman adiabatic passage (STIRAP)
are found to be at best moderately robust under these perturbations. In
contrast, optimal control theory is seen to allow generation of numerical
pulses that are inherently robust within a predefined tolerance window. The
resulting numerical pulse shapes display simple modulation patterns and their
spectra contain only one additional frequency beyond the basic resonant Rydberg
gate frequencies. Pulses of such low complexity should be experimentally
feasible, allowing gate fidelities of order 99.90 - 99.99% to be achievable
under realistic experimental conditions.Comment: 12 pages, 14 figure
Phase shifts in nonresonant coherent excitation
Far-off-resonant pulsed laser fields produce negligible excitation between
two atomic states but may induce considerable phase shifts. The acquired phases
are usually calculated by using the adiabatic-elimination approximation. We
analyze the accuracy of this approximation and derive the conditions for its
applicability to the calculation of the phases. We account for various sources
of imperfections, ranging from higher terms in the adiabatic-elimination
expansion and irreversible population loss to couplings to additional states.
We find that, as far as the phase shifts are concerned, the adiabatic
elimination is accurate only for a very large detuning. We show that the
adiabatic approximation is a far more accurate method for evaluating the phase
shifts, with a vast domain of validity; the accuracy is further enhanced by
superadiabatic corrections, which reduce the error well below .
Moreover, owing to the effect of adiabatic population return, the adiabatic and
superadiabatic approximations allow one to calculate the phase shifts even for
a moderately large detuning, and even when the peak Rabi frequency is larger
than the detuning; in these regimes the adiabatic elimination is completely
inapplicable. We also derive several exact expressions for the phases using
exactly soluble two-state and three-state analytical models.Comment: 10 pages, 7 figure
Fast and robust two- and three-qubit swapping gates on multi-atomic ensembles in quantum electrodynamic cavity
Creation of quantum computer is outstanding fundamental and practical
problem. The quantum computer could be used for execution of very complicated
tasks which are not solvable with the classical computers. The first prototype
of solid state quantum computer was created in 2009 with superconducting
qubits. However, it suffers from the decoherent processes and it is desirable
to find more practical encoding of qubits with long-lived coherence. It could
be single impurity or vacancy centers in solids, but their interaction with
electromagnetic radiation is rather weak. So, here, ensembles of atoms were
proposed for the qubit encoding by using the dipole blockade mechanism in order
to turn multilevel systems in two level ones. But dipole-dipole based blockade
introduces an additional decoherence that limits its practical significance.
Recently, the collective blockade mechanism has been proposed for the system of
three-level atoms by using the different frequency shifts for the Raman
transitions between the collective atomic states characterized by a different
number of the excited atoms. Here, we propose two qubit gate by using another
collective blockade mechanism in the system of two level atoms based on
exchange interaction via the virtual photons between the multi-atomic ensembles
in the resonator. Also we demonstrate the possibility of three qubit gate
(Controlled SWAP gate) using a suppression of the swap-process between two
multi-atomic ensembles due to dynamical shift of the atomic levels controlled
by the states of photon encoded qubit
Decoherence-free dynamical and geometrical entangling phase gates
It is shown that entangling two-qubit phase gates for quantum computation
with atoms inside a resonant optical cavity can be generated via common laser
addressing, essentially, within one step. The obtained dynamical or geometrical
phases are produced by an evolution that is robust against dissipation in form
of spontaneous emission from the atoms and the cavity and demonstrates
resilience against fluctuations of control parameters. This is achieved by
using the setup introduced by Pachos and Walther [Phys. Rev. Lett. 89, 187903
(2002)] and employing entangling Raman- or STIRAP-like transitions that
restrict the time evolution of the system onto stable ground states.Comment: 10 pages, 9 figures, REVTEX, Eq. (20) correcte
- …