28,425 research outputs found
Controlling qubit transitions during non-adiabatic rapid passage through quantum interference
In adiabatic rapid passage, the Bloch vector of a qubit is inverted by slowly
inverting an external field to which it is coupled, and along which it is
initially aligned. In non-adiabatic twisted rapid passage, the external field
is allowed to twist around its initial direction with azimuthal angle \phi(t)
at the same time that it is non-adiabatically inverted. For polynomial twist,
\phi(t) \sim Bt^{n}. We show that for n \ge 3, multiple qubit resonances can
occur during a single inversion of the external field, producing strong
interference effects in the qubit transition probability. The character of the
interference is controllable through variation of the twist strength B.
Constructive and destructive interference are possible, greatly enhancing or
suppressing qubit transitions. Experimental confirmation of these controllable
interference effects has already occurred. Application of this interference
mechanism to the construction of fast fault-tolerant quantum CNOT and NOT gates
is discussed.Comment: 8 pages, 7 figures, 2 tables; submitted to J. Mod. Op
Deriving Specifications of Dependable Systems: toward a Method
This paper proposes a method for deriving formal specifications of systems.
To accomplish this task we pass through a non trivial number of steps, concepts
and tools where the first one, the most important, is the concept of method
itself, since we realized that computer science has a proliferation of
languages but very few methods. We also propose the idea of Layered Fault
Tolerant Specification (LFTS) to make the method extensible to dependable
systems. The principle is layering the specification, for the sake of clarity,
in (at least) two different levels, the first one for the normal behavior and
the others (if more than one) for the abnormal. The abnormal behavior is
described in terms of an Error Injector (EI) which represents a model of the
erroneous interference coming from the environment. This structure has been
inspired by the notion of idealized fault tolerant component but the
combination of LFTS and EI using rely guarantee thinking to describe
interference can be considered one of the main contributions of this work. The
progress toward this method and the way to layer specifications has been made
experimenting on the Transportation and the Automotive Case Studies of the
DEPLOY project.Comment: Published in "12th European Workshop on Dependable Computing, EWDC
2009, Toulouse : France (2009)
An Adaptive Fault-Tolerant Communication Scheme for Body Sensor Networks
A high degree of reliability for critical data transmission is required in
body sensor networks (BSNs). However, BSNs are usually vulnerable to channel
impairments due to body fading effect and RF interference, which may
potentially cause data transmission to be unreliable. In this paper, an
adaptive and flexible fault-tolerant communication scheme for BSNs, namely
AFTCS, is proposed. AFTCS adopts a channel bandwidth reservation strategy to
provide reliable data transmission when channel impairments occur. In order to
fulfill the reliability requirements of critical sensors, fault-tolerant
priority and queue are employed to adaptively adjust the channel bandwidth
allocation. Simulation results show that AFTCS can alleviate the effect of
channel impairments, while yielding lower packet loss rate and latency for
critical sensors at runtime.Comment: 10 figures, 19 page
Temporal Interferometry: A Mechanism for Controlling Qubit Transitions During Twisted Rapid Passage with Possible Application to Quantum Computing
In an adiabatic rapid passage experiment, the Bloch vector of a two-level
system (qubit) is inverted by slowly inverting an external field to which it is
coupled, and along which it is initially aligned. In twisted rapid passage, the
external field is allowed to twist around its initial direction with azimuthal
angle at the same time that it is inverted. For polynomial twist:
. We show that for , multiple avoided crossings
can occur during the inversion of the external field, and that these crossings
give rise to strong interference effects in the qubit transition probability.
The transition probability is found to be a function of the twist strength ,
which can be used to control the time-separation of the avoided crossings, and
hence the character of the interference. Constructive and destructive
interference are possible. The interference effects are a consequence of the
temporal phase coherence of the wavefunction. The ability to vary this
coherence by varying the temporal separation of the avoided crossings renders
twisted rapid passage with adjustable twist strength into a temporal
interferometer through which qubit transitions can be greatly enhanced or
suppressed. Possible application of this interference mechanism to construction
of fast fault-tolerant quantum CNOT and NOT gates is discussed.Comment: 29 pages, 16 figures, submitted to Phys. Rev.
Universal blind quantum computation
We present a protocol which allows a client to have a server carry out a
quantum computation for her such that the client's inputs, outputs and
computation remain perfectly private, and where she does not require any
quantum computational power or memory. The client only needs to be able to
prepare single qubits randomly chosen from a finite set and send them to the
server, who has the balance of the required quantum computational resources.
Our protocol is interactive: after the initial preparation of quantum states,
the client and server use two-way classical communication which enables the
client to drive the computation, giving single-qubit measurement instructions
to the server, depending on previous measurement outcomes. Our protocol works
for inputs and outputs that are either classical or quantum. We give an
authentication protocol that allows the client to detect an interfering server;
our scheme can also be made fault-tolerant.
We also generalize our result to the setting of a purely classical client who
communicates classically with two non-communicating entangled servers, in order
to perform a blind quantum computation. By incorporating the authentication
protocol, we show that any problem in BQP has an entangled two-prover
interactive proof with a purely classical verifier.
Our protocol is the first universal scheme which detects a cheating server,
as well as the first protocol which does not require any quantum computation
whatsoever on the client's side. The novelty of our approach is in using the
unique features of measurement-based quantum computing which allows us to
clearly distinguish between the quantum and classical aspects of a quantum
computation.Comment: 20 pages, 7 figures. This version contains detailed proofs of
authentication and fault tolerance. It also contains protocols for quantum
inputs and outputs and appendices not available in the published versio
Quantal interferometry with dissipative internal motion
In presence of dissipation, quantal states may acquire complex-valued phase
effects. We suggest a notion of dissipative interferometry that accommodates
this complex-valued structure and that may serve as a tool for analyzing the
effect of certain kinds of external influences on quantal interference. The
concept of mixed-state phase and concomitant gauge invariance is extended to
dissipative internal motion. The resulting complex-valued mixed-state
interference effects lead to well-known results in the unitary limit and in the
case of dissipative motion of pure quantal states. Dissipative interferometry
is applied to fault-tolerant geometric quantum computation.Comment: Slight revision, journal reference adde
An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems
The main contribution of this paper is twofold. First, we present an appropriate schedulability analysis, based on response time analysis, for supporting fault-tolerant hard real-time systems. We consider systems that make use of error-recovery techniques to carry out fault tolerance. Second, we propose a new priority assignment algorithm which can be used, together with the schedulability analysis, to improve system fault resilience. These achievements come from the observation that traditional priority assignment policies may no longer be appropriate when faults are being considered. The proposed schedulability analysis takes into account the fact that the recoveries of tasks may be executed at higher priority levels. This characteristic is very important since, after an error, a task certainly has a shorter period of time to meet its deadline. The proposed priority assignment algorithm, which uses some properties of the analysis, is very efficient. We show that the method used to find out an appropriate priority assignment reduces the search space from O(n!) to O(n/sup 2/), where n is the number of task recovery procedures. Also, we show that the priority assignment algorithm is optimal in the sense that the fault resilience of task sets is maximized as for the proposed analysis. The effectiveness of the proposed approach is evaluated by simulation
- …