Quantum computing as a particular case of computing with tensors
From MaRDI portal
Publication:1979850
DOI10.1007/978-3-030-65324-8_8zbMath1471.81016OpenAlexW127096118MaRDI QIDQ1979850
Martine Ceberio, Vladik Ya. Kreinovich
Publication date: 3 September 2021
Full work available at URL: https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1032&context=cs_techrep
Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Matrix models and tensor models for quantum field theory (81T32) Uncertainty relations, also entropic (81S07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation and application of Taylor polynomials with interval remainder bounds
- Taylor models and floating-point arithmetic: proof that arithmetic operations are validated in COSY
- Taylor forms -- use and limits.
- Kaluza-Klein 5D ideas made fully geometric
- On a generalization of Kaluza's theory of electricity
- Struktur der Materie
- String Theory
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs Under Interval, p-Box, and Fuzzy Uncertainty
This page was built for publication: Quantum computing as a particular case of computing with tensors
