dogear

enter for all results · esc to close

Science

Science: physics, biology, chemistry, astronomy and space, neuroscience, and research explained.

  1. What is Network Science? journals.cambridge.org

  2. Network Science journals.cambridge.org

  3. Data Science Group datasciencegroup.pl

  4. Applied Network Science appliednetsci.springeropen.com

  5. Apache OODT oodt.apache.org

    capturing, processing and sharing of data for NASA's scientific archives.

  6. Data Science at Scale with Python and Dask manning.com

    Data Science at Scale with Python and Dask teaches you how to build distributed data projects that can handle huge amounts of data.

  7. Apache Iceberg iceberg.apache.org

    open table format for huge analytic datasets with schema evolution, hidden partitioning, and time travel.

  8. Drizzle drizzle.org

    evolution of MySQL 6.0.

  9. Facebook HydraBase code.facebook.com

    evolution of HBase made by Facebook.

  10. Data Science and Engineering with Apache Spark (edX XSeries) edx.org

    Series of five courses (Introduction to Apache Spark, Distributed Machine Learning with Apache Spark, Big Data Analysis with Apache Spark, Advanced Apache Spark for Data Science and Data Engineering, Advanced Distributed Machine Learning with Apache Spark) covering different…

  11. Latent Space latent.space

    Technical deep dives on AI engineering, from model training to deployment.

  12. Best Data Science Books appliedaicourse.com

    This blog offers a curated list of top data science books, categorized by topics and learning stages, to aid readers in building foundational knowledge and staying updated with industry trends.

  13. Tagging systems (2006) patents.google.com

    Introduces QPV under the name of 'quantum tagging'.

  14. Position-based quantum cryptography and catalytic computation (2016) eprints.illc.uva.nl

    Chapter 5 independently generalises BB84 QPV to more input bases. Chapter 4 provides an efficient attack on the protocol based on interleaved unitaries.

  15. Instantaneous non-local computation of low T-depth quantum circuits (2016) doi.org

    Provides a general attack on QPV using an exponential amount of pre-shared EPR pairs in the number of T-gates or T-depth based on the circuit decomposition of the task unitary into Clifford+T gates.

  16. Beating classical impossibility of position verification (2022) doi.org

    Constructs a QPV protocol with only classical input and output information from the assumption that LWE is quantum-hard. Shows unconditional security in the random oracle model.

  17. Relating non-local quantum computation to information theoretic cryptography (2023) doi.org

    Connects $f$-routing to topics in classical cryptography, in particular conditional disclosure of secrets. Shows a sub-exponential upper bound for attacks for any $f$ and finds an $f$ that is believed to be outside of $\mathsf{P}$ (with pre-processing), but efficiently attacked.

  18. Bounds on instantaneous non-local quantum computation (2020) doi.org

    Shows that any 2-qubit unitary can be attacked up to error $\varepsilon$ using $\log(1/\varepsilon)$ EPR pairs and that any hermitian bipartite binary controlled unitary can be attacked with 1 EPR pair. Shows logarithmic lower bound on entanglement entropy for general bipartite…

  19. Quantum location verification in noisy channels (2010) doi.org

    Studies QPV based on Bell states, GHZ states and entanglement swapping. Studies the effect of noise/decoherence.

  20. Single-qubit loss-tolerant quantum position verification protocol secure against entangled attackers (2023) doi.org

    Tightly characterises the secure region of the protocol depending on the loss and error rates.

  21. Loss-tolerant quantum secure positioning with weak laser sources (2016) doi.org

    Studies a version of the protocol with separable inputs. Proves full loss tolerance and studies practical implementation based on decoy states.

  22. Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation (2016) doi.org

    Shows that if attackers share PR boxes, then any unitary can be attacked using only linear entanglement and a linear number of PR box uses.

  23. next page of items loading…