Role of etravirine in the management of treatment-experienced patients with human immunodeficiency virus type 1

Etravirine is an oral diarylpyrimidine compound, a second-generation human immunodeficiency virus type 1 (HIV-1) non-nucleoside reverse transcriptase inhibitor (NNRTI) with expanded antiviral activity against NNRTI-resistant HIV-1, to be used in combination therapy for treatment-experienced patients. Compared with first-generation NNRTIs, etravirine has a high genetic barrier to resistance, and is better tolerated without the neuropsychiatric and hepatic side effects of efavirenz and nevirapine, respectively. Its safety profile is comparable to placebo with the exception of rash, which has been mild and self-limited in the great majority of patients. In phase III clinical trials among treatment-experienced patients harboring NNRTI-resistant HIV-1, etravirine in combination with an optimized background regimen (OBR) that included ritonavir-boosted darunavir demonstrated superior antiviral activity than the control OBR. In addition, patients on the etravirine arm had fewer AIDS-defining conditions, hospitalizations, and lower mortality compared with the OBR control arm

TOURISM AND HERITAGE IN A GLOBAL SOCIETY: THE PHILIPPINE EXPERIENCE (SOME PHILOSOPHICAL CONSIDERATIONS)

This article tries to clarify the meaning of several terms such as “global society,” “tourism,” “heritage,” and relate them particularly to the Philippine experience. While there are reasons to promote tourism and preserve the national heritage, there are certain obstacles to these that must be overcome. The article further argues that the present Filipino generation has accepted the current global culture—described by James Fallows as a “damaged culture”—as a source out of which a new understanding of Filipino identity is possible

Exponential improvement in precision for simulating sparse Hamiltonians

We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a $d$-sparse Hamiltonian $H$ acting on $n$ qubits can be simulated for time $t$ with precision $\epsilon$ using $O\big(\tau \frac{\log(\tau/\epsilon)}{\log\log(\tau/\epsilon)}\big)$ queries and $O\big(\tau \frac{\log^2(\tau/\epsilon)}{\log\log(\tau/\epsilon)}n\big)$ additional 2-qubit gates, where $\tau = d^2 \|{H}\|_{\max} t$. Unlike previous approaches based on product formulas, the query complexity is independent of the number of qubits acted on, and for time-varying Hamiltonians, the gate complexity is logarithmic in the norm of the derivative of the Hamiltonian. Our algorithm is based on a significantly improved simulation of the continuous- and fractional-query models using discrete quantum queries, showing that the former models are not much more powerful than the discrete model even for very small error. We also simplify the analysis of this conversion, avoiding the need for a complex fault correction procedure. Our simplification relies on a new form of "oblivious amplitude amplification" that can be applied even though the reflection about the input state is unavailable. Finally, we prove new lower bounds showing that our algorithms are optimal as a function of the error.Comment: v1: 27 pages; Subsumes and improves upon results in arXiv:1308.5424. v2: 28 pages, minor change

Simulating Hamiltonian dynamics with a truncated Taylor series

We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator. Our method can simulate the time evolution of a wide variety of physical systems. As in another recent algorithm, the cost of our method depends only logarithmically on the inverse of the desired precision, which is optimal. However, we simplify the algorithm and its analysis by using a method for implementing linear combinations of unitary operations to directly apply the truncated Taylor series.Comment: 5 page

Optimal Quantum Measurements of Expectation Values of Observables

Experimental characterizations of a quantum system involve the measurement of expectation values of observables for a preparable state |psi> of the quantum system. Such expectation values can be measured by repeatedly preparing |psi> and coupling the system to an apparatus. For this method, the precision of the measured value scales as 1/sqrt(N) for N repetitions of the experiment. For the problem of estimating the parameter phi in an evolution exp(-i phi H), it is possible to achieve precision 1/N (the quantum metrology limit) provided that sufficient information about H and its spectrum is available. We consider the more general problem of estimating expectations of operators A with minimal prior knowledge of A. We give explicit algorithms that approach precision 1/N given a bound on the eigenvalues of A or on their tail distribution. These algorithms are particularly useful for simulating quantum systems on quantum computers because they enable efficient measurement of observables and correlation functions. Our algorithms are based on a method for efficiently measuring the complex overlap of |psi> and U|psi>, where U is an implementable unitary operator. We explicitly consider the issue of confidence levels in measuring observables and overlaps and show that, as expected, confidence levels can be improved exponentially with linear overhead. We further show that the algorithms given here can typically be parallelized with minimal increase in resource usage.Comment: 22 page