Noise resilience and entanglement evolution in two nonequivalent classes of quantum algorithms

The speedup provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speedup are not yet completely understood and deserve further attention. In this context, the classical simulation of quantum algorithms is a useful tool that can help us in gaining insight. Starting from the study of general conditions for classical simulation, we highlight several important differences between two nonequivalent classes of quantum algorithms. We investigate their performance under realistic conditions by quantitatively studying their resilience with respect to static noise. This latter refers to errors affecting the initial preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.

Analysis of Receiver Algorithms for LTE SC-FDMA Based Uplink MIMO Systems

This letter derives mathematical expressions for the received signal-to-interference-plus-noise ratio (SINR) of uplink Single Carrier (SC) Frequency Division Multiple Access (FDMA) multiuser MIMO systems. An improved frequency domain receiver algorithm is derived for the studied systems, and is shown to be significantly superior to the conventional linear MMSE based receiver in terms of SINR and bit error rate (BER) performance.

Revealing differences in gene network inference algorithms on the network level by ensemble methods

Motivation: The inference of regulatory networks from large-scale expression data holds great promise because of the potentially causal interpretation of these networks. However, due to the difficulty to establish reliable methods based on observational data there is so far only incomplete knowledge about possibilities and limitations of such inference methods in this context.

Results: In this article, we conduct a statistical analysis investigating differences and similarities of four network inference algorithms, ARACNE, CLR, MRNET and RN, with respect to local network-based measures. We employ ensemble methods allowing to assess the inferability down to the level of individual edges. Our analysis reveals the bias of these inference methods with respect to the inference of various network components and, hence, provides guidance in the interpretation of inferred regulatory networks from expression data. Further, as application we predict the total number of regulatory interactions in human B cells and hypothesize about the role of Myc and its targets regarding molecular information processing.

Low power field programmable gate array implementation of fast digital signal processing algorithms: characterisation and manipulation of data locality

Dynamic power consumption is very dependent on interconnect, so clever mapping of digital signal processing algorithms to parallelised realisations with data locality is vital. This is a particular problem for fast algorithm implementations where typically, designers will have sacrificed circuit structure for efficiency in software implementation. This study outlines an approach for reducing the dynamic power consumption of a class of fast algorithms by minimising the index space separation; this allows the generation of field programmable gate array (FPGA) implementations with reduced power consumption. It is shown how a 50% reduction in relative index space separation results in a measured power gain of 36 and 37% over a Cooley-Tukey Fast Fourier Transform (FFT)-based solution for both actual power measurements for a Xilinx Virtex-II FPGA implementation and circuit measurements for a Xilinx Virtex-5 implementation. The authors show the generality of the approach by applying it to a number of other fast algorithms namely the discrete cosine, the discrete Hartley and the Walsh-Hadamard transforms.

The impact of biomarkers in multivariate algorithms for bladder cancer diagnosis in patients with hematuria

BACKGROUND: We appraised 23 biomarkers previously associated with urothelial cancer in a case-control study. Our aim was to determine whether single biomarkers and/or multivariate algorithms significantly improved on the predictive power of an algorithm based on demographics for prediction of urothelial cancer in patients presenting with hematuria. METHODS: Twenty-two biomarkers in urine and carcinoembryonic antigen (CEA) in serum were evaluated using enzyme-linked immunosorbent assays (ELISAs) and biochip array technology in 2 patient cohorts: 80 patients with urothelial cancer, and 77 controls with confounding pathologies. We used Forward Wald binary logistic regression analyses to create algorithms based on demographic variables designated prior predicted probability (PPP) and multivariate algorithms, which included PPP as a single variable. Areas under the curve (AUC) were determined after receiver-operator characteristic (ROC) analysis for single biomarkers and algorithms. RESULTS: After univariate analysis, 9 biomarkers were differentially expressed (t test; P