Results 1  10
of
43,827
FULLY MULTIQUBIT ENTANGLED STATES
, 2008
"... We investigate the properties of different levels of entanglement in graph states which correspond to connected graphs. Combining the operational definition of graph states and the postulates of entanglement measures, we prove that in connected graph states of N> 3 qubits there is no genuine thre ..."
Abstract
 Add to MetaCart
threequbit entanglement. For certain classes of graph states, all genuine kqubit entanglement, 2 ≤ k ≤ N − 1, among every k qubits vanishes. These results about connected graph states naturally lead to the definition of fully multiqubit entangled states. We also find that the connected graph states
COMPLEMENTARITY RELATIONS FOR MULTIQUBIT SYSTEMS
, 2004
"... We derive two complementarity relations that constrain the individual and bipartite properties that may simultaneously exist in a multiqubit system. The first expression, valid for an arbitrary pure state of n qubits, demonstrates that the degree to which single particle properties are possessed by ..."
Abstract
 Add to MetaCart
We derive two complementarity relations that constrain the individual and bipartite properties that may simultaneously exist in a multiqubit system. The first expression, valid for an arbitrary pure state of n qubits, demonstrates that the degree to which single particle properties are possessed
Controlling bipartite entanglement in multiqubit systems
, 2004
"... Bipartite entanglement in multiqubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multiqubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multiqubit system ..."
Abstract
 Add to MetaCart
prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multiqubit state. In addition, we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits. PACS numbers
Entanglement of Formation of an Arbitrary State of Two Qubits
, 1998
"... The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state ρ is defined as the minimum average entanglement of a set of pure states constituting a decomposition of ρ. An earlier paper [Phys. Rev ..."
Abstract

Cited by 192 (0 self)
 Add to MetaCart
. Rev. Lett. 78, 5022 (1997)] conjectured an explicit formula for the entanglement of formation of a pair of binary quantum objects (qubits) as a function of their density matrix, and proved the formula to be true for a special class of mixed states. The present paper extends the proof to arbitrary
Entanglement universality of twoqubit Xstates
"... We demonstrate that for every twoqubit state there is a Xcounterpart, i.e., a corresponding twoqubit Xstate of same spectrum and entanglement, as measured by concurrence, negativity or relative entropy of entanglement. By parametrizing the set of twoqubit Xstates and a family of unitary transf ..."
Abstract
 Add to MetaCart
transformations that preserve the sparse structure of a twoqubit Xstate density matrix, we obtain the parametric form of a unitary transformation that converts arbitrary twoqubit states into their Xcounterparts. Moreover, we provide a semianalytic prescription on how to set the parameters of this unitary
Algorithms for Scalable Synchronization on SharedMemory Multiprocessors
 ACM Transactions on Computer Systems
, 1991
"... Busywait techniques are heavily used for mutual exclusion and barrier synchronization in sharedmemory parallel programs. Unfortunately, typical implementations of busywaiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract

Cited by 567 (32 self)
 Add to MetaCart
accessible ag variables, and for some other processor to terminate the spin with a single remote write operation at an appropriate time. Flag variables may be locallyaccessible as a result of coherent caching, or by virtue of allocation in the local portion of physically distributed shared memory. We present a
Finding Small TwoQubit Circuits
"... An important result from the mid nineties shows that any unitary evolution may be realized as a sequence of controllednot and onequbit gates. This work surveys especially efficient circuits in this library, in the special case of evolutions on twoquantum bits. In particular, we show that to const ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
that to construct an arbitrary twoqubit state from 00〉, one CNOT gate suffices. To simulate an arbitrary twoqubit operator up to relative phases, two CNOTs suffice. To simulate an arbitrary twoqubit operator up to global phase, three CNOTs suffice. In each case, we construct an explicit circuit and prove
Tinydb: An acquisitional query processing system for sensor networks
 ACM Trans. Database Syst
, 2005
"... We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acq ..."
Abstract

Cited by 609 (8 self)
 Add to MetaCart
of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination
The click modular router
, 2001
"... Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devic ..."
Abstract

Cited by 1155 (28 self)
 Add to MetaCart
language tools that optimize router configurations and ensure they satisfy simple invariants. Due to Click’s architecture and language, Click router configurations are modular and easy to extend. A standardscompliant Click IP router has sixteen elements on its forwarding path. We present extensions
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
that require on the order of 100 seconds to render typical data sets on a workstation. Algorithms with optimizations that exploit coherence in the data have reduced rendering times to the range of ten seconds but are still not fast enough for interactive visualization applications. In this thesis we present a
Results 1  10
of
43,827