I'm looking for an entrypoint to learning about quantum computing to which I'm exposed only by popular science articles and some qiskit materials so far. I understand that it's entirely possible that I'm insulated from the underlying math and implementation details, but I'm not interested in that. Considering my background is in classical programming, mostly imperative languages, what's a good book or set of other materials to get me started but with a view to eventually go deep?
I was very inspired by Michio Kaku's  on the possibilities of quantum computing and also listening to Talia Gershon's  on it.   As I come from a business &amp; analytics background, what materials can I begin exploring to prepare to learn more about the field of quantum computing? Eg. what would I need to study to understand Peter Shor's algorithm,  on physics, etc.
How does one go about proving that the function $x \sin x$ is not uniformly continuous on the set of real numbers ?  Any method that uses the sequential criterion for discontinuity would be preferred.  Thanks in advance ! How to prevent an email from accidentally being forwarded? apt-get update only for a specific repository MD5 Hash outputs not produced Are there any hash outputs not produced by the MD5 hash function? I need to use it as a placeholder for an empty hash while comparing two hashes. Journey Builder: Error binding data bound member Reduction Integration of $I_n=\int{\frac{x^n}{\sqrt{x^2+a^2}} dx}$ How do I derive this using reduction formula?  $$I_n=\int{\frac{x^n}{\sqrt{x^2+a^2}} dx}$$  I got $\sqrt{x^2+a^2}(x^n) - \frac{1}{n-1}(x^{n-1})\sqrt{x^2+a^2} + \frac{1}{n-1}(I_n) $ . I'm not too sure if this is correct. I would appreciate any form of help or correction to my answer. Thank you. How to Count Duplicates in List with LINQ How many individual lights can an arduino control I want to use a regular Arduino board to control LEDs - what is the most lights I can control individually from the board?  Is there a tutorial on how to hook it up? Math.cos() gives wrong result Build a basic Python iterator How to switch from Natbib to Biblatex in pre-made document class/template? I am using  to write my thesis. The template uses Natlib for references, whereas I really need Biblatex.   When I simply try to change \usepackage[natbib] for biblatex I get the error message  This is BibTeX, Version 0.99d (TeX Live 2016/Debian) Capacity: max_strings=100000, hash_size=100000, hash_prime=85009 The top-level auxiliary file: aagot-1-report.aux The style file: acm.bst Illegal, another \bibstyle command---line 80 of file aagot-1-report.aux  : \bibstyle  :          {acm}  I'm skipping whatever remains of this command Database file #1: Mendeleytry.bib.bib Warning--I didn't find a database entry for "" You've used 14 entries,code here   The solution  \usepackage[backend=bibtex, natbib=true, style=numeric]{biblatex}   didn't work.  Another possible solution was said to be to recompile from scratch to delete the .aux file, but that resulted in  /usr/share/texlive/texmf-dist/tex/latex/biblatex/biblatex.sty:462: LaTeX Error:  Command \bibhang already defined.            Or name \end... illegal, see p.192 of the manual.  See the LaTeX manual or LaTeX Companion for explanation. Type  H &lt;return&gt;  for immediate help.  ...                                                l.462 \newlength{\bibhang}   I have tried to use this "marco" to override the \requirePackage settings, but that also didn't work and resulted into  LaTeX Error: Two \documentclass or \documentstyle comm ands.  See the LaTeX manual or LaTeX Companion for explanation. Type  H &lt;return&gt;  for immediate help.  ...                                                l.45 \documentclass[whitelogo]{                            tudelft-report}    Where I can't seem to delete any of the document classes without getting the functionality of the tudelft-package and the biblatex citing (or in fact getting it to work at all!)  (no line number): [0] Config.pm:343&gt; INFO - This is Biber 2.5 [0] Config.pm:346&gt; INFO - Logfile is 'aagot-1-report.blg' [62] biber:290&gt; INFO - === Tue Apr 24, 2018, 22:24:06 [246] Utils.pm:165&gt; ERROR - aagot-1-report.bcf is malformed, last biblatex  run probably failed. Deleted aagot-1-report.bbl [246] Biber.pm:113&gt; INFO - ERRORS: 1   Is there any way I can still make this template work with Biblatex? Natlib seems to deeply rooted in the file and I don't know how to change it/access the settings/the ".sty"-file. Can I use the example documentclass combined with biblatex (instead of the standard natbib) without losing the great parts of the rest of the document class?  Thanks very much :) The photon sphere is a spherical region in space where photons are forced to travel in an orbit at $r = \frac{3GM}{c^{2}}$.   Is it possible to detect these spheres?  What happens if I fall through it? What happens to a photon that tangentially hits the event horizon, wouldn't this also lead to a photon orbiting the black hole? EDIT Since neutron stars also might have a , do we know neutron stars that should have such a sphere? How to Tail -f output with colors using only Awk and show the rest of the output? I was able to do a tail -f output with colors using the awk command. But I'm unsure how to output the rest of the log as it seems to be filtering only those 2 lines. I also want to see the other lines as the log is written.  What do I need to put in the awk command to show the rest of the output?  Image of my issue. The red text above is without using awk and displays the entire tail -f log. And below that is the same command with the awk color filtering. $\sum\limits_{n=1}^{\infty}\frac{1}{1+z^n}$, $|z|&gt;1$.  There are two facts that my professor uses that I am confused about.  The first is: $|1+z^n| \geq ||z|^n-1|$, I believe this is true for any $|z|$.  The other is: $\frac{1}{|z|^n-1} \leq \frac{2}{|z|^n}$, I believe this is also true for any $|z|$.  Can anyone prove these statements for me? Inside the alley I found myself cornered by unpleasant sights: walls covered with cracks and peeling paint, storm drains clogged with moss, dumpsters overflowing with bags, cans, and rotten trash. Inside the alley I found myself cornered by unpleasant sights: walls covered with cracks and peeling paint; storm drains clogged with moss; dumpsters overflowing with bags, cans, and rotten trash. Inside the alley I found myself cornered by unpleasant sights. Walls covered with cracks and peeling paint. Storm drains clogged with moss. Dumpsters overflowing with bags, cans, and rotten trash.  Or maybe the three of them are orthographically correct in their respective contexts? EDIT (based on dockeryZ's answer): I think second example is right, regardless of the context. Explanation: . Why do I get a segmentation fault when writing to a "char *s" initialized with a string literal, but not "char s[]"? If $f$ is continuous and $\,f\big(\frac{1}2(x+y)\big) \le \frac{1}{2}\big(\,f(x)+f(y)\big)$, then $f$ is convex Let $\,\,f :\mathbb R \to \mathbb R$ be a continuous function such that $$ f\Big(\dfrac{x+y}2\Big) \le \dfrac{1}{2}\big(\,f(x)+f(y)\big) ,\,\, \text{for all}\,\, x,y \in \mathbb R, $$ then  how do we prove that $f$ is convex that is $$ f\big(tx+(1-t)y\big)\le tf(x)+(1-t)f(y) , \forall x,y \in \mathbb R , t\in (0,1)? $$ I can prove it for dyadic rational's $t=\dfrac k {2^n}$ and then argue by continuity ; but I would like a more direct proof . Thanks in Advance I am a little bit confused by early stopping and in particular by how it can be inserted inside a CV framework. As far as I understand, I can fix the optimal number of epochs (for NN, or number of trees for XGB) by early stopping, that is:   pick a validation set, train with increasing number of epochs until a predefined metric evaluated on the validation set starts worsening that is the optimal number of epochs to prevent overfitting   and that's fine. But then I would like to insert this early stopping framework inside a CV framework: Suppose I have a model with 10 hyperparameters I want to fix via CV. And suppose that there is an eleventh hyperparameter, the number of epochs. My feeling is that one can do like this:   create the K resampled folds, for each of which you have a training and validation set choose a suitable grid for your 10 hyperparameters for each point on the grid train your model in each fold with early stopping, that is use the validation set of the fold to keep track of the preferred metric and stop when it gets worse take the mean of the K validation metric choose the point of the grid (i.e. the set of hyperparameters) that gives the best metric   Questions:   What number of epochs should I choose as optimal? in each of the K folds I have, in general, a different number of stopping epochs.  seems to suggest they take the mean of the K stopping epochs. Is this right? Is it actually a "fair" practice to use the validation metric coming from the early stopping as a proxy of the out-of-sample metric? As  in section 3.4.5, maybe the best thing to do would be:     ...if you want to do early stopping, then in each fold you should take your training set and split it again, holding out a small early-stopping-set to guide the early stopping, and then evaluate the model on the validation set of that fold.   But this seems to me a really intricate process...   Unfortunately, I wasn't able to find references where this issue is presented in a clear and transparent form. My linear voltage regulator is overheating very fast I'm using a 5 V / 2 A voltage regulator () without a heatsink. I'm testing the circuit with a microcontroller (PIC18FXXXX), a few LEDs and a 1 mA piezzo buzzer. The input voltage is aprox. 24 VDC. After running for a minute, the voltage regulator starts to overheat, meaning it burns my finger if I keep it there for more than a second. Within a few minutes it starts to smell like it's burnt. Is this a normal behavior for this regulator? What could cause it to heat that much?    Other components used in this circuit:  L1:   R2:   F1: Installing Guest Additions causing problems