SearcharxivSearch

arXiv subjects

Caio Almeida

Publications and source records attributed to Caio Almeida.

5 recordsLinked to original sources

Divide-and-Conquer Simulation of Open Quantum Systems

One of the promises of quantum computing is to simulate physical systems efficiently. However, the simulation of open quantum systems - where interactions with the environment play a crucial role - remains challenging for quantum computing, as it is impossible to implement deterministically non-unitary operators on a quantum computer without auxiliary qubits. The Stinespring dilation can simulate an open dynamic but requires a high circuit depth, which is impractical for NISQ devices. An alternative approach is parallel probabilistic block-encoding methods, such as the Sz.-Nagy and Singular Value Decomposition dilations. These methods result in shallower circuits but are hybrid methods, and we do not simulate the quantum dynamic on the quantum computer. In this work, we describe a divide-and-conquer strategy for preparing mixed states to combine the output of each Kraus operator dilation and obtain the complete dynamic on quantum hardware with a lower circuit depth. The work also introduces a balanced strategy that groups the original Kraus operators into an expanded operator, leading to a trade-off between circuit depth, CNOT count, and number of qubits. We perform a computational analysis to demonstrate the advantages of the new method and present a proof-of-concept simulation of the Fenna-Matthews-Olson dynamic on current quantum hardware.

quant-ph

Risk Premia in the Bitcoin Market

We analyze the first and second moment risk premia in the Bitcoin market based on options and realized returns and contrast them to the premia embedded in the main US stock index market. First, Bitcoin is much more volatile and has a higher variance risk premium than the S&P 500. By decomposing the return premium into different regions of the return state space, we find that while most of the S&P 500 equity premium comes from mildly negative returns, the corresponding negative Bitcoin returns (between three and one standard deviations) account for only one-third of the total Bitcoin premium (BP). Further, applying a novel clustering algorithm to a collection of estimated Bitcoin option-implied risk-neutral densities, we find that risk premia vary over time as a function of two distinct market volatility regimes. The low-volatility regime implies a relatively high share of BP attributable to positive returns and a high Bitcoin Variance Risk Premium (BVRP). In high-volatility states, the BP attributable to positive and negative returns is more balanced, and the BVRP is lower. These results suggest Bitcoin investors are more concerned about variance and upside risk in a low-volatility regime.

econ.GN

Constrained Polynomial Likelihood

We develop a non-negative polynomial minimum-norm likelihood ratio (PLR) of two distributions of which only moments are known. The sample PLR converges to the unknown population PLR under mild conditions. The methodology allows for additional shape restrictions, as we illustrate with two empirical applications. The first develops a PLR for the unknown transition density of a jump-diffusion process, while the second extracts a positive density directly from option prices. In both cases, we show the importance of implementing the non-negativity restriction.

math.OC

Non-topological fractional fermion number in the Jackiw-Rossi model

We compute the vacuum fermion current in $(2+1)$ dimensional Jackiw-Rossi model by using the $1/m$ expansion. The current is expressed through a weighted $η$-function with a matrix weight. In the presence of such a weight, the usual proof of topological nature of $η(0)$ is not longer applicable. Direct computations confirm the following surprising result: the fermion number induced by vortices in the Jackiw-Rossi model is \textit{not} topological.

hep-th

Text Similarity Using Word Embeddings to Classify Misinformation

Fake news is a growing problem in the last years, especially during elections. It's hard work to identify what is true and what is false among all the user generated content that circulates every day. Technology can help with that work and optimize the fact-checking process. In this work, we address the challenge of finding similar content in order to be able to suggest to a fact-checker articles that could have been verified before and thus avoid that the same information is verified more than once. This is especially important in collaborative approaches to fact-checking where members of large teams will not know what content others have already fact-checked.

cs.CL