Rational points on a sphere in $\mathbb{R}^d$ Call a point of $\mathbb{R}^d$ rational if all its $d$ coordinates are rational numbers.

Q1.
  Are the rational points dense on the unit sphere $S :\; x_1^2 +\cdots+ x_d^2 = 1$, i.e. does $S$ contain a dense set of rational points?

This is certainly true for $d=2$, rational points on the unit circle.

Q2.
  If (as I suspect) the answer to Q1 is Yes, is there a sense in which the rational coordinates are becoming arithmetically more complicated with larger $d$, say in terms of their height?

If $x= a/b$ is a rational number in lowest terms (i.e. gcd$(a,b)=1$), then the height of $x$ is $\max \lbrace |a|,|b| \rbrace$.
This is far from my expertise.  No doubt this is known, in which case a pointer would suffice.  Thanks!

(Added, 22Mar13).  I just found this reference. 


Klee, Victor, and Stan Wagon. Old and new unsolved problems in plane geometry and number theory. No. 11. Mathematical Association of America, 1996. p.135.


 
 A: Maybe the following paper and references therein help:
MR1975458 (2004h:11031) Reviewed 
Margulis, Gregory(1-YALE)
Diophantine approximation, lattices and flows on homogeneous spaces. A panorama of number theory or the view from Baker's garden (Zürich, 1999), 280–310, Cambridge Univ. Press, Cambridge, 2002. 
A: The question itself has already been answered. Let me just add that in case $d = 3$,
one can obtain a nice picture by marking all rational points with height less than some
upper bound, and projecting this to one of the coordinate planes. The following picture
shows such projection of one octant of the sphere (bound on height: 2048):

This picture in resolution 2048 x 2048 pixels can be found at
https://stefan-kohl.github.io/images/ratpoints2048.png.
Larger versions of this picture are available as well:


*

*5000 x 5000 pixels, bound on height = 5000

*10000 x 10000 pixels, bound on height = 10000
Projecting the rational points on the sphere in a Riemann-sphere-like way
to the plane yields a picture like this:

The point where the sphere touches the plane is in the middle of the picture.
One feature of the picture is a grid of white circles with mesh size 2, i.e.
the diameter of the sphere. The higher density of points around the middle of
the picture arises from the projection.
Larger versions of this picture are available as well:


*

*5000 x 5000 pixels, bound on height = 5000, both coordinates from -6 to 6

*10000 x 10000 pixels, bound on height = 10000, both coordinates from -8 to 8
A: Coincidentally, I learnt about the following paper (from 2008) by Erich Schmutz in a talk by Amos Nevo this morning which, I believe, answers both of your questions: 
Rational Points on the Unit Sphere.
In particular, he proves the following bound on the height of a rational point $r = (r_1, \ldots, r_d)$ on the unit sphere which is $\epsilon$-close to $x = (x_1, \ldots, x_d)$ for the sup-norm: $$H(r) \le \left( \frac {\sqrt{32} m} \epsilon \right)^{2 m},$$
where $m = \lceil \log_2 d \rceil$.
A: We (with Keith Merrill) recently wrote a paper further quantifying the density of rational points on $S^n$, see http://arxiv.org/abs/1301.0989. Hope it helps!
A: With regards to Q1 you can get a finer notion of density by counting the number $N(B)$, say, of rational points with height at most $B$, and consider how this quantity behaves as $B\rightarrow \infty$. I would think of this problem projectively. In this case rational points would be $[x_1,\dots,x_n,y]$, with $x_1,\dots,x_n,y$ integers such that $\gcd(x_1,\dots,x_n,y)=1$, for which $$
x_1^2+\cdots +x_d^2=y^2.$$ 
One could then define the height of a point to be $\max(|x_i|,|y|)$. Using the Hardy-Littlewood circle method, for example, one can prove (for $d\geq 3$) that 
$$
N(B)\sim B^{d-1}\sigma_\infty\prod_p\sigma_p,
$$
as $B\rightarrow \infty$, where $\sigma_v$ is the density of points on the quadric in the completion $\mathbb{Q}_v$. 
