5,309 research outputs found
Recommended from our members
Constant-time cost evaluation for behavioral partitioning
Given a system behavioral specification, partitioning can be used to distribute among chips the processes, procedures, and storage elements that comprise the specification. We introduce a technique for constant-time recomputation of pin, area, and execution-time estimates for a behavioral partitioning move. The technique permits fast, accurate estimations of a large number of partitionings, thus enabling better results than approaches which attain tractable computation time by using gross estimates or less thorough partitioning algorithms. The key to our technique is the isolation and extraction before partitioning of the basic design attributes needed for estimation, and the updating of this information in constant-time for each move. The estimation models are almost as detailed as those presented in previous estimation approaches not intended for constant-time update. The results we provide indicate the speed and practicality of our estimation approach in conjunction with sophisticated partitioning algorithms
Relative multiplexing for minimizing switching in linear-optical quantum computing
Many existing schemes for linear-optical quantum computing (LOQC) depend on
multiplexing (MUX), which uses dynamic routing to enable near-deterministic
gates and sources to be constructed using heralded, probabilistic primitives.
MUXing accounts for the overwhelming majority of active switching demands in
current LOQC architectures. In this manuscript, we introduce relative
multiplexing (RMUX), a general-purpose optimization which can dramatically
reduce the active switching requirements for MUX in LOQC, and thereby reduce
hardware complexity and energy consumption, as well as relaxing demands on
performance for various photonic components. We discuss the application of RMUX
to the generation of entangled states from probabilistic single-photon sources,
and argue that an order of magnitude improvement in the rate of generation of
Bell states can be achieved. In addition, we apply RMUX to the proposal for
percolation of a 3D cluster state in [PRL 115, 020502 (2015)], and we find that
RMUX allows a 2.4x increase in loss tolerance for this architecture.Comment: Published version, New Journal of Physics, Volume 19, June 201
Effect of Loss on Multiplexed Single-Photon Sources
An on-demand single-photon source is a key requirement for scaling many
optical quantum technologies. A promising approach to realize an on-demand
single-photon source is to multiplex an array of heralded single-photon sources
using an active optical switching network. However, the performance of
multiplexed sources is degraded by photon loss in the optical components and
the non-unit detection efficiency of the heralding detectors. We provide a
theoretical description of a general multiplexed single-photon source with
lossy components and derive expressions for the output probabilities of
single-photon emission and multi-photon contamination. We apply these
expressions to three specific multiplexing source architectures and consider
their tradeoffs in design and performance. To assess the effect of lossy
components on near- and long-term experimental goals, we simulate the
multiplexed sources when used for many-photon state generation under various
amounts of component loss. We find that with a multiplexed source composed of
switches with ~0.2-0.4 dB loss and high efficiency number-resolving detectors,
a single-photon source capable of efficiently producing 20-40 photon states
with low multi-photon contamination is possible, offering the possibility of
unlocking new classes of experiments and technologies.Comment: Journal versio
Fast Quantum Modular Exponentiation
We present a detailed analysis of the impact on modular exponentiation of
architectural features and possible concurrent gate execution. Various
arithmetic algorithms are evaluated for execution time, potential concurrency,
and space tradeoffs. We find that, to exponentiate an n-bit number, for storage
space 100n (twenty times the minimum 5n), we can execute modular exponentiation
two hundred to seven hundred times faster than optimized versions of the basic
algorithms, depending on architecture, for n=128. Addition on a neighbor-only
architecture is limited to O(n) time when non-neighbor architectures can reach
O(log n), demonstrating that physical characteristics of a computing device
have an important impact on both real-world running time and asymptotic
behavior. Our results will help guide experimental implementations of quantum
algorithms and devices.Comment: to appear in PRA 71(5); RevTeX, 12 pages, 12 figures; v2 revision is
substantial, with new algorithmic variants, much shorter and clearer text,
and revised equation formattin
Efficient HTTP based I/O on very large datasets for high performance computing with the libdavix library
Remote data access for data analysis in high performance computing is
commonly done with specialized data access protocols and storage systems. These
protocols are highly optimized for high throughput on very large datasets,
multi-streams, high availability, low latency and efficient parallel I/O. The
purpose of this paper is to describe how we have adapted a generic protocol,
the Hyper Text Transport Protocol (HTTP) to make it a competitive alternative
for high performance I/O and data analysis applications in a global computing
grid: the Worldwide LHC Computing Grid. In this work, we first analyze the
design differences between the HTTP protocol and the most common high
performance I/O protocols, pointing out the main performance weaknesses of
HTTP. Then, we describe in detail how we solved these issues. Our solutions
have been implemented in a toolkit called davix, available through several
recent Linux distributions. Finally, we describe the results of our benchmarks
where we compare the performance of davix against a HPC specific protocol for a
data analysis use case.Comment: Presented at: Very large Data Bases (VLDB) 2014, Hangzho
Metastability-Containing Circuits
In digital circuits, metastability can cause deteriorated signals that
neither are logical 0 or logical 1, breaking the abstraction of Boolean logic.
Unfortunately, any way of reading a signal from an unsynchronized clock domain
or performing an analog-to-digital conversion incurs the risk of a metastable
upset; no digital circuit can deterministically avoid, resolve, or detect
metastability (Marino, 1981). Synchronizers, the only traditional
countermeasure, exponentially decrease the odds of maintained metastability
over time. Trading synchronization delay for an increased probability to
resolve metastability to logical 0 or 1, they do not guarantee success.
We propose a fundamentally different approach: It is possible to contain
metastability by fine-grained logical masking so that it cannot infect the
entire circuit. This technique guarantees a limited degree of metastability
in---and uncertainty about---the output.
At the heart of our approach lies a time- and value-discrete model for
metastability in synchronous clocked digital circuits. Metastability is
propagated in a worst-case fashion, allowing to derive deterministic
guarantees, without and unlike synchronizers. The proposed model permits
positive results and passes the test of reproducing Marino's impossibility
results. We fully classify which functions can be computed by circuits with
standard registers. Regarding masking registers, we show that they become
computationally strictly more powerful with each clock cycle, resulting in a
non-trivial hierarchy of computable functions
- …